1. Formal Languages and Automata Theory

Transcription

1 VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY Department of Computer Science and Engineering II B.Tech. II Semester (CSE) ACADEMIC PLAN 1. Formal Languages and Automata Theory 2. Data Base Management Systems 3. Computer Organization 4. Design and Analysis of Algorithms 5. Software Engineering 6. JAVA Programming

2 VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY (Autonomous) DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING II B. Tech, I st Semester (Computer Science & Engineering) Subject : Formal Languages and Automata Theory Subject Code : 5CS04 Academic Year : Number of working days : 90 Number of Hours / week : Total number of periods planned : 72 Name of the Faculty Member : R.Vijaya Saraswathi, K.Bheemalingappa, B.Swetha Course Objectives: Explain the theoretical foundations of computer science concerning the relationships between languages and machines, the inherent limits of what can be computed, and the inherent efficiency of solving problems. Identify a language s location in the Chomsky hierarchy (regular sets, context-free, contextsensitive, and recursively enumerable languages). Convert among equivalently powerful notations for a language, including among DFAs, NFAs, and regular expressions, and between PDAs and CFGs. Build the foundation for students to pursue research in the areas of automata theory, formal languages, and computational power of machines. Course Outcomes (COs): Upon completion of this course, students should be able to: List computational devices according to their computational power, and tools which will allow us to tell if a device is powerful enough to solve a given computational problem. Relate the concept of the grammar with the concept of programming language. Design Solutions for problems related to Finite Automata, RE, CFG, PDA and Turing Machine. Analyze various problems and categorize them into P, NP, NP-Complete and NP-Hard problems. UNIT : I Syllabus: Fundamentals: strings, Alphabet, Language, Operations, Chomsky hierarchy of languages, Finite state machine Definitions, finite automation model, acceptance of strings and languages, DFA and NFA, transition diagrams and language recognizers. NFA with ε transitions Equivalence between NFA with and without ε transitions, NFA to DFA conversion, minimization FSM, equivalence between two FSM s, Output machines- Moore and Mealy machine. Learning Objectives: After completion of the unit, the student must able to: Understand the defining and differentiating the strings

3 Use the different types of operators in the languages Understand the finite automation model Analyze the language recognition tools List out the differences between DFA and NFA Solve the problems related to DFA and NFA Understand the process how to convert the NFA to DFA so that you can write the equivalent DFA for the NFA. Learn the procedure to minimize the DFA Learn the output machines: Moore and Mealy machines Lecture Plan S.No. Description of Topic No. of Hrs. Method of Teaching 1. Fundamentals: Strings, Operations 1 st hour Black board+ppt 2. Finite state automation 2 nd hour Black board 3. Finite automation model, acceptance of strings 3 rd hour Black board 4. DFA and NFA problems 4 th hour Black board 5. Transition Diagrams 5 th hour Black board 6. NFA with ε transition 6 th & 7 th hour Black board 7. NFA to DFA Conversion and related problems 8 th & 9 th hour Black board 8. NFA and DFA equivalence 10 th & 11 th hour Black board 9. DFA minimization 12 th & 13 th hour Black board 10. Finite Automata with output machines 14 th & 15 th hour Black board Assignment 1 Syllabus: 1. Explain the Finite automation how the language constructs can be recognized? 2. List out the Finite automates? 3. Define: string, sub string, transitive closure, and reflexive transitive closure 4. Describe the finite state machine with a block diagram. 5. Explain the procedure to convert NFA to DFA. 6. What are the Finite automates with output and explain them with the suitable Examples. 7. Explain the procedure to minimize the DFA for the given regular expression. UNIT : II Regular Languages : Regular Sets, Regular Expressions, identity 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). Regular Grammars right linear and left linear grammars, equivalence between regular grammar and FA. Learning Objectives: After completion of the unit, the student must able to:

4 Understand the regular expressions Learn the usage of identity rules Learn the conversion procedure for RE to Finite automata. Understand the concept of pumping Lemma Define the grammar and types of grammars Understand the relation between the RE and FA Lecture Plan S.No. Description of Topic No. of Hrs. Method of Teaching 1. Regular sets 16 th hour PPT+Blackboard 2. Identity rules and problems 17 th hours PPT+Blackboard 3. Finite automata for a given regular expression 18 th hours PPT+Blackboard 4. Conversion of regular expression to finite automata 19 th & 20 th hours Black board 5. pumping lemma 21 th & 22 th hours PPT+Blackboard 6. Closure properties 23 th hours Black board 7. Grammar 24 nd & 25 rd hours PPT+Blackboard 8. Equivalence between Regular Grammar and FA 26 th & 27 th hours PPT+Blackboard 9. Context Free grammar 28 th & 29 th hours PPT+Blackboard 10. Derivation and derivation trees 30 th & 31 th hours PPT+Blackboard Assignment 2 1. Define the Regular Expression. 2. Write the Identity Rules for RE 3. Construct the FA for the Regular Expression (a/b)*abb. 4. Obtain the minimized DFA for the RE (a/b)*abb. 5. Explain the Pumping Lemma for the regular sets. 6. What are the properties of regular sets. 7. Define the grammar and what are the types of grammars 8. Consider the grammar E->E + E E * E id. write the right-most derivation and left most derivation for the sentence id*id+id. UNIT : III Syllabus: Context Free Grammar, derivation trees, sentential forms, right most and left most derivations of strings. Ambiguity in Context free Grammars. Minimization of Context free grammars, CNF,

