CO 2406: DATA STRUCTURES

B.E. II YEAR (4YDC) COMPUTER ENGINEERING

CO 2406: DATA STRUCTURES

Theory:

1. Introduction to Data Structure: Concepts of Data and Information, Abstract Data Types, Implementation aspects: Memory representation and operations. Review of Java Programming Language. Java Collection framework: List, Array list, Vector Stacks: Stacks as ADT, Different implementation of stack, Application of Stack Recursion: Definition and examples of recursive algorithms, Application of recursion.
2. Queues: Queues as ADT, Different implementation of queue, Circular queue, Concept of Deque and Priority Queue, Application of queues. Linked List: Representation of linked list in memory, Implementation of linked list including array implementation. Circularly linked list, Doubly linked list, Application of linked list.
3. Sorting: Introduction, Sort methods like: Bubble Sort, Quick sort. Selection sorts, Heap sort, Insertion sort, Shell sort, Merge sort and Radix sort. Searching: Basic Search Techniques: Sequential search, Binary search, Hashing & Indexing, Collision, Resolving collision.
4. Tree: Definitions- Height, depth, order, degree etc. Binary Search Tree - Operations, Traversal, Search. AVL Tree. Applications. Introduction to Forest, Multiway Tree, B tree, B+ tree, B* tree.
5. Graphs: Introduction, Directed and Undirected graphs, Representation, Graph Traversal – Depth First Search (DFS), Breadth First Search (BSF), Minimum spanning tree, Shortest path algorithms: Kruskal and Dijkstra’s algorithm.

 Text Books

1. Michael Goodrich and Roberto Tamasia, “Data structures and Algorithms in JAVA”, 4^th Edition, John Wiley & Sons Inc., 2006.
2. Mark Allen Weiss, “Data Structures and Problem Solving using JAVA”, 2^nd Edition, Addison Wesley, 2006.
3. Peter Drake, “Data Structures and Algorithms in JAVA”, Pearson Ed., 2006.

Reference Books

1.     Aho, Hopcroft, Ullman, “Data Structures and Algorithms”, Pearson Education, 2002.

2. Horowitz, Sahni, Rajasekaran, “Computer Algorithms”, Galgotia Publications, 2000.
3. N. Wirth, “Algorithms + Data Structure = Programs”, Prentice Hall, 1978.