B.Sc. Computer Science “TH Semester Max. Max Ne] Marks | Marks Int a _ Theary Ass, Discrete Structures 38 75 25 as 25 73 35 2 a ej) “| Lab- Vi Cemputer Lab. Data Siructure usingCourse Hi Dir Su ucture using ¢ Unit 1 Introduction: Basic Terminology, Elementary Data Organization, Structure operations, Algorithr Complexity and Time-Space trade-off Arrays: Acay Definition, Representation and Analysis, Single and Multidimensional Arrays, addres calculation, application ef arrays, Character String in C, Character string operation, Array a: Parameters, Ordered List, Sparse Matrices and Vectors Stacks: Array Representation and Implementation of stack, Opcrations 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 Fecursion, Tower of Hanoi Problem, simulating recursion, Backtracking, recursive algorithms, principles of recursion, tail recursion, removal of recursion UNIT IL Queues: Array and linked representation and implementation of queues, Operations on Queue: Create, (Add, Delcte, Full and Empty, Circular queues, D-queues and Priority Queues. Tanked list: Representation and Implementation of Singly Linked Lists, Two-way Header List, Colynemial representation and addition, Generalized linked list, Garbage Collection wy Compaction. UNIT WT ‘Trees: Basic terminology, Binary Trees, Binary tree representation, algebraic Expressions, Complete pinaty Tree, Extended Binary Trees, Array and Linked Representation of Binary trees Traversing inary trees, Threaded Binary tres, Traversing Threaded Binary trees, Huflman algorithne 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 internal Sorting. Binary Search Trees: Binary Search Tree (BST), Insertion and Deletion in BST, Complexity of Search Algorithm, Path Length, AVL Trees, B-trees: UNIT- Vv Graphs: Terminology & Representations, Graphs & Multi-graphs, Directed Graphs, Sequential Representations of Graphs, Adjacency Matrices, Traversal, Connected Componem snd Spanning Trees, Minimum Cost Spanning Trees © Structures: Physical Storage Media File Organization, Organization of records into Blocks, Requential Files, Indexing and Hashing, Primary indices, Secondary indices, B+ Tree index Files, B Tree index Files, Indexing and Hashing Comparisons. Fi Text Books & References: R. Kruse etal Data Strucuure and Program Design in C. Pearson New Deli Balooja Data Structure using ¢Course V Lab-VI Data Structure using C List of Practicals: Write a program in C for the addition of two matrices. L 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 a 7 PONABALD