CSE 203 COMPUTER ORGANIZATION AND DESIGN

[3 1 0 4] 1.BASIC STRUCTURE OF COMPUTERS: Computer types, Functional units, Basic operational concepts, Bus structures, Software, Performance. (1.1,1.2, 1.3,1.4, 1.5,1.6 of Text Book 1) (2 hrs) 2. MACHINE INSTRUCTIONS AND PROGRAMS: Numbers, arithmetic operations and characters, Memory locations and addresses, Memory operations, Addressing modes. (2.1 to 2.5.5 of Text Book 1) (3 hrs) 3. EXECUTION UNIT: Addition and subtraction of signed numbers, Adders, ALU design, Bit slice processor, Multiplication of positive numbers Signed operand multiplication, Fast multiplication, Integer division, Floating point numbers and operations (3.3, 3.4, 3.5 of Text 2, 6.1 to 6.7of Text Book1) (14 hrs) 4. CONTROL UNIT: Introduction, Basic concepts, Design methods (4.1 to 4.3.2 of Text Book 2) (11 hrs) 5. MEMORY SYSTEMS: Basic concepts, RAM memories, Read only memories, Speed size and cost, Cache memories, Performance considerations, Virtual memories, Memory Management Requirements, Secondary storage (5.1 ,5.2, 5.2.1, 5.2.2, 5.2.5, 5.2.6, 5.3, 5.3.1 to 5.3.5, 5.4, 5.5, 5.5.1 to 5.5.3, 5.6, 5.6.2 to 5.6.3, 5.7, 5.7.1,5.9, 5.9.1 to 5.9.2 of Text Book 1) (10 hrs) 6. INPUT/OUTPUT ORGANIZATION: Accessing I/O devices, Interrupts, Direct memory access, Buses, Interface circuits (4.1, 4.2, 4.2.1 to 4.2.5 ,4.4, 4.5, 4.5.1 to 4.5.2,4.6, 4.6.1, 4.6.2 of Text Book 1) (8 hrs) Text Books: 1. Carl Hamacher, ZvonkoVranesic and SafwatZaky, Computer Organization, McGraw Hill International Edition, Fifth edition, (2002). 2. Mohammed Rafiquzzaman and Rajan Chandra,(2008)Modern Computer Architecture, Galgotia Publications Pvt. Ltd. References: 1. William Stallings, Computer Organization and Architecture Designing for Performance, 8th edition, PHI, 2009.

CSE 205 SWITCHING THEORY & LOGIC DESIGN

[3 1 0 4] 1. INTRODUCTION TO LOGIC CIRCUITS: Variables and functions, Inversion, Truth tables, Logic gates and networks, Boolean algebra, Introduction to VHDL, Synthesis using AND OR and NOT gates. (Chapter 2 (except 2.5.1, 2.5.2 & 2.5.3, 2.7, 2.8) and appendix A of Text Book 1) (6 hrs)

1. OPTIMIZED IMPLEMENTATION OF LOGIC FUNCTIONS: Karnaugh map, Strategy for minimization, Minimization of POS forms, Incompletely Specified Functions, Multiple output circuits NAND and NOR logic networks, multilevel NAND and NOR circuits, Analysis of multilevel circuits. (Chapter 4 of Text Book 1(up to 4.8 except 4.7, 4.7.1, 4.7.2)) (8 hrs) 1. ARITHMETIC CIRCUITS: Positional number representation, Addition of unsigned numbers, Signed numbers, Fast adders, Design of arithmetic circuits using VHDL, BCD representation. (Chapter 5(5.1 to 5.5 (except 5.5.1), 5.7.3) of Text Book 1) (10 hrs.) 1. COMBINATIONAL CIRCUIT BUILDING BLOCKS: Multiplexer, Decoder, Encoder, Code converter, Arithmetic comparison circuits, VHDL for Combinational Circuits. (Chapter 6 of Text Book 1) (8 hrs) 1. SYNCHRONOUS SEQUENTIAL CIRCUITS: Flip Flops, Registers, Counters. (Chapter 6 and 7 (upto 7.5) of Text Book 2 , 7.13(except 7.13.1) and 8.1 of Text Book 1) (14 hrs) 1. OVERVIEW OF DIGITAL INTEGRATED CIRCUITS: Overview of semiconductor diode, BJT, MOSFET, TTL standard, High speed, low-power, low-power schotky, CMOS logic-NAND, NOR. (Only specified topics from chapter 14 of Text Book 3) (2 hrs.) Text Books: 1. Stephen Brown and Zvonko Vranesic, Fundamentals of Digital Logic with VHDL Design Tata McGraw Hill Publishing Co. Ltd., 2000. 1. M. Morris Mano, Digital Design , PHI Pvt. Ltd., 2nd Edition, 2000. 2. Donald P. Leach, Albert Paul Malvino, Goutam Saha, Digital Principles and Applications Tata McGrawHill Publishing Co. Ltd., 6th Edition, 2006. References: 1. J. Bhasker, A VHDL Primer, PHI Pvt. Ltd., 3rd Edition, 2005. 2. William I Fletcher, An Engineering Approach to Digital Design, PHI Pvt. Ltd. 3. John M. Yarbrough, Digital Logic Applications and Design, 2009