5 GNF, Pumping Lemma for Context Free Languages. Enumeration of properties of CFL (proofs omitted). 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 (proofs not required), Introduction to DCFL and DPDA. Learning Objectives: After completion of the unit, the student must able to: Know what is meant by ambiguity. Learn the Chomsky Normal forms Learn the Greiback Normal Forms Understand the pumping Lemma for CFG Learn the purpose of push down automata Understand the acceptance of CFL Understand the acceptance of finite state and empty state Gain the knowledge on CFL and PDA Lecture Plan S.No. Description of Topic No. of Hrs. Method of Teaching 1. Ambiguity in CFG 32 nd hour Black board 2. Minimization of CFG 33 rd &34 th hours Black board 3. CNF and GNF 35 th &36 th hour Black board +PPT 4. Pumping Lemma for CFG 37 th -38 th hour Black board +PPT 5. Properties of CFL 39 th hours Black board +PPT 6. Push down automata 40 st hours Black board +PPT 7. Acceptance of CFL 41 th &42 th hours PPT + Video 8. Acceptance by finite state and acceptance by empty 43 rd &44 th hours Black board + Notes state and its equivalence 9. Equivalence of CFL and PDA 45 th -47 th hours Black board + Notes Assignment 3 1. What is an ambiguity? 2. What does an ambiguity trouble in the CFG? 3. What are the techniques used to minimize the CFG 4. Explain the CNF and GNF with an example. 5. Explain the concept of push down automata 6. Write the push down automata to accept the language {ww* w ε {0, 1}}

6 7. Explain the equivalence of CFL and PDA. UNIT : IV Syllabus: Turing Machine: Definition, model, Design of TM, computable functions, recursively enumerable languages. Church s hypothesis, counter machine, types of Turing Machines (proofs not required) Learning Objectives: After completion of the unit, the student must able to: Learn the Turing machine design Usages of computation functions Learn recursively enumerable languages Understand the church s hypothesis. Understand the counter machines. Lecture Plan S. No. Description of Topic No. of Hrs. Method of Teaching 1. Turing machine 48 th & 49 th hours Black board +PPT 2. Design of Turing Machine 50 th 52 nd hours Black board +PPT 3. Recursively enumerable languages 53 rd hours Black board +PPT 4. Church s hypothesis 54 th hours Black board +PPT 5. Counter machine 55 th hours Black board+ppt 6. Types of Turing machines 56 th &57 th hours Black board +PPT Assignment 4 1. Solve the problem using the TM, [a n bc n /where n is an odd ] 2. Explain the steps required to design the TM. 3. Expalin the Counter machines with suitable example. UNIT : V Syllabus: Computability Theory: Linear Bounded Automata and context sensitive languages, LR (0) grammar, decidability of problems, Universal TM, Undecidable problems about Turing Machine Post s Correspondence Problem - The classes P and NP. Learning Objectives: After completion of the unit, the student must able to: Learn the concept on Chomsky hierarchy of languages Learn Context sensitive languages Work on the LR (0) grammars

7 Understand the P and NP problems Lecture Plan S. No. Description of Topic No. of Hrs. Method of Teaching 1. Chomsky hierarchy of languages 58 th hour Black board + PPT 2. Linear bounded automata and context sensitive languages 59 th hours PPT + Blackboard 3. LR (0) grammar 60 th &61 th hours Black board + notes 4. Decidability of problems 62 th &63 rd hours Black board + PPT 5. Universal TM, undesirability of posts 64 th hours Black board + PPT 6. P and NP problems, NP complete and NP hard 65 th - 67 th hours Black board + PPT problems Assignment Explain the Chomsky hierarchy of languages 2. What is meant by linear bounded automata? 3. Define LR (0) grammar? Write canonical collection of LR (0) items for the arithmetic grammar. 4. Explain the difference between LR (0) and LR (1) items 5. Explain the Universal TM 6. Explain the P and NP problems TEXT BOOKS 1. Introduction to Automata Theory, Languages and Computations, H.E.Hopcroft, R. Motwani and J.D.Ullman, Second,Pearson Education, Introduction to theory of computation,micheal Sipser, Thomson Brokecole,1997 REFERENCES 1. Elements of the theory of computation, H.R.Lewis and C.H.papadimitriou,Second Edition, Pearson Education/PHI, Formal Languages and automata Theory, K.V.N.Sunitha and N.Kalyani TMH,2010.

8 VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY (Autonomous) DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING II B. Tech, II nd Semester (Computer Science and Engineering) Subject : Database Management Systems Subject Code : 5CS05 Academic Year : Number of working days : 90 Number of Hours / week : 3+0 Total number of periods planned: 69 Faculty Members: Dr.C.Kiranmai,D.N.Vasundhara,G.S.Ramesh,N.Subhashini Course Objectives: Introduction of Data Base Management concepts and to give the description of structure of Data Base systems. Understand concepts of ER model and model the data base for the given scenarios and prepare the database through normalization. Know the features of various models of data and query representations. Introduce the concepts and protocols related to transaction management and understand the concepts of data storage Course Outcomes: After completion of the course the student is able to 1. Appreciate and effectively explain the underlying concepts of database system architecture and technologies 2. Design and develop database schema for a given scenario using ER model and normalization. 3. Devise queries using relational algebra, Relational Calculus and SQL 4. Summarize the concepts of transaction processing, concurrency control, recovery and data storage techniques. Syllabus: UNIT : I Introduction to Databases and Database Management System - Database system Applications - Advantages of DBMS over File System - Data Models Instances and schema - View of Data - Database Languages -DDL-DML - Database Users and Administrator - Database System Structure.. Learning Objectives: After completion of the unit, the student must able to: At the end of this unit students will be able to define key terms like Database, Database Management Systems(DBMS) Students will be able to compare and contrast Database System and File System Able to define and describe view of data, database languages, data models Able to understand the role of database users and administrators. Can explain the database system structure. Lecture Plan

