2BCA2- Data Structures L [TP | C | Theory Internal | Practical | Total Credits/Hours Marks 44a] o [24] os | 80 20 0 100 Course Objectives: Understand the concepts of data structures and algorithm design methods. Choose the appropriate data structure such as arrays, linked lists, stacks, queues, hash tables, trees, heaps and graphs and writing programs for these solutions, ‘© Solve problems of Searching and Sorting, ‘© Understand the complexity of algorithm. Course Outcomes: * Understand the concept and usage of data types, dynamic memory management and data structures. © Understand various data structures like arrays, linked lists, stacks, queues, hash tables, trees, heaps and graphs, Apply algorithms for Searching and Sorting Methods. © Develop and analyze Algorithms and calculate their Complexities Understand the applications of various data structures. Unit-wise Syllabus UNIT-1 The concept of data structure, abstract data type, concept of list & array, introduction to stack, stack as an abstract data type, primitive operation on stack, stack’s application - infix, postfi prefix and recursion, Introduction to queues, primitive operations on queues, queue as an abstract data type, circular queue, dequeue, priority queue, applications of queue. UNIT -IE Linked list - introduction to linked list, memory representation of linked list, operations on linked list, linked list representation of stack and queue, header nodes, Types of linked list - doubly linked list, circular linked list, application of linked list. UNIT =I Trees - basic terminology of trees, binary trees, tree representations as array & linked list. Binary tree representation, Traversal of binary trees - inorder, preorder &postorder, application of binary tree, threaded binary tree, height balanced tree, b-tree, UNIT-IV Analysis of algorithm, complexity with big 'O’notation, Searching - sequential search, binary search and theit comparison, Sorting - external & internal, sorting algorithm - Insertion, Selection, Quick, Bubble, and Heap, comparison of sorting methods. UNIT-V Graphs- Introduction to graphs, basic terminology, directed, undirected & weighted graph, representation of graphs, graph traversals, Spanning trees, minimum spanning tree, applications of graphs: shortest path problem using Dijkstra method. MCU BCA syllabus Bachelor of Computer Applications (BCA}-2020 Page 29 DrCP AgrawalReferences: Lipschuists, "Data Structure" Schaum ‘S Outline Series, Megraw Hill Publication Ellis Horowitz. AndSartajSawhney, "Fundamentals of Computer Algorithm” Trembley&Sorrenson, "Data Structure” S. Sawhnev&E, Horowitz, "Fundamentals of Data Structure" ‘Aaron M, Tenenbaum, Moshe J. Augenstein, YedidyahLangsam, "Data Structures Using C and C++", PHI. Program Outcomes (POs) cossi >, 2,)3[4[s]6]7,/8]9 | |] u [DR 1/3 [2,2 /[2]2 T 2,3 )/3)3)2)]2 37if[3/3 [2] #[3[3 [2 [3 I MCU BCA syllabus Bachelor of Computer Applications (BCA}-2020 Page 30 DrCP Agrawal