CSE 207 DATA STRUCTURES

[3 1 0 4] 1. BASIC CONCEPTS OF ALGORITHM Introduction, Algorithm Specification, Performance Analysis- Time and Space Complexity, Asymptotic notation. (1.2.1, 1.4, 1.4.1, 1.4.2, 1.4.3 of Text Book 3) (2 hrs) 1. POINTERS AND POINTER APPLICATIONS Accessing variables through pointers, pointer declaration and definition, initialization of pointer variables, pointers and functions, pointers to pointers, Arrays and pointers, pointer arithmetic and arrays, passing an array to a function understanding complex declarations, memory allocation functions, array of pointers. ( 9-3 - 9-7, 10.1 10.6 of Text Book 1) (3 hrs) 3. DERIVED TYPES : The type definition, enumerated types, accessing structures, complex structures, arrays of structures, structures and functions. (12.1,12.2, 12.4 12.7 of Text Book 1) (2 hrs) 4. RECURSION : Recursive definition & processes, Recursion in C, writing recursive programs efficiency of recursion, Example: Tower of Hanoi, GCD, Fibonacci (3.1 3.5 of Text Book 2) (2 hrs) 5. STACKS AND QUEUES : Definition and examples, Representing stacks in C, Evaluation of expressions, multiple stacks and queues. Application : infix, postfix and prefix and their conversions (3.1 ,3.2, 3.4,3.5 of Text Book 3) (6 hrs) 6. LINKED LIST Linked lists representations, Singly, doubly, header node, circular, Applications: linked stacks and queues, polynomial and long integer arithmetic, union, intersection. (4.2 4.4, 4.8 of Text Book 3) (8 hrs) 7. TREES : Basic terminologies, binary tree representation, recursive/ non recursive inorder, preorder and post order tree traversal, Binary search tree, AVL trees. Applications: Expression trees, inserting, deleting, searching, height of BST (5.1, 5.2, 5.3,5.7, 10.2 of Text Book 3) (8 hrs) 8.GRAPHS AND THEIR APPLICATIONS: Terminology and representations, Graph operations, Breadth first, depth first and level order traversal, spanning trees, minimum cost spanning tree, shortest path and transitive closure (6.1 6.4 of Text Book 3) (6 hrs) 9. SEARCHING AND SORTING: Binary and linear search, insertion, quick, merge, heap, radix sort (7.1,7.3,7.4 of Text Book 3) (6 hrs) 10. HASHING Static Hashing ( 8.2 of Text Book 3) (2 hrs) Text Books:

1. Behrouz A. Forouzan, Richard F. Gilberg A Structured Programming Approach Using C,Thomson, 2nd Edition, 2003. 1. Aaron M. Tenenbaum,Yedidyah Langsam,Moshe J. Augeustein,Data Structures using C, PEARSON Education , 2006. 1. 3. Ellis Horowitz, Sartaj Sahni , Anderson, Fundamentals of Data Structures in C, Universities Press (India) Pvt. Ltd., 2nd Edition, 2007. References : 1. Richard F. Gilberg, Behrouz A. Forouzan, Data structures, A Pseudocode Approach with C, Thomson, 2005. 1. Robert Kruc & Bruce Lening, Data structures & Program Design in C, Pearson Education, 2007. 1. 3. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, Prentice Hall

CSE 209 OBJECT ORIENTED PROGRAMMING USING C++

