BSc Cp Science O B.Se. Computer Science ‘S.No "Ti Semester = ‘Code Max. Max. No | Marks | Marks Int Theor Ass. | 7 Disorete Structures 301 B 25 2 ‘Switching Theory and Logic Design 302 75 Tm 3. Data Structure using C 303 | 75 25a 4, Lab-V Switching Theory and Logic Design 304 100. a re Lab- Vi Computer Lab. Data Structure using — | 305 100 ie ‘S.No. ~TVSemester ‘Code | Max Marks | Max. Nd Theory Mark Int. ir . Ass. 1. ‘Computer Oriented Numerical T 401 75 Te 1 Computer Organization S Bikagae: 75 25 [3 GOP through C * ef “| 403 | 75 25 4 Lab- VII computer Oriented Numerical 404 | 50 Techniques s |Course Lit Dita Suucture using € Unit 1 Introduction: Basic Terminology, Elementary Data Organization, Structure operations, Algorithr Complexity and Time-Space trade-off ‘Arrays: Array Definition, Representation and Analysis, Single and Multidimensional Arrays, addres calculation, application of arrays, Character String in C, Character string operation, Array a: Parameters, Ordered List, Sparse Matrices and Vectors. Stacks: Array Representation and Implementation of stack, Operations on Stacks: Push & Pop, Array Representation of Stack, Linked Representation of Stack, Operations Associated with Stacks, Application of stack: Conversion of Infix to Prefix and Postfix Expressions, Evaluation of postfix expression using stack. Recursion: Recursive definition and processes, recursion in C, example of recursion, Tower of Hanoi Problem, simulating recursion, Backtracking, recursive algorithms, principles of recursion, tail recursion, removal of recursion. | © | UNIT Queues: Array and linked representation and implementation of queues, Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues, D-queues and Priority Queues. Finked list: Representation and Implementation of Singly Linked Lists, Two-way Header List, Traversing and Searching of Linked List, Overflow and Underflow, Insertion and deletion to/from Linked Lists, Insertion and deletion Algorithms, Doubly linked list, Linked ‘Lig Array, Polynomial representation and addition, Generalized linked list, Garbage Collection and Compaction. UNIT Ut Trees: Basic terminology, Binary Trees, Binary tree representation, algebraic Expressions, Complete inary Tree, Extended Binary Trees, Array and Linked Representation of Binary trees Traversing Binary trees, Threaded Binary trees, Traversing Threaded Binary trees, Huffinan algoriihns Searching and Hashing: Sequential search, binary search, comparison and analysis, Hach Table, Hash Functions, Collision Resolution Strategies, Hash Table Implementation. UNIT IV Sorting: Insertion Sort, Bubble Sorting, Quick Sort, Two Way Merge Sort, Heap Sort, Sorting on Different Keys, Practical consideration for intemal Sorting, Binary Seareh Trees: Binary Scarch Tree (BST), Insertion and Deletion in BST, Complexity of Search Algorithm, Path Length, AVL Trees, B-ttees, UNIT-y Graphs: Terminology & Representations, Graphs & Multi-graphs, Directed Graphs, Sequential Representations of Graphs, Adjacency Matrices, Traversal, Connected Component and Spanning Trees, Minimum Cost Spanning Trees File Structures: Physical Storage Media File Organization, Organization of records into Blocks, : Sequential Files, Indexing and Hashing, Primary indices, Secondary indices, B¥ Tree index Files, B Tree index Files, Indexing and Hashing Comparisons. Text Books & Refere: R. Kruse etal Data Structure and Program Design in C. Pearson New Dethi Balooja Data Structure using ¢fing Pheory and togie Design Course IN Lab-\ Swit List of Experiments: Bread-board implementation of various flip-flops. Bread-board implementation of counters & shift registers. Determination of Delay time and NAND, NOR, Ex-OR, AND & OR Gates Transfer characteristics of TTL inverters & TTL Schmitt Trigger inverter. Transfer characteristics of CMOS inverters series and CD40 series and estimation of Gate delay of CD40 series CMOS inverter 6. Monoshot multivibrators using 74121 and 74123. 7. Clock circuit realization using 555 and CMOS inverter and quartz crystal. 8. Adder/ subtractor operation using 1C7483 4 bit/ 8 bit. 9. Demultiplexer / Decoder operation using IC-74138. 10. Modulo- N counter using programmable counter 741190. Course V Lab-VI Data Structure using C List of Practicals: Write a program in C for the addition of two matrices. Write a program in C for the multiplication of two matrices. To sort a list using bubble sort Write a program for finding a number in a array To implement circular queue Deletion of duplicate from one dimensional array Create a link list and make its display Multiplication of two numbers with recursion Write a program for stake implementation using push and pop 10. Write a program for queue implementation 11. Write a program for traversing a binary tree 12, Write a program for students data base bot yen Yen awe