B.TECH. (COMPUTER SCIENCE AND ENGINEERING Artificial Intelligence and Data Science Artificial Intelligence and Machine Learning ‘Computer Science & Design ‘THIRD SEMESTER (DETAILED SYLLABUS) KCS 301 DATA STRUCTURE Course Outcome ( CO) Bloom’s Knowledge Level (KL) At the end of course , the student will be able to understand Describe how arrays, inked lists, stacks, queues, tees, and graphs are represented in memory. ©O1 | used hy the algorithms and their common applications. Ki, Ka CO2 | Discuss the computational efficiency of the sorting and searching algorithms Coa | lnplenentaion of Trees and Graphs and perform various operations on these data siclure | x, (co | Walestsnding ths concept of recursion application of earsin and is implementation and | ‘dentify the alternative implementations of data structures with respect fo its performance to ©05 | solve a real world problem. Ess DETAILED SYLLABUS Unit Topic Lecture Introduetion: Basic Terminology. Elementary Data Organization, Built in Data Types in C. Algorithm, Efficiency of an Algorithm, Time and Space Complexity, Asymptotic notations: Big Oh, Big Theta and Big Omega, Time-Space trade-off. Abstract Data Types (ADT) Arrays: Definition, Single and Multidimensional Arrays, Representation of Arrays: Row Major 1 | Order, and Column Major Order, Derivation of Index Formulae for 1-D,2-D,3-D and n-D Array | 08 Application of arrays, Sparse Matrices and their representations. Linked lists: Atray Implementation and Pointer Implementation of Singly Linked Lists, Doubly Linked List, Circularly Linked List, Operations on a Linked List. Insertion, Deletion, Traversal, Polynomial Representation and Addition Subtraction & Multiplications of Single variable & Two variables Polynomial Stacks: Abstract Data Type, Primitive Stack operations: Pash & Pop, Array and Linked Implementation of Stack in C, Application of stack: Prefix and Postfix Expressions, Evaluation of 11 | postfix expression, Iteration and Recursion: Principles of recursion, Tail recursion, Removal of recursion Problem solving using iteration and recursion with examples such as binary search, Fibonacci numbers, and Hanoi towers. Tradeoffs between iteration and recursion Queues: Operations on Queue: Create, Add, Delete Full and Empty, Circular queues, Amay and linked implementation of queues in C, Dequeue and Priority Queue. o8 Searching: Concept of Searching, Sequential search, Index Sequed unt | Concept of Hashing & Collision resolution Techniques used in Hashing. Sorting: Insertion Sort, | 08 Selection, Buble Sort, Quick Sort, Merge Sort, Heap Sort and Radix Sort IV _| Graphs: Terminology used with Graph, Data Structure for Graph Representations: Adjacency Matrices, Adjacency List, Adjacency. Graph Traversal: Depth First Search and Breadth First | 08 Search, Connected Component, Spanning Trees, Minimum Cost Spanning Trees: Prims and Kruskal algorithm. Transitive Closure and Shortest Path algorithm: Warshal Algorithm and Dijikstra Algorithm, Trees: Basic terminology used with Tree, Binary Trees, Binary Tree Representation: Amay Representation and Pointer(Linked List) Representation, Binary Search Tree, Strictly Binary Tree Complete Binary Tree . A Extended Binary Trees, Tree Traversal algorithms: Inorder, | Preorder and Postorder, Constructing Binary Tree from given Tree Traversal, Operation of | °% Insertation , Deletion, Searching & Modification of data in Binary Search . Threaded Binary trees, Traversing Threaded Binary trees. Huffman coding using Binary Tree. Concept & Basic Operations for AVL Tree .B Tree & Binary Heaps Text books: 1. Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein, “Data Structures Using C and C+” PHI Learning Private Limited, Dethi India 2. Horowitz and Sahani, “Fundamentals of Data Structures”, Galgotia Publications Pvt Ltd Delhi India 3. Lipschutz, “Data Structures” Schaum's Outline Series, Tata McGraw-hill Education (India) Pvt, Lt. 4. Thareja, “Data Structure Using C* Oxford Higher Education, 5. AK Sharma, “Data Structure Using C”, Pearson Education India. 6. 1. Rajesh K. Shukla, “Data Structure Using C and C++" Wiley Dreamtech Publication. Michael T. Goodrich, Roberto Tamassia, David M. Mount "Data Structures and Algorithms in C++", Wiley India, 8. P.S. Deshpandey, “C and Data structure”, Wiley Dreamtech Publication, 9. R Kruse etal, “Data Structures and Program Design in C”, Pearson Education, 10. Berztiss, AT: Data structures, Theory and Practice, Academic Press. I. Jean Paul Trembley and Paul G. Sorenson, “An Introduction to Data Structures with applica MeGraw Hill 12. Adam Drozdek “Data Structures and Algorithm in Java", Cengage Learning