[3 1 0 4] 1..INTRODUCTION TO C++: A Review of Structures, Procedure-Oriented Programming Systems, Object-Oriented Programming Systems, Comparison of C++ with C, Console Input/output in C++, Variables in C++, Reference Variables in C++, Function Prototyping, Function Overloading, Default Values for Formal Arguments of Functions, Inline Functions. Class and Objects: Introduction to Classes and Objects, Member Functions and Member Data, Objects and Functions, Objects and Arrays, Namespaces, Nested Classes. Dynamic Memory Management: Introduction, Dynamic Memory Allocation, Dynamic Memory Deallocation, The set_new_handler () function. (Chapter 1, 2 and 3 of Text Book ) (12hrs) 2.CONSTRUCTORS AND DESTRUCTORS: Constructors, Destructors, the Philosophy of OOPS. Inheritance: Introduction to Inheritance, Base Class and Derived Class Pointers, Function Overriding, Base Class Initialization, The Protected Access Specifier, Deriving by Different Access Specifiers, Different Kinds of Inheritance, Order of Invocation of Constructors and Destructors. (Chapter 4 and 5 of Text Book ) (8hrs) 3.VIRTUAL FUNCTIONS AND DYNAMIC POLYMORPHISM: The Need for Virtual Functions, Virtual Functions, the Mechanism of Virtual Functions, Pure Virtual Functions, Virtual Destructors and Virtual Constructors. Stream Handling: Streams, The Class Hierarchy of Handling Streams, Text and Binary Input/Output, Text Versus Binary Files, Text Input/Output, Binary Input/Output , Opening and Closing Files, Files as Objects

of the fstream Class, File Pointer, Random Access to Files, Object Input/Output through Member Functions, Error Handling, Manipulators. ( Chapter 6 and 7 of Text Book ) (10hrs) 4.OPERATOR OVERLOADING: Operator Overloading, Overloading the Various Operators Overloading the Increment and the Decrement Operators (Prefix and Postfix), Overloading the Unary Minus and the Unary Plus Operator, Overloading the Arithmetic Operators. Overloading the Relational Operators, Overloading the Assignment Operator, Overloading the Insertion and Extraction Operators, Overloading the new and the delete Operators, Overloading the Subscript Operator, Overloading the Pointer-to-member (->) Operator (Smart Pointer). Type Conversion ( Chapter 8, 8.1- 8.3 of Text Book) (10hrs) 5.TEMPLATES: Introduction, Function Templates, Class Templates, the Standard Template Library (STL). Exception Handling: Introduction, C-Style Handling of Error-generating Codes, C++ Style Solution the try/throw/catch Construct, Limitation of Exception Handling. ( Chapter 9 and 10 of Text Book) (8hrs) Text Books: 1. Sourav Sahay, Object oriented programming with C++, Oxford Higher Education, 2008. References: 1. Stanley B Lippman, Josee Lajoe, Barbara E Moo, C++ Primer, , 4th edition 2005. 2. Robert Lafore, Object oriented programming in C++, Galgotia publications, 3rd edition, 2006.

CSE 211 LOGIC DESIGN LAB [0 0 3 1] Simulation of the following logic circuits using VHDL code 1. Introduction to MAX+plus II and Verification of logic gates and Boolean algebra. (Refer Appendix B of Text Book1) 1. Application of Boolean algebra. 2. Simplification of expressions using Kmap. 3. Multilevel NAND, NOR circuits. (Introduction to structural style of programming - usage of components). 4. Arithmetic circuits. (Writing programs in behavioral and mixed styles) 5. Multiplexers (Usage of sequential and concurrent VHDL statements) 6. Multiplexer Applications 7. Decoders and encoders 8. Applications of Decoders and encoders

9. Code converters and comparator. 10. FFs, registers. 11. Counters References: 1. Stephen Brown and Zvonko Vranesic, Fundamentals of digital logic with VHDL design, Tata MGH 2000. 2. J. Bhasker, A VHDL Primer, PHI Pvt. Ltd., 3rd Edition, 2005. CSE 213 DATA STRUCTURES LAB [0031] 1. Review of C 2. Review of C 3. Recursion 4. Stacks 1 5. Stacks 2 6. Queues 1 7. Queues 2 8. Lists 1 9. Lists 2 10. Trees 1 11.Trees 2 12. Graphs References: 1. Aaron M. Tenenbaum, Yedidyah Langsam, Moshe J. Augeustein, Data Structures Using C, PEARSON Education, PHI 2006 1. Behrouz A. Forouzan, Richard F. Gilberg, A Structured Programming, Approach Using C, Thomsan, 2nd Edition, 2003.