BAMU · Second Year B.E./B.Tech Information Technology · NEP 2020
Data Structures
PCCT-1 · Semester III · 3 credits · CIA 40 + SEE 60
Module 1: Introduction to Data Structures; Queues and Linked Lists
15 hoursData structure operations, ADTs, arrays, structures, pointers and dynamic memory; asymptotic notations; stacks and their array and linked representations with infix, postfix and prefix; queues as ADT, circular queues, deques and priority queues; singly, header, circular and doubly linked lists and buddy systems.
Examined in the 60-mark end-semester paper
- Data structures and abstract data types
- Time and space complexity, asymptotic notation
- Stack implementation with arrays and linked lists
- Stack applications: recursion and expression conversion
- Queue, circular queue and deque
- Priority queues
- Singly linked list
- Doubly and circular linked lists
Module 2: Trees; Sorting
15 hoursBinary trees, their memory representation and traversals, header nodes, threaded binary trees, and searching, inserting and deleting in binary search trees; bubble, merge, quick, radix, insertion, selection and heap sort, with performance analysis and comparison.
Examined in the 60-mark end-semester paper
- Binary trees and their representation
- Binary tree traversals
- Threaded binary trees
- Binary search trees
- Bubble, selection and insertion sort
- Divide and conquer: merge sort and quick sort
- Heaps and heap sort
Module 3: Searching and Hashing Algorithms; Graphs
15 hoursSequential and binary search, ordered lists, hash tables, hash functions and collision resolution, with complexity analysis; graph terminology, adjacency and path matrices, DFS and BFS, Warshall's and Dijkstra's algorithms, topological sorting, and Prim's and Kruskal's spanning trees.
Examined in the 60-mark end-semester paper
- Linear and binary search
- Hash functions
- Collision handling: chaining and open addressing
- Graph representation, BFS and DFS
- Shortest path algorithms
- Topological sort
- Minimum spanning trees: Prim's and Kruskal's
Module contents are summarised from the official BAMU syllabus . AiCanCode.org is not affiliated with Dr. Babasaheb Ambedkar Marathwada University (BAMU).