9 S.No. Description of Topic No. of Hrs. Method of Teaching 1 st hour BB 1. Introduction to Databases and Database Management System, Database system Applications 2. Advantages of DBMS over File System 2 nd hour BB 3. Data Models 3 rd hour PPT, VIDEO 4. Instances and schema, View of Data 4 th hour 5. Database Languages -DDL-DML, Database Users and 5 th hour PPT, VIDEO Administrator 6. Database System Structure 6 th hour PPT, VIDEO Assignment 1. Draw the architecture of a DBMS and explain the functionality of each Component. 2. What is DBMS? What are the advantages of DBMS over a File System? What are the various applications of DBMS? 3. What are the types of languages a database system provides? Explain. 4. Explain the 3 levels of Data Abstraction. 5 Explain about various database users? 6 Explain the roles and responsibilities of DBA? 7 What is a data model? List and explain various data models. Syllabus: UNIT : II Relationship Sets Constraints - Keys - Design Issues - Entity-Relationship Diagram- Weak Entity Sets - Extended E-R Features- Database Design with ER model - Database Design for Banking Enterprise Database Design and ER diagrams Attributes and Entity Sets Relationships and Relationships Sets Learning Objectives: After completion of the unit, the student must able to: Lecture Plan Distinguish Attributes and Entity Sets Differentiate Relationships and Relationship Sets Get to additional features of ER Models Reduce ER-diagrams to tables Generalize Database Design for Large Enterprises S.No. Description of Topic No. of Hrs. Method of Teaching 1. Database Design and ER diagrams 7 th hour PPT 2. Attributes and Entity Sets 8 th hour BB 3. Relationships and Relationship Sets, Constraints - 9 th hour BB Keys 4. Design Issues 10 th hour BB 5. Entity-Relationship Diagram, Weak Entity Sets 11 th hour BB 6. Extended E-R Features 12 th hour BB

10 7. Database Design with ER model 13 th hour PPT, VIDEO 8. Database Design for Banking Enterprise 14 th hour PPT, VIDEO Assignment 1. Explain the following a)specialization b) generalization c) aggregation d) total participation e) partial participation 2. Explain the E-R diagram components and notaions with their extended features. 3. What is an ER model? Explain in detail how will you convert the given ER model into Tables. 4. Construct an E-R diagram for a car insurance company with a set of customers, each of whom owns a number of cars. Each car has a number of recorded accidents associate with it. Determine the entities and relationships that exists between the entities. Also construct the tabular representation of the entities and relationships. 5. Explain the following terms: a) Relation Instance b) Composite attribute c) Multivalued attribute d) Descriptive attribute e) Derived attribute f) Simple attributes g) Composite attributes h) Entity set i) Entity Set j) Relationship k) Relationship set l) Degree of a relationship m) weak entity set n)strong entity set o) discriminator p) partial key q) cardinality ratio r) Super key s) candidate key t) primary key Syllabus: UNIT : III Introduction to the Relational Model Structure of RDBMS - Integrity Constraints over Relations Enforcing Integrity Constraints Querying Relational Data - Relational Algebra and Calculus. Introduction to SQL- Data Definition commands, Data Manipulation Commands, Basic Structure, Set operations Aggregate Operations - Join operations - Sub queries and correlated queries, SQL functions, views,triggers, Embedded SQL Learning Objectives: After completion of the unit, the student must able to: Lecture Plan Introduce Relational Model, queries on relations, relational algebra Demonstrate Integrity Constraints over relations and SQL triggers Classify Relational Algebra operations Describe Relational Calculus, NULL values Specify writing basic SQL Query and aggregate operators Discuss basic SQL queries and outer joins Distinguish Nested Queries and Correlated Nested Queries Categorize Logical Connectivity s AND, OR and NOT S.No. Description of Topic No. of Hrs. Method of Teaching 15 th hour BB 1. Introduction to the Relational Model, Structure of RDBMS

11 2. Integrity Constraints over Relations, Enforcing Integrity Constraints 16 th hour PPT, VIDEO 3. Querying Relational Data 17 th hour BB 4. Relational Algebra and Calculus 18 th & 19 th PPT, VIDEO hours 5. Introduction to SQL 20th hour BB 6. Data Definition commands 21 st hour BB 7. Data Manipulation Commands 22 nd hour BB 8. Basic Structure 23 rd hour BB 9. Set operations and Aggregate Operations 24 th & 25 th BB hours 10. Join operations 26 rd hour BB 11. Sub queries and correlated queries 27 th & 28 th BB hours 12. SQL functions 29 th hour BB 13. views,triggers, Embedded SQL 30 th &31 st hours PPT,VIDEO Assignment 1.. Explain the features of relational model with examples. 2. What is meant by Integrity constraint? why do you want to enforce integrity constraints into your database. Explain various Integrity constraints. 3. Explain the following terms: a) Relation Instance b) Relation Schema c) Tuple relational calculus d) Domain relation calculus 4. List and explain the various operations of relational algebra. 5. Diffentiate relational calculus, relational algebra and domain relational calculus? 6. Consider the following database. Employee (employee-name, street, city) Works (employee-name, company-name, salary) Company (company-name, city) Manager (employee-name, manager-name) Give an expression in the relational algebra, the tuple relational calculus, and the domain relational calculus, for the following query. Find the names of all employees who work for estate bank. 7..Consider the following schema for a COMPANY database Employee (Name, SSN, Address, Sex, Salary, Dnumber) Department (Dname, Dnumber, MGRSSN, MGRSTART date) Dept-locations (Dnumber, Dlocations) Project (Pname, Pnumber, Plocation, Dnumber) Works-on (ESSN, Pnumber, Hours) Dependent (ESSN, Dependent-name, Sex, Bdate, Relationship) Write the queries in Relational Algebra to i. Retrieve all employees who either work in department 4 and make over 25,000 per year or work in department 5 and make over 30,000 ii. Retrieve the Social Security numbers of all employees who either work in department 5 or directly supervise a employee who works in department5. iii. Retrieve the name and address of all employees who work for the Research department iv. List all the projects on which employee Smith is working. 8 Explain nested queries giving examples? 9 Define SQL and state the differences between SQL and other conventional programming Languages 10 Distinguish between nested queries and correlated nested queries.

