Data Structures and Algorithms
3IT4-05 · Semester 3
0/61 topics
Basic stack operations
Representation of stack using static array
Representation of stack using dynamic array
Multiple stack implementation using single array
Stack applications: Reversing list
Stack applications: Factorial calculation
Infix to postfix transformation
Evaluating arithmetic expressions
Towers of Hanoi
Basic queue operations
Representation of queue using array
Implementation of queue operations using stack
Queue applications: Round Robin algorithm
Circular queues
Double Ended Queue (DeQueue)
Priority queues
Single linked list introduction
Representation of linked list in memory
Operations on single linked list
Reversing a single linked list
Advantages and disadvantages of single linked list
Circular linked list
Double linked list
Header linked list
Sequential search
Binary search
Basic sorting concepts
Bubble sort
Insertion sort
Selection sort
Quick sort
Heap sort
Merge sort
Radix sort
Counting sort
Definition of tree
Properties of tree
Binary tree
Representation of binary trees using arrays
Representation of binary trees using linked lists
Operations on binary trees
Recursive binary tree traversals
Binary search tree
B-tree
B+ tree
AVL tree
Threaded binary tree
Basic graph concepts
Representations of graphs
Breadth-First Search (BFS)
Depth-First Search (DFS)
Prim's Minimum Spanning Tree algorithm
Kruskal's Minimum Spanning Tree algorithm
Dijkstra's shortest path algorithm
Hash functions
Address calculation techniques
Common hashing functions
Collision resolution techniques
Linear probing
Quadratic probing
Double hashing