computer science and engineering course description …

COMPUTER SCIENCE AND ENGINEERING

COURSE DESCRIPTION FORM

Course Title JAVA PROGRAMMING

Course Code A40503

Regulation R13-JNTUH

Course Structure Lectures Tutorials Practicals Credits

4 - - 4

Course Faculty N PUSHPALATHA Assoc.Prof

I. COURSE OVERVIEW:

This course explains the fundamental ideas behind the object oriented approach to programming.

Knowledge of java helps to create the latest innovations in programming. Like the successful computer

languages that came before, java is the blend of the best elements of its rich heritage combined with the

innovative concepts required by its unique environment. This course involves OOP concepts, java basics,

inheritance, polymorphism, interfaces, inner classes, packages, Exception handling, multithreading,

collection framework, files, JDBC and GUI components. This course is presented to students by power point

projections, course handouts, lecture notes, course handouts, assignments, objective and subjective tests.

II. PREREQUISITE(S):

Level Credits Periods/ Week Prerequisites

UG 4 5 C,C++

II. MARKS DISTRIBUTION:

University Total

Sessional Marks

End Exam

marks

marks

Midterm Test

There shall be two midterm examinations. Each midterm examination consists

of essay paper, objective paper and assignment.

The essay paper is for 10 marks of 60 minutes duration and shall contain 4

questions. The student has to answer 2 questions, each carrying 5 marks.

The objective paper is for 10 marks of 20 minutes duration. It consists of 10 75 100

multiple choice and 10 fill-in-the blank questions, the student has to answer all

the questions and each carries half mark.

First midterm examination shall be conducted for the first two and half units of

syllabus and second midterm examination shall be conducted for the remaining

portion.

University Total

Sessional Marks

End Exam

marks

marks

Five marks are earmarked for assignments. There shall be two assignments in

every theory course. Assignments are usually issued at the time of

commencement of the semester. These are of problem solving in nature with

critical thinking.

Marks shall be awarded considering the average of two midterm tests in each

course.

IV. EVALUATION SCHEME:

S. No Component Duration Marks

1. I Mid Examination 80 minutes 20

2. I Assignment - 5

3. II Mid Examination 80 minutes 20

4. II Assignment - 5

5. External Examination 3 hours 75

V. COURSE OBJECTIVES:

I. Understand object oriented programming concepts- and apply them in problem solving.

II. Understand the basics of java Console and GUI based programming.

III. Describe the basics of inheritance for reusing the program.

IV. Demonstrate how the multi tasking is performed by using threads.

V. Enumerate the types of exception handling.

VI. Describe the byte streams and character streams for file management.

VI. COURSE OUTCOMES:

At the end of the course the students are able to: 1. Understanding of OOP concepts and basics of java programming.

2. The skills to apply OOP and java programming in problem solving.

3. Should have the ability to extend his/her knowledge of java programming further on his/her own.

4. Ability to implement GUI based programming.

VII. HOW PROGRAMS ARE ACCESSED:

Program Outcomes

Level

Proficiency

assessed by

PO1 Engineering knowledge: Apply the knowledge of mathematics, Assignments,

science, engineering fundamentals, and an engineering to the solution

of complex engineering problems specialization

S

Tutorials

PO2 Problem analysis: Identify, formulate, review research literature,

and analyze complex engineering problems reaching substantiated H

Assignments

conclusions using first principles of mathematics, natural sciences,

and engineering sciences.

PO3 Design/development of solutions: Design solutions for complex

engineering problems and design system components or processes

that meet the specified needs with appropriate consideration for the H Mini Projects

public health and safety, and the cultural, societal, and environmental

considerations.

PO4 Conduct investigations of complex problems: Use research-based

knowledge and research methods including design of experiments, S

Projects

analysis and interpretation of data, and synthesis of the information to

provide valid conclusions.

PO5 Modern tool usage: Create, select, and apply appropriate techniques,

resources, and modern engineering and IT tools including prediction H

Mini Projects

and modeling to complex engineering activities with an

understanding of the limitations.

PO6 The engineer and society: Apply reasoning informed by the

contextual knowledge to assess societal, health, safety, legal and N

--

cultural issues and the consequent responsibilities relevant to the

professional engineering practice.

PO7 Environment and sustainability: Understand the impact of the

professional engineering solutions in societal and environmental N

--

contexts, and demonstrate the knowledge of, and need for sustainable

development.

PO8 Ethics: Apply ethical principles and commit to professional ethics S

--

and responsibilities and norms of the engineering practice.

PO9 Individual and team work: Function effectively as an individual,

and as a member or leader in diverse teams, and in multidisciplinary H Tutorials,Exams

settings.

PO10 Communication: Communicate effectively on complex engineering

activities with the engineering community and with society at large,

such as, being able to comprehend and write effective reports and N --

design documentation, make effective presentations, and give and

receive clear instructions.

PO11 Project management and finance: Demonstrate knowledge and Future scope or

understanding of the engineering and management principles and

H

projects

apply these to one‟s own work, as a member and leader in a team, to

discussion

manage projects and in multidisciplinary environments.

PO12 Life-long learning: Recognize the need for, and have the preparation

and ability to engage in independent and life-long learning in the S Projects

broadest context of technological change.

N = None S = Supportive H = Highly Related

VIII. HOW PROGRAM SPECIFIC OUTCOMES ARE ASSESSED:

Program Specific Outcomes Level Proficiency

assessed by

PSO1 Applications of Computing: Ability to use knowledge in various

domains to provide solution to new ideas and innovations.

H Lectures,

Assignments

PSO2 Programming Skills: Identify required data structures, design suitable

algorithms, develop and maintain software for real world problems.

H

Projects

IX. SYLLABUS:

UNIT-1 OOP concepts- Data abstraction, encapsulation, inheritance, benefits of inheritance, polymorphism, classes and objects, procedural and object oriented programming paradigm.

Java programming – History of java, comments data types, variables, constants, scope and life time of variables, operators, operator hierarchy, expressions, type conversion and casting, enumerated types, control flow – block scope, conditional statements ,loops, break and continue statements, simple java stand alone programs, arrays, console input and output, formatting output, constructors ,methods, parameter passing, static fields and methods, access control, this reference, overloading methods and constructors, recursion, garbage collection, building strings, exploring string class.

UNIT-2 Inheritance – Inheritance hierarchies, super and subclasses, member access rules, super keyword, preventing inheritance: final classes and methods, the object class and its methods Polymorphism – dynamic binding, method overriding, abstract classes and methods

Interface – Interfaces VS Abstract classes, defining an interface, implement interfaces, accessing implementations through interface references, extending interface.

Inner classes – Uses of inner classes, local inner classes, anonymous inner classes, static inner classes, examples.

Packages – Defining, creating and accessing a package, understanding CLASSPATH, importing packages.

UNIT-3 Exception Handling – Dealing with errors, benefits of exception handling, the classification of exceptions

, exception hierarchy, checked exceptions and unchecked exceptions, usage of try, catch, throw, throws and

finally, rethrowing exceptions, exception specification, built in exceptions, creating own exception sub

classes.

Multithreading – Differences between multiple processes and multiple threads, thread states, creating threads, interrupting threads, thread priorities, synchronizing threads, inter – thread communication, producer consumer pattern

UNIT-4 Collection Framework in java – Introduction to java collections, overview of java collection frame work,

generics, commonly used collection classes- Array List, vector ,hash table, stack, enumeration, iterator,

string tokenizer ,random ,scanner ,calendar and properties

Files – streams – byte streams, character stream, text input/output, binary input/output, random access file operations, file management using file class.

Connecting to Database – JDBC Type 1 to 4 drivers, connecting to a database, querying a database and

processing the results, updating data with JDBC.

UNIT-5 GUI Programming with Java – The AWT class hierarchy, introduction to swing, swing Vs AWT,

hierarchy for swing components, containers- JFrame, JApplet, JDialog, Jpanel, overview of some swing

components – JButton, JLabel, JTextField, JTextArea, java lab course description simple applications,

Layout management – Layout manager types – border, grid and flow

Event Handling: Events, Event sources, Event classes, Event Listeners, Relationship between Event

sources and Listeners, Delegation event model, Example: handling a button click, handling mouse events,

Adapter classes.

Applets – Inheritance hierarchy for applets, differences between applets and applications, life cycle of an applet, passing parameters to applets, applet security issues.

Text books:

1. Java Fundamentals – A comprehensive Introduction- Herbert Schildt and Dale Skrien References:

1. Java for programmers-P.J.Dietel and H.M.Dietel Pearson education(or)Java: How to program P.J.Dietel

and H.M.Dietel-PHI 2. Object Oriented programming through Java -P.Radha Krishna -Universities Press

3. Thinking in Java- Bruce Eckel-Pearson Education 4. Programming in Java- S.Malhotra and S. Choudhary- Oxford University Press.

X. COURSE PLAN:

At the end of the course, the students are able to achieve the following course learning outcomes.

Lecture

Topics to be covered

Course Learning Outcomes References

No.

1-3 Data abstraction, encapsulation, inheritance, Understand and use OOP T1, R2

polymorphism dynamic binding, Need of concepts.

Classes and objects, Benefits of OOP,

procedural and object oriented programming

paradigm.

4-6 History of java, comments, data types Understand variable and T1,R2

Variables, constants, scope and life time of program.

variables

7-9 Operators, operator hierarchy, expressions Understand operators and T1, R2

type conversion and casting, Enumerated expressions and program

types, control flow control flow block scope

conditional statements, loops, break and

continue statements

10 Simple java program

Understand the program on T1

expressions, operators

11-13 Arrays, console input and output, formatting Use constructors and methods T1, R2

output, Constructors, methods, parameter

passing overloading methods and

constructors, static fields and methods,

14-15 access control, this reference, Recursion, Use methods and their T1, R2

garbage collection- building strings, exploring applications

string class.

16-17 Inheritance, Inheritance hierarchies, super and Relate the concept of class T1, R2

Subclasses member access rules, and to the sub class

18-19 super keyword, preventing inheritance: final Explain the concept of final T1

classes and methods, the object class and its keyword with their usage

methods

20 Polymorphism, dynamic binding method List the methods of T1

overriding, abstract classes and methods polymorphism

21-22 Interface, Interfaces VS Abstract classes, Relate interfaces and abstract T1,R2

defining an interface implements interfaces, classes

accessing implementations through interface

references, extending interface.

23-24 Inner classes Uses of inner classes, local inner Explain the concept of inner T1,R2

classes, anonymous inner classes, static inner classes

classes- examples

25 Packages, Defining creating and accessing a Define basic concepts of T1

package, understanding CLASSPATH, packages

importing packages.

26-27 Exception Handling , Dealing with errors, Illustrate the concept of T1,R2

benefits of exception handling the exception handling

classification of exceptions, exception

hierarchy, checked exceptions and unchecked

exceptions usage of try, catch, throw, throws

and finally

28-29 Re-throwing exceptions, exception Understand the concept of re- T1,R2

specification, built in exceptions, creating own throwing exceptions

exception sub classes.

30-31 Multithreading , Differences between multiple Define multithreading and T1

processes and multiple threads, thread states able to explain the differences

between multiple processes

and states

32-34 Creating threads, interrupting threads, thread Analyze the problem of T1,R2

priorities, synchronizing threads, inter , thread producer consumer pattern.

communication, producer consumer pattern

35-36 Collection Framework in java , Introduction to Explain the java collections T1,R1

java collections, overview of java collection and framework.

frame work

37 Generics, commonly used collection classes, Define generics, array list T1,R2

Array List

38 Vector, hash table

State vector and hash table T1

39-40 Stack, enumeration, iterator

Generalize the stack T2,R2

,enumeration and iterator

41-42 String tokenizer , random, scanner,calendar Describe the concept of T1

and properties dividing the string into small

token.

43-44 Explain files and their types T1,R1

Files , streams , byte streams, character stream of reading and writing data to

the files

45 text input/output, binary input/output

Understand the concept of T1

text and binary input/output.

46 Random access file operations Identify various random T1

access file operations.

47 File management using file class.

Analyze the methods of file T1

class

48 Connecting to Database , JDBC Type 1 to 4 Relate java program to JDBC T2, R2

drivers

49 Connecting to a database, querying a database Manage the connection to the T1, R2

data bases

50 Processing the results, updating data with

Understand the process of R2

updating the data bases using

JDBC

JDBC

51-52 The AWT class hierarchy, introduction to Classify the AWT class T1

swing, swing Vs AWT, hierarchy for swing hierarchy

components

53-54 Containers, JFrame, JApplet, JDialog, Jpanel, List the swing compoents. T1

overview of some swing components ,

JButton, JLabel , JTextField, JTextArea

55-56 Simple applications, Layout management , Explain the types of layout T1

Layout manager types , border, grid and flow managers

57-58 Event Handling : Events, Event sources, Event Apply the techniques of event T1,R2

classes, Event Listeners, Relationship between handling with listeners.

Event sources and Listeners

59-61 Delegation event model, Example: handling a Explain the concept of T1

button click, handling mouse events, Adapter delegation event model.

classes.

62 Inheritance ,hierarchy for applets, differences Explain the differences T1

between applets and applications between applets and

applications

63 Life cycle of an applet

Understand the life cycle of T1

applet

64 Passing parameters to applets

Explain the method of T1

parameter passing to applets

65 Applet security issues

Understand the applet T1

security issues.

X1. MAPPING COURSE OBJECTIVES LEADING TO THE ACHIEVEMENT OF PROGRAM OUTCOMES AND PROGRAM SPECIFIC OUTCOMES:

Course

Program Outcomes

Program Specific

Outcomes

Objectives

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

I S H

II H H H

III S H H

IV H H

V S H H S

VI H H S H

S = Supportive H = Highly Related

XI1. MAPPING COURSE OUTCOMES LEADING TO THE ACHIEVEMENT OF

PROGRAM OUTCOMES AND PROGRAM SPECIFIC OUTCOMES:

Course

Program Outcomes

Program Specific

Outcomes

Outcomes


1 S H H

2 H

3 S H

4 H S H

S = Supportive H = Highly Related

ASSIGNMENT

Course Name : JAVA PROGRAMMING

Course Code : A40503

Class : II B. Tech II Semester

Branch : Computer Science and Engineering

Year : 2015 – 2016

Course Faculty : N PUSHPALATHA Assoc.Prof

OBJECTIVES

To meet the challenge of ensuring excellence in engineering education, the issue of quality needs to be addressed, debated and taken forward in a systematic manner. Accreditation is the principal means of quality assurance in higher education. The major emphasis of accreditation process is to measure the outcomes of the program that is being accredited.

In line with this, Faculty of Institute of Aeronautical Engineering, Hyderabad has taken a lead in

incorporating philosophy of outcome based education in the process of problem solving and career

development. So, all students of the institute should understand the depth and approach of course to be

taught through this question bank, which will enhance learner‟s learning process. S. No. Question Blooms Course

Taxonomy Level

Outcome

UNIT – II

1 Describe Inheritance? Discuss its uses, Hierarchical abstractions With an Understand 1

example.

2 Describe the types of inheritances in java? Explain each of them in detail. Understand 1

3 Explain about Object class in detail. Remember 1

4 Explain Uses of „Super‟ keyword, discuss accessing the member of a super Remember 1

class

5 Describe a package? Discuss its advantages? Explain with example. Remember 1

6 Explain different Types of Packages. Explain in detail about Creating, Remember 1 importing packages.

7 Describe method overriding? Explain with an example? Understand 1

8 Describe Abstract classes? Explain with an example? Explain final classes Understand 1

, methods and interfaces with an example

9 Describe interface? Explain with an example? Explain working procedure Understand 1 of CLASSPATH

10 Describe inner classes? Explain with an example? Explain Member access Understand 1

rules with an example.

UNIT – III

S. No. Question Blooms Course Taxonomy Level Outcome

1 Explain creation of thread using runnable interface with an example Understand 3

2 Write a java program that implements a multi-thread application that has Understand 2,3 three threads. First thread generates random integer every 1 second and if

the value is even, second thread computes the square of the number and

prints. If the value is odd, the third thread will print the value of cube of the

2

number.

3 Write a Java program that creates three threads. First thread displays “Good Understand 2 Morning” every one second, the second thread displays “Hello” every two

seconds and the third thread displays “Welcome” every three seconds.

4 Explain about thread interrupts with an example. 3 Understand

5 Explain about inter –thread Communication with an example. Understand 3

6 Explain creation of thread using extending thread class with an example Understand 3

7 Explain with an example how java performs thread synchronization? Understand 3

8 Explain producer consumer problem with an example Knowledge 3

9 Explain about thread interrupts with an example. Knowledge 3

10 Explain the life cycle of a thread and multithreading. Knowledge 3,4

UNIT – I V

1 Explain the Java Collection frame work with an hierarchy Understand 3

3

2 Explain ArrayList and Vector with examples. Understand 3

3 Explain hash table and stack with examples. Understand 3

4 Explain enumeration and iterator with an example. Understand 3

5 Explain StringTokenizer with an example. Understand 3

6 Explain Random and scanner with examples. Understand 3

7 Explain Calander class and properties with an example. Analysis 3

8 Write a Java program that reads a file name from the user, then displays Analysis 3 information about whether the file exists, whether the file is readable,

whether the file is writable, the type of file and the length of the file in bytes

9 Explain binary input/output file operations and random access file Analysis 3 operations and Write a Java program to implement character streams

(reader classes).

10 Explain different types of JDBC drivers with diagrams and Write a Java Knowledge 3

Program that connects to a database using JDBC and does add, delete,

modify and retrieve operations.

UNIT – V

1 Explain in detail about hierarchy for swing and awt? Knowledge 2

2 Write a program for passing parameters to applet? Knowledge 2

3 Develop an applet that receives an integer in one text field and computes its Create 2

factorial value and returns it in another text field, when the button named

“compute” is clicked using swing components?

4 Develop an applet that receives an integer in one text field and computes its Create 2 factorial value and returns it in another text field, when the button named

“compute” is clicked using awt components?

5 Define JFrame, JApplet, JDialog and Jpanel, Jbutton, JLabel, JTextField and Create 1 JtextArea? Write a java program that simulates a traffic light. The program

lets the user select one of three lights: red, yellow, or green with radio

buttons. On selecting a button an appropriate message with “STOP” or

“READY” or ”GO” should appear above the buttons in selected color.

Initially, there is no message shown

6 Describe Layout manager types – border, grid, flow? Write a Java program Create 1 that works as a simple calculator. Use a grid layout to arrange buttons for

the digits and for the +,-,*, % operations. Add a text field to display the

result. Handle any possible exception like divided by zero

7 Describe Delegation event model? Describe is the relationship between Understand 1 Event sources and Listeners?

8 Describe events for handling a button click and mouse events with an Create

examples 1

9 Explain applet life cycle? Difference between applet and application? Understand 1

10 Explain applet security issues? Understand 1

Tutorial Question Bank

Course Name : JAVA PROGRAMMING




Year : 2015 – 2016

Course Faculty : N PUSHPALATHA Assoc.Prof OBJECTIVES

To meet the challenge of ensuring excellence in engineering education, the issue of quality needs to be

addressed, debated and taken forward in a systematic manner. Accreditation is the principal means of quality

assurance in higher education. The major emphasis of accreditation process is to measure the outcomes of the

program that is being accredited.

In line with this, Faculty of Institute of Aeronautical Engineering, Hyderabad has taken a lead in incorporating

philosophy of outcome based education in the process of problem solving and career development. So, all

students of the institute should understand the depth and approach of course to be taught through this question

bank, which will enhance learner‟s learning process. PART – A (Short Answer Questions)

S. No Question Blooms Course Taxonomy Level Outcome UNIT - I

1 Define OOP? Remembering 1,2,3

2 Distinguish between procedural language and OOPs? Analyzing 1,2,3

3 Define Encapsulation? Remembering 1,2,3

4 Define Inheritance? Remembering 1,2,3

5 Define Polymorphism? Remembering 1,2,3

6 List advantages of OOP? Remembering 1,2,3

7 List disadvantages of OOP? Remembering 1,2,3

8 Explain briefly out history of java? Understanding 1,2,3

9 Explain briefly about different types of data types in java? Understanding 1,2,3

10 What is constant? Explain different types of constants? Remembering 1,2,3

11 What is Variable? Describe scope and life time of variables? Remembering 1,2,3

S. No Question Blooms Course Taxonomy Level Outcome

12 List and describe different types of operators? Remembering 1,2,3

13 Define type conversion? Remembering 1,2,3

14 Define type casting? Remembering 1,2,3

15 Define enumerated types? Remembering 1,2,3

16 Define an array? Remembering 1,2,3

17 Define this reference? Remembering 1,2,3

18 Define constructor? Remembering 1,2,3

19 Define recursion? Remembering 1,2,3

20 Define garbage collection? Remembering 1,2,3

UNIT – II

1 Define Inheritance? Understand 4

2 List types of inheritances in java? Remembering 4

3 What are Member access rules in java? Remembering 4

4 Explain the Uses of „Super‟ keyword Understanding 4

5 Explain the Uses „final‟ keyword with inheritance Understanding 4

6 What is Object class? Understand 4

7 Define abstract classes? Remembering 4

8 Define polymorphism? Remembering 4

9 Define dynamic binding? Remembering 4

10 Define method overriding? Remembering 4

11 Compare and Contrast differences between interfaces vs. Abstract Understanding 4 classes

12 Define interface? Remembering 4

13 Define inner classes? Remembering 4

14 Define static inner classes? Remembering 4

15 Define a package? Remembering 4

16 Define various steps for creating and importing packages. Understand 4

17 Define abstract methods? Remembering 4

18 Define CLASSPATH? Remembering 4

19 List advantages of inheritance? Remembering 4

20 How we implement an interface write steps Remembering 4

UNIT - III

1 Define Exception? Remembering 1

2 Distinguish between exception and error? Analyzing 2

3 What are the benefits of exception handling Remembering 2

4 Explain the classification of exceptions Understanding 2

5 Define checked exceptions? Remembering 3

6 Define unchecked exceptions? Remembering 3

7 Define built in exceptions? Remembering 3

8 Explain the usage of try and catch Understanding 3

9 Explain the usage of throw, throws and finally Understanding 3

10 Distinguish between throw and throws? Analyzing 3


11 Distinguish between process and thread? Analyzing 1

12 What are thread states? Explain. Remembering 1

13 What are the different ways to create a thread? Remembering 1

14 Define producer consumer problem? Remembering 1

15 Define inter-thread communication? Remembering 1

16 How threads are synchronized? Remembering 2

17 What are different thread priorities Remembering 2

18 How many ways can thread be Created? Understanding 2

19 Explain about the alive() and join() method Understanding 2

20 Explain about “thread class implements Runnable interface” Understanding 2

UNIT - IV

1 Define collections? Remembering 3

2 Define Java collection Frame work. Remembering 3

3 Define Array List with syntax Remembering 3

4 Define Vector with syntax. Remembering 3

5 Define hash table with syntax. Remembering 3

6 Define stack with syntax. Remembering 4

7 Define enumeration with syntax. Remembering 4

8 What is Iterator? Remembering 1

9 Explain the function of StringTokenizer. Understanding 1

10 Define random class. Remembering 1

11 Define Scanner class. Remembering 1

12 Define Calendar class. Remembering 1

13 Define Properties class Remembering 1

14 Define Stream? Remembering 2

15 Define byte stream? Remembering 2

16 Define character stream? Remembering 2

17 Define text input/output file? Remembering 2

18 Define JDBC? Remembering 3

19 List types of JDBC drivers. Understand 3

20 Define random access file? Understand 4

UNIT - V

1 Define AWT class hierarchy? Remembering 4

2 Distinguish between swings Vs AWT? Analyzing 4

3 Explain the hierarchy for swing? Understanding 4

4 Define components? Remembering 4

5 Define containers? Remembering 4

6 Define JFrame, JApplet, JDialog and Jpanel? Remembering 4

7 Define some of swing components? Remembering 4

8 Define Jbutton, JLabel, JTextField and JtextArea? Remembering 4

9 Define Layout management? Remembering 4


10 List Layout manager types – border and grid flow? Remembering 3

11 Explain about Events, Event sources, Event classes Understanding 3

12 Explain about Event Listeners Understanding 3

13 Compare and contrast the relationship between Event sources and Understanding 3 Listeners?

14 Define Delegation event model? Remembering 1

15 Explain various events for handling a button click? Understanding 1

16 Explain various events for handling mouse events? Understanding 1

17 Define adapter class? Remembering 2

18 Distinguish between applet and application? Analyzing 2

19 Explain the life cycle of an Applet. Understanding 2

20 Describe applet security issues? Understand 2

PART – B (Long Answer Questions)

S. No Question Blooms Course Taxonomy Level Outcome UNIT – I

1 Discuss the various characteristics of object oriented programming Creating 1,2,3 concepts?

2 Explain briefly about the features (buzzwords) of Java. Understanding 1,2,3

3 Discuss various Differences between Java and C++. Creating 1,2,3

4 Why Java is a pure object oriented programming language Remembering 1,2,3