12 11 Explain about NULL values. 12 Explain various aggregate operators in SQL with examples 13 Write a short notes on database triggers. 14 Explain GROUP BY and GROUP-BY HAVING clause. 15 State the difference between a "where" clause and a "having" clause Syllabus: UNIT : IV Functional Dependencies Introduction, Basic Definitions, Trivial and Non trivial dependencies, closure of a set of dependencies, closure of attributes, irreducible set of dependencies-troduction, Basic Definitions, Trivial and Non trivial dependencies, closure of a set of dependencies, closure of att Schema Refinement in Database Design- Problems Caused by Redundancy Decompositions Problem Related to Decomposition - Lossless Join Decomposition Dependency Preserving Decomposition - FIRST, SECOND, THIRD Normal Forms BCNF Multivalued Dependencies Fourth Normal Form. Learning Objectives: After completion of the unit, the student must able to: Lecture Plan Explain functional dependencies Properties of dependencies Describe Schema Refinement, 1NF, 2NF,3NF,BCNF and Multivalued Dependencies, 4NF Illustrate Problems Caused by Redundancy Explain Decompositions in relations, Identify Problems related to Decomposition Compare and Contrast 3NF and BCNF Illustrate Schema Refinement in Database Design S. No. Description of Topic No. of Hrs. Method of Teaching 1. Functional Dependencies Introduction 32 nd hour PPT 2. Basic Definitions 33 rd hour PPT 3. Trivial and Non trivial dependencies 34 th hour BB 4. closure of a set of dependencies 35 th & 36 st hours BB 5. closure of attributes 37 th hour BB 6. irreducible set of dependencies 38 th hour BB 7. Schema Refinement in Database Design 39 th hour PPT 8. Problems Caused by Redundancy 40 th hour BB 9. Decompositions Problem Related to 41 st hour BB Decomposition, Lossless Join Decomposition 10. Dependency Preserving Decomposition 42 nd hour BB 11. FIRST, SECOND, THIRD Normal Forms 43 rd 44 th & 45 th PPT hour 12. BCNF 46 th hour PPT

13 13. Multivalued Dependencies Fourth Normal Form 47 th hour BB Assignment 1. Define the following terms: a) Relation schema b) Redundancy c) Decomposition d) Normalization e) Normal Forms f) Functional Dependency 2. Explain Armstrong axioms of Functional dependencies. 3. Explain 1NF,2NF,3NF,BCNF with a suitable example.what are the advantages of normalized relations over the unnormalized relations? 4. How does BCNF differ from 3NF.Explain with examples. 5. Explain 4NF with an example. Why is it useful? 6. What is dependency preservation property for decomposition? Explain why is it important. 7. Define MVD? Is the decomposition in 4NF always dependency preserving and lossless? Justify your answer with the help of an example. 8. Consider the relation scheme Emp Dept( Ename, SSN, Bdate, Address, Dnumber, Dname, DMGRSSN) and the following set of FD s F={ SSN > Ename,Bdate, Address, Dnumber Dnumber > Dname, DMGRSSN} Calculate the closer {SSN}+ and {Dnumber}+ with respect to F. 9. Consider the relation R(A,B,C,D,E,F) and FD s A -> BC F -> A C ->A D ->E E -> D is the decomposition of R into R1 (A,C,D), R2 (B,C,D) and R3 (E,F,D) loss less? Explain the requirement of loss less decomposition. Syllabus: UNIT : V Transaction concept- Transaction state- Implementation of atomicity and Durability- Concurrent executions Serializability, Recoverability.Lock Based Protocols, Timestamp Based Protocols, Validation Based Protocols, Multiple Granularity, Dead Lock Handling Failure Classification Storage Structure - Recovery and Atomicity- Log Based recovery Recovery with concurrent transactions Checkpoints. File Organization Organization of records in file - Data Dictionary Storage Indexing and Hashing Basic Concepts, Ordered Indices,B+Tree Index files, B- tree index files Static Hashing Dynamic Hashing Comparison of Indexing with Hashing Learning Objectives: After completion of the unit, the student must able to: Discriminate ACID properties Define a Transaction, LOG Explain Lock based concurrency control Describe locking protocols, File Organization, Indexing, Differentiate Log based recovery mechanisms

14 Lecture Plan Determine Data storage on external storage Distinguish Indexing Techniques Describe hash Based Indexing and Tree based Indexing Compare and Contrast File Organization Techniques S. No. Description of Topic No. of Hrs. Method of Teaching 1. Transaction concept, Transaction state 48 th hour BB 2. Implementation of atomicity and Durability 49 th hour BB 3. Concurrent executions 50 th hour BB 4. Serializability 51 st & 52 nd hours PPT 5. Recoverability 53 rd hour PPT 6. Lock Based Protocols 54 th hour PPT 7. Timestamp Based Protocols 55 th hour PPT 8. Validation Based Protocols, Multiple Granularity 56 th hour PPT 9. Dead Lock Handling 57 th hour PPT 10. Failure Classification, Storage Structure 58 th hour PPT 11. Recovery and Atomicity 59 th hour PPT 12. Log Based recovery 60 th hour PPT 13. Recovery with concurrent transactions, Checkpoints 61 st hour PPT 14. File Organization, Organization of records in file, 62 nd & 63 rd hours PPT Data Dictionary Storage 15. Indexing and Hashing - Basic Concepts 64 th hour PPT 16. Ordered Indices 65 th hour PPT 17. B + Tree Index files 66 th hour PPT 18. B- tree index files 67 th hour PPT 19. Static Hashing 68 th hour PPT 69 th hour PPT 20. Dynamic Hashing, Comparison of Indexing with Hashing Assignment 1. What is meant by the concurrent execution of database transactions in a multiuser system. Discuss why concurrency control is needed. Give informal example. 2. Define the concept of schedule for a set of concurrent transaction. Give a suitable example. 3 Explain two phase locking Protocol and how does it ensure conflict serializability. 2. Explain various locking protocols. 3. Write the locking compatibility matrix used for multiple granularity? Explain with suitable example 4. How is the recovery manager is responsible for transaction atomicity and durability. Explain 5. How is the lock-based concurrency control performance measured. 6. Compare the two log based recovery schemes in terms of implementation and overhead cost. 7. Explain the purpose of check point mechanism. How often should a database management system do a check point.

