BIT · Semester III
Data Structures and Algorithms syllabus
Official TU syllabus for Data Structures and Algorithms (BIT201): 9 units, 73 topics. Every unit links to its notes and solved questions.
1
Fundamentals of Data Structures and Algorithms
6 Q- Definition of data structure
- Definition of abstract data type (ADT)
- Benefits of using ADT
- Primitive data types with examples
- Array as an ADT
- Static versus dynamic list structures
2
Algorithm Analysis and Complexity
5 Q- Definition of algorithm analysis
- Big O notation with examples
- Omega notation with examples
- Time complexity definition and measurement
- Space complexity definition and measurement
- Asymptotic analysis fundamentals
3
Linear Data Structures: Stacks and Queues
12 Q- Stack definition and operations
- Queue definition and operations
- Differentiation between stack and queue
- Simple queue implementation
- Circular queue advantages and implementation
- Priority queue definition and implementation
- Queue implementation using linked list
- Stack implementation using linked list
- Infix to postfix conversion using stack
- Postfix expression evaluation algorithm
4
Linked Lists
5 Q- Singly linked list definition and traversal
- Doubly linked list definition and comparison
- Circular linked list definition and traversal
- Doubly circular linked list operations
- Insertion at front position algorithm
- Deletion of last node algorithm
- Advantages and disadvantages of linked list over array
5
Recursion and Advanced Techniques
6 Q- Recursion definition and benefits
- Limitations of recursion
- Stack usage in recursion
- Tower of Hanoi algorithm and tracing
- Recursive Fibonacci number calculation
- Recursive algorithm design
6
Sorting Algorithms
5 Q- Sorting problem definition
- Quick sort algorithm and tracing
- Quick sort time complexity analysis
- Pivot selection and limitations
- Merge sort algorithm and tracing
- Merge sort time complexity analysis
- Why sorting is needed
7
Searching and Hashing
6 Q- Sequential search algorithm
- Binary search algorithm
- Comparison between sequential and binary search
- Hashing definition and advantages
- Hash collision definition
- Quadratic probing collision resolution
- Double hashing collision resolution
- Hashing versus binary search comparison
8
Trees and Binary Search Trees
9 Q- Binary tree definition and applications
- Complete binary tree definition with examples
- Almost complete binary tree definition with examples
- Binary search tree (BST) definition
- BST search algorithm
- BST insertion algorithm
- BST deletion algorithm
- Pre-order traversal method
- In-order traversal method
- Post-order traversal method
- Binary tree traversal examples
9
Graphs and Graph Algorithms
6 Q- Graph definition and types
- Graph representation using adjacency matrix
- Graph traversal definition
- Breadth first search (BFS) algorithm
- Depth first search (DFS) algorithm
- BFS and DFS tracing with examples
- Shortest path problem definition
- Dijkstra's algorithm for shortest path
- Spanning tree definition
- Minimum spanning tree (MST) definition
- Prim's algorithm for MST
- Round Robin algorithm for MST
Study BIT201 the smart way
Solved questions, flashcards & practice