5 Distinguish between applications and applets in Java? Analyzing 1,2,3

6 Explain the importance of this keyword with an example. Understanding 1,2,3

7 What is method overloading? Explain with an example. Remembering 1,2,3

8 Discuss about the constructor overloading with an example. Creating 1,2,3

9 What is Array? Explain the concept of arrays with an example. Remembering 1,2,3

10 Explain briefly about String class and discuss various methods in Understanding 1,2,3 String class with an example.

11 Explain about the console input and output with an example. Understanding 1,2,3

12 Discuss about various conditional statements with necessary examples Creating 1,2,3

13 Explain about different loops with an example. Understanding 1,2,3

14 What is the use of break and continue statements in java? Explain with Remembering 1,2,3 an example.

15 Discuss about the operator hierarchy with an example. Creating 1,2,3

16 What is the use of the operators in java? Explain with an example. Remembering 1,2,3

17 Define static field? Write with an example. Remembering 1,2,3

18 Define static method? Write with an example. Remembering 1,2,3

19 What is type conversion and casting? Explain with an example. Remembering 1,2,3

20 Explain about foreach loop with an example Understanding 1,2,3

UNIT – II 1 Define Inheritance? Discuss its uses and Hierarchical abstractions? Remembering 4

2 List different types of inheritances in java? Explain each of them in Remembering 4

S. No Question Blooms Course Taxonomy Level Outcome detail with an example programs.

3 Discuss about Object class in detail Creating 4

4 Explain the Uses of „Super‟ keyword , discuss accessing the member Understanding 4 of a super class

5 What is package? Discuss its advantages? Remembering 4

6 Explain different Types of Packages Understanding 4

7 Define dynamic binding? Write with an example? Remembering 4

8 Define method overriding? Write with an example? Remembering 4

9 Define Abstract classes? Write with an example? Remembering 4

10 Define interface? Write with an example? Remembering 4

11 Define inner classes? Write with an example? Remembering 4

12 Discuss in detail about creating and importing packages with an Creating 4 examples

13 Discuss in detail how packages are accessed Creating 4

14 Explain different ways to extending interfaces with an example Understanding 4

15 Define interface? Write Differences between classes and interfaces? Remembering 4

16 What is final keyword? Explain its importance in java with an example Understand 4 program.

17 What is inheritance? Explain the benefits of inheritance with an Remembering 4 example

18 What are various Member access rules explain with an example Remembering 4

19 Discuss the various levels of Acceee protection available for packages Creating 4 and their implications.

20 Compare and contrast overloading and overriding methods Remembering 4

UNIT - III

1 Explain briefly about exception handling mechanisms with example Understanding 4 programs.

2 What are try, catch , and finally keywords in with an example Remembering 4

3 Define throw keyword? Write with an example Remembering 4

4 Define throws keyword? Write with an example Remembering 4

5 Define a exception called “NotEqualException” that is thrown when a Remembering 4 float value is not equal to 3.14. write a program that uses the above

user defined exception.

6 Differenciate between checked and unchecked exceptions? Remembering 4

7 Define a exception ?explain the different type of exception. 4

8 Develop a program to implement built in exceptions? Apply, Create 4

9 Explain the various ways of creation of thread with an examples. Understanding 4

10 Explain with an example how java performs thread synchronization? Understanding 4

11 Explain the producer consumer problem with an example Understanding 4

13 Explain briefly about the life cycle of a thread with an example. Understanding 4

15 Differenciate between multiprocessing and multithreading?what is to be Remembering 3 done to implement these ian a pogram

16 Define thread.How do we set priorities for threads? Understanding 3

17 Explain Deamon threads with a an example? Understanding 2

18 Explain any five methods of thread class? Understanding 2

19 Explain with an example how thread class methods can be used to Understanding 2

control the behavior of a thread?

UNIT – IV

1 Explain the Java Collection frame work with an example. Understanding 1

2 What is ArrayList? Explain with an example. Remembering 1

3 Explain briefly about Vector class with an example. Understanding 1

4 What is hash table? Explain with an example? Remembering 1

5 Explain about stack class with an example. Understanding 1

6 What is enumeration? Explain about with an example. Remembering 1

7 Explain briefly about iterator with an example. Understanding 1

8 What is StringTokenizer? Explain with an example. Remembering 1

9 Explain in detail about Random class with an example. Understanding 1

10 What is Scanner class? Explain with an example. Remembering 2

11 Explain in detail Calender class with an example. Understanding 2

12 What are text input/output file operations? Explain Remembering 2

13 Explain binary input/output file operations with examples. Understanding 2

14 What are random access file operations? Remembering 2

15 Explain briefly about File management using File class. Understanding 2

16 Distinguish between Understanding 3 a)InputStream and Reader classes

b)OutputStream and Writer Classes

17 Explain different types of JDBC drivers with diagrams. Understanding 3

18 Develop a JDBC application for querying the database and processing Applying 3 the results.

19 Develop a JDBC application for updating data. Applying 3

UNIT – V

1 Explain in detail about hierarchy for swing? Understanding 4

2 Explain in detail about hierarchy for awt? Understanding 4

3 Explain in detail about Layout management? Understanding 1,4

4 Develop a java program for handling a button clicks? Applying 3

5 Develop a java program for handling mouse Related events? Applying 3

6 Explain in detail about Events, Event sources and Event classes Understanding 3

7 Explain in detail about Event sources and Listeners Understanding 3

8 Develop a java program for simple applet? Applying 3

9 Develop a java program for passing parameters to applet? Applying 3

10 Develop an applet that receives an integer in one text field and Applying 3 computes its factorial value and returns it in another text field, when

the button named “compute” is clicked

11 Explain briefly about Adapter classes. Understanding 3

12 What is the importance of Delegation Event Model on Event Handling Remembering 2

13 Distinguish various differences between Swing and AWT Analyzing 2

14 Explain the differences between applets and applications Understanding 2

15 Explain various swing components in detail Understanding 2

PART – C (Problem Solving and Critical Thinking Questions)

S. No Question Blooms Course Taxonomy Level Outcome UNIT – I

1 Student john12 = new Student(1001, "John", 12); Understand 1,2,3 Student john13 = new Student(1002, "John", 13);

System.out.println("comparing John, 12 and John, 13 with compareTo :" + john12.compareTo(john13));

then predict the output of the code?

2 What is the output of the program? Understand 1,2,3 class Lifetime

{ public static void main(String args[])

{

int x;

for (x=0; x<3; x++)

{

int y=-1; System.out.pirnltn(“ y is :” + y);

y=100;

System.out.println(“ y is now : “ + y);

}

}

}

3 What will be the output of the program? Understand 1,2,3

public class If2 {

static boolean b1, b2;

public static void main(String [] args)

{

int x = 0;

if ( !b1 )

{

if ( !b2 )

{ b1 = true;

x++;

if ( 5 > 6 )

{

x++;

}

if ( !b1 )

x = x + 10;

else if ( b2 = true )

x = x + 100;

else if ( b1 | b2 )

x = x + 1000;

} }

System.out.println(x);

}

}

4 Explain the following code legal in Java? is it example of method Understand 1,2,3 overloading or overriding?

public String getDescription(Object obj){

return obj.toString;

}

public String getDescription(String obj){

return obj;

}

and

public void getDescription(String obj){

return obj;

}

5 Analyze the following program and find the output of the program? Analyze 1,2,3 public class CounterAtomic {

private AtomicLong counter = new AtomicLong();

public void increment() { counter.incrementAndGet();

}

public long get() { return counter.get();

}

}

6 What will be the output of the program? Remembering 1,2,3

public class Test {

public int aMethod()

{

static int i = 0;

i++;

return i;

}

public static void main(String args[])

{ Test test = new Test();

test.aMethod();

int j = test.aMethod();

System.out.println(j);

}

}


public class Test {


{

int i = 1, j = 0;

switch(i)

{

case 2: j += 6;

case 4: j += 1;

default: j += 2;

case 0: j += 4;

}

System.out.println("j = " + j);

}

}

8 Analyze the following program and find the output of the program? Analyze 1,2,3

Class Test {


{

int x, y;

y=20;

for(x=0; x<10: x++) {

System.out.println("this is x:"

+x); System.out.println("this is

y:" +y); y= y-2;

}

}

}


class BitShift {


{

int x = 0x80000000;

System.out.print(x + " and ");

x = x >>> 31;


}

}

10 Analyze and find out What will be the problem in the program? Analyze 1,2,3

class Equals {


{

int x = 100;

double y = 100.1;

boolean b = (x = y);

System.out.println(b);

}

}

UNIT – II

1 Analyze the program and give output Analyzing 4 public class Foo

{

Foo()

{

System.out.print("foo");

}

class Bar {

Bar() {

System.out.print("bar");

S. No Question Blooms Course Taxonomy Level Outcome }

public void go()

{

System.out.print("hi");

}

} /* class Bar ends */

public static void main (String [] args) {

Foo f = new Foo();

f.makeBar();

}

void makeBar()

{

(new Bar() {}).go();

}

}/* class Foo ends */

2 Explain the following code legal in Java? Understanding 4 class OuterClass {

private int privInt = 10; public void createInnerClass() {

InnerClass inClass = new InnerClass();

inClass.accessOuter();

}

class InnerClass {

public void accessOuter() {

System.out.println("The outer class's

privInt is " + privInt);

}

}

}

public static void main(String[] args)

{

OuterClass outClass = new OuterClass();

OuterClass.InnerClass inner = outClass.new InnerClass();

inner.accessOuter();

}

3 Analyze the following program and find the output of the program? Analyze 4 class A {

//Members and methods declarations.

}

class B extends A {

//Members and methods from A are inherited.

//Members and methods declarations of B.

} class A {

public A() {

S. No Question Blooms Course Taxonomy Level Outcome System.out.println("New A");

}

}

class B extends A {

public B() {

super();

System.out.println("New B");

}

}

4 Illustrate the output of the following program? Applying 4 interface MyInterface

{ public void method1();

public void method2();

}

class XYZ implements MyInterface

{

public void method1()

{

System.out.println("implementation of method1");

}

public void method2()

{

System.out.println("implementation of method2");

}

public static void main(String arg[])

{

MyInterface obj = new XYZ();

obj. method1();

}

}

5 What is the output of the program? Remembering 4 Class A

{

final public int GetResult(int a, int b) { return 0; }

}

class B extends A

{

public int GetResult(int a, int b) {return 1; }

}

public class Test

{


{

B b = new B();

System.out.println("x = " + b.GetResult(0, 1));

}

}

6 What will be the output of the program? Remembering 4

class Super {

S. No Question Blooms Course Taxonomy Level Outcome public int i = 0;

public Super(String text) {

i = 1;

}

}

class Sub extends Super { public Sub(String text)

{

i = 2;

}


{

Sub sub = new Sub("Hello");

System.out.println(sub.i);

}

}

7 What will be the output of the program? Remembering 4

interface Count {

short counter = 0;

void countUp();

}

public class TestCount implements Count

{


{

TestCount t = new TestCount();

t.countUp();

}

public void countUp()

{

for (int x = 6; x>counter; x--, ++counter)

{

System.out.print(" " + counter);

}

}

}

8 Analyze and find out the output of the program? Analyze 4

public class Test {

public int aMethod()

{

static int i = 0;

i++;

return i; }

S. No Question Blooms Course

Taxonomy Level Outcome


{

Test test = new Test();

test.aMethod();

int j = test.aMethod();

System.out.println(j);

}

}

9 Develop a Java Program to create an abstract class named Shape that Applying 4

contains two integers and an empty method named print Area().provide

three classes named Rectangle, Triangle and Circle such that each one

of the classes extends the class Shape. Each one of the classes contains

only the method print Area () that prints the area of the given shape.

10 Analyze and find out the output of the program? Analyze 4

package mypack

class Book

{

String bookname;

String author;

Book(String b, String c)

{

this.bookname = b;

this.author = c;

}

public void show()

{

System.out.println(bookname+" "+ author);

}

}

class test

{

public static void main(String[] args)

{

Book bk = new Book("java","Herbert");

bk.show();

}}

UNIT - III 1 What will be the output of the program? Remembering

public class X {


{ 4

try

{

badMethod();

System.out.print("A");

}

catch (Exception ex)


{ System.out.print("B");

} finally {

System.out.print("C"); } System.out.print("D");

} public static void badMethod() {

throw new Error(); }

}

2 Analyze the program and find the output ? Analyze

public class Test {

public static void aMethod() throws Exception {

try { throw new Exception();

} 2 finally {

System.out.print("finally "); } } public static void main(String args[]) {

try {

aMethod(); } catch (Exception e) {

System.out.print("exception "); } System.out.print("finished");

}

}

3What will be the output of the program? Remembering

class s1 implements Runnable {

int x = 0, y = 0;

int addX() {x++; return 1

x;} int addY() {y++;

return y;} public void

run() {

for(int i = 0; i < 10; i++)

System.out.println(addX() + " " + addY());

}

public static void main(String args[]) {


s1 run2 = new s1();

Thread t1 = new

Thread(run1); Thread t2 =

new Thread(run2); t1.start();

t2.start();

}

}

4Explain the output of the following program? Evaluated class Exceptions {

public static void main(String[] args) {

String languages[] = { "C", "C++", "Java", "Perl", "Python" }; 4

try { for (int c = 1; c <= 5; c++) {

System.out.println(languages[c]);

}

}

catch (Exception e) {

System.out.println(e);

}

}

}

5What is the output of the below program? Remembering class Allocate {


try {

long data[] = new long[1000000000]; 1 } catch (Exception e) {

System.out.println(e); }

finally {

System.out.println("finally block will execute always."); }

} }then predict the output?

6 What will be the output of the program? Analyzing

class MyThread extends Thread {

public static void main(String [] args) { 2

MyThread t = new MyThread(); Thread x = new Thread(t); x.start();

} public void run() {

for(int i = 0; i < 3; ++i)

S. No Question Blooms Course Taxonomy Level Outcome {

System.out.print(i + "..");

}

}

}

7 What will be the output of the program? Remembering

public class RTExcept {

public static void throwit ()

{

System.out.print("throwit ");

throw new RuntimeException();

}

public static void main(String [] args) 2

{

try

{

System.out.print("hello ");

throwit();

}

catch (Exception re )

{

System.out.print("caught ");

}

finally

{

System.out.print("finally ");

}

System.out.println("after ");

}

}

8 Analyze the program and find the output Analyzing

public class NFE {


{ 1

String s = "42";

try

{

s = s.concat(".5");

double d = Double.parseDouble(s);

s = Double.toString(d);

int x = (int) Math.ceil(Double.valueOf(s).doubleValue());


}

catch (NumberFormatException e)

{

System.out.println("bad number");

} }}



class MyThread extends Thread {

MyThread()

{

System.out.print(" MyThread");

}

public void run()

{ System.out.print(" bar");

}

public void run(String s)

{ 2

System.out.println(" baz");

}

}

public class TestThreads

{

public static void main (String [] args)

{

Thread t = new MyThread()

{

public void run()

{

System.out.println(" foo");

}

}

t.start();

}

}

10 What will be the output of the program? Remembering class implements Runnable

{

int x, y;

public void run()

{

for(int i = 0; i < 1000; i++)

synchronized(this)

{ 1

x = 12;

y = 12;

}

System.out.print(x + " " + y + " ");

}


{

s run = new s();

Thread t1 = new

Thread(run); Thread t2 =

new Thread(run); t1.start();

t2.start();

} }

S. No Question Blooms Course Taxonomy Level Outcome UNIT – IV


package foo; import java.util.Vector;

private class MyVector extends Vector

{

int i = 1;

public MyVector()

{ 2

i = 2;

} }

public class MyNewVector extends MyVector

{

public MyNewVector ()

{

i = 4;

}

public static void main (String args [])

{

MyVector v = new MyNewVector();

}

}

2 Analyze the following program and find the output of the program? Analyzing public class Test {


System.out.println(Math.min(Double.MIN_VALUE, 0.0d)); 2

}

}

3 Find the output of the program. Remembering import java.util.*;

class I

{

public static void main (String[] args) 1,4

{

Object i = new ArrayList().iterator();

System.out.print((i instanceof List)+",");

System.out.print((i instanceof Iterator)+",");

System.out.print(i instanceof ListIterator);

}

}

4 Compare the output before adding and after adding? Remember import java.util.*;

