This action might not be possible to undo. Are you sure you want to continue?
TECHNICAL UNIVERSITY LUCKNOW
Computer Science & Engineering
2nd Year (III & IV Sem.)
[Effective from Session 2009-10]
Course Code SUBJECT 1. LUCKNOW STUDY & EVALUATION SCHEME B. ECS-301 EAS-301 EHU-301/ EHU-302 ECS-302 ECS-303 ECS-304 IT Infrastructure and its Management EHU-111 *Human Values & Professional Ethics PRACTICAL/DESIGN/DRAWING ECS-351 ECS-352 ECS-353 GP-301 Logic Design Lab Data structures Lab Numerical Techniques General Proficiency Total 8. Students will be required to audit it with in the period of their study. 0 0 0 17 0 0 0 5 2 2 2 6 10 10 5 - 10 10 5 - 20 20 10 50 - 30 30 15 - 50 50 25 50 1000 1 1 1 1 26 *Human values & Professional Ethics will be offered as a compulsory audit course for which passing marks are 40% in theory & 50% in aggregate. 10. 6.U. ESE CT TA Total 30 30 15 30 30 30 15 20 20 10 20 20 20 10 50 50 25 50 50 50 25 100 100 50 100 100 100 50 Credits Subject Total 150 150 75 150 150 150 75 4 4 2 4 4 4 S. 4. 11. 7. Computer Science & Engineering [Effective From session 2009-10] YEAR II. No. 5. There will not carry over facility for this course and the failure student will be required to repeat this course (in next-semester). Tech.P. TECHNICAL UNIVERSITY. 9. (2) . SEMESTER-III PERIODS L THEORY Digital Logic Design Mathematics-III Industrial Psychology/ Industrial Sociology Data Structures Using C Discrete Mathematical Structures 3 3 2 3 3 3 2 T 1 1 0 1 1 1 2 P 0 0 0 0 0 0 0 Evaluation Scheme SESSIONAL EXAM. 2 3.
P. 6. Computer Science & Engineering [Effective from Session 2009-10] YEAR II.U. 11. 3. 4. EEC-456 ECS-452 ECS-453 GP-401 0 0 0 17 0 0 0 5 2 2 2 6 10 10 5 - 10 10 5 - 20 20 10 50 - 30 30 15 - 50 50 25 50 1000 1 1 1 1 26 Paper Code EOE-031/EOE-041 EOE-032/EOE-042 EOE-033/EOE-043 EOE-034/EOE-044 EOE-035/EOE-045 EOE-036/EOE-046 EOE-037/EOE-047 EOE-038/EOE-048 Science Based Open-Electives Introduction to Soft Computing (Neural Networks. Tech. LUCKNOW STUDY & EVALUATION SCHEME B. TECHNICAL UNIVERSITY. 2. Course Code THEORY SUBJECT 1. (3) . 10. No. 9. CT TA Total ESE 15 30 30 30 30 30 15 10 20 20 20 20 20 10 25 50 50 50 50 50 25 50 100 100 100 100 100 50 Credits Subject Total S. 5. Fuzzy Logic and Genetic Algorithm) Nano Sciences Laser System and Applications Space Science Polymer Science & Technology Nuclear Science Materials Science Discrete Mathematics** ** Note : CS & IT Students can not take the Open Elective Course EOE 048 : Discrete Mathematics. 7 EHU-402/ EHU-401 EOE-041EOE-048 EEC-406 ECS-401 ECS-402 ECS-403 75 150 150 150 150 150 75 2 4 4 4 4 4 Database Management Systems Theory of Automata & Formal Languages EHU-111 *Human values & Professional Ethics PRACTICAL/TRAINING/PROJECT Microprocessor Lab DBMS Lab Computer Organization Lab General Proficiency Total 8. SEMESTER-IV PERIODS L Industrial Sociology / Industrial Psychology Science Based Open Elective Introduction to Microprocessor Computer Organization 2 3 3 3 3 3 2 T 0 1 1 1 1 1 2 P 0 0 0 0 0 0 0 Evaluation Scheme SESSIONAL EXAM.
magnitude comparator. multiplexers Unit-III Synchronous Sequential logic: Sequential circuits. Quine McClusky method (Tabular method). state reduction and assignments. 4th Edition. hamming codes. don’t care conditions. decimal adder. “Digital Design”. Registers and counters: Shift registers. synchronous counter. binary multiplier. POS simplification. Morris Mano and M. circuit with latches. NAND and NOR implementation. hazards. Text Book:M. ROM. binary adder-subtractor. cyclic codes. analysis procedure. design procedure. Unit-IV Memory and programmable logic: RAM. Unit-II Combinational Logic: Combinational circuits. analysis of clocked sequential circuits. encoders. design procedure. design example. Pearson Education (4) . flip flops. race free state assignment. binary codes. ripple counter.ECS-301 : Digital Logic Design Unit-I Digital system and binary numbers: : Signed binary numbers. error detecting and correcting codes. Unit-V Asynchronous sequential logic: Analysis procedure. D. design procedure. Ciletti. storage elements: latches. design with multiplexers. PLA. Floating point representation Gate-level minimization: The map method up to five variable. reduction of state and flow table. PAL. decoders. other counters. Design at the register transfer level: ASMs.
2007.I Moments. Time series and forecasting (moving and semi-averages). Mathematical Statistics. t-test. Numerical integration . Numerical Methods for Scientific and Engineering Computation. Jain & S. Correlation. difference tables. Unit – IV : Numerical Techniques – I Zeroes of transcendental and polynomial equation using Bisection method. p. Test Books :1. S. Gauss. Kurtosis.. Sampling theory (small and large).L T EAS-301: MATHEMATICS –III P 3 1 0 Unit – I : Function of Complex variable Analytic function. Taylor’s and Laurent’s series.Kutta mehthods. np. Trapezoidal . Iyenger & Jain. Residue theorem.K. Analysis of variance (one way) . Evaluation of real integrals of the type and Unit – II : Statistical Techniques . Application to engineering.Seidal method.R. Kapur. singularities. Fitting of straight lines. Lagrange’s and Newton’s divided difference formula for unequal intervals. 2. Unit – III : Statistical Techniques . Picard’s and forth-order Runge. agriculture etc. Unit – V : Numerical Techniques –II Solution of system of linear equations. (5) 08 08 10 08 08 . Simpson’s one third and three-eight rules. medicine. Narosa Publication House. New Delhi .2000 Reference Books :1. Polynomials. Advance Engineering Mathematics. R. 2003. Numerical differentiation. Probability theory. 3. Solution of ordinary differential (first order.K. Cauchy’s integral theorem. Chand & company Ltd. Regula-falsi method and Newton-Raphson method. C-R equations..II Binomial. Crout method. Poisson and Normal distributions. Advance Engineering Mathematics Thomson (Cengage) Learning. Jain. 2002. J. O’Neil. Linear. . Iyenger. Interpolation: Finite differences. Statistical quality control methods. Curve fitting. New Age International. Exponential curves etc. Peter V. R. Moment generating functions. Newton’s forward and backward interpolation . and c charts. Rate of convergence of above methods. Tests of significations: Chi-square test. Cauchy’s integral formula for derivatives of analytic function. Method of least squares. non –linear and multiple regression analysis. second order and simultaneous) equations by Euler’s. Control charts. Skewness.N.
Traversing Threaded Binary trees. Preorder and Postorder. Application of arrays. 1996. Two Way Merge Sort. ECS-302 : DATA STRUCTURES USING .2. Elementary Data Organization. Huffman algorithm. 2005. Abstract Data Types (ADT) Arrays: Definition. Add. Adjacency List. Traversal. Practical consideration for Internal Sorting. Deletion. Sparse Matrices and their representations. Evaluation of postfix expression. Array and Linked Representation of Binary trees. Extended Binary Trees. Radix Sort. (6) . New Delhi 2006. Time and Space Complexity. Operations on a Linked List. Circularly Linked List. Array and Linked Implementation of Stack in C. Adjacency Multi list. Comparison and Analysis Internal Sorting: Insertion Sort. Spanning Trees. Algebraic Expressions. 3. Khanna Publishers. Binary Tree Representation: Array Representation and Dynamic Representation. Generalized Linked List . Introduction to Activity Networks Unit – V Searching : Sequential search. Connected Component. Prasad Mudralaya. Recursion. Single and Multidimensional Arrays. Unit – IV Graphs: Terminology. Removal of recursion Queues. Chandrika Prasad.C L T P 3 1 0 Unit . Graph Traversal : Depth First Search and Breadth First Search. Circular queues. Array and linked implementation of queues in C. Linked lists: Array Implementation and Dynamic Implementation of Singly Linked Lists.I Introduction: Basic Terminology. Application of stack: Prefix and Postfix Expressions. Simulating Recursion. B. Bubble Sort. Tail recursion. Quick Sort. Sequential and linked Representations of Graphs: Adjacency Matrices. John Wiley & Sons. Tower of Hanoi Problem. Narosa Publication house. and Column Major Order. Kreysig. Representation of Arrays: Row Major Order. Binary Search. Minimum Cost Spanning Trees: Prims and Kruskal algorithm. Unit – II Stacks: Abstract Data Type. Polynomial Representation and Addition. Primitive Stack operations: Push & Pop. 2005. Doubly Linked List. Advanced Engineering Mathematics. Asymptotic notations: Big-Oh. Threaded Binary trees. Insertion. Transistive Closure and Shortest Path algorithm: Warshal Algorithm and Dijikstra Algorithm. Operations on Queue: Create. Unit – III Trees: Basic terminology. Delete. Higher Engineering Mathematics. Advanced Mathematics for Engineers. Time-Space trade-off. Full and Empty. Grewal. Selection. Dequeue and Priority Queue. Efficiency of an Algorithm.S. Binary Trees. Algorithm. Devi Prasad. E. Principles of recursion. An introduction to Numerical Analysis. 4. 5. Complete Binary Tree. Tree Traversal algorithms: Inorder. Heap Sort.
PHI 2. Unit-III Partial order sets: Definition. Variants of Induction. Contradiction. Complexity of Search Algorithm. Proof by contradiction. Digital circuits and Boolean algebra. AVL trees. Cosets. Natural Numbers: Introduction. Operations on relations. Group Homomorphisms. well formed formula. Sorenson. Algebra of proposition. Lipschutz. Lattices: Definition. “Data Structures and Algorithms”.Search Trees: Binary Search Trees(BST). Functions: Definition. Partial order sets. Proofs of some general identities on sets. Properties of lattices – Bounded. Pearson Education 5. Multisets. Normal Subgroups. Simplification of Boolean Functions. TMH ECS-303 : DISCRETE MATHEMATICAL STRUCTURES LTP 310 Unit-I Set Theory: Introduction. Text books and References: 1. “An Introduction to Data Structures with applications”. Unit-IV Propositional Logic: Proposition. Theory of Inference. R. (7) . Introduction to m-way Search Trees. Horowitz and Sahani. Classification of functions. Integers Modulo n. Aaron M. Composite Relations. Mathematical Induction. Tautology. Groups. Definition and elementary properties of Rings and Fields. Proof by counter – example. Galgotia Publication 3. Growth of Functions. Relations: Definition. “Data Structures” Schaum’s Outline Series. Hasse diagram. McGraw Hill 4. Karnaugh maps. Yedidyah Langsam and Moshe J. Properties of relations. Cyclic Groups. Recursive definition of relation. Combination of sets. Insertion and Deletion in BST. Permutation and Symmetric groups. Proof Methods. Kruse etal. “Fundamentals of Data Structures”. Augenstein “Data Structures Using C and C++” . Truth tables. Jean Paul Trembley and Paul G. Collision Resolution Strategies Storage Management: Garbage Collection and Compaction. Boolean Algebra: Introduction. Equality of relations. G A V Pai. B Trees & B+ Trees Hashing: Hash Function. Ordered pairs. Subgroups and order. Combination of partial order sets. Tenenbaum. “Data Structures and Program Design in C”. Recursively defined functions. Lagrange's theorem. Operations on functions. Satisfiability. Induction with Nonzero Base cases. Axioms and Theorems of Boolean algebra. Logic gates. Complemented. Unit-II Algebraic Structures: Definition. Order of relations. TMH 6. Modular and Complete lattice. Algebraic manipulation of Boolean expressions.
Requirements. quantifiers. 2000.P. Kenneth H. Discrete Mathematical Structures. Bipartite graphs. IT Infrastructure Library UNIT II: SERVICE DELIVERY PROCESS. Busby.R. Planar graphs. Addison Wesley. Discrete and Combinatorial Mathematics. Computer Software. 5/e. 5/e. Kolman. IT INFRASTRUCTURE. IT System Management Process. Computer Hardware. Unit-V Trees : Definition. Problem Management. B. Method of solving recurrences.C. Computing Resources. Binary tree. Brooks/Cole. Jean Paul Trembley. Prentice Hall. R. Counting Techniques. Configuration Management. McGraw-Hill. Service Level Management. Graph coloring. ECS-304 : INFORMATION TECHNOLOGY INFRASTRUCTURE AND ITS MANAGEMENT UNIT I: INTRODUCTION-Information Technology. Incident Management. Elsevier Pub. Multigraphs. Discrete Mathematical Structures with Application to Computer Science. Ross. Graphs: Definition and terminology. Recursive algorithms. NY. Release Management (8) . Service Management Process. and S. Binary tree traversal. Binary search tree. Inc. Mathematics: A Discrete Introduction. Discrete Structures.Service Support Process. Capacity Management. 3. Inference theory of predicate logic. McGraw-Hill. Scheinerman. E. 2008 2. Grimaldi. 6. Change Management.Predicate Logic: First order predicate. Koshy. Rosen. New York. 2004. References: 1. Isomorphism and Homeomorphism of graphs. Financial Management. Representation of graphs. R Manohar. 1975.C. Discrete Mathematics and Its Applications. 2006. Pólya’s Counting Theory. 5. Euler and Hamiltonian paths.Service Delivery Process. Information System Design. 4. Availability Management UNIT III: SERVICE SUPPORT PROCESS. Service Management. Recurrence Relation & Generating function: Recursive definition of functions. R. 6/e. Network and Internet. 2004. well formed formula of predicate. Combinatorics: Introduction.Design Issues. Pigeonhole Principle.
Intrusion Detection. Introduction to digital electronics lab. and verify the 4-bit asynchronous counter. Mobile Communication Development. Physical Security. Intellectual Property. and verify the 4-bit synchronous counter.Introduction to Cyber Ethics. Verification of state tables of RS. Identity Management. Insertion and Deletion in BST. Data Retention UNIT IV: SECURITY MANAGEMENT. Binary Search Tree. 2. BFS. Mini Project. Electronic Data Interchange. 7. Min. Archive & Retrieve. shortest path algorithm. List. Implementation of 4x1 multiplexer using logic gates. DFS. Implementation of Searching and Sorting Algorithms. 8. Queue. Bare Machine Recovery. Access Management. List using Dynamic memory Allocation. Design. T and D flip-flops using NAND & NOR gates. Space Management. Expert Systems ECS -351 : Logic Design Lab Objective: To understand the digital logic and create various systems by using these logics. verification of the truth tables of logic gates using TTL ICs. ECS-352 : Data Structure Lab L T P 0 0 2 Write Program in C or C++ for following. 4.Backup & Storage. cost spanning tree. Implementation of the given Boolean function using logic gates in both SOP and POS forms. Implementation and verification of Decoder/De-multiplexer and Encoder using logic gates. Implementation of Stack.Security. Circular Queue. Binary Tree. Cyber Crimes EMERGING TRENDS in IT. Implementation of Tree Structures. (9) . 3. • • • • • Array implementation of Stack. JK. Queue. Circular Queue. 1. Graph Implementation. Security Information Management UNIT V: IT ETHICS.STORAGE MANAGEMENT.Electronics Commerce. Ethics and Internet. Privacy and Law. specifications. Computer and internet Security. Design.nomenclature of digital ICs. concept of Vcc and ground. 9. 6. Tree Traversal. Database & Application Protection. Implementation of 4-bit parallel adder using 7483 IC. Computer Forensics. Smart Card. Disaster Recovery. 5. study of the data sheet.
Typical microprocessor development schemes. Simpson 1/3 and Simpson 3/8 rule. regression coefficient. 8. data transfer schemes. addressing modes. value of R2 for atleast two independent variables. interrupts.Tech CSE L T P 3 1 0 Unit-I Introduction: Microprocessor evolution and types. To implement Gauss Forward and Backward. To implement Numerical Differentiations. To deduce error envolved in polynomial equation. To draw frequency chart like histogram. To estimate regression equation from sampled data and evaluate values of standard deviation. Architectural advancement of microprocessor. Interfacing devices. frequency curve and pie-chart etc. To implement Newton’s Forward and Backward Interpolation formula. t-statistics. Sterling’s and Evertt’s Interpolation formula 5. 10. 3. (10) .ECS-353 : Numerical Techniques Lab L T P 0 0 2 Write Programs in ‘C’ Language: 1. 4. timer and timing diagram. instruction and data flow. To Find out the root of the Algebraic and Transcendental equations using Bisection. To implement Numerical Integration using Trapezoidal. 9. To implement Least Square Method for curve fitting. microprocessor architecture and operation of its components. EEC-406 : INTRODUCTION TO MICROPROCESSOR Fourth Semester B. Also give the rate of convergence of roots in tabular form for each of these methods. Newton Raphson and Iterative Methods. 7. 2. Bessel’s. To implement Newton’s Divided Difference and Langranges Interpolation formula. Regula-falsi. 6.
data transfer. Hall D V .Sigh. 2. Theory and Applications”. Barry B. registers. Programming and Applications with 8085”. Operating modes. Addressing modes. 8253/8254programmable timer/counter. execution unit. “Microprocessors. memory segmentation. logical operations. arithmetic. “ Introduction to Microprocessor”. counters and time delays. memory addressing. Unit-IV Programming: Assembly language programming based on intel 8085/8086. Gaonkar . Books 1. Aditya P Mathur. “ Microcomputer System: The 8086/8088 family’’ . “Advanced Microprocessors and Peripherals”.P.PHI 5. Instructions. bus interface unit. “Microprocessor. Ramesh S . Ray A K . Instruction sets. logic. Liu and Gibson G A . arithmetic operations. machine control and assembler directives. 8251 USART and RS232C. TMH 3. conditional call and return instructions Unit-V Peripheral Interfacing: Peripheral Devices: 8237 DMA Controller. ALU. PHI 7. Penram International Publishing. Control & statu. 8259 programmable interrupt controller. M Rafiqzzaman. indexing.Unit-II *-bit Microprocessors: Pin diagram and internal architecture of 8085 microprocessor. Types of instructions. Instruction sets. Bhurchandi K M . Instruction formats Instruction Classification: data transfer. Interfacing and Applications 8. programming techniques. TMH 6. looping. instruction format. Interrupts: hardware and software interrupts. interrupt and machine cycle. Unit-III 16-bit Microprocessor: Architecture of 8086 microprocessor: register organization. branching operations. Renu Sigh & B. counting. stacks and subroutines. 8255 programmable peripheral interface. Brey. (11) . branch operations. TMH 4. “Microprocessor Architecture.”Microprocessor Interfacing’. “INTEL Microprocessors”.
Hardwire and microprogrammed control: microprogramme sequencing.Hamacher & Zaky. IEEE standard for floating point representation. PHI 5. I/O interface. bus and memory transfer. micro-operations. address mapping and replacement) Auxiliary memories: magnetic disk. types of buses and bus arbitration. formats. I/O ports. “ Computer Organization”. Tannenbaum. TMH 4. Register. “ Computer Organization”. concept of horizontal and vertical microprogramming.” Structured Computer Organization’. instruction cycles and subcycles ( fetch and execute etc) . Unit-III Control Unit: Instruction types. Modes of Data Transfer: Programmed I/O. PHI (12) . microinstruction with next address field. John P Hays. computer types and classifications. Patterson. functional units and their interconnections. interrupt initiated I/O and Direct Memory Access. semiconductor RAM memories. buses. Booths algorithm and array multiplier. bus architecture. Digital computer generation. William Stalling. Unit-II Central Processing Unit: Addition and subtraction of signed numbers. 2009 2. PHI 7. Serial Communication: Synchronous & asynchronous communication. fixed and floating point number representation. McGraw Hill 6. general register organization.. types of interrupts and exceptions. wide branch addressing. Floating point arithmetic operation Processor organization. Books 1. ROM memories.ECS-401 : COMPUTER ORGANIZATION Fourth Semester B. I/O channels and processors. Mano. pre-fetching microinstructions. ‘ Computer Organization & Design’. Unit-V Input / Output: Peripheral devices. 2D & 2 1/2D memory organization. Interrupts: interrupt hardware.” Computer System Architecture”.Tech CSE & IT L T P 3 1 0 Unit-I Introduction: Number representation. stack organization and addressing modes. look ahead carry adders. PHI 3. Division and logic operations. P Pal chaudhry. Multiplication: Signed operand multiplication. Cache memories: concept and design issues 9 performance. Unit-IV Memory: Basic concept and hierarchy. “Computer Organization”. execution of a complete instruction. Error detection and correction codes: Hamming code. standard communication interfaces. Elsevier Pub. magnetic tape and optical disks Virtual memory: concept implementation. Vravice. Computer Organisation and Design.
Cursors. relational algebra. Books 1. Navathe. Procedures in SQL/PL SQL Unit-III Data Base Design & Normalization: Functional dependencies. SQL operators and their procedure. primary key. referential integrity. checkpoints.”Database Management Systems”. Addision Wesley 2.ECS-402 : DATA BASE MANAGEMENT SYSTEM IVth Semester B. Triggers. Sudarshan. Tables. update and delete operations. McGraw Hill 3. “ An Introduction to Database Systems”. Bipin C. Desai. database system Vs file system. tuple and domain calculus. conflict & view serializable schedule. reduction of an ER diagrams to tables. concurrency control. candidate key. Leon & Leon. Silbertz. Intersection. and JDs. DML. TMH (13) . extended ER model. “ An Introduction to Database Systems”. relational calculus. O’Neil. views and indexes. directory system. data model schema and instances. case study of Oracle. notation for ER diagram. third normal forms. data independence and database language and interfaces. Data Modeling using the Entity Relationship Model: ER model concepts. multiple granularity. Korth. Locking Techniques for concurrency control. Aggregate functions. Generalization. Overall Database Structure. keys. Unions. MVD. mapping constraints. normalization using FD. Addision Wesley 4. 5. serializability of schedules. BCNF. log based recovery. Elsevier Pub. first. second. inclusion dependence. Joins. Unit-II Relational data Model and Language: Relational data model concepts. recoverability. Insert. Testing of serializability. Distributed Database: distributed data storage. Domain constraints. Multi version schemes. Unit-V Concurrency Control Techniques: Concurrency control. Recovery with concurrent transaction. advantage of SQL. CSE & IT L T P 3 1 0 Unit-I Introduction: An overview of database management system. validation based protocol. SQl data type and literals. data definitions language. Recovery from transaction failures. Vikas Publishing House 6. Tech. Introduction on SQL: Characteristics of SQL.” Database Concepts”. Minus. Elmasri. Gagotia Publications 7. deadlock handling. loss less join decompositions. Types of SQL commands. Concepts of Super Key. “ Fudamentals of Database Systems”. “Database Management System”. aggregation. entity integrity. Queries and sub queries. Majumdar & Bhattacharya. alternative approaches to database design. Keys constraints. Date C J. Time stamping protocols for concurrency control. integrity constraints. Databases. Unit-IV Transaction Processing Concept: Transaction system. relationship of higher degree. normal forms. Database system concept and architecture.
Firewall Media. Instantaneous Description. definition and representation. 10. Kleen’s Theorem. “ Database Processing Fundamentals . Equivalence of PDA and CFG. Introduction to recursive function theory Text Books and References: 1.8. Automata and Grammars. Halting problem. Design and Implementation” Pearson Education. Ullman. Operators of regular expression and therr precedence. Deterministic PDA. Useless symbols. Hopcroft. Myhill-Nerode Theorem Unit – II Regular expression (RE) . Pumping lemma for CFLs. Simplification of CFGs. Normal forms for CFGs: CNF and GNF. Applications and Limitation of FA. Post correspondence problem (PCP). Unit – IV Push Down Automata (PDA): Description and definition. Examples. Instantaneous Description. Variants of Turing Machine. Ambiguous to Unambiguous CFG. Inherent ambiguity. Derivation trees. “ Principles of Database and Knowledge base System”. Recursive and recursively enumerable languages. Decision Properties of CFLs: Emptiness.’DBMS: Complete Practical Approach”. Maheshwari Jain. Acceptance by Final state. Computer Science Press. “ Database Management System”. Language of DFA. “Introduction Computation”. Simplified notation: State transition graph. Ramkrishnan. Finiteness and Memership. CFG to PDA and PDA to CFG. Universal TM. TM as Computer of Integer functions. Church’s Thesis. Pearson Education to Automata Theory. Nondeterministic finite Automata (NFA). Decision properties of Regular Languages. Undecidable problems about TMs. FA with output: Moore and Mealy machine. New Delhi ECS-403 : THEORY OF AUTOMATA AND FORMAL LANGUAGES L T 3 1 P 0 Unit – I Introduction. Language acceptance by TM. NFA with epsilon transition. Alphabets. Definition. Arden Theorem. Equivalence of Moore and Mealy Machine. Derivation . Acceptance by empty stack. Kroenke. Unit – III Context free grammar (CFG) and Context Freee Languages (CFL): Definition. Transition table. Strings and Languages. Minimization of Finite Automata. McGraw Hill 9. Gehrke. Closure properties of Regular Languages. Application of Pumping Lemma. Closure properties of CFLs. 11. D. Language of NFA. Language of PDA. Introduction to Undecidability.Ulman. Algebraic laws for Regular expressions. Distinguishing one string from other. DFA to Regular expression. Ambiguity in Grammer. Pumping Lemma for regular Languages. Two stack PDA Unit – V Turing machines (TM): Basic model. Non Regular Languages. Modified PCP. Deterministic finite Automata (DFA)-Formal Definition. Languages and (14) . Regular expression to FA. Equivalence of NFA and DFA.
Write SQL queries for sub queries. Papadimitrou. Martin J. 5. Write SQL query using character.<.Chandrasekaran. C. (15) . Mishra and N. K. “Introduction to Languages and Theory of Computations”. Mini Projects may also be planned & carried out through out the semester to understand important concepts of database..L. However student may use Power Builder/SQL SERVER .. Concepts for ROLL BACK. PHI EEC-456 : MICROPROCESSOR LAB L T P 0 0 2 1. The queries to be implemented on DBMS using SQL 2. Write SQL queries for extracting data from more than one table 7. 6. TMH 4. 11. PHI 3.L. “Theory of Computer Science : Automata. Write SQL queries using logical operations (=. To perform interfacing of RAM chip to 8085/8086 To perform interfacing of keyboard controller To perform interfacing of DMA controller To perform interfacing of UART/USART ECS-452 : DBMS LAB L T P 0 0 2 1. Write programme by the use of PL/SQL 9. 2. number. 4. nested queries 8..etc) 3. Creat VIEWS. 10. Creat FORMS and REPORTS Note: 1. Write the queries for Data Definition and Data Manipulation Language. Write SQL queries using SQL operators 4. Write SQL queries for relational algebra 6. 7. date and group functions 5. 9. Languages and Computation”. Students are advised to use Developer 2000/Oracle9i or other latest version for above experiments. 3. “Elements of the Theory of Computation”. 2. and Lewis.2. C. COMMIT & CHECK POINTS 10. CURSORS and TRGGERS & write ASSERTIONS. To study 8085 microprocessor System To study 8086 microprocessor System To develop and run a programme to find out largest and smallest number To develop and run a programme for converting temperature from F to C degree To develop and run a programme to compute square root of a given number To develop and run a programme for computing ascending/descending order of a number. C. 8.P.>.
5. Full) Bread Board implementation of Binary Adder. 6. Bread Board implementation of counters & shift registers. 2. Implementation of Arithmetic algorithms. 7.ECS-453 : COMPUTER ORGANIZATION LAB L T P 0 0 2 1. 4. (16) . 8. Bread Board Implementation of Flip-Flops. Design of Counters. Institute may also develop the experiment based on the infrastructure available with them. Experiments with clocked Flip-Flop. Bread Board implementation of Adder/Subtractor (Half. 3. Bread Board implementation of Seven Segment Display.
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue reading from where you left off, or restart the preview.