15 8. What are the merits and demerits of using Fuzzy dumps for media recovery. 9. What are the typical kinds of records in a system log? what are the transaction commit points and why are they important? 10. Describe three popular file organization techniques on disks and compare them 11. Explain all the operations on B+ tree by taking a sample example. 14. Compare and contrast static hashing and dynamic hashing. 15 Explain various page & record formats with suitable examples. 16 Describe an algorithm to 1. Insert an element into a B-Tree 2. Remove an element from a B-Tree EXTRA TOPICS S.No Description Unit 1. Data Control Statements - DCL I 2. Views Materialized Views 3 3. CURSORS 3 4. Join Dependencies Fifth Normal Form 4 5. Domain Key Normal form (DKNF) 4 TEXT BOOKS: 1. Database System Concepts, Silberschatz, Korth, Sudarshan,Seventh Edition, McGraw hill (1, 2, 3 & 5 Units). 2. Introduction to Database Systems, C.J.Date, Pearson Education (4 th Unit)\ REFERENCES: 1. Database Management Systems, Raghu ramakrishnan, Johannes Gehrke, TATA Mc Graw Hill. 2. Fundamentals of Database Systems, Elmasri Navrate Pearson Education Data base Systems design, Implementation, and Management, Peter Rob & Carlos Coronel 7th Edition. 3. Fundamentals of Database Systems, Elmasri Navrate Pearson Education

16 Computer Organization UNIT I BASIC STRUCTURE OF COMPUTERS: Computer Types, functional unit, basic operational concepts, bus structures, multi processors and multi computers, multi tasking. Register Transfer Language and Micro Operations: Register Transfer Language, Register Transfer, Arithmetic Micro Operations, Logic Micro operations, Shift Micro Operations, Arithmetic Logic shift Unit. Objectives: At the end of this unit the student will be able to know The Basic structure of Computers Various types of computers, bus structures. Basics of Register Transfer Language Various Micro Operations. The functionality of Arithmetic Logic shift Unit. Lecture Plan: S.No Topic No. Of Classes 1 Computer Types, functional unit, basic operational concepts 2 2 bus structures 1 3 multi processors and multi computers, multi tasking 2 4 Register Transfer Language 1 5 Arithmetic Micro Operations 1 6 Logic Micro operations, 1 7 Shift Micro Operations 1 8 Arithmetic Logic shift Unit. 1 9 Total classes 10 Assignment-I 1) What are functional units? Discuss the basic functional units of a computer? 2) With a neat diagram explain the basic operational concepts of computer? 3) a) Explain various types of buses? b) Discuss the functions of system software? 4) Discuss and differentiate multi computers and multi processors. 5) Explain the different types of data representation? 6) Explain with example the implementation of register transfer 7) Discuss in detail about various arithmetic operations. 8) Explain the following operations in detail a) Basic micro operations. b) Arithmetic shift. c) Circular shift. d) Rotate shift.

17 UNIT II BASIC COMPUTER ORGANIZATION AND DESIGN: Instructions codes, Computer Registers, computer instructions- instruction cycle, memory reference instructions, input-output and interrupt. Central Processing unit: Stack organization, instruction formats, addressing modes, data transfer and manipulation, program control, CISC, RISC Objectives: At the end of this unit the student will be able to Understand the instruction codes and various computer Registers Understand the instruction cycle How to write computer instructions To write memory reference instructions Understand input-output and How to handle interrupts Organization of a Stack Understand various instruction formats and addressing modes Understand the data transfer and manipulation Know the architectures of CISC and RISC Lecture Plan: S.No Topic No. Of Classes 1 Instruction Codes 1 2 Computer Registers 1 3 Computer instructions 1 4 Instruction cycle 1 5 Memory reference instructions 1 6 Input-Output 1 7 Interrupts 1 8 Stack organization 1 9 Instruction formats 1 10 Addressing modes 2 11 Data transfer and Manipulation 2 12 CISC and RISC 2 Total classes 15 Assignment-II 1) What is an instruction code? Explain in detail various addressing modes. 2) Explain the instruction cycle with a neat flow chart. 3) Explain the data transfer and manipulation instructions. 4) Define interrupt? Explain the types of interrupts.

18 5) Define and discuss the types of registers.. UNIT III Micro Programmed Control: Control memory, Address sequencing, microprogram example, design of control unit Hard wired control. Microprogrammed control The Memory Organization: Memory Hierarchy, Main Memory, Cache memory, performance considerations, Virtual memory, secondary storage Objectives: This unit enables the students to Understand memory control To how to calculate the addresses Understand a microprogram To how to designing a control unit Understand the hard wired control Know the levels of memory hierarchy Know Various memories like main and cache Understand the performance considerations, Understand the Virtual memory, secondary storage Lecture Plan: S.No Topic No. Of Classes 1 Control memory, Address sequencing 2 2 microprogram example 1 3 design of control unit 2 4 Hard wired control. Microprogrammed control 3 5 Memory Hierarchy 1 6 Main Memory, Cache memory 2 7 performance considerations 1 8 Virtual memory, secondary storage 2 Total classes 14 Assignment-III 1) Explain with neat diagram, the address selection for control memory. 2) Explain the design of control unit. 3) Define and discuss the differences between hardwired control unit and micro programmed control unit 4) Define the Static RAM (SRAM). Explain the working of SRAM cell with a neat diagram. 5) Define the Dynamic RAM (DRAM). Explain the working of DRAM with a neat diagram. 6) Define the Read Only Memory. Explain in detail the types of ROM s 7) Define and discuss the types of replacement algorithms. 8) Define Virtual Memory. Explain the process of converting virtual addresses to physical addresses with a neat diagram.