public class ArrayListExample { 2 public static void main(String args[]) { ArrayList<String> obj = new ArrayList<String>();

obj.add("Ajeet");

obj.add("Harry");

System.out.println("Currently the array list has following

S. No Question Blooms Course Taxonomy Level Outcome elements:"+obj);

obj.add(0, "Rahul");

obj.add(1, "Justin");

obj.remove("Chaitanya");

obj.remove("Harry");

System.out.println("Current array list is:"+obj);

obj.remove(1);

System.out.println("Current array list is:"+obj);

}

}

5 What is the output of the following program Remembering import java.util.*;

public class ArrayListExample {


{ ArrayList<String> a1 = new ArrayList<String>();

a1.add(1);

a1.add(2);

a1.add(3); 2

a1.add(4);

System.out.println("Current array list is:"+a1);

Integer ia[]= new Integer [a1.size()];

ia= a1.toArray(ia);

int sum=0;

for (int i : ia) sum += i;

System.out.println("Sum is:"+sum)

}

}

6 Analyze the program and explain the importance of line 1 and give the Analyzing output

import java.util.StringTokenizer;

class Stdemo

{

Static String in= “title= java : the complete reference” + 2

“author= schildt” +

“publisher= Osborne/mcgraw-hill “ +

“copyright= 2005”;


{

String key= st.nextToken(); ----- 1

String val= st.nextToken();

System.out.println( key + “\t” + val);

} }

7 What is the output of the below program? Remembering import java.io.*;

class BRRead

{

public static void main(String args[]) throws IOException

{

S. No Question Blooms Course Taxonomy Level Outcome char c;

{

BufferedReader br= new BufferedReader( new InputStreamReader

(System.in));

System.out.println(“enter characters, „q‟ to quit.”);

Do

{ 4

c= (char) br.read();

System.out.println(c);

While(c != „q‟);

}

}

}

8 Analyze the program and give the output and also explain the Analyze importance of hasNext() and next() methods.

import java.util.*;

class Findlinedemo

{


{ 1

String s=”Name: Tom Age: 28 Id: 77”;

Scanner sc= new Scanner(s);

sc.findInLine (“Age”);

if(sc.hasNext())

Syste.out.println(sc.next());

else

Syste.out.println(“error”);

}

}

9 What is the output of the below program? Remembering import java.io.*;

class HTdemo

{ public static void main(String args[])

{

Hashtable< String, Double> balance= Hashtable< String, Double>();

Enumeration<String> names;

String str;

double bal; 4

balance.put(“abc” 3435.35);

balance.put(“abc” 1254.35);

names= balance.keys();

while(names.hasMoreElements())

{ Str= names.nextElement();

System.out.println(str + “ : “ + balance.get(str);

}

System.out.println();

}


10 Analyze the below program and give the output of the following Analyze program?

import java.util.Scanner;

class Division {


int a, b, result; 3

Scanner input = new

Scanner(System.in);

System.out.println("Input two integers");

a = input.nextInt();

b = input.nextInt();

result = a / b;

System.out.println("Result = " + result);

}

UNIT - V

1 Predict the output using below code and what happens if below code is Understand not used in GUI programs?

public void windowClosing(WindowEvent e) { 1

dispose();

System.exit(0);

2 Explain the below code and mention its important Understanding Public void actionPerformed(ActionEvent e)

{

it(e.getSource()== b1)---Assume b1 is variable of button

{

int x= Integer.parseInt(t1.getText()) ---- Assume t1 is variable of

textfield

int y= Integer.parseInt(t2.getText()) ---- Assume t2 is variable of

textfield 4

int sum= X+Y; t3.setText(“ ”+sum); ---- Assume t3 is variable of

textfield

}

}

3 What is the output the program Remembering import java.awt.*;

import java.swing.*;

/* < applet code= “Jlabeldemo” width= 200 height =200> </applet> 1

*/

public class JLabeldemo extends JApplet {

ImageIcon i= new ImageIcon(“ india.gif ”);

JLabel ji=new JLabel(“ INDIA” , I , JLabel.CENTER);

add(ji);

}

}

4 Explain the output of the following program? Evaluated import java.applet.*;

import java.awt.*; 2

public class Main extends Applet{

S. No Question Blooms Course Taxonomy Level Outcome public void paint(Graphics g){

g.drawString("Welcome in Java Applet.",40,20);

}

} <HTML>

<HEAD>

</HEAD>

<BODY>

<div >

<APPLET CODE="Main.class" WIDTH="800" HEIGHT="500">

</APPLET>

</div>

</BODY>

</HTML>

5 Explain the usage of the following code? Understanding public void actionPerformed(ActionEvent ae){

try{ 4

num = Integer.parseInt(input.getText());

sum = sum+num;

input.setText("");

output.setText(Integer.toString(sum));

lbl.setForeground(Color.blue);

lbl.setText("Output of the second Text Box : "

+ output.getText());

}

catch(NumberFormatException e){

lbl.setForeground(Color.red);

lbl.setText("Invalid Entry!");

}

6 Analyze the program and explain the importance 1 to 4 line and give Analyze the output.

import java.awt.*; class Frame1 extends Frame

{ Frame1()

{ 3

setTitle(“demo”);----------- 1

setSize(200,200);

setVisible(true); ------------ 2

setLayout(new FlowLayout());

Label l1= new Label(“java”);

Label l2= new Label(“j2ee”);

add(l1); --------------- 3

add(l2); --------------- 4

}

}

Class Labeldemo

{

Public static void main(String args();

{

Frame1 f= new Frame();

}

}


7 What is the output the program Remembering import java.awt.*;

import java.applet.*; /* < applet code= “statusdemo.class” width= 200 height =200>

</applet>

*/

public class satusdemo extends Applet

{

Public void init()

{ 4

setBackground(Color.red);

}

Public void paint(Graphics g)

{

g.drawString(“this is in the applet window” 10,20)‟

showStatus(“this is the status window message”);

}

}

8 Explain the usage of following line of code line by line. Understanding Public void mouseClicked(MouseEvent me)

{ Mousex-=0;

Mousey=10;

Msg= “mouse clicked”

Repaint();

} 1

Public void mouseEntered(MouseEvent me)

{

Mousex-=0;

Mousey=10;

Msg= “mouse entered”

Repaint();

}

9 What is the output of the program Remembering import java.applet.Applet;

import java.awt.*;

public class Sms extends Applet {

public void init() {

} 3 public void paint(Graphics g) {

g.setColor(Color.blue);

Font font = new Font("verdana", Font.BOLD, 15);

g.setFont(font);

g.drawString("Welcome To Aeronautical Eng College", 50, 50);

}

}

10 What is the output the program and explain line 1 and 2. Remembering import java.awt.*; 4

import java.applet.*; /* < applet code= “GridLayoutDemo” width= 300 height =300>

</applet>

S. No Question Blooms Course Taxonomy Level Outcome */

public class GridLayoutDemo extends Applet

{ static final int n=5;

public void init()

{

setLayout(new GridLayout( n , n)); -------1

setFont (new Font (“SamsSerof”, Font.BOLD, 24)); --- 2

for (int j=0l j<n; j++)

{ int k= I * n + j;

if(k>00)

Add( new button (“” + k0;

}}}}

Prepared by: HOD, COMPUTER SCIENCE AND ENGINEERING



Course Title DATABASE MANAGEMENT SYSTEMS

Course Code A40507

Regulation R13 - JNTUH


3 1 - 3

Course Faculty Y Appa Rao Assoc.Prof

COURSE OVERVIEW:

This course introduces the core principles and techniques required in the design and implementation of database systems. This introductory application-oriented course covers the relational database systems RDBMS - the predominant system for business, scientific and engineering applications at present. It includes Entity-Relational model, Normalization, Relational model, Relational algebra, and data access queries as well as an introduction to SQL. It also covers essential DBMS concepts such as: Transaction Processing, Concurrency Control and Recovery. It also provides students with theoretical knowledge and practical skills in the use of databases and database management systems in information technology applications.

PREREQUISITE(S):

Level Credits Periods/ Week Prerequisites

UG 3 4 Basic concepts of files, data structures and

design of database systems

MARKS DISTRIBUTION:

Sessional Marks

University End Total

Exam marks marks

Mid Semester Test

There shall be two midterm examinations.

Each midterm examination consists of subjective type and objective type

tests.

The subjective test is for 10 marks of 60 minutes duration.

Subjective test of shall contain 4 questions; the student has to answer 2

questions, each carrying 5 marks. 75 100

The objective type test is for 10 marks of 20 minutes duration. It consists

of 10 Multiple choice and 10 objective type questions, the student has to

answer all the questions and each carries half mark.

First midterm examination shall be conducted for the first two and half

units of syllabus and second midterm examination shall be conducted for

the remaining portion.

Sessional Marks University End Total

Exam marks marks

Assignment

Five marks are earmarked for assignments.

There shall be two assignments in every theory course. Marks shall be

awarded considering the average of two assignments in each course.


S. No Component Duration Marks 1. I Mid Examination 80 minutes 20 2. I Assignment - 5 3. II Mid Examination 80 minutes 20 4. II Assignment - 5 5. External Examination 3 hours 75 V. COURSE OBJECTIVES:

I. Discuss the basic database concepts, applications, data models, schemas and instances.

II. Design Entity Relationship model for a database.

III. Demonstrate the use of constraints and relational algebra operations.

IV. Describe the basics of SQL and construct queries using SQL.

V. Understand the importance of normalization in databases.

VI. Demonstrate the basic concepts of transaction processing and concurrency control.

VII. Understand the concepts of database storage structures and identify the access techniques.


I. Demonstrate the basic elements of a relational database management system.

II. Ability to identify the data models for relevant problems

III. Ability to design entity relationship and convert entity relationship diagrams into RDBMS and

Formulate SQL queries on the respect data.

IV Apply normalization for the development of application software‟s.

VII HOW PROGRAM OUTCOMES ARE ASSESSED

Program Outcomes Level Proficiency

assessed by

PO1 An ability to apply Knowledge of Science Mathematics Engineering

&Computing fundamentals for the solutions of ComplexEngineering

Problems

H

PO2 An ability to identify, formulates, research literature and analyze

complex engineering problems using firstprinciples of mathematics


H

PO3 An ability to design solutions to complex process or program to meet

desired needs

H

substantiated

PO4 Ability to use research-based knowledge and research methods

including design of experiments to provide valid conclusions

S

-----------

PO5 An ability to use appropriate techniques, skills and tools necessary

for computing practice Ability to apply reasoning informed by the

contextual knowledge to assess social issues, consequences &

responsibilities relevant to the professional engineering practice

H

-----------

PO6 Ability to understand the impact of engineering solutions in a global,

economic, environmental, and societal context with sustainability

N

-------------

PO7 An understanding of professional, ethical, Social issues and

responsibilities

N

-------------

PO8 An ability to function as an individual, and as a member or leader in

diverse teams and in multidisciplinary settings N

PO9 An ability to communicate effectively on complex engineering

activities within the engineering community.

H

--------------

PO10 Ability to demonstrate and understanding of the engineering and

management principles as a member

N

--------------- PO11 Ability to engage in independent and lifelong learning in the context

of technological change.

S

PO12 Ability to engage in independent and lifelong learning in the context

of technological change.

S

Projects



assessed by



H Lectures,

Assignments



H

Projects

IX. SYLLABUS

UNIT – I

Introduction -Data base System Applications, Purpose of data base Systems, View of Data – Data Abstraction – Instances and Schemas – data Models, Database Languages – DDL – DML – database Access for applications Programs, Transaction Management, Data Storage and Querying, Database architecture, Database users and administrators, History of database systems, Introduction to database design, ER Diagrams, Beyond ER design, Entities, Attributes and entity sets, Relationships and relationship sets, Additional features of ER model, Conceptual design with ER model, Conceptual design for large enterprises, Relational Model: Introduction to the Relational Model – Integrity Constraint Over relations – Enforcing Integrity constraints – Querying relational data – Logical data base Design – Introduction to Views – Destroying /altering Tables and Views.

UNIT – II

Relational Algebra and Calculus: Relational Algebra – Selection and projection ,set operations – renaming – Joins – Division – Examples of Algebra Queries, Relational calculus – Tuple relational Calculus – Domain relational calculus – Expressive Power of Algebra and calculus. Form of Basic SQL Query – Examples of Basic SQL Queries – Introduction to Nested Queries – Correlated Nested Queries Set – Comparison Operators – Aggregative Operators – NULL values – Comparison using Null values – Logical connectivity‟s – AND, OR and NOT– Impact on SQL Constructs – Outer Joins – Disallowing NULL values – Complex Integrity Constraints in SQL Triggers and Active Data bases.

UNIT – III

Introduction to Schema refinement – Problems Caused by redundancy – Decompositions – Problem related to decomposition –Functional dependencies, reasoning about FDS – FIRST, SECOND, THIRD Normal forms – BCNF ,Properties of decompositions, Lossless join Decomposition – Dependency preserving Decomposition – Schema refinement in Data base Design – Multi valued Dependencies – forth Normal Form, Join dependencies, Fifth Normal Form, Inclusion Dependencies.

UNIT – IV

Transaction Management: Transaction Concept-Transaction State- Implementation of atomicity and Durability, Concurrent Executions, Serializability, Recoverability, Implementation of Isolation, Testing for Serializability. Concurrency Control: Lock-Based Protocols –time Stamp Based Protocols- Validation Based Protocols-Multiple Granularity. Recovery System-Failure Classification-storage Structure-recovery and Atomicity-Log Based Recovery-Recovery with Concurrent Transactions-Buffer Management-Failure with loss of Non Volatile Storage-Advance Recovery Systems-Remote Backup Systems.

UNIT – V

Overview of Storage and Indexing: Data on External Storage – File Organization and Indexing – Cluster Indexes, Primary and Secondary Indexes – Index data Structures – Hash Based Indexing – Tree base Indexing – Comparison of File Organizations . Tree Structured Indexing: Intuitions for tree Indexes – Indexed Sequential Access Methods (ISAM) – B+ Trees: A Dynamic Index Structure-Search, Insert, and Delete-Hash Based Indexing: Static Hashing – Extendable hashing – Linear Hashing –Extendable vs. Linear hashing.

Text books:

1. Raghurama Krishnan, Johannes Gehrke (2003), Database Management Systems, 3rd

edition, Tata McGraw Hill, India.

2. Database System Concepts, A.Silberschatz, H.F.Korth, S.Sudharshan, Mc Grab hill, 5th Edition, 2006

References: 1. Database systems, 6th edition, Ramez Elmasri, Shamkant, B.Navathe, Pearson Education, 2013 2. Database system concepts, Peter rob and carles coronel, cengage learning 2008 3. Introduction to database management ML Gillenson & others, Willey student edition.

X. COURSE PLAN:

At the end of the course, the students are able to achieve the following course learning outcomes.

Lecture Course Learning Outcomes Topics to be covered Reference No.

1-4 Understand the basic concepts Introduction, Data base System Applications, T2: 1.1, 1.2 of databases and different Purpose of data base Systems.

type s of data models, View of Data – Data Abstraction, Instances T2: 1.3 languages and Schemas

Data Models T2: 1.4 Database Languages – DDL – DML – T2: 1.5 Database Access for applications Programs

5-8 Describe overall architecture Transaction Management, Data Storage and T2: 1.7, 1.8.1 of DBMS Querying

Database architecture T2: 1.8 Database users and administrators, History of T2:1.6, 1.10 database systems

Introduction to database design, ER Diagrams T1: 2.1 Beyond ER design

9-12 Identify the entities and Entities,Attributesandentitysets, T1: 2.2, 2.3 relationships and demonstrate Relationships and relationship sets

the features of ER model Additional features of ER model T1: 2.4 Conceptual design with ER T1: 2.5, 2.6 model, Conceptual design for

13-16 Apply integrity constraints Relational Model: Introduction to the T1: 3.1, 3.2 Relational Model – Integrity Constraint Over

relations

Enforcing Integrity constraints – Querying T1:3.3 - 3.5 relational data – Logical data base Design

Introduction to Views – Destroying /altering T1:3.6, 3.7 Tables and Views

17-19 Analyze and solve database Relational Algebra and Calculus: Relational T1: 4.1, 4.2.1 problems using relational Algebra – Selection and projection –

algebra, relational calculus set operations – renaming, Joins – Division T1: 4.2.2 - 4.2.5 20-28 Analyze and solve database Relational calculus – Tuple relational T1:4.3, 4.4

problems using SQL Calculus – Domain relational calculus –

Expressive Power of Algebra and calculus.

Form of Basic SQL Query – Examples of T1: 5.2 Basic SQL Queries

Introduction to Nested Queries – Correlated T1: 5.4 Nested Queries Set

Comparison Operators– Aggregative T1: 5.4.3, 5.5 Operators

8 | P a g e

NULL values – Comparison using Null T1: 5.6

values , Logical connectivity‟s – AND, OR

and NOT

Disallowing NULL values – Complex T1: 5.7, 5.8

Integrity Constraints in SQL ,Triggers and

Active Data bases

29-30 Discuss basic concepts of Introduction to Schema refinement – T1: 19.1

schema refinement Problems Caused by redundancy

Decompositions – Problem related to T1:19.1.3

decomposition

Functional dependencies, reasoning about FDS T1: 19.4

– FIRST, SECOND Normal forms

THIRD Normal forms – BCNF ,Properties of T1:19.4, 19.5

decompositions,

31-38 Define and Apply the normal Lossless join Decomposition – Dependency T1: 19.5

forms preserving Decomposition

Schema refinement in Data base Design – Multi T1: 19.7, 19.8.1

valued Dependencies

Forth Normal Form,Join dependencies,Fifth T1: 19.8.2 -19.8.5

Normal Form,Inclusion Dependencies

Understand the basic concepts Transaction Management: Transaction T2: 15.1, 15.2

of transaction and ACID Concept-Transaction State-

properties Implementation of atomicity and Durability, T2: 15.3

39-44 Solve problems of Concurrent Executions, Serializability , T2: 15.4 - 15.6

Concurrent Execution and Recoverability,

Implementation of Isolation, Testing for

Implement ACID properties T2: 15.7, 15.9

Serializability.

Concurrency Control: Lock-Based Protocols – T2: 16.1, 16.2

Describe the Concurrency time Stamp Based Protocols-

45-47

control protocols Validation Based Protocols-Multiple T2: 16.3, 16.4

Granularity.

Recovery System-Failure Classification-storage T2: 17.1, 17.2

Structure

recovery and Atomicity-Log Based Recovery- T2: 17.3, 17.4

48-53 Understand storage structure, Recovery with Concurrent Transactions- T2: 17.6

recovery process Buffer Management-Failure with loss of Non T2: 17.7, 17.8

Volatile Storage

Advance Recovery Systems-Remote Backup T2: 17.9, 17.10

Systems

Overview of Storage and Indexing: Data on T1: 8.1

Understand the basic concepts External Storage

54-56

of file organization File Organization and Indexing – Cluster T1: 8.2

Indexes, Primary and Secondary Indexes

Differentiate Index data Index data Structures – Hash Based Indexing T1: 8.3.1

57-59 structures and File Tree base Indexing – Comparison of File T1: 8.3.2, 8.4

Organizations Organizations

Tree Structured Indexing: Intuitions for tree T1: 10.1

60-61 Apply Indexes ,ISAM on trees Indexes

Indexed Sequential Access Methods (ISAM) T1: 10.2

Discuss Dynamic Index B+ Trees: A Dynamic Index Structure-Search,

62-63 Structures and apply different T1: 10.3 - 10.6

insert, Delete

operations

Differentiate Static and

Hash Based Indexing: Static Hashing – T1: 11.1, 11.2

64-65 Extendable hashing

Dynamic hashing techniques

Linear Hashing –Extendable vs. Liner hashing T1: 11.3, 11.4

9 | P a g e

XI. MAPPING COURSE OBJECTIVES LEADING TO THE ACHIEVEMENT OF PROGRAM

OUTCOMES

Course

Program Outcomes

Program Specific

Outcomes

Objectives


I S S H S H S

II S H S S S H

III H S H S S S

IV S S H S S S

V S S H H H

VI H S S S

VII S S H H S

S – Supportive H - Highly Related

XII. MAPPING COURSE OUTCOMES LEADING TO THE ACHIEVEMENT OF PROGRAM

OUTCOMES:

Course

Program Outcomes

Program Specific

Outcomes

Outcomes


1 H S S H S

2 S S H S S S

3 H H S

4 S S S S H

S – Supportive H - Highly Related

ASSIGNMENT QUESTIONS

Course Name : DATABASE MANAGEMENT SYSTEMS




Year : 2015 – 2016

Course Faculty : Y Appa Rao Assoc.Prof

OBJECTIVES



philosophy of outcome based education in the process of problem solving and career development. So, all students

of the institute should understand the depth and approach of course to be taught through this question bank, which

will enhance learner‟s learning process.

S. No. Question Blooms Course Taxonomy Level Outcome

UNIT – I

1 Define (i) Database (ii) DBMS (iii) database Applications? Knowledge 2

2 Discuss about Data Definition language, commands with example? Understand 1

3 Discuss about Data Manipulation language, commands with example? Understand 2

4 List various types of attributes? Knowledge 3

5 Discuss how can you change the data in the table? Understand 4

6 Explain data model and list the types of data model used? Understand 2

7 Define instance, schema and data abstraction and give the levels of data Understand 2 abstraction?

8 Discuss about the Concept Design with the ER Model? Understand 4

9 Define the terms i) Entity ii) Entity set iii) weak entity set iv) strong entity Knowledge 3 set?

10 Explain different types of database users and write the functions of DBA? Understand 2

UNIT – II

S. No. Question Blooms Course


1 Illustrate different set operations in Relational algebra with an example? Apply 1

2 Discuss about Domain Relational calculus in detail? Understand 2

3 Define trigger and explain its three parts? Differentiate row level and Knowledge 3

statement level triggers?

4 Illustrate Group by and Having clauses with examples? Apply 4

5 List the table modification commands in SQL? Knowledge 2

6 Discuss about the operators SELECT, PROJECT, UNION? Knowledge 2

7 Discuss about the operators renaming, joins, division? Knowledge 2

8 Demonstrate how to add a NOT NULL column to a table with example? Apply 3

9 Define a nested query? Write a nested query to find the names of sailors Knowledge 3

who have reserved both a red and green boat?

10 Discuss correlated nested queries? Write a query to find the names of sailors Understand 3

who have reserved a red boat?

UNIT – III

1 Define decomposition and how does it address redundancy? Discuss the Knowledge 3

problem s that may be caused by the use of decompositions?

2 Define functional dependencies.How are primary keys related to FD‟s? Knowledge 3

3 Define normalization? Explain 1NF, 2NF, 3NF Normal forms? Knowledge 4

4 Compare and contrast BCNF with 3NF? Apply 4

5 Describe properties of decompositions? Understand 4

6 Illustrate Multivalued dependencies and Fourth normal form with example? Apply 4

7 Discuss about Join dependencies and Fifth normal form? Understand 4

8 Illustrate Inclusion dependencies with example? Apply 4

9 Illustrate fully functional dependency with example? Apply 4

10 Demonstrate transitive dependency? Give an example? Apply 4

UNIT – IV

1 Explain ACID properties and Illustrate them through examples? Understand 2

2 Illustrate Concurrent execution of transaction with examples? Apply 2

3 Discuss two phase locking protocol and strict two phase locking protocols? Understand 2

4 Describe Timestamp based locking protocols? Understand 2

5 Describe Validation-based locking protocols? Understand 2

6 Explain Buffer Management? Understand 2

7 Explain different types of Advanced Recovery Techniques? Understand 2

8 Write in detail about Remote Backup systems? Apply 2

9 Discuss the failures that can occur with loss of Non-volatile storage? Understand 1

10 Define a Transaction? List the properties of transaction Knowledge 2

UNIT – V

1 Write in detail about Hash based Indexing and Tree based Indexing?

Apply 1

2 Compare I/O costs for all File Organizations?

Understand 1

3 Explain in detail about ISAM?

Understand 1

4 Explain B+ trees? Discuss about this Dynamic Index Structure?

Understand 1

5 Demonstrate searching a given element in B+ trees? Explain with Understand 1

example?

6 Illustrate insertion and deletion of an element in B+ trees with example?

Apply 1

7 Write in detail about Static Hashing?

Apply 1

8 Explain in detail about Extendible Hashing?

Understand 1

9 Explain in detail about Linear Hashing?

Understand 1

10 Compare and Contrast Extendible Hashing with Linear Hashing? Apply 1

TUTORIAL QUESTION BANK

Course Name : DATABASE MANAGEMENT SYSTEMS




Year : 2015 – 2016

Course Faculty : Y Appa Rao Assoc.Prof

OBJECTIVES To meet the challenge of ensuring excellence in engineering education, the issue of quality needs to be addressed, debated and taken forward in a systematic manner. Accreditation is the principal means of quality assurance in higher education. The major emphasis of accreditation process is to measure the outcomes of the program that is being accredited.




bank, which will enhance learner‟s learning process.

PART – A (Short Answer Questions)

Blooms

Course

Taxonomy

Q. No Questions Outcome

Level

UNIT – I

1. List the advantages of DBMS? Knowledge 1

2. List the database applications? Knowledge 2

3. Define instances and schemas of database? Knowledge 2

4. Discuss data independence? Understand 2

5. Define (i) database (ii) DBMS Knowledge 2

6. Explain about database storage structure? Understand 2

7. Discuss transaction management? Understand 2

8. Explain the query processor? Understand 2

9. Define (i) entity (ii) attribute iii) entity set Knowledge 3

10. Define relationship and relationship set? Knowledge 3

11. Discuss about data definition language and commands? Understand 2

12. Discuss about data manipulation language and commands? Understand 2

13. Explain about querying relational data? Understand 2

14. Discuss how can you change the data in the table? Understand 2

15. Define a database administrator and specify any two responsibilities of DBA? Knowledge 3

16. Discuss how can you alter and destroy tables? Understand 2

17. Explain data model and list the types of data model used? Understand 2

18. Give the levels of data abstraction? Understand 2

19. Define weak and strong entity sets? Knowledge 3

20. Explain about stored and derived attributes? Understand 3

UNIT – II

1 Define relational database query? Knowledge 1

2 State about SELECT operation in relational algebra? Knowledge 1

3 State about PROJECT operation in relational algebra? Knowledge 1

4 Define aggregate functions and list the aggregate functions supported by SQL? Knowledge 1

5 Discuss the use of rename operation? Understand 1

6 Illustrate division operation? Apply 2

7 Discuss the basic form of SQL query? Understand 2

8 Define null value and explain how to restrict insertion of null values into the table. Knowledge 1

9 Define tuple variable with its syntax? Knowledge 3

10 Define primary key and foreign constraints with examples? Knowledge 1

11 Define string functions in SQL? Knowledge 3 12 Explain about trigger and its operations? Understand 1 13 Demonstrate how to add a NOT NULL column to a table? Apply 1 14 Explain about unique, not null and default constraint? Knowledge 1 15 List the table modification commands in SQL? Knowledge 2 16 What is domain integrity? Give example. Understand 3 17 List the set operations of SQL? Knowledge 1 18 What is the use of group by clause? Understand 1 19 Discuss about the operators SELECT, PROJECT, UNION? Knowledge 1 20 Discuss about the operators renaming, joins, division? Knowledge 1

UNIT – III

1 Define redundancy? Knowledge 1

2 List out the Problems related to decompositions? Knowledge 2

3 Define functional dependency? Why are some functional dependencies trivial? Knowledge 2

4 Discuss normalization? Understand 2

5 Illustrate functional dependency with example? Apply 2

6 Illustrate fully functional dependency with example? Apply 3

7 Define First Normal Form? Knowledge 3

8 Define Second Normal Form? Knowledge 3

9 Define Third Normal Form? Knowledge 3

10 Define Fourth Normal Form? Knowledge 4

11 Demonstrate transitive dependency? Give an example? Apply 4

12 Discuss Domain-Key Normal Form? Understand 4

13 Explain about Loss less-join dependency? Understand 4

14 Explain about BCNF? Understand 4

15 Explain about multi-valued dependencies? Understand 4

16 Define join dependency and fifth normal form? Knowledge 4

17 Define armstrong axioms for FD‟s? Knowledge 4

18 Explain the concept scheme refinement in database design? Understand 4

19 Define dependency preserving decomposition? Knowledge 4

20 Explain about inclusion dependency? Understand 1

UNIT – IV

1 Define a transaction? List the properties of transaction Knowledge 1

2 Discuss different phases of transaction? Understand 1

3 Discuss recoverable schedules? Understand 1

4 Discuss cascade less schedules? Understand 1

5 Define two phase commit protocol? Knowledge 1

6 Demonstrate the implementation of isolation? Apply 1

7 Discuss the procedure to test serializability? Understand 1

8 Explain about different types of locks? Understand 2

9 Discuss about failure classification? Understand 2

10 Define a checkpoint? Knowledge 2

11 Discuss the failures that can occur with loss of non-volatile storage? Understand 2

12 Demonstrate conflict serializability? Apply 2

13 Discuss view serializability? Understand 3

14 Explain about transition states? Understand 3

15 Explain about acid properties? Understand 3

16 Explain about locking protocols? Understand 3

17 Define timestamp based protocol? Understand 3

18 Explain about multiple granularity? Understand 2

19 Explain about storage structure? Understand 2

20 Explain about remote backup systems? Understand 2

UNIT – V

1 Discuss about data on external storage? Understand 2 2 Explain clustered indexes? Understand 1 3 Discuss the primary and secondary indexes? Understand 1 4 Define Tree Indexing? Knowledge 1 5 Explain hash based indexing? Understand 1 6 Discuss the intuition for tree indexes? Understand 1 7 Define indexed sequential access method? Knowledge 1 8 Discuss about overflow pages and locking considerations of ISAM? Understand 1 9 Discuss the cost model of heap files? Understand 1

10 Discuss the cost model of sorted files? Understand 1 11 Discuss the cost model of clustered files? Understand 1 12 Explain about several ordered indexing? Understand 1 13 Explain about B+ tree index file? Understand 1 14 Explain about static hashing? Understand 1 15 Explain about organization of records in files? Understand 1 16 Discuss the impact of workload on indexes? Knowledge 1 17 Explain about RAID Understand 2 18 Define extendable hashing? Knowledge 1 19 Define linear hashing? Knowledge 1 20 Differentiate extendable vs linear hashing? Knowledge 1

PART – B (Long Answer Questions)

Blooms

Course

Taxonomy

Q. No Questions Outcome

Level

UNIT – I

1 Compare and contrast file systems with database systems? Apply 1

2 Define data abstraction and discuss levels of abstraction? Knowledge 2

3 Discuss about different types of data models? Understand 2

4 Describe the structure of DBMS? Understand 2

5 Discuss additional features of the ER-Models. Understand 3

6 Discuss about the concept design with the ER Model? Understand 4

7 Write about views and updates on views? Knowledge 1

8 Explain different types of database users and write the functions of DBA? Understand 2

9 Explain about different types of integrity constraints? Understand 3

10 Discuss about the logical database design? Understand 4

Distinguish strong entity set with weak entity set? Draw an ER diagram Apply 3

11 to illustrate weak entity set?

Differentiate relation schema and relational instance? Define the terms arity and Understand 2

12 degree of s relation? What are domain constraints?

13 Explain about types of database languages with syntax and example? Apply 1

14 Differentiate DBMS and RDBMS? Understand 1

15 Explain briefly about database users? Understand 1

16 Explain briefly about database administrator and responsibilities of DBA? Understand 1

17 Explain about TCL and DCL commands with examples? Apply 3

18 List the data definition language commands with examples? Apply 3

19 Explain about transaction management? Understand 1

20 Explain about class hierarchy and aggregation in dbms? Understand 1

UNIT – II

1 Illustrate different set operations in relational algebra with an example? Apply 2

2 Define Join? Explain different types of joins? Knowledge 1

3 Discuss about selection and projection in relational algebra in detail? Understand 3

4 Define trigger and explain its three parts? Differentiate row level and statement Knowledge 1

level triggers?

5 Illustrate group by and having clauses with examples? Apply 1

6 Discuss about complex integrity constraints in SQL? Understand 2

7 Discuss different types of aggregate operators with examples in SQL? Understand 1

Define a nested query?

8 a. Write a nested query to find the names of sailors who have reserved both Knowledge 1

a red and green boat?

b. Write a nested query to find the names of sailors who have reserved all boats?

Discuss correlated nested queries?

9 a. Write a query to find the names of sailors who have reserved a red boat? Understand 1

b. Write a query to find the names of sailors who have not reserved a red boat?

Explain about union and intersect operator

a. Write a query to find the names of sailors who have reserved boat 103 and

10 color is green? Understand 1

b. Write a query to find the names of sailors who have reserved a red or a

green boat?

11 Discuss about active databases and write an example for trigger? Knowledge 1

12 Illustrate outer joins and its types with examples? Knowledge 1

13 Describe logical connectives of SQL with examples? Knowledge 1

14 Explain briefly about joins and its types with examples? Knowledge 1

a) Explain about relational algebra and its operations?

15 b) Write a relational algebra query to find the names of sailors who reserved a Knowledge 1

red boat?

16 State the difference between primary key constraint and foreign key constarint? Understand 1

17 Explain briefly about key constraints with examples? Knowledge 1

18 Discuss about types of keys with valid examples? Understand 1

19 Discuss about types of string functions in dbms by using SQL queries. Understand 1

20 Explain the term constraint and specify different types of constraints? Understand 1

UNIT – III

1 Illustrate redundancy and the problems that it can cause? Apply 3

2 Define decomposition and how does it address redundancy? Discuss the problem s Knowledge 3

that may be caused by the use of decompositions?

