BAMU · Second Year B.E./B.Tech Artificial Intelligence / AI & ML / AI & DS · 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 notation; stacks and their applications to infix, postfix and prefix; queues, 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 their types
- Asymptotic notations
- Static and dynamic memory allocation
- Stack ADT and operations
- Expression conversion and evaluation
- Queue ADT and operations
- Deques and priority queues
- Doubly linked lists
Module 2: Trees; Sorting
15 hoursBinary trees, their memory representation and traversals, header nodes, threaded binary trees, binary search trees and their operations; bubble, insertion, selection, merge, quick, radix and heap sort and their performance.
Examined in the 60-mark end-semester paper
- Tree terminology and representation
- Binary tree traversals
- Threaded binary trees
- Binary search trees
- Insertion, bubble and selection sort
- Merge sort and quick sort
- Radix sort
- Heaps
Module 3: Searching and Hashing; Graphs
15 hoursSequential and binary search, hash tables, hash functions and collision resolution; 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
- Sequential and binary search
- Hashing and collision resolution
- Graph representation
- DFS and BFS
- Warshall's algorithm for transitive closure
- Dijkstra's algorithm
- Topological sorting
- Prim's and Kruskal's algorithms
Module contents are summarised from the official BAMU syllabus . AiCanCode.org is not affiliated with Dr. Babasaheb Ambedkar Marathwada University (BAMU).