19 9) Explain the following secondary storage devices a) Magnetic disk. b) Magnetic tape. UNIT IV COMPUTER ARITHMETIC : Addition and subtraction, multiplication Algorithms, Division Algorithms, Floating point Arithmetic operations. Decimal Arithmetic unit Decimal Arithmetic operations. INPUT-OUTPUT ORGANIZATION : Peripheral Devices, Input-Output Interface, Asynchronous data transfer Modes of Transfer, Priority Interrupt Direct memory Access. Objectives: At the end of this unit the student will be able to Know how to do Additions, subtractions, multiplications and divisions using algorithms Do all the Floating-point Arithmetic operations. Do decimal Arithmetic unit Decimal Arithmetic operations. Understand the various Peripheral Devices, Input-Output Interface, Know the Asynchronous data transfer and Modes of Transfer. To understand the concept of Priority Interrupt and Direct memory Access Lecture Plan: S.No Topic No. Of Classes 1 Addition and subtraction, 2 2 multiplication Algorithms, 2 3 Division Algorithms 2 4 Floating point Arithmetic operations 2 5 Decimal Arithmetic unit Decimal Arithmetic operations. 2 6 Peripheral Devices, Input-Output Interface 2 7 Asynchronous data transfer 1 8 Modes of Transfer 1 9 Priority Interrupt 1 10 Direct memory Access 1 Total classes 16 Assignment-IV 1) Explain the Addition and subtraction algorithms with a example 2) Discuss in detail the division algorithm. 3) Explain the decimal Arithmetic unit 4) Explain about asynchronous data transfer and asynchronous communication interface. 5) Explain about modes of transfer. 6) Explain about interrupt priorities. 7) Explain about DMA in detail. UNIT V

20 PIPELINE AND VECTOR PROCESSING : Parallel Processing, Pipelining, Arithmetic Pipeline, Instruction Pipeline, RISC Pipeline Vector Processing, Array Processors. Objectives: At the end of this unit the student will be able to Know the concept of Parallel Processing Understand what is Pipelining Know what is Arithmetic pipelining and how to implement it Understand what is Instruction pipelining Understand the RISC Pipeline Know the Vector processing Understand various Array Processors. Lecture Plan: S.No Topic No. Of Classes 1 Parallel Processing 1 2 Pipelining, 1 3 Arithmetic Pipeline 2 4 Instruction Pipeline 1 5 RISC Pipeline 2 6 Vector Processing 1 7 Array Processors 2 Total classes 10 Assignment-V 1) Explain the Flynn s classification to accomplish parallel processing. 2) a) Define pipelining? Explain the structure of pipelining with an example. b) Explaining the implementation of four stage pipelining. 3) List out the limitations of instruction pipeline. 4) List out the advantages of RISC and CISC 5) Define vector processing. Explain the characteristics of vector processing. 6) Explain the instruction format of vector processor. 7) What is array processor? Explain the two categories of array processor

21 Design & Analysis of Algorithms (DAA) UNIT I Introduction: Algorithms, Pseudo code for expressing algorithms, Performance Analysis Space complexity, Time Complexity, Asymptotic Notation- Big oh Notation, Omega Notation, Theta Notation. Disjoint Sets- Disjoint set operations, union and find algorithms, spanning trees, connected components and biconnected components. Objectives: At the end of this unit the student will be able to know Learn about Pseudo code for expressing algorithms. Analyze the Performance Analysis. Become familiar with Space complexity, Time complexity. Learning Different Asymptotic Notations. Understand the Probabilistic analysis. Learn Amortized analysis. Lecture Plan: S.No Topic No. Of Classes 1 Algorithms, Pseudo code for expressing algorithms 2 2 Performance Analysis Space complexity, Time Complexity, 3 3 Asymptotic Notation- Big oh Notation, Omega Notation, Theta 3 Notation 4 Disjoint set operations, union and find algorithms 2 5 spanning trees 2 6 connected components and biconnected components. 3 Total classes 15 Assignment-I 9) Write an algorithm in pseudo code to count the number of Lower case letters in a file of text. How many comparisons does it do? What is least number of increments it might do? Assume that N is number of characters in a file. Determine its time complexity using step count method? 10) Compare Big-oh notation and Little-oh notation. Illustrate with an example. 11) Find Big-oh notation and Little-oh notation for f(n) = 7n n ) Solve the recurrence relation of formula T (n) = g(n) n is small T(n) = 2T (n/2) + f (n), otherwise when i) g(n) = O(1) and f(n) =O(n); ii) g(n) = O(1) and f(n) = O(1). 13) Explain the performance analysis of an algorithm. 14) Write an algorithm for recursive binary search?

22 UNIT II Divide and Conquer: General method, application-binary search, Quick sort, Merge sort, Strassen s matrix multiplication. Greedy method: General method, applications- job sequencing with deadlines, 0/1 Knapsack problem, minimum cost spanning trees, Single source shortest path problem, Huffman Codes. Objectives: At the end of this unit the student will be able to Analyze the divide and conquer method. Understand the Binary Search. Understand the Quick Sort, merge sort. Understand the Strassen s matrix multiplication. Analyze the Greedy method. Understand the job sequencing with dead lines. Understand the 0/1 Knapsack problem. Understand the minimum cost spanning trees, Understand the Single source shortest path problem Lecture Plan: S.No Topic No. Of Classes 1 General method 1 2 Binary search 1 3 Quick sort 2 4 Merge sort 2 5 Strassen s matrix multiplication 1 6 General method 1 7 job sequencing with deadlines 2 8 0/1 Knapsack problem 2 9 Single source shortest path problem 1 10 Huffman Codes. 2 Total Classes 15 Assignment-II 1. Explain Binary search with example. 2. Explain Quick sort with example. 3. Explain Merge sort with example. 4. Explain Strassen s matrix multiplication with example 5. Show how quick sort sorts the following sequences of keys in ascending order. 12, 25, 35, 43, 48, 59, 77, 85, 86, 94? 6. Discuss the time complexity of the quick sort algorithm for the above case? 7. Explain the control abstraction of Greedy method compare this with Dynamic programming.