3 Define functional dependencies. How are primary keys related to FD‟s? Knowledge 3

4 Define normalization? Explain 1NF, 2NF, 3NF normal forms? Knowledge 3

5 Compare and contrast BCNF with 3NF? Apply 3

6 Describe properties of decompositions? Understand 3

7 Explain about schema refinement in database design? Understand 3

8 Illustrate multi valued dependencies and fourth normal form with example? Apply 3

9 Discuss about join dependencies and fifth normal form? Understand 3

10 Illustrate inclusion dependencies with example? Apply 3

11 Discuss join dependencies and fifth normal form, and explain why 5NF? Understand 3

Define a functional dependency. List and discuss the six inference rules for Knowledge 3

12 functional dependencies. Give relevant examples.

13 Explain the role of functional dependency in the process of normalization. Understand 3

14 State the need for normalization of a database and explain various normal forms? Understand 3

15 Explain about properties of decomposition? Understand 3

UNIT – IV

1 Explain ACID properties and Illustrate them through examples? Understand 2

2 Discuss how do you implement atomicity and durability? Understand 2

3 Illustrate concurrent execution of transaction with examples? Apply 2

4 Discuss serializability in detail? Understand 2

5 Discuss two phase locking protocol and strict two phase locking protocols? Understand 2

6 Describe timestamp based locking protocols? Understand 2

7 Describe validation-based locking protocols? Understand 2

8 Discuss in detail multiple granularity? Understand 2

9 Explain in detail storage structure? Understand 2

10 Discuss deferred database modification and immediate database modification? Understand 2

11 Discuss how do you recover from concurrent transactions? Understand 2

12 Explain buffer management? Understand 2

13 Explain different types of advanced recovery techniques? Understand 2

14 Write in detail about remote backup systems? Apply 2

15 Explain briefly about lock-based concurrency control? Understand

UNIT-V 1 Write in detail about hash based indexing and tree based indexing? Apply 1 2 Compare I/O costs for all file organizations? Understand 1 3 Explain in detail about ISAM? Understand 1 4 Explain B+ trees? Discuss about this dynamic index structure? Understand 1 5 Demonstrate searching a given element in B+ trees? Explain with example? Understand 1 6 Illustrate insertion and deletion of an element in B+ trees with example? Apply 1 7 Write in detail about static hashing? Apply 1 8 Explain in detail about extendible hashing? Understand 1 9 Explain in detail about linear hashing? Understand 1

10 Compare and contrast extendible hashing with linear hashing? Apply 1 Blooms

Course

Q. No Questions Taxonomy

Outcome

Level

UNIT – I

Consider the database given by the following schemes.

Customer (CustNo, SalesPersonNo ,City)

Sales_ Person(SalesPersonNo ,SalesPersonName, CommonPrec,YearofHire)

Give an expression in SQL for each of the following queries:

1 a) Display the list of all customers by Cust_No with the city in Apply 3

which each is located.

b) Select Cust No, city from Customer list the names of the sales persons

who have accounts in Delhi.

Explain the term aggregation in an ER model? Develop an ER diagram using

aggregation that captures the following information :

2 Employees work for projects. An employee working for a particular project uses Apply 3

various machinery. State any options you make. Also discuss about the ER

diagram you have designed.

Construct an E-R diagram for a car-insurance company whose customers own

3 one or more cars each. Each car has associated with it zero to any number of Apply 3

recorded accidents. State any assumptions you make.

4 Explain briefly about views in database and analyze and find whether view

exists if the table is dropped from the database?

5 Explain the structure of a DBMS With a neat diagram,. Apply 3

6 We can convert any weak entity set to strong entity set by simply adding Analyze 3

appropriate attributes. Analyze why, then, do we have weak entity sets?

7 Explain about primary key constraint and foreign key constraint briefly and by Analyze 1

using primary key and foreign key create tables for student and college.

8 Define constraint and explain each constraint with an example? Analyze 1

9 Create a database for the college library system by using E-R diagram and identify Analyze 3

the relations between the entities, primary key and foreign key.

UNIT-II Consider the following relational schema

Employee (empno,name,office,age)

Books(isbn,title,authors,publisher)

Loan(empno, isbn,date)

Write the following queries in relational algebra.

Find the names of employees who have borrowed a book Published

1 by McGraw-Hill?

Apply 1

Find the names of employees who have borrowed all books Published by

McGraw-Hill?

Find the names of employees who have borrowed more than five

different books published by McGraw-Hill?

For each publisher, find the names of employees who have borrowed?

Find the details of employee in ascending order.

Given the Students relation as shown below

For the Student relation find the details of student with highest CPI.

Display the names of the students in reverse order. Apply 1

2 Find the details of employee in descending order.

Find the average of CPI from the table.

Find the details of student whose name starts with „S‟.

Consider the following relations containing

3 employee(name,salary,deptno) Apply 1

department (deptno, deptname, address)

Solve the query by using the basic relational algebra operations(U, -,x , ,p)?

Explain about aggregation functions in detail and

Write SQL Query to find second highest salary of employee from

4 employee Apply 1

table?

Write SQL Query to find the name of employee from Employee table

whose ages are between 30 to 50.

Consider the following information about a university database and create tables

for following entities:

5 Professors have an SSN, a name, an age, a rank, and a research specialty Apply 1

Graduate students have an SSN, a name, an age, and a degree program

(e.g., M.S. or Ph.D.)

Consider the following relational schema:

Emp(eid: integer, ename: string, age: integer, salary: real)

Works(eid: integer, did: integer, pcttime: integer)

Dept(did: integer, dname: string, budget: real, managerid: integer)

6 Write an SQL statement to add John Doe as an employee with eid = Apply 1

101, age = 32 and salary = 15, 000.

Write an SQL statement to give every employee a 10 percent raise.

Write an SQL statement to delete the Toy department.

Display the details of employees in order.

Define a query and explain SQL queries with solutions for the following data:

Sid name login Age gpa

58 luther Luther1@hgmail. 25 1.8

com

31 Ricky [email protected] 20 2.0

7 m Apply 1

42 rosey [email protected]

21 2.1

om

Modify this query so that only the login column is included in the answer.

If the clause WHERE S.gpa >= 2 is added to the original query, what

is the set of tuples in the answer?

Find the difference between the highest gpa and least gpa.

Consider the following relations containing

Suppliers(sid: integer, sname: string, address: string)

Parts(pid: integer, pname: string, color: string)

8 Catalog(sid: integer, pid: integer, cost: real) Apply 1

Find the names of suppliers who supply some red part.

Find the sids of suppliers who supply some red part and some green part.

Find the pids of parts supplied by at least two different suppliers.

Create a view by combining three tables.

Consider the following relations containing airline flight information:

Flights(flno: integer, from: string, to: string, distance: integer, departs: time,

Aircraft(aid: integer, aname: string, cruisingrange: integer) Certified(eid:

integer, aid: integer)

9 Employees(eid: integer, ename: string, salary: integer) Apply 1

UNIT – III

1 Consider a relation scheme R = (A, B, C, D, E, H) on which the following functional dependencies hold: {A–>B, BC–> D, E–>C, D–>A}. Write the

candidate keys of R?

Apply 1

2 Consider the following relational schemes for a library database: Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection (Title, Author, Catalog_no) the following are functional dependencies:

\ a. Title Author --> Catalog_no b Catalog_no --> Title Author Publisher Year c Publisher Title Year --> Price

Apply 2

3

Consider a schema R (A, B, C, D) and functional dependencies A -> B and C ->D. Solve and find whether the decomposition of R into R1 (A, B) and R2(C, D) belongs to which one or both (dependency preserving and loss less join)?

Apply 3

4 Show that: if α → β and α → γ then α → βγ Apply 4

UNIT-IV

5 Explain briefly about functional dependency and trivial functional dependency and FD axioms.

Apply 1

1 Consider the following transactions with data items P and Q initialized to zero: T1: read(P); read(Q); If P=0 then Q:=Q+1; write(Q); T2: read(Q); read(P); If Q=0 then P:=P+1; write(P); Solve and find any non-serial interleaving of T1 and T2 for concurrent execution leads to a serializable schedule or non serializable schedule. Explain?

Apply 2

2 Analyze which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock? Explain the following: a. 2-phase locking b. Time-stamp ordering

Apply 1

3 Suppose that there is a database system that never fails. Analyze whether a recovery manager required for this system?

Apply 1

UNIT-V

1 Consider a B+-tree in which the maximum number of keys in a node is 5. Calculate the minimum number of keys in any non-root node?

Apply 1

2 In the index allocation scheme of blocks to a file, Calculate on what maximum possible size of the file depends?

Apply 2

3 A clustering index is defined on the fields of which type? Analyze them. Apply 2

4 Calculate the minimum space utilization for a B+ tree index? Apply 2



2015 - 2016

Course Name : DESIGN AND ANALYSIS OF ALGORITHMS




Year : 2015 – 2016

Course Faculty : D SHIVA RAMA KRISHNA

OBJECTIVES To meet the challenge of ensuring excellence in engineering education, the issue of quality needs to be addressed, debated and taken forward in a systematic manner. Accreditation is the principal means of quality assurance in higher education. The major emphasis of accreditation process is to measure the outcomes of the program that is being accredited.

In line with this, Faculty of Institute of Aeronautical Engineering, Hyderabad has taken a lead in incorporating philosophy of outcome based education in the process of problem solving and career development. So, all students of the institute should understand the depth and approach of course to be taught through this question bank, which will enhance learner‟s learning process.

PART – A (SHORT ANSWER QUESTIONS)

S. No Question Blooms Program Taxonomy Outcome Level

UNIT – I

1 Define the term algorithm and state the criteria the algorithm should satisfy. Remember 1

2 Define order of an algorithm and the need to analyze the algorithm. Remember 2

3 Define asymptotic notations: big „Oh‟, omega and theta? Remember 2

4 List the two different types of recurrence Remember 4

5 State the best case and worst case analysis for linear search Remember 2

6 If f(n)=5n2 + 6n + 4, then prove that f(n) is O(n

2) Remember 3

7 Give the recurrence equation for the worst case behavior of merge sort. Remember 3

8 Compute the average case time complexity of quick sort Remember 4

9 Define algorithm correctness Remember 4

10 Describe best case, average case and worst case efficiency of an algorithm? Remember 3

11 Explain the term amortized efficiency Understand 3


12 Define order of growth Remember 2

13 How do you measure the algorithm running time? Understand 1

14 Describe the role of space complexity and time complexity of a program are Understand 1 necessary?

15 Explain algorithm design technique? Understand 3

16 Use step count method and analyze the time complexity when two n×n Apply 3 matrices are added

17 What is meant by divide and conquer? Give the recurrence relation for Understand 2 divide and conquer.

18 Define Control Abstraction and write the computing time of divide and Remember 1 conquer.

19 List out any two drawbacks of binary search algorithm. Remember 2

20 List out the drawbacks of Merge Sort algorithm. Remember 3

UNIT – II

1 Describe union operation on sets Remember 4

2 Describe find operation on sets Remember 4

3 Definea spanning tree and minimal spanning tree Remember 3

4 Define depth first search Remember 2

5 Define breadth first search Remember 2

6 Differentiate Breadth first search and depth first search Remember 1

7 Describe AND/OR graph Remember 3

8 Explain game tree Remember 2

9 Define an articulation point? Remember 4

10 Define aconnected and bi-connected component. Remember 1

UNIT – III

1 Define greedy method Remember 2

2 Define job sequencing with deadlines problem Remember 2

3 Define minimum cost spanning tree Remember 3

4 State the principle of optimality Remember 1

5 Define prims algorithm Remember 1

6 Definekruskal algorithm Remember 4

7 Define single source shortest path problem Remember 4

8 Define dynamic programming. Remember 2

9 List the features of dynamic programming Remember 3

10 Distinguish greedy method and dynamic programming Remember 4

UNIT – IV

1 State the principle of Backtracking Remember 4

2 Write control abstraction for backtracking Apply 4

3 List the applications of backtracking? Remember 3

4 Define a dead node Remember 2

5 Differentiate live node and dead node Remember 1

6 Define state space tree Remember 1


7 Define is solution space Remember 2

8 Define solution states and answer state? Remember 3

9 Explain 8 – Queens problem Apply 1

10 Explain Sum of Subsets problem Apply 1

UNIT – V

1 Define class P Remember 2

2 Compare NP-hard and NP-completeness Remember 1

3 Define NP- hard problem Remember 1

4 Define NP-complete problem Remember 2

5 Define deterministic problem? Remember 4

6 Define non-deterministic problem Remember 4

7 Define a decision problem? Remember 3

8 Explain optimization problem Understand 2

9 Explain maxclique problem? Understand 2

10 Define halting problem Remember 1

PART – B (LONGANSWER QUESTIONS)

S. No

Question Blooms Taxonomy Program

Level Outcome

UNIT - I

1 Discuss various the asymptotic notations used for best case average case Understand 1

and worst case analysis of algorithms.

2 Differentiate between priori analysis and posteriori analysis. Understand 3

3 Discussbinary search algorithm and analyze its time complexity Understand 4

4 Explain quick sort algorithm and simulate it for the following data 20, Understand 4

35, 10, 16, 54, 21, 25

5 Explain Iterative binary search algorithm Understand 2

6 Illustratemerge sort algorithm and discuss time complexity Understand 2

7 Describestrassen‟s matrix multiplication. Understand 4

8 Discussamortized analysis Understand 3

9 Explain probabilistic analysis Understand 3

10 Sort the list of numbers using merge sort: 78, 32, 42, 62, 98, 12, 34, 83 apply 4

UNIT - II

1 Explain breadth first search algorithm with example Understand 2

2 Explain depth first search algorithm with example Understand 2

3 Discuss various tree traversal techniques with examples Understand 1

4 Compare and contrast BFS and DFS. Understand 3

5 Explain in detail about AND/OR graphs Understand 3

6 Explain waiting rule for finding UNION of sets and collapsing rule Understand 2

7 Differentiate divide and conquer and greedy method Understand 1

8 Discuss game trees Understand 1

UNIT - III 1 Explain in detail job sequencing with deadlines problem with example Apply 2

2 Explain single source shortest path problem with example Apply 2

3 Explain knapsack problem with example Apply 1

4 Explain prims algorithm with example Understand 3

5 Explain kruskal algorithm with example Understand 4

6 Explain the concept multistage graphs with example. Understand 4

7 Explain optimal binary search tree algorithm with example Understand 2

8 Explain 0/1 knapsack problem with example Understand 2

9 Explain all pairs shortest path problem with example Understand 1

10 Describe the travelling salesman problem and discuss how to solve it Understand 3

using dynamic programming?

UNIT – IV

1 Write an algorithm for N-queens problem using backtracking Apply 1

2 Explain subset-sum problem and discuss the possible solution strategies Apply 1 using backtracking.

3 Describe graph coloring problem and write an algorithm for m-coloring Understand 2 problem

4 Write an algorithm for Hamiltonian cycle with an example Apply 2

5 Explain properties of LC search Apply 3

6 Describe control abstraction for LC Search Understand 4

7 Explain principle of FIFO branch and bound Apply 3

8 Explain principle of LIFO branch and bound Apply 3

9 Explain the method of reduction to solve travelling sales person problem Apply 3 using branch and bound

10 Explain TSP using branch and bound method with example Apply 4

UNIT – V

1 State and prove cook‟s theorem Remember 2

2 Explain deterministic and non-deterministic algorithms Apply 1

3 Write non deterministic algorithm for sorting and searching Apply 1

4 Write a non-deterministic knapsack algorithm Apply 3

5 Explain how P and NP problems are related Apply 4

6 Distinguish NP- hard and NP-complete problems Understand 4

7 Explain decision problem with an example Apply 2

8 Explain chromatic number decision problem and clique decision problem Apply 1

9 Explain the strategy to prove that a problem is NP-hard Apply 2 10 Explain intractable problems with examples Apply 4

PART – C (PROBLEM SOLVING AND CRITICAL THINKING QUESTIONS)

S. No Question Blooms Program


UNIT – I

1 Solve the following recurrence relation Understand 4

= 2

+ , 1 = 2

2


T(n) = 7T(n/2)+cn2

3 Solve the recurrence relation Understand 4

, = 1

= 3 + , > 1, 2

2

4 Explain quick sort algorithm and simulate it for following data sequence: Apply 2

3 5 9 7 1 4 6 8 2

5 Sort the list of numbers using merge sort Understand 3

33, 44, 2, 10, 25, 79, 86, 47, 14, 36

6 Show that the average case time complexity of quick sort is O(nlogn) Apply 3

7 Understand merge sort on letters H, K, P,C,S,K,R,A,B,L Understand 4

8 Understandstrassen‟s matrix multiplication on following matrices Understand 2

4 5 2 10

5 9

,

1 6

9 Write and solve recurrence relation for strassen‟s matrix multiplication Apply 2


= 2

+ 1, 1 = 2

2

UNIT - II

1 Illustrate BFS traversal of following graph

Understand 4

2 List the articulation points from the following graph 1

Understand

3 Writeinorder, preoreder, post order traversal of the following tree Understand 3

S. No Question Blooms Program Taxonomy Level Outcome

4 Illustrate DFS and BFS traversals of following graph

Understand 3

5 Illustrate DFS traversal of following graph Understand 2

6 Illustrate BFS traversal of following graph Understand 1

7 List the articulation points from the following graph Understand 2

8 Writeinorder, preorder, post order traversal of the following tree Understand 2


9 Illustrate BFS and DFS traversals of following graph Understand 4

10 Illustrate DFS traversal of following graph Understand 4

UNIT - III 1 Compute the optimal solution for job sequencing with deadlines using Understand 3

greedy method. N=4, profits (p1,p2,p3,p4) = (100,10,15,27),

Deadlines (d1,d2,d3,d4) = (2,1,2,1)

2 Compute the optimal solution for knapsack problem using greedy Understand 2 methodN=3, M= 20, (p1,p2,p3)= (25,24,15), (w1,w2,w3) =(18,15,10)

3 Construct minimum cost spanning tree using Understand 2 a) prims algorithm b) kruskal algorithm

4 Apply single source shortest path algorithm for the following graph Apply 3

5 Use optimal binary search tree algorithm and compute wij, cij, rij, Understand 4

0<=i<=j<=4,p1=1/10, p2=1/5, p3=1/10, p4=1/120, q0=1/5, q1=1/10,

q2=1/5, q3=1/20,q4=1/20.

6 Construct optimal binary search for (a1, a2, a3, a4) = (do, if,int, while), Understand 4 p(1 : 4) = (3,3,1,1) q(0 : 4)= (2,3,1,1,1)


7 Solve the solution for 0/1 knapsack problem using dynamic Apply 1 programming(p1,p2,p3, p4) = (11, 21, 31, 33), (w1, w2, w3, w4) = (2, 11,

22, 15), M=40, n=4

8 Solve the solution for 0/1 knapsack problem using dynamic programming Apply 1 N=3 , m=6 profits (p1,p2,p3) = (1,2,5) weights (w1,w2,w3) = (2,3,4)

9 Find the shortest tour of traveling sales person for the following cost Understand

matrix using dynamic Programming 2

∞ 12 5 7

11 ∞ 13 6

4 9 ∞ 18

10 3 2 ∞

10 Calculate shortest distances using all pairs shortest path algorithm Understand 2

UNIT - IV

1 Sketch the state space tree degenerated by 4 queens problem Understand 3

2 Apply the backtracking algorithm to solve the following instance of the Understand 3 sum of subsets problem S={5,10,12,13,15,18} and d=30

3 Sketch the state space tree generated all possible 3-color,4-node graph Understand 4

4 Identify Hamiltonian cycle from the following graph Understand 4

S. No Question Blooms Program


5 Solve the following instance of travelling sales person problem using Understand 1

Least Cost Branch Bound

∞ 12 5 7

11 ∞ 13 6

4 9 ∞ 18

10 3 2 ∞

6 Draw the portion of state space tree generated by LCBB by the following Understand 1

knapsack problem n=5 , (p1,p2,p3,p4,p5) =(10,15,6, 8, 4),

(w1,w2,w3,w4,w5)=(4,6,3,4,2) and m=12

7 Draw the portion of state space tree generated by FIFO knapsack for the Understand 2

instance N=4 , (P1, P2, P3, P4)= ( 10, 10, 12, 18 ) , ( w1, w2,w3,w4) = (

2, 4, 6, 9 ) , m=15

8 Solve the following instance of travelling sales person problem using Understand 3

Least Cost Branch Bound

9 Identify Hamiltonian cycle from the following graph Understand 3

10 Apply the backtracking algorithm to color the following graph Understand 3


UNIT - V 1 Show that satisfiability is at most three literals reduces to chromatic Remember 4

number

2 Prove Hamiltonian cycle is in NP Understand 1

3 Prove circuit-SAT is in NP Understand 1

4 List two problems that have polynomial time algorithms justify your Understand 3 answer

5 Explain 3CNF satisfiability problem Remember 2

6 Explain P type problems with examples Remember 1

Prepared by: HOD, C SE



Course Title FORMAL LANGUAGES AND AUTOMATA THEORY

Course Code A40509

Regulation R13 – JNTUH


4 1 - 4

Course Faculty D SHIVA RAMA KRISHNA

I. COURSE OVERVIEW:

Formal languages and automata theory deals with the concepts of automata, formal languages, grammar,

computability and decidability. The reasons to study Formal Languages and Automata Theory are Automata

Theory provides a simple, elegant view of the complex machine that we call a computer. Automata Theory

possesses a high degree of permanence and stability, in contrast with the ever-changing paradigms of the

technology, development, and management of computer systems. Further, parts of the Automata theory

have direct bearing on practice, such as Automata on circuit design, compiler design, and search algorithms;

Formal Languages and Grammars on compiler design; and Complexity on cryptography and optimization

problems in manufacturing, business, and management. Last, but not least, research-oriented students will

make good use of the Automata theory studied in this course.

II. PREREQUISITES:

Level Credits Periods / Week Prerequisites

UG

4

5 Discrete mathematics, data

structures and algorithms

III. MARKS DISTRIBUTION:

University Total

Sessional Marks

End Exam

marks

marks

Midterm Test

There shall be two midterm examinations. Each midterm examination consists

of essay paper, objective paper and assignment.

The essay paper is for 10 marks of 60 minutes duration and shall contain 4

questions. The student has to answer 2 questions, each carrying 5 marks.

The objective paper is for 10 marks of 20 minutes duration. It consists of 10 75 100

multiple choice and 10 fill-in-the blank questions, the student has to answer all




portion.

Five marks are earmarked for assignments. There shall be two assignments in

every theory course. Assignments are usually issued at the time of

commencement of the semester. These are of problem solving in nature with

critical thinking.

Marks shall be awarded considering the average of two midterm tests in each

course.



1 I Mid Examination 90 minutes 20

2 I Assignment - 05

3 II Mid Examination 90 minutes 20

4 II Assignment - 05

5 External Examination 3 hours 75

V. COURSE OBJECTIVE :

Understand an overview of the theoretical foundations of computer science from the perspective of formal

languages

II. Illustrate finite state machines to solve problems in computing

III. Understand the hierarchy of problems arising in the computer sciences.

IV. Understand Regular grammars, context free grammar.

V. Construct the model of Push down Automata, Turing Machines.


1. Students should be able to understand the concept of abstract machines and their power to

recognize the languages.

2. Attains the knowledge of language classes and grammars relationship among them with the

help of Chomsky hierarchy.

3. Students will be able to understand the pre-requisites to the course compiler or advanced

compiler design.

HOW PROGRAMS ARE ACCESSED:

Program Outcomes

Level

Proficiency

assessed by


science, engineering fundamentals, and an engineering to the solution

of complex engineering problems specialization

S

Tutorials



Assignments







considerations.



Projects





Mini Projects





--





--


development.


--




settings.








H

projects


discussion








assessed by

Applications of Computing: Ability to use knowledge in various domains to provide

solution to new ideas and innovations.

H Lectures,

Assignments

Programming Skills: Identify required data structures, design suitable algorithms,

develop and maintain software for real world problems.

H

Projects

SYLLABUS:

UNIT I:

Fundamentals:Strings, Alphabets, Language, Operations, Finite state machine, definitions, finite automaton model, acceptance of strings, and languages, deterministic finite automation and non deterministic finite automaton, transition diagrams and language recognizers.

Finite automata:NFA with ε transitions – Significance, acceptance of languages. Conversions and

Equivalence : Equivalence between NFA with and without ε – transitions. NFA to DFA

conversion, minimization of FSM, equivalence between two FSM‟s, Finite Automata with output

– Moore and Melay machines.

UNIT II:

Regular Languages:Regular sets, regular expressions, identify rules, Constructing finite Automata for a given regular expressions, Conversion of Finite Automata to Regular expressions. Pumping lemma of regular sets, closure properties of regular sets(proofs not required)

Grammar Formalism:Regular grammars – right linear and left linear grammars, equivalence

between regular linear grammar and FA, inter conversion, Context free grammar , derivation

trees, sentential forms. Right most and left most derivation of strings.

