B.Tech(CS) 3rd to 8th Sem - MDU, Rohtak

More documents

Recommendations

Info

CSE-206 E THEORY OF AUTOMATA COMPUTATION L T P Class Work: 50 3 1 - Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Unit-1: Finite Automata and Regular Expressions: Finite State Systems, Basic Definitions Non- Deterministic finite automata (NDFA), Deterministic finite automata (DFA), Equivalence of DFA and NDFA Finite automata with E-moves, Regular Expressions, Equivalence of finite automata and Regular Expressions, Regular expression conversion and vice versa. Unit-2: Introduction to Machines: Concept of basic Machine, Properties and limitations of FSM. Moore and mealy Machines, Equivalence of Moore and Mealy machines, Conversion of NFA to DFA by Arden’s Method. Unit-3: Properties of Regular Sets: The Pumping Lemma for Regular Sets, Applications of the pumping lemma, Closure properties of regular sets, Myhill-Nerode Theorem and minimization of finite Automata, Minimization Algorithm. Unit-4: Grammars: Definition, Context free and Context sensitive grammar, Ambiguity regular grammar, Reduced forms, Removal of useless Symbols and unit production, Chomsky Normal Form (CNF), Griebach Normal Form (GNF). Unit-5: Pushdown Automata: Introduction to Pushdown Machines, Application of Pushdown Machines Unit-6: Turing Machines: Deterministic and Non-Deterministic Turing Machines, Design of T.M, Halting problem of T.M., PCP Problem. Unit-7: Chomsky Hierarchies: Chomsky hierarchies of grammars, Unrestricted grammars, Context sensitive languages, Relation between languages of classes. Unit-8: Computability: Basic concepts, Primitive Recursive Functions. Text Book: Introduction to automata theory, language & computations- Hopcroaft & O.D.Ullman, R Mothwani, 2001, AW Reference Books: Theory of Computer Sc.(Automata, Languages and computation):K.L.P.Mishra & N.Chandrasekaran, 2000, PHI. Introduction to formal Languages & Automata-Peter Linz, 2001, Narosa Publ.. Fundamentals of the Theory of Computation- Principles and Practice by RamondGreenlaw and H. James Hoover, 1998, Harcourt India Pvt. Ltd.. Elements of theory of Computation by H.R. Lewis & C.H. Papaditriou, 1998, PHI. Introduction to languages and the Theory of Computation by John C. Martin 2003, T.M.H. Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Students will be required to attempt five questions in all.
IT-202 E OBJECT ORIENTED PROGRAMMING USING C++ L T P Class Work: 50 3 1 - Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Unit–1: Introduction to C++, C++ Standard Library, Basics of a Typical C++ Environment, Preprocessors Directives, Illustrative Simple C++ Programs. Header Files and Namespaces, library files. Unit-2: Object Oriented Concepts : Introduction to Objects and Object Oriented Programming, Encapsulation (Information Hiding), Access Modifiers: Controlling access to a class, method, or variable (public, protected, private, package), Other Modifiers, Polymorphism: Overloading,, Inheritance, Overriding Methods, Abstract Classes, Reusability, Class’s Behaviors. Unit–3: Classes and Data Abstraction: Introduction, Structure Definitions, Accessing Members of Structures, Class Scope and Accessing Class Members, Separating Interface from Implementation, Controlling Access Function And Utility Functions, Initializing Class Objects: Constructors, Using Default Arguments With Constructors, Using Destructors, Classes : Const(Constant) Object And Const Member Functions, Object as Member of Classes, Friend Function and Friend Classes, Using This Pointer, Dynamic Memory Allocation with New and Delete, Static Class Members, Container Classes And Integrators, Proxy Classes, Function overloading. Unit-4: Operator Overloading: Introduction, Fundamentals of Operator Overloading, Restrictions On Operators Overloading, Operator Functions as Class Members vs. as Friend Functions, Overloading, Overloading Unary Operators, Overloading Binary Operators. Unit-5: Inheritance: Introduction, Inheritance: Base Classes And Derived Classes, Protected Members, Casting Base- Class Pointers to Derived- Class Pointers, Using Member Functions, Overriding Base –Class Members in a Derived Class, Public, Protected and Private Inheritance, Using Constructors and Destructors in derived Classes, Implicit Derived –Class Object To Base- Class Object Conversion, Composition Vs. Inheritance. Unit–6: Virtual Functions and Polymorphism: Introduction to Virtual Functions, Abstract Base Classes And Concrete Classes, Polymorphism, New Classes And Dynamic Binding, Virtual Destructors, Polymorphism, Dynamic Binding. Unit-7: Files and I/O Streams: Files and Streams, Creating a Sequential Access File, Reading Data From A Sequential Access File, Updating Sequential Access Files, Random Access Files, Creating A Random Access File, Writing Data Randomly To a Random Access File, Reading Data Sequentially from a Random Access File. Stream Input/Output Classes and Objects, Stream Output, Stream Input, Unformatted I/O (with read and write), Stream Manipulators, Stream Format States, Stream Error States. Unit-8: Templates & Exception Handling: Function Templates, Overloading Template Functions, Class Template, Class Templates and Non-Type Parameters, Templates and Inheritance, Templates and Friends, Templates and Static Members. Introduction, Basics of C++ Exception Handling: Try Throw, Catch, Throwing an Exception, Catching an Exception, Rethrowing an Exception, Exception specifications, Processing Unexpected Exceptions, Stack Unwinding, Constructors, Destructors and Exception Handling, Exceptions and Inheritance. Text Books: C++ How to Program by H M Deitel and P J Deitel, 1998, Prentice Hall Object Oriented Programming in Turbo C++ by Robert Lafore ,1994, The WAITE Group Press. Programming with C++ By D Ravichandran, 2003, T.M.H Reference books: Object oriented Programming with C++ by E Balagurusamy, 2001, Tata McGraw-Hill Computing Concepts with C++ Essentials by Horstmann, 2003, John Wiley, The Complete Reference in C++ By Herbert Schildt, 2002, TMH. Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Students will be required to attempt five questions in all.
Page 1 and 2: M.D.UNIVERSITY, ROHTAK Scheme of st
Page 3 and 4: M. D. UNIVERSITY, ROHTAK Scheme of
Page 5 and 6: Sl. No. Course No. M.D.UNIVERSITY,
Page 7 and 8: MATH-201-E MATHEMATICS-III (COMMON
Page 9 and 10: CSE-203 E DISCRETE STRUCTURES L T P
Page 11 and 12: EE-204-E DIGITAL ELECTRONICS L T P
Page 13 and 14: IT-201 E PC Lab. L T P Class Work:
Page 15 and 16: EE-224-E DIGITAL ELECTRONICS LAB L
Page 17: CSE-204 E PROGRAMMING LANGUAGES L T
Page 21 and 22: CSE- 210 E COMPUTER ARCHITECTURE &
Page 23 and 24: IT-206 E C ++ PROGRAMMING LAB. L T
Page 25 and 26: Q12. Write a function called revers
Page 27 and 28: GPCSE-202- E GENERAL FITNESS FOR TH
Page 29 and 30: VI. Performance in Viva voce before
Page 31 and 32: EE-309-E MICROPROCESSORS AND INTERF
Page 33 and 34: CSE -305 E ANALYSIS AND DESIGN OF A
Page 35 and 36: IT-204 E MULTIMEDIA TECHNOLOGIES L
Page 37 and 38: CSE-311 E WEB DEVELOPMENT & CORE JA
Page 39 and 40: EE-329-E MICROPROCESSORS AND INTERF
Page 41 and 42: CSE-302 E PRINCIPLES OF SOFTWARE EN
Page 43 and 44: IT-305 E COMPUTER NETWORKS L T P Cl
Page 45 and 46: EE-402-E WIRELESS COMMUNICATION L T
Page 47 and 48: CSE-306 E INTELLIGENT SYSTEM LAB. L
Page 49 and 50: GPCSE-302- E GENERAL FITNESS FOR TH
Page 51 and 52: VI. Performance in Viva voce before
Page 53 and 54: CSE-403 E SOFTWARE PROJECT MANAGEME
Page 55 and 56: CSE-411- E COMPILER DESIGN LAB L T
Page 57 and 58: CSE-407- E Neural Networks L T P Cl
Page 59 and 60: CSE-404-E ADVANCED JAVA L T P Class
Page 61 and 62: IT-464 E NETWORK SECURITY & MANAGEM
Page 63 and 64: CSE-434 E ADVANCED DATABASE MANAGEM
Page 65 and 66: CSE 444 E FUZZY LOGIC L T P Class W
Page 67 and 68: CSE-448 E OBJECT ORIENTED SYSTEMS D
Page 69 and 70:
Drama _____________________________
show all

B.Tech(CS) 3rd to 8th Sem - MDU, Rohtak

Create successful ePaper yourself

Delete template?

Save as template?