23 8. WriteKruskals algorithm that generates minimum spanning tree for every connected undirected graph. 9. Two sets S1 and S2 are given as below a. S1={1,2,4,6} and S2 ={7,8} 1. Draw disjoint sets S1 and S2 using Trees 2. Draw disjoint sets S3 using Trees such that S3=S1 U S2 3. Draw disjoint sets S4 using Trees such that S4=S2 U S1 4. Give Pointer representation of S1, S2, S3 and S Discuss Control abstraction for divide and conquer strategy. 11. By applying Divide and Conquer strategy, write a recursive algorithm for finding the maximum and the minimum element from a list. 12. Find the feasible solution for job sequencing with deadlines for the instance n=5, (P1,,P5)=( 20, 15, 10, 5, 1) and (d1,,d5)= (2,2,1,3,3). 13. Explain the 0/1 knapsack problem algorithm with Greedy concept. UNIT III Dynamic Programming: General method, Principle of optimality, applications Multi stage graphs, Matrix chain multiplication, Optimal binary search trees,0/1 knapsack problem, all pair shortest path problem, Traveling sales person problem, reliability design. Objectives: This unit enables the students to Analyze the Dynamic Programming method. Learn applications. Understand the Matrix chain multiplication. Understand the Optimal binary search trees. Understand the 0/1 knapsack problem, Understand the all pair shortest path problem Understand the. Traveling sales person problem Understand the reliability design Lecture Plan: S.No Topic No. Of Classes 1 General method 2 2 Principle of optimality 1 3 Multi stage graphs 2 4 Matrix chain multiplication 2 5 Optimal binary search trees 2 6 0/1 knapsack problem 2 7 All pair shortest path problem 2 8 Traveling sales person problem, Reliability design. 2 Total classes 15 Assignment-III 1. Write about Matrix chain multiplication. 2. Explain Optimal binary search trees.

24 3. Write about all pair shortest path problem 4. The edge length of a directed graph are given by the below matrix. Using the 5. Traveling salesperson algorithm, calculate the optimal tour. a b c d e Design a three stage system with device types D1, D2, D3. The costs are Rs.30, Rs.15 and Rs.20 respectively. The cost of the system is to be not more than Rs.105. The reliability of each device type is 0.9, 0.8 and 0.5 respectively. 7. What do you mean by forward and backward approach of problem solving in Dynamic programming? 8. Define merging and purging rules in 0/1 Knapsack problem. 9. Consider n=4 and (q 1, q 2, q 3, q 4 ) = (do, if, int, while) the values for P s and q s are given as P(1:4) = (3, 3, 1, 1) and q(0:4) = (2, 3, 1, 1, 1). Construct the optimal binary search tree. 10. Compare and contrast between fixed and variable tuple size formulation and illustrate it for the following sum of subset problem given below. 11. Let w = {7; 4; 10; 23; 35; 20; 32} and m=55. Find all possible subsets of w that sum to m. Draw the portion of the state space tree that is generated. UNIT IV Backtracking: General method, applications- Recursive Permutation Generator, N-queen problem, sum of subsets problem, graph coloring, Hamiltonian cycles. Objectives: At the end of this unit the student will be able to Understand the concepts of Backtracking: General method Become familiar with the application-n-queen problem. Analyze sum of subsets problem. Understand the AND graph coloring, Hamiltonian cycles. Lecture Plan: S.No Topic No. Of Classes 1 General method 2 2 Recursive Permutation Generator 2 3 N-queen problem 2 4 Sum of subsets problem 2 5 Graph coloring, 2 6 Hamiltonian cycles 2 Total classes 12

25 Assignment-IV 1. Explain the 4-Queen problem using backtracking? 2. Draw the permutation tree by taking implicit constraint, explicit constraint and bounding functions? 3. Describe the Backtracking technique to m-coloring graph. Explain with an example. 4. Draw the portion of the state space tree for m-colorings of a graph. 5. Explain Application-n-queen problem. 6. Explain graph coloring, Hamiltonian cycles UNIT V Branch and Bound: General method, applications-traveling sales man problem, 0/1 kanpsack problem, L C Branch and bound solution, FIFO Branch and bound solution NP-hard and NP-complete problem: Basic concepts, non deterministic algorithms, NP-hard and NP-Complete classes Cook s Thorem.. Objectives: At the end of this unit the student will be able to Understand the concepts of Branch and Bound: General method Become familiar with the Traveling sales man problem. Analyze 0/1 kanpsack problem. Understand the L C Branch and bound solution, FIFO Branch and bound solution. Understand the concepts of NP-hard and NP-complete problem Become familiar with the non deterministic algorithms. Analyze NP-hard and NP-Complete classes. Lecture Plan: S.No Topic No. Of Classes 1 General method 1 2 Traveling sales man problem 2 3 0/1 kanpsack problem 2 4 L C Branch and bound solution 2 5 FIFO Branch and bound solution 2 6 Non deterministic algorithms, 2 7 NP-hard, NP-Complete classes Cook s Thorem. 2 Total classes 13 Assignment-V 1. Write short notes on Cook s theorem. 2. Explain about different types of NP problem. 3. Explain the P, NP, NP-Hard and NP- complete classes? Give relationship between them? 4. Briefly explain the concepts of the NP-Hard and NP-Complete? 5. Explain non deterministic algorithms? Give some examples? 6. Describe the Traveling Salesperson Problem in Branch & Bound. 7. Explain the principles of FIFO & LC Branch & Bound? 8. What are differences between NP-Hard and NP-Complete classes? 9. Write the control abstraction of LC search