UNIT III:

Context Free Grammars :Ambiguity in context free grammars. Minimization of Context Free Grammars. Chomsky normal form, Greiback normal form, Pumping Lemma for Context Free Languages. Enumeration of properties of CFL ( proofs omitted).

Push Down Automata:Push down automata, definition , model, acceptance of CFL, Acceptance

by final state and acceptance by empty state and its equivalence. Equivalence of CFL and PDA,

interconversion.(Proofs not required). Introduction to DCFL and DPDA.

UNIT IV:

Turing Machine :Turing Machine, definition, model , design of TM, Computable functions, recursively enumerable languages. Church‟s hypothesis , counter machine , types of Turing machines(proofs not required).linear bounded automata and context sensitive language.

UNIT V:

Computability Theory :Chomsky hierarchy of languages, decidability of problems, Universal Turing Machine, undecidability of posts. Correspondence problem, Turing reducibility, Definition of P and NP problems, NP complete and NP hard problems.

TEXT BOOKS:

1. “Introduction to Automata Theory Languages and Computation”.Hopcroft H.E. and Ullman

J.D.Pearson Education.

2. Introduction to Theory of Computation –Sipser 2nd edition Thomson

REFERENCES

1. Theory of Computation – Vivek Kulkarni - OXFORD 2. Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley.

3. Introduction to languages and the Theory of Computation ,John C Martin, TMH

4. Theory of Computer Science – Automata languages and computation – Mishra and

Chandrashekaran, 2nd

edition, PHI 5. “Elements of Theory of Computation”, Lewis H.P. & Papadimition C.H. Pearson /PHI

X. COURSE PLAN:

The course plan is meant as a guideline. There may probably be changes.

Lecture Topics to be covered Course Learning Outcomes Reference

No.

1 – 2 Fundamentals : Strings, Alphabet, Language, Understand Fundaments T1: 1.1-1.2

Operations R1: 1.2 – 1.3

3 Finite state machine, definitions, finite automaton Understand Finite state machine T1:2.1 -2.2

model, acceptance of strings, and languages R1: 2.2 – 2.3

4 – 5 Deterministic finite automaton. Illustrate Deterministic finite T1:2.2

automaton R1: 2.4

6 -7 Non deterministic finite automaton Illustrate Non deterministic finite T1:2.3

automato

n R1: 2.5

8 Transition diagrams and Language recognizers Illustrate Transition diagrams T1:2.2

R1: 2.2 -2.3

9 – 10 Finite Automata : Non deterministic finite Illustrate Non deterministic finite T1:2.4

automaton with ε transitions - Significance, automaton with ε transitions R1: 2.7

acceptance of languages.

11 Conversions and Equivalence : Equivalence Illustrate NFA with ε to NFA T1:2.4

between NFA with and without ε transitions conversions R1: 2.8

12 – 13 NFA to DFA conversion Illustrate NFA to DFA conversion T1:2.3

R1: 2.6.1

14 – 15 Minimization of Finite state machine Understand Minimization of Finite T1:3.4

state machine R1: 2.6.2 , 2.13

16 Equivalence between two Finite state machine‟s Illustrate Equivalence between two T1:3.4

Finite state machine‟s R1: 2.12

17 – 18 Finite Automata with output- Moore and Melay Illustrate Finite Automata with output T1:2.7

machines machines. R1: 2.10

19 Regular Languages : Regular sets, regular Understand Regular languages T1:2.5

expressions, identity rules, R1: 3.2 -3.3

20 – 21 Constructing finite Automata for a given regular Illustrate Constructing Finit T1:2.5

e

expressions Automata for given RE R1: 3.4

22 Conversion of Finite Automata to Regular Illustrate Conversion of finite T1:2.5

expressions. automaton to Regular expressions R1: 3.4

23 Pumping lemma of regular sets Understand Pumping lemma T1:3.1

R1: 3.6

24 Closure properties of regular sets (proofs not Understand Closure properties T1:3.2

required). R1:3.5.2

25 Grammar Formalism : Regular grammars-right Understand Regular Grammars T1:9.1

linear and left linear grammars R1: 5.11.4

26 – 27 Equivalence between regular linear grammar and Illustrate Equivalence of regular linear T1:9.1

Finite Automata, inter conversion grammar & Finite Automata R1: 5.12 – 5.13

28 Context free grammar, derivation trees Understand Context free grammar T1:4.2

R1: 5.6 , 5.7

29 Sentential forms, Right most and leftmost Illustrate Derivation of strings T1:4.3

derivation of strings R1: 5.5

30 Context Free Grammars: Ambiguity in context Understand Ambiguity in context free T1:4.3

free grammars. grammars R1: 5.8

31 Minimization of Context Free Grammars. Understand Minimization T1:4.4

R1: 5.9

32 Chomsky normal form Understand Chomsky normal form T1:4.5

R1: 5.10.1

33 Greiback normal form Understand Greiback normal form T1:4.6

R1: 5.10.2

34 Pumping Lemma for Context Free Languages. Understand Pumping Lemma T1:6.1

R1: 5.14

35 Enumeration of properties of CFL (proofs UnderstandContext Free Language T1:6.2

omitted). properties R1: 6.8

36 -40 Push Down Automata Push down automata, Understand Push down automata T1:5.2

definition, model, acceptance of CFL. Acceptance R1: 6.2 – 6.3

by final state and acceptance by empty state and T1:5.2

its equivalence. R1: 6.5

40 – 41 Equivalence of CFL and PDA, inter conversion. Understand Equivalences T1:5.3

(Proofs not required). R1: 6.7

42 Introduction to DCFL and DPDA Illustrate DCFL,DPDA T1:10.1 – 10.2

R1: 6.6

43- 46 Turing Machine : Turing Machine, definition, Understand Turing machines T1:7.2

Model, design of TM R1: 4.2 – 4.3

T1:7.2

R1: 4.4 – 4.5

47 -49 Computable functions Illustrate Computable functions T1:7.3

R1: 4.6

50 Recursively enumerable languages. Understand Recursively enumerable T1:7.3 , 8.2

languages R1: 4.15

51 Church‟s hypothesis, counter machine Understand Cchurch‟s hypothesis T1:7.6

R1: 4.17

52 Types of Turing machines (proofs not required) IllustrateTypes of Turing machines T1:7.5

R1: 4.8 – 4.12

53 – 54 Computability Theory : Chomsky hierarchy of Understand Chomsky hierarchy T1:9.1 – 9.4

languages, Linear bounded automata and context R1: 5.11

sensitive languages T1:9.3

R1: 4.20,

5.11.2

55 – 56 LR(0) grammar, decidability of, problems Illustrate LR(0) T1:10.6

R1: 7.5.1

57 Universal Turing Machine Understand Universal Turing Machine T1:8.3

R1: 4.9

58 – 60 Undecidability of posts. Correspondence Understand PCP, P, NP, NP complete T1:8.5|

problem,Turing reducibility, Definition of P and problems R1: 4.18

NP problems,NP complete and NP hard

T1:13.1

T1:13.2

problems.

XI. MAPPING COURSE OBJECTIVES LEADING TO THE ACHIEVEMENT OF PROGRAM

OUTCOMES:

Course

Program Outcomes Program Specific

Outcomes

Objectives


I S H S

II H S

III H H S

IV S H

V S H

S - Supportive H - Highly Related

XII. MAPPING COURSE OUTCOMES LEADING TO THE ACHIEVEMENT OF PROGRAM

OUTCOMES:

Course

Program Outcomes

Program Specific

Outcomes

Outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1

PSO2

1 H S

2 H S

3 H S

4 H S

S - Supportive H - Highly Related

ASSIGNMENT

Course Name : FORMAL LANGUAGES AND AUTOMATA THEORY




Year : 2014 – 2015

Course Faculty : D SHIVA RAMA KRISHNA OBJECTIVES


In line with this, Faculty of Institute of Aeronautical Engineering, Hyderabad has taken a lead in incorporating philosophy of outcome based education in the process of problem solving and career development. So, all students of the institute should understand the depth and approach of course to be

taught through this question bank, which will enhance learner‟s learning process.

Blooms Taxonomy

Level

Course

S. No. Question Outcome

UNIT – I

1 Construct NFA for (0+1)*0(0+1)0(0+1)* and convert to DFA. Apply 2

2 Construct NFA for (0+1)*010(0+1)* and Convert to DFA. Apply 2

3 Construct NFA with Ɛ for 0*1*2* and Convert to NFA . Apply 2

4 Explain the steps for the minimization of given DFA with an example. Understand 2

5 Construct Mealy Machine for Residue Modulo of 5 for the ternary number Apply 2

system and convert to Moore Machines.

6 Define language over an alphabet with examples. Remember 2

Write a DFA to accept set of all strings ending with 010.

7 Give example for Minimize the DFA . Understand 2

8 Construct a Moore machine to accept the following language. Apply 3

L = { w |w mod 3 = 0} on ∑ = { 0,1,2}

9 Write any four differences between DFA and NFA Apply 2

10 Convert NFA with Ɛ to NFA with an example. Understand 2

UNIT – II

1

Explain Identity rules . Give an example using the identity rules for the

Remember 3

simplification

2 Construct Regular grammar for the given Finite Automata Apply 3

3

Convert given Finite Automat to Regular Expression using standard

Understand 3 method(RijK method)

4 Convert Regular Expression ab* + b to Finite Automata. Understand 3

Blooms Course

S. No.

Question Taxonomy

Outcome

Level

5 Convert given Finite Automat to Regular Expression using Arden‟s theorem. Understand 1

Use G be the grammar

S

aBbA 1

A

a aS bAA B

b bS aBB

6

For the string aaabbabbba ,

Apply

Find

a. Leftmost Derivation.

b . Rightmost Derivation.

c. Derivation Tree.

7 Convert Regular Expression (bb + a)*(aa + b)* to NFA with ε. Understand 1

8 Construct Regular Grammars for Finite Automata a*(b (a + b))* . Apply 1

Construct Finite Automata for

A0

a A1 2

9 A1

b A1 Apply

A1

a

A1

bA0.

10 Convert Regular Expression (a + b)*(aa + bb)(a + b)* to DFA. Understand 2

UNIT - III

1 Discuss the Pumping lemma for Context Free Languages concept with Understand 3

example.

2 Show that the following grammar is ambiguous with respect to the string Understand 3

aaabbabbba.

S

aB | bA

A

aS| bAA| a

B

bS | aBB | b

3 Use the following grammar : Apply 4

S

ABC | BbB,

A

aA | BaC|aaa

B

bBb| a|D

C

CA|AC

D

ε

Eliminate ε-productions.

Eliminate any unit productions in the resulting grammar.

Eliminate any useless symbols in the resulting grammar.

Convert the resulting grammar into Chomsky Normal Form (CNF).

4 Convert the following grammar to GNF Understand

A1

A2 A3

A2

A3 A1 /b 4

A3

A1 A2 /a

5 Write the procedure to convert CFG to PDA and also convert the following Apply

CFG to PDA. PDA.

S

aABB | aAA 3

A

aBB | a

B

bBB | A

C

a

6 Construct PDA for equal number of x‟s and y‟s Apply 2

7 Convert the following PDA to CFG Understand

δ(q0,0,z0)={q0,xz0) 1

δ(q0,0,x)=(q0,xx)

δ(q0,1,x)=(q1,ϵ)

δ(q1,1,x) = (q1,ϵ)

δ(q1,ϵ,x)=(q1,ϵ)

δ(q1,ϵ,z0)=(q1,)

8 Construct a PDA to accept the language L ={anb

n | n >= 1} by a final Apply 1

state. Draw the graphical representation of the PDA. Also show the

Blooms

Course

S. No.

Question Taxonomy

Outcome

Level

moves made by the PDA for the string aaabbb 2

9 Construct NPDA for L = { W WR /W ϵ ( X + Y)*} Apply 2

M =

({q1,q2},{0,1}.{R,B,G},δ,q1,R, }

10 Show that the following CFG ambiguous. Understand 2

S

iCtS | iCtSeS | a

C

b

UNIT – IV

1 Construct a Turing Machine to accept the language Apply 3

L= { wwR | w € ( 0 + 1 ) *}

2 Construct a Turing Machine that accepts the language Apply 3

L = {anb

n | n ≥1}. Give the transition diagram for the Turing

Machine obtained

3 Construct a Turing Machine which shift non block symbols 2 cells to the Apply 1

right.

4 Construct a Turing Machine that accepts the language L = {0n1

n | n ≥1}. Apply 1

Give the transition diagram for the Turing Machine obtained and also

show the moves made by the Turing machine for the string 000111.

5 Define a Turing Machine. With a neat diagram explain the working of a Turing Remember 1

Machine.

6 Define Recursive and Recursively Enumerable languages? Write the properties Remember 1

of recursive and recursively enumerable languages.

7 Construct a Turing Machine that gives two‟s compliment for the given Apply 2

binary representation.


L = {02n

1n| n ≥0}. Give the transition diagram for the Turing

Machine obtained.

9 Construct a Turing Machine that accepts the language L = {1n2

n3

n | n ≥1}. Apply 2

Give the transition diagram for the Turing Machine obtained and also

show the moves made by the Turing machine for the string 111222333.

10 Construct a Turing Machine to implement Subtraction ( m-n ). Apply 3

UNIT – V

1 Explain the concept of undecidability problems about Turing Machine Remember 3

2 Write a short notes on Context sensitive language and linear bounded Apply 2

automata

3 Explain individually classes P and NP Remember 2

4 Write a shot notes on post's correspondence problem Apply 2

5 Explain the Halting problem with an example. Write a short notes on universal Apply 1

Turing machine.

6 Construct LR(0) for Apply 1

A

aAa/B

B

b

7 Write a short notes on Chomsky hierarchy Apply 1

8 Write a note on Modified PCP and Multi stack Turing machine. Apply 2

9 Write a short notes on NP complete , NP hard problems Apply 2

10 Construct LR(0) for Apply 1

S

E

E

E*B

E

E + B


Course Name : FORMAL LANGUAGES AND AUTOMATA THEORY




Year : 2015 – 2016

Course Faculty : D SHIVA RAMA KRISHNA OBJECTIVES



Group - A (Short Answer Questions)

S. No. Questions Blooms Course

Taxonomy Outcomes

Level

UNIT - I

1. Explain transition diagram, transition table with example. Understand 1

2. Define transition function of DFA. Remember 2

3. Define ε –transitions. Remember 2

4. Construct a DFA to accept even number of 0‟s. Apply 2

5. Define Kleene closure. Remember 1

6. Construct a DFA to accept empty language. Apply 2

7. Explain power of an alphabet (∑*)? Understand 1

8. Write transition diagram for DFA accepting string ending with 00. Apply 2

9. Write transition diagram for DFA to accept exactly one a. Apply 2

10. Define the language of NFA. Remember 2

11. Explain the different Operations on the languages. Understand

12. Construct a finite automaton accepting all strings over {0, 1}

Apply 2

having

even number of 0‟s

13. Define Moore Machines. Remember 3

14. Define Mealy Machines. Remember 3

15. Write DFA for odd number of 1‟s. Apply 2

16. Write NFA for (0+1)*101(0+1)*. Apply 2

17. Write DFA for (0+1)*10(0+1)*. Apply 2

18. Define ɛ - closure. Remember 2

19. Write NFA for (0+1)*001(0+1)*. Apply 2

20. Write DFA for (0+1)*00(0+1)*. Apply 2

UNIT – II

1. Define Regular Languages. Remember 1

2. Define Pumping Lemma for Regular Languages. Remember 1

3. Write the applications of pumping lemma for regular languages. Apply 1

4. List any two applications of regular expression. Remember 1

5. Define Context Free Grammars. Remember 1

6. Define Left linear derivation. Remember 1

7. Write regular expression for denoting language containing empty Apply 1

string.

8. Differentiate left linear and right linear derivations. Understand 2

9. Write the Context free grammar for palindrome. Remember 2

10. Define right linear grammars. Remember 2

11. Define Regular grammars. Remember 2

12. Write regular expressions for the Set of strings over {0, 1} whose Apply 2

last two symbols are the same.

13. Define right linear derivation. Remember 3

14. Define left linear grammars. Remember 3

15. Write the regular language generated by regular expression Apply 3

(0+1)*001(0+1)*.

16. Write the Regular Expression for the set of binary strings. Apply 3

17. Write the derivation of the string aaaa from CFG – Apply 4

S

a S/A A

a

18. Write the derivation of the string 110 from CFG – Apply 1

S

A0/B A

0/12/B B

A/11

19. Write the Regular Expression to generate atleast one b over Apply 1

Σ ={a,b}

20. Write the Context free grammar for equal number of a‟s and b‟s. Apply 1

UNIT – III

1. Define Greibach normal form. Remember 1

2. Define nullable Variable. Remember 1

3. Write the minimized CFG for the following grammar Remember 2

S

ABCa | bD

A

BC |b

B

b | ε

C

Đ | ε

D

d

4. Convert the grammar to CNF - S

bA/aB A

aS/a B

bS/b. Understand 2

5. Explain the elimination of UNIT production. Understand 3

6. Explain the elimination of useless symbols in productions. Understand 4

7. Define CNF. Remember 3

8. Write the minimization of CFG – S

a S/A A

a B

aa Understand 3

9. Define the ambiguity in CFG. Remember 3

10. What is the use of CNF and GNF. 3

11. Write the minimization of CFG - S

aS1b S1

aS1b/ɛ. Understand 3


A A

aA/ ɛ. Understand 3


AB / a A

a. Understand 3


aS/A/C A

a B

aa Understand 3

C

aCb.


AbA A

Aa/ ɛ. Understand 3


aSa S

bSb S

a/b/ ɛ. Understand 3


A0/B A

0/12/B Understand 3

B

A/11.


aSa/aa S

bSb/bb S

a/b. Understand 2


aAbB A

aA/a B

bB/a. Understand 2

20. Define PDA. Remember 2

21. Define NPDA. Remember 2

22. Differentiate between deterministic and nondeterministic PDA. Understand 2

23. Define the language of DPDA. Remember 2

24. List the steps to convert CFG to PDA. Remember 2

25. Explain – acceptance of PDF by final state. Understand 2

26. Explain – acceptance of PDF by empty stack. Understand 2

27. Convert the following PDA to CFG Apply 2

δ(q0,b,z0)={q0,zz0)


δ(q0, b, z)=(q0,zz)


δ(q0, ϵ ,z0)=(q0,ϵ)


δ(q0,a,z) = (q1,z)


δ(q1,b,z)=(q1,ϵ)


δ(q1,a,z0)=(q0,z0)


δ(q0,0,z0)={q0,xz0)


δ(q0,0,x)=(q0,xx)


δ(q0,1,x)=(q1,ϵ)


δ(q1,1,x) = (q1,ϵ)


δ(q1,ϵ,x)=(q1,ϵ)


δ(q1,ϵ,z0)=(q1,ϵ)


δ(q1,ϵ,z)=(q0,ϵ)

40. Convert the following CFG to PDA Apply 1

S

ABC | BbB


A

aA | BaC|aaa


B

bBb| a|D


C

CA|AC


S

a S/A

UNIT - IV

1. Define Turing Machine Apply 2

2. Explain the moves in Turing Machine. Understand 2

3. Define an ID of a Turing Machine. Remember 2

4. Define the Language of Turing Machine. Remember 3

5. List types of TM. Remember 3

6. Define Computable Functions by Turing Machines . Remember 3

7. Write the difference between Pushdown Automata and Turing Apply 4

Machine.

8. Explain Church‟s Hypothesis. Understand 1

9. Define Context sensitive language. Remember 1

10. Define multi head Turing Machine. Remember 1

11. Define multi dimensional Turing Machine. Remember 2

12. Define multiple tapes Turing Machine. Remember 2

13. Define Recursive languages. Remember 3

14. Define Recursively enumerable languages. Remember 3

15. Define Two way infinite Turing Machine. Remember 4

16. Define Non deterministic Turing Machine. Remember 4

17. Define Counter machine . Remember 1

18. Construct Turing Machine for (0+1)*. Remember 2

19. Construct Turing Machine for 1‟s complement for binary numbers. Remember 4

20. Differentiate Recursive languages and Recursively enumberable Remember 2

languages.

UNIT - V

1. Define Chomsky hierarchy of languages. Remember 3

2. Define Universal Turing Machine Remember 3

3. Define MPCP. Remember 3

4. Define decidability. Remember 1

5. Define P problems. Remember 1

6. Define Universal Turing Machines Remember 4

7. Give examples for Undecidable Problems Understand 4

8. Define Turing Machine halting problem. Remember 4

9. Define Turing Reducibility Remember 4

10. Define PCP. Remember 4

11. Define Type 0 grammars . Remember 3




15. Define NP problems. Remember 2

16. Define NP complete problems Remember 2

17. Define NP Hard problems Remember 2

18. Define undecidability. Remember 1

19. Define Reducibility. Remember 2

20. List the types of grammars. Remember 4

2. Group - II (Long Answer Questions)


Taxonomy Outcomes

Level

10 Marks Questions

UNIT - I

1. Construct a DFA to accept set of all strings ending with 010. Apply 2

Define language over an alphabet and write for the above DFA .

2. Construct a Moore machine to accept the following language. Apply 3

L = { w |w mod 3 = 0} on ∑ = { 0,1,2}

3. Write any four differences between DFA and NFA Apply 2

4. Write NFA with Ɛ to NFA conversion with an example. Understand 2

5. Construct NFA for (0 + 1)*(00 + 11)(0 + 1)* and Convert to DFA. Apply 2

6. Construct NFA for (0 +1)*(00 + 11)(0 + 1)* and Draw the transition Apply 2

table and transition diagram and example strings.

7. Construct Mealy machine for (0 + 1)*(00 + 11) and convert to Moore Apply 3

machine.

8. Convert NFA with Ɛ – a*b* to NFA. Understand 2

9. Construct NFA for (0 + 1)*101 and Convert to DFA. Apply 2

10. Convert Moore machine to Mealy machine with an example. Understand 3

11. Construct a DFA, the language recognized by the Automaton being L Apply 2

{anb/n 0}. Draw the transition table.

12. Construct the DFA that accepts/recognizes the language L(M) = {w | Apply 2

w{a, b, c}* and w contains the pattern abac }. Draw the transition

table.

13. Differentiate between DFA and NFA with an example. Understand 2

14. Construct a finite automaton accepting all strings over {0, 1} having Apply 2

even number of 0‟s and even number of 1‟s.

15. Construct a Moore Machine to determine the residue mod 5 for each Apply 3

binary string treated as integer. Sketch the transition table.

16. Convert Mealy machine for (0 + 1)*(00 + 11) to Moore machine. Understand 3

UNIT - II

1. Convert Regular Expression 01* + 1 to Finite Automata. Understand 1

3. Construct Right linear , Left linear Regular Grammars for 01*+1. Apply 2

4. Explain Identity rules . Simplify the Regular Expression - Understand 1

Є + 1*(011)*(1*(011)*)*

5. Construct Regular grammar for the given Finite Automata. Apply 3

(a+b)*ab*.

6. Construct Leftmost Derivation. , Rightmost Derivation, Apply

Derivation Tree for the following grammar 4

SaBbA

Aa aS bAA

Bb bS aBB

For the string aaabbabbba .

7. Explain the properties, applications of Context Free Languages Understand 1

8. Construct right linear and left linear grammars for given Regular Apply 1

Expression.

9. Construct a Transition System M accepting L(G) for a given Regular Apply 1

Grammar G.

10. Discuss the properties of Context free Language. Explain the pumping Understand 2

lemma with an example.

12. Construct a NFA with Є equivalent to the regular expression 10 + (0 + Apply 2

11)0*1

13. Construct Leftmost Derivation. , Rightmost Derivation, Apply

Derivation Tree for the following grammar G = (V, T, P, S) with 2

N = {E}, S = E, T = {id, +, *, (,)}

E

E+E

E

E*E

E

(E)

E

id

Obtain id+id*id in right most derivation, left most derivation

14. Write a CFG that generates equal number of a‟s and b‟s. Apply 2

15. Convert G = ( {S},{a},{ S

aS /a},{S} ) into FA Understand 3

16. Construct a Regular expression for the set all strings of 0‟s and 1‟s Apply 1

with at least two consecutive 0‟s

17. Construct context free grammar which generates palindrome strings Apply 1

∑={a,b}

18. Construct equivalent NFA with є for the given regular expression Apply 2

0*(1(0+1))*.

20. Write 12 identity rules for regular expressions Apply 2

UNIT – III

1. Write a short notes on Chomsky Normal Form and Griebach Normal Apply 1

Form.

2. Show that the following grammar is ambiguous with respect to the Understand 1

string aaabbabbba.

S

aB | bA

A

aS| bAA| a

B

bS | aBB | b

3. Use the following grammar : Apply 1

S

ABC | BbB

A

aA | BaC|aaa

B

bBb| a|D

C

CA|AC

D

ε

Eliminate ε-productions.

Eliminate any unit productions in the resulting grammar.

Eliminate any useless symbols in the resulting grammar.

Convert the resulting grammar into Chomsky Normal Form

4. Illustrate the construction of Griebach normal form with an example. Apply 1

5. Show that the following CFG ambiguous. Apply 1

S

iCtS | iCtSeS | a

C

b

6. Discuss the Pumping lemma for Context Free Languages concept with Understand 1

example {anb

nc

n where n>0}

7. Write the simplified CFG productions in S

a S1b Apply 1

S1

a S1b/ Є

8. Convert the following CFG into GNF. Understand 1

S

AA/a A

SS/b

9. Explain unit production? Explain the procedure to eliminate unit Understand 2

production.

10. Explain the procedure to eliminate ϵ-productions in grammar. Understand 2

11. Convert the following grammar into GNF Understand 2

G=({A1,A2,A3},{a,b},P,A)

A1->A2A3

A2->A3A1/b

A3->A1A2/a

12. Write simplified CFG productions from the following grammar Apply 2

A->aBb/bBa

B->aB/bB/ϵ

13. Convert the following grammar into GNF Understand 2

S->ABA/AB/BA/AA/B

A->aA/a

B->bB/b

14. Convert the following grammar into CNF Understand 1

S->aAbB

A->aA/a

B->bB/b

15. Write the GNF equivalent to the following grammar Apply 2

S->XA/BB

B->b/SB

X->b

A->a

16. State the following grammar is ambiguous. Remember 1

S-> AB|aaB

A->a / Aa

B->b

17. Construct NPDA for L = { W WR /W ϵ ( 0 + 1)*} Apply 1

M = ({q1,q2},{0,1}.{R,B,G},δ,q1,R,ϕ}

18. Write the procedure to convert from the given PDA to a CFG. Convert Apply 1

the following example.

δ(q0,b,z0)={q0,zz0)

δ(q0, b, z)=(q0,zz)

δ(q0, ϵ ,z0)=(q0,ϵ)

δ(q0,a,z) = (q1,z)

δ(q1,b,z)=(q1,ϵ)

δ(q1,a,z0)=(q0,z0)

19. Write the procedure to convert CFG to PDA and also convert the Apply 3

following CFG to PDA.

S

B| aAA

A

aBB | a

B

bBB|A

C

a

20. Construct a PDA to accept the language L ={ anb

n | n >= 1} Apply 3

by a final state. Draw the graphical representation of the PDA.

Also show the moves made by the PDA for the string aaabbb

UNIT – IV

1. Define a Turing Machine. With a neat diagram explain the working of Remember 4

a Turing Machine.

2. Construct a Transition table for Turing Machine which shift non Apply 4

block symbols 3 cells to the right.

3. Construct a Transition diagram for Turing Machine to accept the Apply 4

following language. L = { 0n1

n0

n | n ≥1}

4. Construct Transition diagram for Turing Machine that accepts the Apply 4

language L = {0n1

n | n ≥1}. Give the transition diagram for the

Turing Machine obtained and also show the moves made by the

Turing machine for the string 000111.


language L= { w#wR | w ϵ ( a + b ) *}

6. Write short notes on Recursive and Recursively Enumerable Apply 2

languages.

7. Write the properties of recursive and recursively enumerable Apply 2

languages.

8. Construct a Turing Machine to accept strings formed with 0 Apply 2

and 1 and having substring 000.

9. Construct a Turing Machine that accepts the language Apply 1

L = {1n2

n3

n | n ≥1}. Give the transition diagram for the Turing

Machine obtained and also show the moves made by the Turing

machine for the string 111222333.

10. Construct a Transition Table for Turing Machine to implement Apply 1

Subtraction ( m-n ).

11. Design Turing machine to increment the value of any binary number Create 1

by 1.The output should also be a binary number with value one more

the number given.


Taxonomy Outcomes

Level

12. Construct Transition diagram for TM - L={anb

nc

n/n>=1} Apply 2

13. Construct a Transition diagram for Turing Machine to implement Apply 2

Subtraction ( m-n ).

14. Construct a Transition table for Turing Machine to accept the Apply 2

language L= { w#wR | w ϵ ( a + b ) *}

15. Construct a Transition diagram for Turing Machine which shift non Apply 2

block symbols 3 cells to the right.

16. Construct Transition table for Turing Machine that accepts the Apply 3

language L =

{0n1

n | n ≥1}. Give the transition diagram for the

Turing Machine obtained and also show the moves made by the

Turin

g machine for the string 000111.


following language. L = { 0n1

n0

n | n ≥1}


language L= { wwR | w ϵ ( a + b ) *}

19. Construct Transition table for TM - L={anb

nc

n/n>=1} Apply 4


language L= { wwR | w ϵ ( a + b ) *}

UNIT – V

1. Explain the concept of undecidability problems about Turing Understand 3

Machines.

2. Write a note on Modified PCP and Multi tape Turing machine. Apply 3

3. Explain individually classes P and NP Understand 2

4. Write a shot notes on post's correspondence problem Apply 2

and check the following is PCP or not.

I A B

1 11 111

2 100 001

3 111 11

5. Explain the Halting problem and Turing Reducibility. Understand 2

6. Write a short notes on universal Turing machine. Apply 3

7. Write a short notes on Chomsky hierarchy. Apply 2

8. Write a short notes on Context sensitive language and linear bounded Apply 3

automata.

9. Write a short note on NP complete Apply 4

10. Write a short note on NP hard problems. Apply 4



I A B

1 100 1

2 0 100

3 1 0



I A B

1 00 0

2 001 11

3 1000 011

3. Group - III (Analytical Questions)

S. Questions Blooms Course

No. Taxonomy Outcom

es

Level

PROBLEM SOLVING/ANALYTICAL/CRITICAL THINKING QUESTIONS

UNIT - I

1 Construct NFA for (0 + 1)*0(0 + 1)0(0 + 1)* and convert to DFA. Apply 2

2 Construct NFA for (0 + 1)*010(0 + 1)* and Convert to DFA. Apply 2

3 Construct NFA with Ɛ for 0*1*12* and Convert to NFA . Apply 2

4 Construct Mealy Machine for Residue Modulo of 5 for the ternary number Apply 2

system and convert to Moore Machines.

5

Write the DFA that will accept those words from {a, b} where the

number Apply 2

of a‟s is divisible by two and the number of b‟s is divisible by three. Sketch the

transition table of the finite Automaton M .

6 Construct DFA for the given NFA as shown in fig. below Apply 2

UNIT - II

1 Convert Regular Expression (11 + 0)*(00 + 1)* to NFA with Ɛ. Underst 1

and

2 Convert Regular Expression (a + b)*(aa + bb)(a + b)* to DFA. Underst 1

and

3 Construct Regular Grammars for Finite Automata 0*(1(0 + 1))* . Apply 1

4 Construct Finite Automata for Apply 2

A0

a A1

A1

b A1

A1

a

A1

bA0

UNIT - III

1 Construct PDA for equal number of x‟s and y‟s Apply 3

2 Convert the following grammar into GNF Understand 4

A1

A2 A3

A2

A3 A1 /b

A3

A1 A2 /a

3 Convert the following PDA to CFG Undersandt 1

δ(q0,0,z0)={q0,xz0)

δ(q0,0,x)=(q0,xx)

δ(q0,1,x)=(q1,ϵ)

δ(q1,1,x) = (q1,ϵ)

δ(q1,ϵ,x)=(q1,ϵ)

δ(q1,ϵ,z0)=(q1,ϵ)

4 Write the PDA with only one state that accepts the language{amb

n:n>m} Apply 1

5 Design a PDA for the following grammar Create 1

S->0A

A->0AB/1

B->1

6 Convert the following PDA to CFG Understand 2

M=({q0,q1},{a,b},{z0,za},μ,q0,z0,Ф)

δ is given by,

δ(q0,a,z0)=(q0,zz)

δ(q0,a,z)=(q0,zz0)

δ(q0,b,z)=(q1,ϵ)

δ(q1,b,z)=(q1,ϵ)

δ(q1,ϵ,z0)=(q1,ϵ)

UNIT - IV


L = {a2n

bn| n ≥0}. Give the transition diagram for the Turing Machine

obtained.

2 Construct a Turing Machine that gives two‟s compliment for the given Apply 2

binary representation.

3 Construct a Turing Machine to accept the following language. Apply 3

L = { wnx

ny

nz

n | n ≥1}

4 Construct a Turing Machine which shift non block symbols 2 cells to the right. Apply 3

UNIT - V

1 Explain PCP and MPCP with examples. Understand 4

2 Explain Turing theorem ,Halting problems, Turing Reducibility. Understand 4

3 Explain Type 3 and Type 2 grammars with example. Apply 4

4 Explain Type 1 and Type 0 grammars with example. Apply 4

COMPUTER SCIENCE AND ENGINEERING COURSE

DESCRIPTION FORM

Course Title COMPUTER ORGANIZATION

Course Code A40506

Regulation R13-JNTUH

Course Structure Lectures Tutorials Practical Credits

4 1 - 4

Course Coordinator SIVA RAMA PRASAD

I. COURSE OVERVIEW:

This course introduces the principles of computer organization and the basic architecture concepts. The

course emphasizes performance and cost analysis, instruction set design, pipelining, memory technology,

memory hierarchy, virtual memory management, and I/O systems. It also deals with fundamentals of

microprocessor, Assembly language programs. The main objective of this course is to examine how a

computer operates at the machine level. It provides essential knowledge that are needed from engineering

professionals to measure a simple PC performance. This course is presented to students by power point

projections, lecture notes, course handouts, Assignments, Objective and subjective tests.

II. PREREQUISITES:

Level Credits Periods/Weeks Prerequisites

UG 4 4 Basic Mathematics, Digital logic design, Basic concepts of Micro processor

III. COURSE ASSESSMENT METHODS:

a) Marks Distribution

Session Marks(25M) University End

Exam Marks

Total

Marks

There shall be 2 midterm examinations. Each midterm examination consists of

subjective type and objective type tests.

The subjective test is for 10 marks, with duration of 1 hour.

Subjective test of each semester shall contain 4 questions; the student has to

answer 2 questions, each carrying 5 marks.

The objective type test is for 10 marks with duration of 20 minutes. It consists of

10 multiple choice and 10 objective type questions, the student has to answer all




portion. Five marks are earmarked for assignments. There shall be two

assignments in every theory course. Marks shall be awarded considering the

average of two assignments in each course.

75

100



1 I Mid Examination 90 minutes 20

2 I Assignment - 05

3 II Mid Examination 90 minutes 20

4 II Assignment - 05

5 External Examination 3 hours 75

V. COURSE OBJECTIVES:

i. Identify the basic components of computers.

ii. Describe the factors involved in Instruction set architecture design.

iii. Discuss the Input-Output organization in depth.

iv. Explore the memory Organization Techniques.

v. Discuss pin description of 8086 microprocessor.

vi. Illustrate general instruction formats and addressing modes of 8086 microprocessor.

VI. COURSE OUTCOME:

1. The students will be able to understand basic components of computers.

2. The students will be able to understand the I/O organizations in depth.

3. The students will be able to understand the memory organization.

4. To understand the basic chip design and organization of 8086 with assmbly language programming.

VII. HOW PROGRAM OUTCOMES ARE ASSESSED:

Program Outcomes Level Proficiency

assessed by

PO1

An ability to apply knowledge of Science, Mathematics,

Engineering & Computing fundamentals for the solutions of

Complex Engineering problems.

H

Assignments,

Tutorials

PO2

An ability to Identify, formulate, research literature and analyze

complex engineering problems using first principles of

mathematics and engineering sciences.

H

Assignments

PO3

An ability to design solutions to complex process or program to

meet desired needs.

S

Mini Projects

PO4

Ability to use research-based knowledge and research methods

including design of experiments to provide valid conclusions

S

Projects

PO5

An ability to use appropriate techniques, skills and tools

necessary for computing practice

S

Mini Projects

PO6

Ability to apply reasoning informed by the contextual knowledge

to assess social issues, consequences & responsibilities relevant

to the professional engineering practice

N

--

PO7

Ability to understand the impact of engineering solutions in a

global, economic, environmental, and societal context with

sustainability

N

--

PO8 An understanding of professional, ethical, Social issues and

responsibilities N --

PO9 An ability to function as an individual, and as a member or

leader in diverse teams and in multidisciplinary settings.

N

--

PO10

An ability to communicate effectively on complex engineering

activities within the engineering community.

N

--

PO11 Ability to demonstrate and understanding of the engineering and

management principles as a member and leader in a team

N

--

PO12 Ability to engage in independent and lifelong learning in the

context of technological change.

S

Projects



assessed by

PSO1 Applications of Computing: Ability to use knowledge in

various domains to provide solution to new ideas and

innovations.

H

Lectures,

Assignments

PSO2 Programming Skills: Identify required data structures, design

suitable algorithms, develop and maintain software for real

world problems.

H

Projects

N - None S - Supportive H - Highly Related

IX. SYLLABUS:

UNIT-I

Basic computer organization-Functions of CPU, I/O Units, Memory, Instruction: Instruction

Formats-one address, two address, Zero address and three addresses and comparison;

addressing modes with numeric examples: program control-Status bit conditions,

conditional branch instructions, Program interrupts: Types of Interrupts.

UNIT-II

Input-Output organizations- I/O Interface, I/O Bus and Interface modules: I/O Vs memory

Bus , Isolated Vs Memory-Mapped I/O, Asynchronous data Transfer –strobe control ,Hand Shaking

: Asynchronous Serial transfer-Asynchronous Communication interface , Modes of transfer

Programmed I/O, Interrupt Initiated I/O,DMA; DMA controller, DMA Transfer, IOP-CPU-IOP

Communication ,Intel 8089 IOP.

UNIT-III

Memory Organizations Memory hierarchy ,Main Memory, RAM ,ROM Chips , Memory Address

map, Memory Connection to CPU, associate memory ,cache Memory, Data cache ,Instruction

cache, Miss and Hit ratio, Access time, associative ,set associative ,mapping, waiting into cache,

Introduction to virtual memory

UNIT-IV

8086 CPU Pin Diagram – Special functions of general purpose registers, Segment register, Concept of

pipelining, 8086 Flag register, Addressing modes of 8086.

UNIT-V

8086-instruction formats:

Assembly language programs involving branch & call instructions, sorting, evolving of arithmetic

expressions.

TEXT BOOKS:

1. Morris Mano ,” Computer system architecture:”, Universities Press, 5e, 1992

2. Hall/A K Ray, “Advanced Micro Processor and Peripherals”, PHI Learning

REFERENCES

1. William Stallings ,”Computer organization and architecture –sixth Edition”, Pearson/PHI.

2. Andrew S.Tanenbaum,: Structured Computer Organization “, 4th Edition PHI/Pearson.

3. Sivaraama Dandamudi ,”Fundamentals or Computer Organization and Design”, Springer Int.Edition.

4. john L.Hennessy and David A.Patterson ,”Computer Architecture a quantitative approach”, ,Fourth

Edition Elsevier.

5. Carl Hamacher, “Computer organization”, fifth Edition,Mc Graw Hill

X. COURSE PLAN:

At the end of the course, the students are able to achieve the following Course Learning Outcomes.

Lecture

No. Course Learning Outcomes Topics to be covered Reference

1-4 Identify different types of instructions

and calculate their impact on

performance of computer.

Instruction Formats, Comparison,

Conditional Branch instructions

T1:8-4

5-6 Understand program control

instructions using status bit conditions

program control- status bit

conditions

T1:8-7

7-8 Understand different types of

addressing modes used in an

instruction.

Addressing Modes with numerical

Examples

T1:8-5

9-12 Ability to understand interrupts and

their impact on system performance.

Program Interrupts, Types of

Interrupts

T1:8-7

13 Identify different ways of

communicating with I/O devices and

compare standard input-output

interfaces.

I/O vs. memory Bus, Isolated vs.

memory-mapped I/O

T1:11-2

14-20 Understand the concept of

Asynchronous Transfers and modes of

transfer.

Asynchronous Data Transfer,

Asynchronous Serial transfer, Modes

of Transfer

T1:11-3

21-23 Describe Speed of transfer using Direct

Memory Access technique.

DMA T1:11-6,R1:6-4

24-26 Identify Processor with Direct memory

access capability and define

Communication between CPU and IOP

Input-Output Processor(IOP),CPU-

IOP, Intel 8089 IOP

T1:11-7,R1:6-9

27 Understand Asynchronous

communication interface as both

transmitter and receiver

Asynchronous Communication

interface

T1:11-3

28-35 Understand the memory hierarchy and

the function of RAM and ROM chips

along with Connection between CPU

and Memory

Memory Hierarchy, Main Memory,

RAM and ROM Chips, Memory

connection to CPU

T1:12-2

36-38 Explain Page table by means of

Associative memory

Associative Memory T1:12-4,R5:5.5

39-43 Define Cache memory and identify

methods for specifying where memory

blocks are placed in cache.

Cache Memory, Data Cache,

Instruction Cache, Miss and Hit

ratio, Access time

T1: 12-5, R5:5.5

Lecture

No. Course Learning Outcomes Topics to be covered Reference

44-47 Know the concept of virtual memory

that involves defining address space .

Virtual memory, Memory Address

map

T1:12-6, R5:5.7

48-53 Learn the configuration of pin diagram

and Determine register organization

with flag performance.

8086 CPU Pin Diagram, General

purpose registers, Segment register,

Flag register

T2:

T1(1.1,1.2,1.3,1.4)

54-57 Understand the performance

improvement using pipelining

Concept of Pipelining T2:(4.1,4.2)

58-60 Learn the specifications of Addressing

modes

Addressing Modes of 8086 T2:(2.2)

61-62 Describe different instruction formats 8086 Instruction formats T2:(2.1,2.3)

63-64 Understand Assembly language

programming and various types of

instructions provided by 8086

Assembly Language programs

involving Branch and call

instructions

T2:(3.1,3.2)

65 Identify operations on arithmetic and

sorting techniques.

Sorting, evaluation of arithmetic

Expressions

T2(3.3,3.4)

XI. MAPPING COURSE OBJECTIVES LEADING TO THE ACHIEVEMENT OF

PROGRAM OUTCOMES:

Course

Objectives


Outcomes


I H H H H S

II S H H

III H S S

IV H S

V S

VI H H S

S= Supportive H = Highly Related

XII. MAPPING COURSE OUTCOMES LEADING TO THE ACHIEVEMENT OF

PROGRAM OUTCOMES AND PROGRAM SPECIFIC OTCOMES:

Course

Outcomes


Outcomes


1 H S S H H

2 H S

3 H S

4 S H



Course Name : Computer Organization




Year : 2014 – 2015

Course Faculty : K SIVA RAMA PRASAD

OBJECTIVES



philosophy of outcome based education in the process of problem solving and career development. So, all students

of the institute should understand the depth and approach of course to be taught through this question bank, which

will enhance learner‟s learning process.

Group - A (Short Answer Questions)

Blooms Course

S. No Questions Taxonomy

Outcome

Level

2 MARKS QUESTIONS

UNIT – I

1 Explain the role of program counter in addressing modes? Understand 1

2 Discuss the different types of addressing modes? Understand 1

3 Define condition codes? Can a processor be designed without any condition Knowledge 1

codes?

4 Explain the four basic types of operations that need to be supported by an Understand 1

instruction set?

5 Describe the Auxiliary carry flag usage? Understand 1

6 Define conditional code/ status registers in computer organization? Knowledge 1

7 Explain load and store architecture in microprocessor? Understand 1

8 Discuss data structures that can be best supported using (a) indirect addressing Understand 1

mode (b) indexed addressing mode?

9 Discuss in detail instruction formats with various examples? Knowledge 1

10 Explain the functional units of a general computer? Understand 1

11 List out the instruction formats for Motorola 68000? Knowledge 1

12 List out the different computer instruction formats? Knowledge 1

13 Explain different types of addressing modes in branch instructions? Understand 1

14 Explain briefly the operation of „load‟ in Pentium microprocessor? Understand 1

15 Discuss the usage of MAR and MDR in computer organization? Knowledge 1

16 Discuss about micro instruction sequence in fetch instruction cycle? Understand 1

17 Explain Little endian and big endian scheme of instructions. Understand 1

18 Define conditional branch in computer organization? Knowledge 1

19 Differentiate different architectures in computer organizations? Knowledge 1

20 Differentiate hardwired control unit and micro programmed control unit with an Knowledge 1

example?

UNIT - II

1 Distinguish between memory mapped I/O and I/O mapped I/O? Apply 1

2 Distinguish between a synchronous and an asynchronous data transfer Apply 1

mechanisms?

3 Explain a procedure to handle an interrupt? Understand 1

4 Differentiate synchronous and asynchronous communication? Understand 1

5 Discuss how DMA have priority over the CPU while memory transfer in CPU? Understand 1

6 Discuss memory mapped I/O in computer organization? Understand 1

7 Explain different hazards in pipeline concept while an instruction is transferd? Understand 1

8 Define different factors considered while designing an I/O subsystem? Knowledge 1

9 List the different methods used for handling the situation when multiple Knowledge 1

Interrupts occur?

10 Discuss the need of interrupt controller while instructions are executed? Understand 1

11 Explain DMA operation? State its advantages? Understand 1

12 List out the major functions of I/O system? Knowledge 1

13 Define a port? Explain various types of ports available? Knowledge 1

14 Explain the performance consideration in pipeline format? Knowledge 1

15 Define intra segment and inter segment program control transfer in computer Knowledge 2

organization? (near and far pointer concept)

16 Explain the program-controlled I/O with an example? Understand 2

17 Discuss interrupt masks provided in any processor? Understand 2

18 Define the necessity and advantage of multiplexing the address and data bus? Knowledge 2

19 Discuss the necessity of an interface in memory organization? Understand 2

20 Define modes of data transfer in memory organization? Knowledge 2

21 Define synchronous bus with read and write cycles? Knowledge 2

22 Define asynchronous bus with read and write cycles? Knowledge 2

23 Explain a privileged instruction set in memory? Understand 2

24 Discuss the usage of an I/O controller. In memory organization? Understand 2

25 Explain strobe control in asynchronous data transfer along with hand shaking Understand 2

problem?

UNIT - III

1 Distinguish between the write-through and write-back policies pointing out their Apply 2

Merits and demerits?

2 Define the virtual memory organization and explain briefly? Knowledge 2

3 Explain cache memory to reduce the execution time? Understand 2

4 Define CPU registers, Main memory, Secondary memory and cache memory? Knowledge 2

5 List the various types of semiconductor RAMs? Knowledge 2

6 Define Random Access Memory and types of RAMs present? Knowledge 2

7 Explain the necessary for memory hierarchy? Understand 2

8 Define HIT and MISS ratio in memory with an example? Knowledge 2

9 Differentiate SRAM and DRAM? Understand 3

10 List out two kinds of address locality of reference in cache memory? Knowledge 3

Blooms Course


Outcome

Level

11 List out the two parameters for performance of a computer system? Knowledge 2

12 State the differences between static and dynamic memories? Knowledge 2

13 Define virtual or logical address? Knowledge 2

14 Define cache memory? Explain how it is used to reduce the execution time? Knowledge 2

15 Explain the mapping procedures adopted in the organization of a Cache Understand 2

Memory?

16 Discuss the function of a TLB? (Translation Look-aside Buffer) Understand 2

17 Differentiate volatile and non volatile memory organization? Knowledge 2

18 Discuss the multilevel hierarchy of storage devices? Understand 2

19 Explain memory management unit (MMU)? Understand 2

20 Discuss the enhancements used in the memory management? Understand 2

21 List the factors that determine the storage device performance? Knowledge 2

22 Define locality of reference? What are its types of locality of reference? Knowledge 2

23 Explain basic concept of virtual memory technique? Understand 2

24 Define Memory Access Time? Knowledge 2

UNIT - IV

1 List out the major features of 8086 Microprocessors? Knowledge 3

2 Discuss the significance of flags in flag register in 8086? Understand 3

3 Explain how physical address is generated in 8086? Understand 3

4 Explain the advantage of using memory segmentation? Understand 3

5 Discuss how queue, speed up processing? Understand 3

6 Explain about index registers? Understand 3

7 Classify the usage of SI and DI registers? Apply 3

8 Describe the functions of BIU? Understand 3

9 Explain about timing and control unit in 8086? Understand 3

10 List out the sequence of signals that occurs on address bus and data bus when Knowledge 3

microprocessor fetches an instruction?

11 Explain why 8086 internal architecture is divided into BIU and EU? Discuss the

Understand 3

A-bus, B-bus and C- bus and their use?

12 List the internal registers in 8086 Microprocessor? Knowledge 3

13 Explain the advantages of pipelining? Understand 3

14 Calculate physical address using base and offset addresses in 8086? Understand 3

15 Discuss the function of S3 and S4 Status signal of 8080 microprocessor? Understand 3

16 Explain the roles of pins TEST, LOCK. With examples? Understand 3

17 Describe how do you configure 8086 into minimum and maximum modes? Understand 3

18 Illustrate the function of the BHE and ALE signals in 8086? Apply 3

19 Explain which are the pins of 8086 that are to be connected to 8087 and explain Understand 3

their functions?

20 Define microprocessors and evolution of microprocessors? Understand 3

21 Classify the functions of bus interface unit (BIU) in 8086? Apply 3

22 Analyze the significance of LOCK signal in 8086? Apply 3

23 Define pipelining concept and explain its working? Understand 3

24 Explain the function of a segment register in 8086? Understand 3

25 Classify various operating modes does 8086 with examples? Apply 3

26 Differentiate the relation between 8086 processor frequency & crystal Apply 3

frequency?

27 Explain the purpose of MN/MX pin? Explain. Understand 3

28 Explain how many 16 bit registers are available in 8086? Understand 3

UNIT - V

1 Define relative memory addressing with an example? Understand 1

2 Explain the use of push and pop instruction in 8086 ? Understand 2

3 Discuss the function of stack pointer? Understand 4

4 Distinguish between inter segment and intra segment jump instructions in 8086? Apply 4

5 Differentiate between near CALL and far CALL instructions? Apply 4

6 Explain about DOS function call? Apply 4

7 State the difference between machine language and assembly language? Apply 4

8 Define macro and procedure? Discuss the advantages of macro? Understand 4

9 Explain the function of XLAT and CWD instructions in 8086? Understand 4

10 Explain the two techniques to convert binary data to ASCII ? Understand 4

11 Explain DAA, DAS instructions with examples? Understand 4

12 Explain the instructions related to arithmetic and logical shift?. Understand 3

13 Describe how REP instruction is used along with string instructions? Understand 2

14 Discuss about cross-compiler? Understand 2

15 Differentiate ENDS and ENDP directives? Apply 3

16 Explain the operation performed by the 8086 when it executes the XLAT Apply 3

instruction. What is the use of XLAT?

17 Explain the function of the assembler directives BYTE PTR and WORD PTR. Apply 4

18 Define non-Mask able interrupts? Understand 4

19 Differentiate between RET and IRET instruction? Apply 4

20 Explain IN and OUT instructions? Understand 4

21 Explain ALIGN & ASSUME? Understand 2

22 Explain PTR & GROUP? Understand 2

23 Discuss how do you set and clear direction flag? Understand 2

24 Explain how to set and clear trap flag? Understand 3

25 Explain a program to check a number is odd or even number? Knowledge 3

Group - II (Long Answer Questions)

Blooms

Course


Outcome

Level

UNIT – I

1 Define an instruction format? Explain different types of instruction formats in Knowledge 2

detail.

2 Explain different types of addressing modes with Suitable examples? Understand 2

3 Define an interrupt? Explain Types of interrupts? Knowledge 2

4 Illustrate one-address and zero-address instruction formats, With Examples? Apply 2

5 Explain i) Implied mode ii) Immediate Mode iii) Register Mode iv) Register Understand 2