26 Academic Plan UNIT-I:-SYLLABUS INTRODUCTION TO SOFTWARE ENGINEERING:- Changing nature of Software, Software Myths. A GENERIC VIEW OF PROCESS:- Software engineering- A layered technology, The Capability Maturity Model Integration (CMMI). PROCESS MODELS:- The water fall model, Incremental process models, evolutionary process models, the unified process. LEARNING OBJECTIVES:- At the end of unit I Student must be able to State the objective of software engineering, discipline of software engineering List the major differences between the exploratory style and modern software development practices. Describe layered technology software engineering.. Is it difficult to accurately quantify the reliability of a software product it important for a software development organization to obtain ISO 9001 certification Discuss the relative merits of SEI-CMM based evaluation. Discuss the Process Patterns, Process Assessments. LECTURE PLAN ( 8 PERIODS ) Introduction to software engineering Changing Nature of software Software Myths, Layered Technology Process Frame work The Capability Maturity Model Integration (CMMI), Process Patterns Process Assessments, Personal And Team Process Models. The water fall model Incremental process models, evolutionary process models The unified process ASSIGNMENT-I :- 1. Discuss the attributes of good software. 2. How process models are useful. 3. Compare and contrast Personal and team process Model 4. Expalin about software development life cycle

27 5. Explain Unified process model. UNIT-II:-SYLLABUS SOFTWARE REQUIREMENTS:-Functional and non functional requirements, User requirements, System requirements, Interface specification, the software requirements document. REQUIREMENTS ENGINEERING PROCESS: Feasibility studies, requirements elicitation and analysis, requirements validation, requirements management LEARNING OBJECTIVES:- At the end of unit II Student must be able to Explain the importance of Software development life cycle. What are the major phases in the waterfall model of software development Which phase consumes the maximum effort for developing a typical software product Explain how a software development effort is initiated and finally terminated in the spiral model. What are the major advantages of first developing the prototype of a system Discuss the relative advantages of formal and informal Requirements specifications. List five desirable characteristics of good SRS (Software Requirement Specification) List the important issues which an SRS document must address analyze feasibility studies define principle requirements and their relationships describe requirements elicitation and analysis Comprehend requirements validation LECTURE PLAN (8 PERIODS) The water fall model Incremental process models, evolutionary process models The unified process Interface Types specification of requirements, like Functional and non functional requirements etc. software requirements document Feasibility studies, requirements elicitation and analysis requirements validation, requirements management ASSIGNMENT-II:- 1. Requirements gathering of one web based project. 2. Recommend the life cycle model (waterfall or evolutionary) for the following software systems. (a) Enterprise Software (b) Management Information Systems. 3. What is system requirements? How would you specify them? 4. What is non-functional requirements? Explain the classification of

28 different types of it? 6. List three major short comings that we might face, if we use the classical waterfall model for developing all types of software products. 7. What is requirements validation? Explain different requirements validation techniques. 8. Discuss an example of a type of system where social and political factors might strongly influence the system requirements. 9. Suggest who might be the stakeholders in a university students records system. Explain why it is almost inevitable that the requirements of different stakeholders will conflict in some way. UNIT III System models: Context models, behavior models, data models, object models, structured methods Design engineering: design process and design quality, design concepts the design model Creating an architectural design: software architecture, data design, architectural styles and patterns, architectural design LEARNING OBJECTIVES:- Explain why it is important to establish the boundaries of a system and model its context compare the concepts of behavioral, data and object modeling define design process state characteristics of good design assess design quality with its attributes explain design concepts identify four major elements in design model and discuss recognize the dimensions of design model Express what is s/w architecture and why it is important compare data design at architectural level and component level Categorize different architectural styles and patterns identify archetypes of architectural design demonstrate architectural design LECTURE PLAN (15 PERIODS) Context, Behavioral models Data Models Object models, Structured methods. Design process and design Quality Design Concepts Design model Software Architecture Data Design Architectural styles and patterns Architectural Design

29 Assignment-III 1. Using your knowledge of how an ATM is used,develop a set of use cases that could serve as basis for understanding the requirements for an ATM system 2. Who should be involved in a requirements review?draw a process model showing how a requirements review might be organized? 3. What is software architecture? Why is it important? 4. Define data design. Discuss about data design at architectural level 5. How do we assess the quality of s/w design 6. Discuss the relationship between the concept of information hiding as an attribute of effective modularity and the concept module independence 7. What is meant by Layered architecture? Give an example. 8. What is architectural style? Discuss various categories of it. UNIT IV SYLLABUS Test Strategies: A strategic approach to software testing, Black box and White box Testing, Validation Testing, System Testing, Product Metrics, Software Quality, Metrics for analysis model, Metrics for design model, Metrics for source code, Metrics for testing, Metrics for maintenance, Metrics for process and products,software measurement, Metrics for software quality LEARNING OBJECTIVES:- After completing the above syllabus the student will be able to: Importance of testing in software industry. List the strategic approaches to software testing Cite the test strategies for conventional software Compare and contrast black box and white box testing Explain the steps involved in white box and black box testing Compare and contrast validation and system testing Explain the art of debugging Define what is software quality Compare and contrast metrics for analysis,design, testing and maintenance Lesson Plan (8 periods) A strategic approach to software testing Test strategies for conventional software Black box and White box Testing Validation Testing System Testing Unit Testing Integration Testing Software Quality Metrics for analysis model Metrics for design model Metrics for source code Metrics for testing Metrics for