indirect mode v) Direct addressing mode with Examples.

6 Explain different program control instructions in CPU? Understand 2

7 Discuss status bit conditions with Diagram? Understand 2

8 Explain conditional branch instructions? Understand 2

9 Compare different instruction formats? Understand 2

10 Define program interrupt? Explain External interrupts and internal interrupts. Knowledge 2

11 Explain i) Indirect addressing Mode ii) Relative addressing Mode iii) Auto Understand 2

increment or auto decrement mode. Iv) Indexed addressing mode and Base

register addressing mode.

UNIT – II

1 Explain the DMA transfer technique with the block diagram? Understand 3

2 Describe input-output-processor (IOP) Organization in detail? Understand 3

3 Compare I/O versus Memory bus? Understand 3

Blooms Course


Outcome

Level

4 Explain DMA Controller with the block diagram? Understand 1

5 Differentiate isolated I/O and memory mapped I/O? Understand 1

6 Discuss Strobe Control method of Asynchronous data transfer technique? Understand 1

7 Explain Asynchronous communication interface with diagram? Understand 1

8 Discuss various techniques used for Modes of Transfer? Understand 1

9 Explain 8089 Input-Output processor? Understand 1

10 Describe asynchronous serial transfer? Understand 2

11 Discuss Handshaking method of Asynchronous data transfer technique? Understand 2

UNIT - III

1 Explain briefly about memory hierarchy? Understand 2

2 Discuss RAM and ROM chips with diagrams? Understand 2

3 State and Explain virtual memory organization technique? Remember 2

4 Describe in detail about associative memory? Remember 2

5 Define cache memory? Explain Associative mapping technique?. Remember 3

6 Define a mapping function? Explain Set-Associative mapping technique? Remember 3

7 Define virtual memory? Discuss Address mapping using pages in virtual Remember 3

memory?

8 Explain i) ROM ii) PROM iii)EPROM iv)EEPROM. Understand 3

9 Explain i) Write through policy ii) write back policy iii) Hit and Miss ratio. Understand 4

10 Explain virtual memory Address translation? Understand 4

11 Explain briefly about Memory connection to CPU? Understand 4

UNIT – IV

1 Explain the various addressing modes of 8086 with examples? Understand 4

2 Explain difference between 8086 and 8088? Apply 4

3 Explain what are the GPR & SPR registers in 8086? Understand 4

4 Classify flag register in 8086 and explain flag instruction set? Apply 4

5 Distinguish between min mode and max mode of 8086? Apply 4

6 Explain the functional block diagram of 8086and write about the functions of Understand 2

each block?

7 Differentiate between physical address, effective address and offset address? Apply 3

8 Explain with example how physical address is generated? Understand 3

9 Discuss the addressing modes provided by 8086with examples? Understand 3

10 Describe and explain the minimum mode configuration of 8086 with read and Apply 3

write cycles of timing diagram? 3

11 Describe pin diagram of 8086 and explain each pin? Apply 3

UNIT - V

1 Discuss the instructions formats of 8086 with examples? Understand 2

2 Describe the following instructions with examples Understand

i)IMUL ii) XLATE iii) XCHG iv) MOVSB 2

3 Explain Arithmetic instruction set of 8086 with examples? Understand 2

4 Explain data transfer instructions of 8086 with examples? Understand 2

5 Distinguish macros & procedures? Understand 2

6 Explain short notes on JUMP instructions with examples? Understand 2

7 Explain the following instructions i). WAIT ii). HLT iii). ESC iv). NOP. Understand 2

8 Explain If AL contains A0H, what happens when the instruction CBW is Understand 2

executed?

9 Explain the uses of Shift & rotate instructions? Understand 2

10 Differentiate jump & loop instructions? Apply 2

11 Explain short notes on string instructions? Understand 2

12 Identify the logical instructions available in 8086? Understand 2

Group - III (Critical Thinking / Analytical Questions)

Blooms Course

S. No Questions Taxonom

Outcome

y Level

UNIT – I

1 Calculate how many one-address instructions can be formulated when A Apply 2

Computer has 32-bit instructions and 12-bit address with 250 two-address

instructions?

2 List a program to evaluate the arithmetic statement. Knowledge 2

X= A [B+C (D+E)] Using Zero address instructions.

F(G+H)

3 Calculate the number of times control unit refer to memory when it fetches and Apply 2

executes an indirect addressing mode instruction if the instruction is a

computational type requiring an operand from memory?

4 Calculate the address field of an indexed addressing mode instruction to make it Apply 3

the same as a register indirect mode instruction?

5 List the basic differences between a branch instruction, a call subroutine Knowledge 3

instruction, and a program interrupt?

6 The memory unit of a computer has 256K words of 32 bits each. The computer Apply 3

has an instruction format with four fields: an operation field, a register address

field, a mode field, and a memory address. Determine the instruction format and

the number of bits in each field if the instruction is in one memory word?

7 The program in a computer compares two unsigned numbers A and B by Apply 2

performing a subtraction A-B and updating the status bits. Let A=01000001 and

B=10000100, Calculate the values of Status bits C (borrow) and Z?

UNIT - II

1 Indicate whether the following constitute a control, status, or data transfer Understand 2

commands.

a. Skip next instruction if flag is set.

b. Seek a given record on a magnetic disk.

2 A CPU with a 20-MHZ clock is connected to a memory unit whose access time Apply 1

is 40 ns. Formulate a read and write timing diagrams using a READ strobe and

a WRITE strobe, Include the address in the timing diagram.

3 Calculate the minimum number of bits that a frame must have in the bit-oriented Apply 2

protocol?

4 Calculate the number of characters per second can be transmitted over 1200- Apply 2

baud line in each of the following modes?

a. Synchronous serial transmission.

b. Asynchronous serial transmission with two stop bits.

5 In most computers an interrupt is recognized only after the execution of the Understand 2

current instruction. Consider the possibility of acknowledging the interrupt at

any time during the execution of the instruction. Discuss the difficulty that may

arise?

6 A DMA controller transfers 16-bit words to memory using cycle stealing. The Apply 2

words are assembled from a device that transmits characters at a rate of 2400

characters per second. The CPU is fetching and executing instructions at an

average rate of 1 million instructions per second. Calculate how much the CPU

be slowed down because of the DMA transfer?

7 Analyze how DMA interrupt have priority over the processor interrupt when Apply 2

both interrupts occur simultaneously?

UNIT – III

1 A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8). Calculate the Apply 1

number of 2 × 4 decoders with enable line needed to construct a 16K × 16 RAM

from 1K × 8 RAM?

2 Calculate The amount of ROM needed to implement a 4 bit multiplier? Apply 1

3 A computer has a 256 K Byte, 4-way set associative, write back data cache with Apply

block size of 32 Bytes. The processor sends 32 bit addresses to the cache 1

controller. Each cache tag directory entry contains, in addition to address tag, 2

valid bits, 1 modified bit and 1 replacement bit. Calculate the number of bits in

the tag field of an address?

4 A 4-way set-associative cache memory unit with a capacity of 16 KB is built Apply 1

using a block size of 8 words. The word length is 32 bits. The size of the

physical address space is 4 GB. Calculate The number of bits for the TAG field?

5 In a k-way set associative cache, the cache is divided into v sets, each of which Apply 1

consists of k lines. The lines of a set are placed in sequence one after another.

The lines in set s are sequenced before the lines in set (s+1). The main memory

blocks are numbered 0 onwards. Calculate The main memory block numbered j

must be mapped to any one of the cache lines from?

6 Consider two cache organizations: The first one is 32 KB 2-way set associative Apply 2

with 32-byte block size. The second one is of the same size but direct mapped.

The size of an address is 32 bits in both cases. A 2-to-1 multiplexer has a latency

of 0.6 ns while a k bit comparator has a latency of k/10 ns. The hit latency of the

set associative organization is h1 while that of the direct mapped one is h2.

Calculate The value of h1?

7 In many computers the cache block size is in the range 32 to 128 bytes. Discuss Understand 1

the main advantages and disadvantages of making the size of the cache blocks

larger or smaller?

8 An eight-way set-associative cache consists of a total of 256 blocks. The main Apply

memory contains 8192 blocks, each consisting of 128 words. 1

1. Calculate number of bits in the main memory address?

2. Calculate number of bits in the TAG, SET and WORD fields?

9 Calculate numbers of 128 x 8 RAM chips are needed to provide a memory Apply

capacity of 2048 bytes? 1

10 Explain how will you calculate time Tb to access a block of data in serial access Apply

memory? 1

11 Calculate the number of page faults using First In First out (FIFO) Page Apply

Replacement Algorithm for the following CPU References. 1

3 4 5 6 4 7 4 0 6 7 4 7 6 5 6 4 5 3 4 5

Assume Main Memory contains 4 frames.

12 Calculate the number of page faults using Least Recently used (LRU) Page Apply 2

Replacement Algorithm for the following CPU References.

7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1


UNIT – IV

1 Explain the loop instructions of 8086? Explain the use of DF flag in the Understand 1

execution of string instructions?

2 Explain common function signals of 8086? Understand 1

3 Explain about HOLD response sequence? Understand

4 Explain hardware and software, vectored and non-vectored, I/O and processor Understand 1

interrupt in 8086?

5 Explain the architecture of 8086 with BIU and EU units and implementation of Understand 1

pipelining and instruction queue techniques?

6 Explain how odd memory bank is accessed in 8086? Understand 1

7 Explain segmentation of memory in 8086? Understand 1

Blooms Course


Outcome

Level

UNIT - V

1 Describe an assembly language program to find sum of squares? Understand 4

2 Explain a program sequence thatcompares thefirst 10 bytes beginning Understand 4

atCHAR_1with the first10bytes beginning at CHAR_2 and branches toMATCH.

If they are equal, but otherwise continues in sequence

3 Describe program sequences that will perform the followingoperations Apply

ontwodigit packed BCD number.

a. A=B+(C-6) 3

b. A=(X+W) – (Z– (U*5))

4 Describe a program to read ASCII code after a strobe signal is sent from a Apply 3

Keyboard?

5 Describe a program to add a profit factor to each element in a cost array and Apply 3

puts the result in a prices array?

6 Identify the errors in the following instructions or groups of instructions. Understand 3

Loop: MOV BL,72H

DEC BL JNZ loop

ASSIGNMENT

Course Name : Computer Organization




Year : 2015 – 2016

Course Faculty : Mr K SIVA RAMA PRASAD

OBJECTIVES

To meet the challenge of ensuring excellence in engineering education, the issue of quality needs to be

addressed, debated and taken forward in a systematic manner. Accreditation is the principal means of quality

assurance in higher education. The major emphasis of accreditation process is to measure the outcomes of the

program that is being accredited.




bank, which will enhance learner‟s learning process.

S. No Question Blooms

Taxonomy Level

Program

Outcomes

UNIT-I

1 Calculate how many one-address instructions can be formulated when A

Computer has 32-bit instructions and 12-bit address with 250 two-

address instructions?

Apply 4

2 List a program to evaluate the arithmetic statement. X= A [B+C (D+E)] Using Zero address instructions.

F(G+H)

Knowledge 4

3 Calculate the number of times control unit refer to memory when it

fetches and executes an indirect addressing mode instruction if the

instruction is a computational type requiring an operand from memory?

Apply 2

4 Calculate the address field of an indexed addressing mode instruction to

make it the same as a register indirect mode instruction?

Apply 4

5 List the basic differences between a branch instruction, a call subroutine

instruction, and a program interrupt?

Knowledge 3

6 Define an instruction format? Explain different types of instruction

formats in detail.

Knowledge 1

7 Explain different types of addressing modes with Suitable examples? Understand 1

8 Define an interrupt? Explain Types of interrupts? Knowledge 3

9 Illustrate

Examples?

one-address and zero-address instruction formats, With Apply 1

UNIT-II

1. A CPU with a 20-MHZ clock is connected to a memory unit whose access

time is 40 ns. Describe a read and write timing diagrams using a READ

strobe and a WRITE strobe, Include the address in the timing diagram.

Understand I

2. Calculate How many characters per second can be transmitted over a

1200-baud line in each of the following mode ?(assume a character code of

8 bits )

a) Synchronous serial Transmission.

b ) Asynchronous serial Transmission with one stop bit.

c) Asynchronous serial Transmission with two stop bits.

Apply 2


Taxonomy Level

Program

Outcomes

3. Explain the programming steps are required to check when a source

interrupts the computer while it is still being service by a previous interrupt

request from the same source?

Understand 2

4. Calculate the minimum number of bits that a frame must have in the bit-

oriented protocol?

Apply 1

5. Explain Asynchronous communication interface with diagram? Understand 3

6. Describe the basic advantage of using Interrupt-Initiated data transfer over

transfer under program control without an interrupt?

Understand 3

7. In most computers an interrupt is recognized only after the execution of the

instruction .Consider the possibility of acknowledging the interrupt at any

time during the execution of the instruction. Discuss the difficulty that may

arise.

Understand 2

8. A DMA controller transfers 16-bit words to memory using Cycle stealing.

The words are assembled from a device that transmits characters at a rate of

2400 characters per second. The CPU is fetching and executing instructions

at an average rate of 1 million instructions per second.

Calculate how much will the CPU be slowed down because of the DMA

transfer?

Apply 1

9. Explain why DMA have priority over the CPU when both request a

memory transfer?

Understand 3

10. Explain briefly about Intel- 8089 Input-Output processor. Understand 3

UNIT - III

1. In many computers the cache block size is in the range 32 to 128 bytes.

Discuss the main advantages and disadvantages of making the size of the

cache blocks larger or smaller?

Understand 1

2. Define a mapping function? Explain Set-Associative mapping technique

with Example?

Understand 3

3. Explain virtual memory Address translation with diagram? Understand 3

4. An eight-way set-associative cache consists of a total of 256 blocks. The

main memory contains 8192 blocks, each consisting of 128 words.

1. Calculate number of bits in the main memory address?

2. Calculate number of bits in the TAG, SET and WORD fields?

Apply 2

5. Calculate the number of page faults using Least Recently used (LRU)

Page Replacement Algorithm for the following CPU References.

7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1


Apply 2

6. Calculate the number of page faults using First In First out (FIFO) Page

Replacement Algorithm for the following CPU References.

3 4 5 6 4 7 4 0 6 7 4 7 6 5 6 4 5 3 4 5


Apply 2

7. Define a mapping function? Explain Associative mapping technique with

Example?

Understand 2

8. Explain i) Write through policy ii) write back policy iii) Hit and Miss

ratio.

Understand 1

9. The Access Time of a Cache Memory is 100 ns and that of main memory

1000 ns. It is estimated that 80 percent of the memory requests are for read

and the remaining 20 percent for write. The hit ratio for read access only is

0.9. A Write through Procedure is used.

Calculate the average access time of the system considering only memory

read cycles.

Calculate the average access time of the system for both read and write

requests.

Calculate the hit ratio taking into consideration the write cycles?

Apply 2

10 A computer employs RAM chips of 256x8 and ROM chips of 1024x8 the

computer system needs 2K bytes of RAM ,4K bytes of ROM and 4

interface units each with 4 registers .A memory mapped I/O configuration

is used .the two highest order bits of the address bus are assigned 00 for

RAM,01 for ROM , and 10 for interface register.

a) Calculate How many RAM and ROM chips are needed?

b) Draw a memory address map for the system.

c) Give the address range in Hexadecimal for RAM, ROM ,and interface.

Understand 1


Taxonomy Level

Program

Outcomes

UNIT – IV

1. Explain why 8086 internal architecture with the help of BIU and EU? Understand 3

2. Define arithmetic pipeline with an example? Understand 3

3. Explain about HOLD response sequence? Understand 2

4. Explain MINIMUM and MAXIMUM modes in 8086? Understand 2

5. Differentiate 8086 with 8085? Understand 2

6. Explain about interrupts in 8086? Understand 3

7. Explain what are the GPR & SPR registers in 8086? Understand 3

8. Classify flag registers in 8086 and explain it? Apply 3

9. Differentiate between physical address, effective address and offset

Address?

Understand 1

10. Discuss the addressing modes provided by 8086 with examples? Understand 1

UNIT – V

1. Describe the following instructions with examples?

i) IMUL ii) XLATE iii) XCHG iv) MOVSB Understand 1

2. Summarize the following instructions i. WAIT ii. HLT iii. ESC iv. NOP. Understand 1

3. Explain briefly about string instructions. Understand 3

4. Discuss assembly language program to find sum of squares. Understand 5

5. Explain a program to read ASCII code after a strobe signal is sent from a

Keyboard?

Understand 1

6. Identify the logical instructions available in 8086 with one example. Understand 5

7. Define non-Mask able interrupts.? Apply 3

8. Explain ALIGN & ASSUME? Understand 3

9. Discuss about cross-compiler. Understand 3

10 Explain about the instruction format in 8086? Understand 2

FRESHMAN ENGINEERING


CourseTitle ENVIRONMENTAL STUDIES

CourseCode A40009

Regulation R13– JNTUH

CourseStructure Lectures Tutorials Practicals Credits

4 - 4

Course Faculty Mr. VIJAY

I. COURSEOVERVIEW:

Environmentalstudyisinterconnected;interrelatedandinterdependentsubject.Hence,itismultidisciplinaryin

nature.ThepresentcourseisframedbyexpertcommitteeofUGCunderthedirectionofHonorableSupremeCour

ttobeasacoremodulesyllabusforallbranchesofhighereducationandtobeimplementedinalluniversitiesoverIn

dia.Thecourseisdesignedtocreateenvironmentalawarenessandconsciousnessamongthepresentgenerationt

obecomeenvironmentalresponsiblecitizens.Thecoursedescriptionis:multidisciplinarynatureofenvironmen

talstudies,NaturalResources:Renewableandnonrenewableresources;Ecosystems;Biodiversityanditsconse

rvation;EnvironmentalPollution;SocialIssuesandtheEnvironment;HumanPopulationandtheEnvironment;

pollutioncontrolactsandFieldWork.Thecourseisdividedintofivechaptersforconvenienceofacademicteachi

ngfollowedbyfield visits.

II. PREREQUISITE(S):

Level Credits Periods/Week Prerequisites

UG 4 4 Knowledge of basic sciences

III. MARKSDISTRIBUTION:

SessionalMarks UniversityE

nd Exam

Marks

Total

Marks

MidtermTest

Thereshallbetwomidtermexaminations.Eachmidtermexaminationconsistsof

essaypaper,objectivepaperandassignment.

Theessaypaperisfor10marksof60minutesdurationandshallcontain4question

s.Thestudenthastoanswer2questions,each carrying5 marks.

75 100

SessionalMarks UniversityE

nd Exam

Marks

Total

Marks

Theobjectivepaperisfor10marksof20minutesduration.Itconsistsof10multiplec

hoiceand10fill-in

theblankquestions,thestudenthastoanswerallthequestionsandeachcarries

halfmark.Firstmidtermexaminationshallbeconductedforthefirsttwoandhalfunit

sofsyllabusandsecondmidtermexaminationshall be conductedfor

theremainingportion.Fivemarksareearmarkedforassignments.Thereshallbetw

oassignmentsineverytheorycourse.Assignmentsareusuallyissuedatthetimeofc

ommencementofthesemester.Theseareofproblemsolvinginnaturewithcriticalth

inking.Marksshallbeawardedconsideringtheaverageoftwomidtermtests in

eachcourse.

IV. EVALUATIONSCHEME:


1. IMid Examination 80 minutes 20

2. I Assignment - 5

3. IIMid Examination 80 minutes 20

4. IIAssignment - 5

5. External Examination 3 hours 75

V. COURSEOBJECTIVES:

Atthe end ofthe course,the students willbe ableto:

I. DeterminetheNaturalresourcesonwhichthestructureofdevelopmentisraisedforsustainabilityoftheso

cietythroughequitablemaintenanceofnaturalresources.

II. Illustrateaboutbiodiversitythatraisesanappreciationanddeeperunderstandingofspecies,ecosystemsa

ndalsotheinterconnectednessofthelivingworldandtherebyavoids the mismanagement, misuse and

destruction ofbiodiversity.

III. Summarizeamethodologyforidentification,assessmentandquantificationofglobalenvironmentaliss

uesinordertocreateawarenessabouttheinternationalconventions formitigating global environmental

problems

IV. Sustainabledevelopmentthataimstomeetraisinghumanneedsofthepresentandfuturegenerationsthrou

gh preservingtheenvironment.

V. Outlinegreenenvironmentalissueprovidesanopportunitytoovercomethecurrentglobalenvironmental

issuesbyimplementingmoderntechniqueslikeCDM, greenbuilding,green computingetc.

VI. COURSEOUTCOMES:

Based on this course, the Engineering graduate will understand / evaluate /develop

technologies on

the basis of ecological princoples and environmental regulations which inturn helps in

sustainable

development..

VII. HOW PROGRAMOUTCOMES AREASSESSED:

Program Outcomes

Level

Proficiency

assessed by


science, engineering fundamentals, and an engineering

S

Tutorials

to the solution of complex engineering problems

specialization



Assignments







considerations.



Projects





Mini Projects





--





--


development.


--




settings.








H

projects


discussion








assessed by



H Lectures,

Assignments



H

Projects

VIII. SYLLABUS:

UNIT-I

Ecosystems:Definition,ScopeandImportanceofecosystem.Classification,structureandfunctionofane

cosystem,Foodchains,foodwebsandecologicalpyramids.Flowofenergy,Biogeochemicalcycles,Bioac

cumulation,Biomagnifications,ecosystemvalue,servicesand carryingcapacity,Field visit.

UNIT-II

NaturalResources:ClassificationofResources:LivingandNonLivingresources,waterresources:usean

doverutilizationofsurfaceandgroundwater,floodsanddroughts,Dams:benefitsandproblems.Mineralre

sources:useandexploitation,environmentaleffectsofextractingandusingmineralresources,Landresour

ces:Forestresources,Energyresources:growingenergyneeds,renewableandnonrenewable

energysources, use ofalternate energysource, casestudi

UNIT-III

BiodiversityandBioticResources:Introduction,Definition,genetic,speciesandecosystemdiversity.Val

ueofbiodiversity;consumptiveuse,productiveuse,social,ethical,aestheticandoptionalvalues.Indiaasame

gadiversitynation,Hotspotsofbiodiversity.Fieldvisit.Threatstobiodiversity:habitatloss,poachingofwildl

ife,man-wildlifeconflicts;conservationofbiodiversity:In-SituandEx-situconservation.National

Biodiversityact.

UNIT-IV

EnvironmentalPollutionandControlTechnologies:EnvironmentalPollution:Classificationofpollutio

n,AirPollution:Primaryandsecondarypollutants,AutomobileandIndustrialpollution,Ambientairquality

standards.Waterpollution:Sourcesandtypesofpollution,drinkingwaterqualitystandards.SoilPollution:S

ourcesandtypes,Impactsofmodernagriculture,degradationofsoil.NoisePollution:SourcesandHealthhaz

ards,standards,Solidwaste:MunicipalSolidWastemanagement,compositionandcharacteristicsofe-

Wasteanditsmanagement.Pollutioncontroltechnologies:WastewaterTreatmentmethods:Primary,secon

daryandTertiary.Overviewofairpollutioncontroltechnologies,Conceptsofbioremediation.GlobalEnviro

nmentalProblemsandGlobalEfforts:Climatechangeandimpactsonhumanenvironment.Ozonedepletion

andOzonedepletingsubstances(ODS).Deforestationanddesertification.Internationalconventions/Protoc

ols:Earthsummit, Kyoto protocol and MontréalProtocol.

UNIT-V

EnvironmentalPolicy,Legislation&EIA:

EnvironmentalProtectionact,LegalaspectsAirAct,WaterAct,ForestAct,WildlifeAct,Municipalsolidwast

emanagementandhandlingrules,biomedicalwastemanagementandhandlingrules,hazardouswastemanag

ementandhandlingrules.EIA:EIAstructure,methodsofbaselinedataacquisition.OverviewonImpactsofair

,water,biologicalandSocio-

economicalaspects.Strategiesforriskassessment,ConceptsofEnvironmentalManagementPlan(EMP).To

wardsSustainableFuture:ConceptofSustainableDevelopment,Populationanditsexplosion,CrazyConsum

erism,EnvironmentalEducation,UrbanSprawl,Humanhealth,EnvironmentalEthics,ConceptofGreenBui

lding,Ecological Foot Print, Life Cycleassessment (LCA),Lowcarbonlifestyle

Text Books:

1. BennyJoseph (2005)., EnvironmentalStudies, New Delhi,TataMcGrawHillPublishingco.Ltd

2. ErachBharucha(2005).,Textbook of Environmental Studies for UndergraduateCourses,

Hyderabad, Universities Press.

Reference Books:

1. Anji Reddy.M (2007),Textbook of EnvironmentalSciences and Technology,Hyderabad,BS

Publications.

2. Y Anjaneyulu.(2004),Introduction toEnvironmentalSciences,BSPublications.

3. AnubhaKaushik(2006).,Perspectives in Environmental Science,3rd

Edition, NewDelhi,New age

international.

IX. COURSEPLAN:

Attheendofthecourse,thestudentsareabletoachievethefollowingcourselearningoutcomes:

Lecture

No. CourseLearningOutcomes Topicstobecovered Reference

1 Summarizeabout environment

anditsimportance

Definition.Scope,importanceandneedforP

ublicAwareness.

T2:1-12

2 Summarize about environment

andimportanceofecosystem

s

Ecosystem: Definition, scope

andimportanceofecosyste

m

T1:17-20

3 Provides information regardingecosystemandapp

licability

Structureandfunctionofecosystem T1:17-26

4-5 Tounderstandhowalltheanimalsarecompet

ingwiththeirfoodrequirementsandalsound

erstandsthevarioustrophiclevelsinthefood

chain.

Food chain,Food weband pyramids T1:28-39

6 Explaintheflowofenergythroughthevariou

scomponentsofecosystem

Flowofenergy TI:48-57

7 Tounderstandtheimportanceofnutrientsan

dflowofnutrientsinecosystem

Biogeochemicalcycles. T1:57-64

8 Explainstheconceptofgaseouscyclesandth

eirimportanceintheecosystem

Gaseouscycles T1:64-68

9 Explainstheconceptofsedimentarycyclesa

ndtheirimportanceintheecosystem

.Sedimentarycycles T2:48-49

10 Torecognize

thetoxicityofheavymetalsonthebioticanda

bioticcomponents.Explainsthedifferentser

vicesprovidedbytheecosystems

Bioaccumulation andBiomagnifications and

Valuesofecosystem

T2:51-55

11 Distinguishaboutdifferenttypesofnaturalre

sourcesandtheirapplicabilityandIllustratet

heutilityofrenewableresourcesefficiency

Energy resources: Living

andnonlivingresources

T1:76-

78T2:5

9

12 Describe theimpactofover

utilizationofundergroundandsurfacewater

Water resources: use and

overutilizationofsurfaceandgro

undwater

T1:85-88

13 . Discussthe disaster managementalplans FloodsandDrought T1:88-90T2:71-

76 14 Describethebenefitsandpropertydams Dams:befitandproblems. T1:94-100

15 illustratetheusesofmineralresources . Mineral resources: use

andexploitation

T2:86-88

16 Enumeratetheapplication

ofthesolarenergyinmodernways

Energy resources:introduction

andimportance

T2:101-106

Solarenergyanditsapplication T2:108-124

17 Describethesolarcollectors Solarcollectors T2:124-138

18 Enumeratetheapplicationofthewindenerg

yinmodernways

Windenergyanditsapplication. T2:139-150

19 Discussthemerits and

limitationofwindenergy

Meritsanddemeritsofwindenergy T2:151-156

20 Enumeratetheapplicationofthewindenerg

yinmodernways Biomassanditsapplication T2:158-161

21 Illustratethedefinitionandimportanceofbio

diversity Biodiversity and Biotic

resources:introductionand

definition.

T2:162-166

22 Explainthegenetic

diversity,speciesandecosystemdiversity

Classification of biodiversity

andNationalbiodiversity

act.

T2:176-182

23 Describe theecologicalvalues

andconsumptivevaluesofecosystem

Valuesofbiodiversity T1:254-256

Lecture


24 Providesinformationregardingindirectval

ueofbiodiversity

Indirectvaluesofbiodiversity. T1:257-

262T1:288-

289 25 Discussthehotspot

centerinandaroundthecountry

Hotspotsofbiodiversity. T2:187-192

26 Providesinformationregardingdifferentca

usesforlossofbiodiversity Threatstobiodiversity T2:192-205

27 Analyzevariousreasonsforconflictofspeci

es

Manwildlifeconflict R1:179-189

28 Illustratedifferent methods to

protectbiodiversity,Preventpollution

Conservationofbiodiversity R1:204-

216R3-213-

214 29 Explainthe meaningof

environmentalpollutionandclassification.

Environmental pollution: introductionandclassification.

T1:257

30 Describe thenaturaland

manmadepollutantthatcausesairpollution

Airpollution:primarypollutantssourcesan

deffects

T1

Discussthesecondarypollutantsourceande

ffects.

Secondarypollutantssourceandeffects T2

32 Illustratetheautomobilepollution. Automobileandindustrialpollution T2

33 Tounderstandthepermissiblelevelsofpollutant.

Airqualitystandards R1

34 Explainthesourcesandeffectsofwaterpollu

tion

Water pollution: sources of

waterpollution

T2

35 Enumeratethedifferenttypesofwaterpollut

ants.

Typesofwaterpollution. T1

36 Distinguishthe sourcesand

typesofwaterpollution

Soilpollution:sourcesandtypesofsoilpollu

tion

T2

37 To understand modern

agriculturepractices

Impactofmodernagricultureonsoil T1

38 Toactivitiestodegradethesoil Degradationofsoil, T1

39 Toidentifythesourcesandhealthhazard Noise pollution: sources

andhealthhazards T2

40 Tohaveintroduction

noisequalityp

ermissiblelevels

Noisequalitystandards T1

41 Explainthevariousmethodscommonlyemp

loyedforthedisposalofsolidwaste.

Solid waste:Municipal solid

wastemanagement

T2

42 Tounderstandthe recenttrends in e-

wastemanagementpractices.

E-waste: characteristics and

itsmanagement

T1

43 Suggestvariousremedial and

controlmeasurestominimizewaterpollutio

n

Pollution control

technologies:wastewatertr

eatmentmethods

T2

44 Tounderstandtherecenttrendsin

bio

remediation

Conceptofbioremediation T1

45 To understandconcept

ofclimatechangeandimpacts.

Globalenvironmentalproblems:climatech

angeandimpactonhuman

T1

46 Describe theremedialmeasures

ofozonedepletion.

Ozonedepletionandconsequences. T2

47 Toevolvestrategiesto

environmentalissues.

Internationalprotocols T1

48 Describe therole of

governmentandlegalaspectsinenvironmen

talprotection

Environmentalpolicy,legislationandEI

A

T2

49 Discussthesalientfeaturesoftheairandwate

rpollutionact

Airpollutionandpreventionact,Waterpollu

tionandpreventionact.

T1

50 Summarizedifferentacts

inprotectingenvironmentand

Municipalsolidwastemanagementandhan

dlingrules,Biomedicalwastemanagementa

ndhandlingrules

T2

51 Discussthesalientfeaturesof

thehazardouswastemanagement

Hazardous waste management

andhandlingrules.

T1

Lecture


52 Tounderstandtheimportanceofeiafordevel

opmentalactivities.

Eiastructure T2

53 Discussthe various data

collectionmethods.

Methodsofbaselinedataacquisition T1

54-56 Discussvariousimpactsofindustriesontheenvironment

Impactsofdevelopmental activities onenvironmentalcomponents

T2

57-58 Discussthe different

managementalplansforprotectionofenviro

nment.

Environmentalmanagementalplans T1

59 States the aim and objectives

ofsustainabledevelopment.

Towards sustainable

features:conceptsofsustainabledevelopme

nt

T2

60-62 States the aim and objectives

ofsustainabledevelopment.

Crazyconsumerismsandurbansprawl T1

63-65 Explainthe environmental

ethicsandobjectivesofgreenbuildings

Environmentalethics andconcepts

ofgreenbuildings

T2

IX. MAPPINGCOURSE OBJECTIVESLEADINGTO THE ACHIEVEMENT

OFPROGRAM OUTCOMES ANDPROGRAM SPECIFIC OUTCOMES:

Course

Objectives


Outcomes


I N H N S S

II N S N S

III N S S N S

IV S S N S

V N S

S–SupportiveN-NONE H-HighlyRelated

X. MAPPINGCOURSEOUTCOMESLEADINGTO THE ACHIEVEMENT

OFPROGRAM OUTCOMES ANDPROGRAM SPECIFIC OUTCOMES:

Course

Outcomes


Outcomes


1 H S S H H

S–SupportiveN-NONE H-HighlyRelated

Prepared by :


ASSIGNMENT QUESTION BANK

Course Name : ENVIRONMENTAL STUDIES

Course Code : A4009

Class : II B.Tech II Semester

Branch : CSE

Year : 2015 - 2016

Course Faculty : VIJAY Y Asst.Prof

OBJECTIVES



S No. Questions Blooms Course Taxonomy Outcome Level

UNIT – 1 ECOSYSTEM

1 Describe any two forest ecosystems in India. What are the current threats to Remember 1 forest ecosystems and how can they be conserved.

2 Describe five ecosystems goods and services that human benefits from. Understand 1

3 Discuss the structure and function of desert ecosystem Remember 1

4 Explain phosphate and sulphate cycles. Understand 1

5 Explain briefly about indicators of the quality of ecosystem. Remember 1

UNIT – II NATURAL RESOURCES

1 Describe the merits and demerits of nuclear power energy and discuss the Remember 1 major concern regarding its use for electricity generation in India

2 Explain the solar energy; also discuss about the solar cells with a diagram Understand 1

and enumerate its applications

3 Discuss droughts and floods with respect to their occurrence and impacts. Remember 1

4 How can you prevent the depletion of ground water resources? Understand 1

5 Explain growing energy needs? Remember 1

UNIT –III BIODIVERSITY AND BIOTIC RESOURCES

1 Identify and explain the present day major threats to the biodiversity of Remember 1 India?

2 Discuss the various strategies of conservation of biodiversity? Understand 1

3 Enumerate five important biosphere reserves, national parks and wild life Understand 1 sanctuaries of India.

4 Explain the the hot spots of biodiversity Remember 1

5 Explain national biodiversity act. Understand 1

UNIT – IV ENVIRONMENTAL POLLUTION AND CONTROL TECHNOLOGIES

1 Define soil pollution and write the sources and types. Remember 1

2 Explain the Impacts of modern agriculture on soil. Understand

3 Define soil degradation and discuss the major causes of soil degradation Remember 1

4 Define noise pollution and write the sources and health hazards Understand 1

5 Explain the concepts of bioremediation Remember 1

UNIT-V ENVIRONMENTAL POLICIES, LEGISLATIONS, RULES AND REGULATIONS

1 Differentiate direct impact and indirect impact. Remember 1

2 Discuss the basic characteristics of green buildings. Understand 1

3 Explain climate change and consequences with reference to human being. Remember 1

4 Discuss the importance of an environmental awareness campaign? Share Understand 1 your experience on a attending/conducting such programs.

5 Explain the term environmental degradation and discus the role of advanced Remember 1 technology in the protection of the environment.



Course Name : ENVIRONMENTAL STUDIES

Course Code : A4009

Class : II B.Tech II Semester

Branch : CSE

Year : 2015 - 2016

Course Faculty : VIJAY Asst.Prof

OBJECTIVES

Environmental study is interconnected; interrelated and interdependent subject. Hence, it is

multidisciplinary in nature. The present course is framed by expert committee of UGC under the direction

of Honourable Supreme Court to be as a core module syllabus for all branches of higher education and to be

implemented in all universities over India. The course is designed to create environmental awareness and

consciousness among the present generation to become environmental responsible citizens. The course

description is: multidisciplinary nature of environmental studies, Natural Resources: Renewable and non-

renewable resources; Ecosystems; Biodiversity and its conservation; Environmental Pollution; Social Issues

and the Environment; Human Population and the Environment; pollution control acts and Field Work. The

course is divided into five chapters for convenience of academic teaching followed by field visits.

1. GROUP - A (SHORT ANSWER QUESTIONS)

S. No

Questions

BLOOMS

TAXONOMY

LEVEL

COURSE

OUTCOME

UNIT – 1 ECOSYSTEM

1 Define ecology and ecosystem. Remember 1

2 Differentiate between food chain and food web. Understand 1

3 Briefly explain the importance of ecological pyramids Remember 1

4 Define biogeochemical cycles? Explain their importance. Understand 1

5 List the factors make a desert ecosystem Remember 1

6 Briefly discuss about grassland ecosystem Understand 1

7 Explain few important characteristics of a forest ecosystem. Remember 1

8 Explain why there are only 4 to 5 tropic levels in any

ecosystem.

Understand 1

9 Briefly discuss an aquatic ecosystem. Remember 1

10 Define biomagnifications Understand 1

11 Define bioaccumulation Remember 1

12 Define carrying capacity? Understand 1

13 Define primary production and secondary production. Remember 1

14 Define ecological pyramids. Understand 1

15 Define pyramid of energy. Remember 1

16 Differentiate between grazing food chain detritus food chain. Understand 1

17 List the different tropic levels of ecosystem? Remember 1

18 Define decomposers? Understand 1

19 Define photosynthesis process. Remember 1

20 List the types of grasslands in India and two animal species found

in this grass land .

Understand 1


1 Discuss some of the water resources problems in India. Remember 1

2 Discuss the problems of over exploitation of ground water. Understand 1

3 Explain the causes for floods. Remember 1

4 Discuss the methods of flood control. Understand 1

5 Define desertification? Remember 1

6 Define aquifer? Understand 1

7 Enlist different surface and ground water resources. Remember 1

8 List the environmental effects of using of mineral resources? Understand 1

9 define mineral? What is its use? Remember 1

10 Name the non renewable resources? Understand 1

11 Define water logging? Remember 1

12 Define soil erosion? Remember 1

13 List the effects of soil pollution? Understand 1

14 Differentiate soil texture and structure Remember 1

15 Define green fuels? Understand 1

16 Outline the role of geo thermal energy in India? Remember 1

17 List the different type‟s energies which can be derived from the

ocean?

Understand 1

18 Define solar cells. Remember 1

19 Define pesticides? Mention it types. Understand 1

20 List the different types of natural resources Remember 1

UNIT –III BIODIVERSITY AND BIOTIC RESOURCES

1 Enumerate the biogeographical classification of India. Remember 1

2 define hot spots of biodiversity? Mention the three hot spots in

India

Understand 1

3 Differentiate between endanger and endemic species. Understand 1

4 Define national park? Name few such parks in India. Remember 1

5 Define red data book? Understand 1

6 Outline in situ and ex situ conservation of biodiversity? Remember 1

7 What does NBPGR AND NBAGR stand for? Where are they

located?

Understand 1

8 List the major causes of man-wild life conflict? Remember 1

9 List the major threats to biodiversity? Understand 1

10 Define endemic species? Name some endemic species in India. Remember 1

11 List the national wildlife sanctuaries? Understand 1

12 List the indirect values of biodiversity. Remember 1

13 Define biological diversity. Understand 1

14 Differentiate genetic and species diversity. Remember 1

15 Define national biodiversity act. Understand 1

16 Underline India as a nation of mega diversity nation? Remember 1

17 Define threatened species? Understand 1

18 Define onsite conservation Remember 1

19 Define bio piracy. Understand 1

20 Define the term genetic banks. Remember 1


1 Define environmental pollution. Remember 1

2 Define air pollution? Understand

3 Mention two important controlling devices of air pollution used in

industries.

Remember 1

4 Mention the major sources of primary air pollutants. Understand 1

5 Define water pollution. Remember 1

6 List the various types of water pollution? Understand 1

7 List the main stages of treatment of domestic sewage? Remember

8 Mention the main treatment methods meant for industrial effluents. Understand 1

9 List the chemical treatments for industrial effluents? Remember 1

10 Differentiate between aerobic oxidation and anaerobic

oxidation.

Understand 1

11 Mention some of the water borne diseases and the name of the

pathogenic organisms involved in it.

Remember 1

12 Define eutrophication. Understand 1

13 Define Bod and Cod Remember 1

14 Differentiate between blue baby syndrome and itai-itai disease. Understand 1

15 Define soil pollution. Remember 1

16 Enumerate the various effects of soil pollution. Understand 1

17 Underline the monitoring of soil pollution made? Remember 1

18 Define noise pollution. Understand 1

19 List the physical, physiological and psychological effects of noise? Remember 1

20 Describe an account of decibel scale for the measurement of sound. Understand 1

UNIT-V ENVIRONMENTAL POLICIES, LEGISLATIONS, RULES AND REGULATIONS

1 List the objectives of Air pollution act. Remember 1

2 Explain the necessity of wild life protection act. Understand 1

3 Explain the necessity of various environmental legislations. Remember 1

4 Mention the objectives of environmental protection act. Understand 1

5 Discribe water cess and water pollution as defined by water

pollution cess act, 1974.

Remember 1

6 List the bio-medical wastes? What are the rules to manage and

handle them?

Understand 1

7 Name the governmental organization/deportment responsible for

the protection of the environment.

Remember 1

8 Name the role assigned to central pollution and state pollution

control board under the water pollution and prevention act.

Understand 1

9 Define environmental impact assessment? Remember 1

10 Define Environmental Impact Assessment and Environmental

Management Plan

Understand 1

2. GROUP - B (LONG ANSWER QUESTIONS)

S. No

Question

Blooms

Taxonomy

Level

Course

Outcome

UNIT-I ECOSYSTEM

1 Explain energy flow pattern in different types of ecosystem Remember 1

2 Discuss the major characteristics features of a river ecosystem

different from lake ecosystem

Understand 1

3 List the main components of ecosystem and briefly describe the

functions of each.

Remember 1

4 Explain the role of producers, consumers and decomposers in an

ecosystem with practical example.

Understand 1

5 What would happen to an ecosystem if all its decomposer and

detritus feeder were eliminate. Remember

1

6 List the food chain and food web? give example and discuss their

significance.

Understand 1

7 List the biogeochemical cycles? Explain nitrogen cycle with help

of a diagram. Remember 1

8 Define the ecological pyramids? Explain why some of these

pyramids are upright while others are inverted in different

ecosystem.

Understand

1

9 Explain energy flow of the ecosystem. Remember 1

10 Name all the cycles that constitute the proper functioning of an

ecosystem. Understand

1


1 List the Natural resources and write the classification of resources. Remember 1

2 Explain the Big dams - Benefits and problems. Understand 1

3 List the Mineral Resources, uses and exploitation? Remember 1

4 List the alternate energy sources? Explain their present status, merits

and demerits.

Understand 1

5 Explain the environmental impacts of (i) Fertilizer – Pesticides (ii).

Over grazing. Remember 1

6 Define mining. Explain various environmental impacts of mineral

extraction.

Understand 1

7 List the importance of forest resources for economic and ecological

wealth of country?

Understand 1

8 Discuss about the soil texture, structure and its composition. Remember 1

9 Write a short note on wind energy; also discuss its advantages and

limitations.

Understand 1

10 List the different types of energies which can be derived from the

ocean? Explain briefly along with their advantages and limitations.

Understand

1

UNIT – III BIODIVERSITY AND BIOTIC RESOURCES

1 Discuss the causes of man-wild life conflicts. Suggest suitable wild

life conservation practices. Remember 1

2 Define biodiversity? Explain different types of biodiversity Understand 1

3 Explain in-situ and ex-situ conservation of biodiversity Remember 1

4 Summarize consumptive use value, productive use value, social

value and optional value of biodiversity? Remember 1

5 How the study of biodiversity is beneficial to human life. Remember 1

6 Explain the threats to biodiversity? Understand 1

7 Define biodiversity; explain genetic biodiversity, species diversity

and ecosystem diversity? Remember 1

8 Discuss the status of India as a mega diversity nation of

biodiversity.

Understand 1

9 List the different services that are contributed in various ways by

biodiversity? Remember 1

10 Explain endangered species of India? Understand 1


1 Define environmental pollution and explain their types and

effects.

Understand 1

2 Define air pollution and describe the technologies for the control of

air pollution. Remember 1

3 Explain primary and secondary sources of air pollution? Understand 1

4 List the effects of air pollution on plants, animals and human beings Remember 1

5 Explain automobile pollution and industrial pollution. Understand 1

6 Describe National ambient air quality standards. Remember 1

7 Define water pollution and explain point and non point sources of

water pollution.

Understand 1

8 Explain sewage water treatment plants, effluent water treatment

plants and common effluent treatment plants. Remember 1

9 List the effects of water pollution and enumerate drinking water quality standards

Understand 1

10 Explain the methods for the control of water pollution. Remember 1

UNIT – V ENVIRONMENTAL POLICIES, LEGISLATIONS, RULES AND REGULATIONS

1 Discuss the salient features of Air Act Understand 1

2 Explain Water Act. Remember 1

3 Explain environmental protection Act Understand 1

4 List the major provisions in Forest Conservation Act 1980 Remember 1

5 Discuss the salient features of Wild life protection Act Understand 1

6 List the major municipal solid waste management and handling rules

Remember 1

7 Define biomedical wastes? What are the rules to manage and

handle them Understand 1

8 Define hazardous wastes? Discuss the rules to manage and handle them.

Remember 1

9 Discuss the various types of impacts caused by the

developmental activities with suitable examples. Understand 1

10 Explain the methodology for EIA Remember 1

GROUP- C ANALYTICAL AND CRITICAL THINKING

S. No

Question

Blooms

Taxonomy

Level

Course

Outcome

UNIT-I ECOSYSTEM

1 List the different development activities, including construction of

dams, affect the various ecosystems and what action need to be

taken to conserve them.

Remember 1

2 Explain the impacts of pesticide and other agro chemicals on any

ecosystem you have visited. Understand 1

3 Explain with examples the links between the activities of man

which are hazardous to human health and ecosystem. Remember 1


1 Prepare a detailed report on the management of water and waste

water in your town/city?

Understand 1

2 Discuss with the help of a case study, how big dams have

affected forests and tribal?

Remember 1

UNIT – III BIODIVERSITY AND BIOTIC RESOURCES

1 Explain environmental hot spots of your city? Explain the possible

factors observed by you for degradation of quality of hot spot.

Suggest suitable engineering measure to restore their quality.

Understand 1

2 List the different developmental activities, including construction

of dams, affect the biodiversity and action need to be taken to

conserve them.

Remember 1


1 List out the Sewage treatment plants, effluent treatment plants and

common effluent treatment plants in your vicinity.

Understand 1

2 Explain the problems encountered in the disposal of solid waste

from various sources? Remember 1

3 Explain the e-waste can be effectively managed. Understand 1

UNIT – V ENVIRONMENTAL POLICIES, LEGISLATIONS, RULES AND REGULATIONS

1 Environmental education necessary in the present context? What is your opinion about the environmental ethics?

Remember 1

2 Explain the role of remote sensing and GIS in environmental

protection.

Understand 1

computer science and engineering course description …

Documents