Data Structures and Algorithms

• Chapter 1: Introduction to Data Structures & Algorithms. Notes and past questions on Introduction to Data Structures & Algorithms for TU BSc CSIT Data Structures and Algorithms.
• Chapter 2: Stack. Notes and past questions on Stack for TU BSc CSIT Data Structures and Algorithms.
• Chapter 3: Queue. Notes and past questions on Queue for TU BSc CSIT Data Structures and Algorithms.
• Chapter 4: Recursion. Notes and past questions on Recursion for TU BSc CSIT Data Structures and Algorithms.
• Chapter 5: Lists. Notes and past questions on Lists for TU BSc CSIT Data Structures and Algorithms.
• Chapter 6: Sorting. Notes and past questions on Sorting for TU BSc CSIT Data Structures and Algorithms.
• Chapter 7: Searching and Hashing. Notes and past questions on Searching and Hashing for TU BSc CSIT Data Structures and Algorithms.
• Chapter 8: Trees and Graphs. Notes and past questions on Trees and Graphs for TU BSc CSIT Data Structures and Algorithms.

• What is AVL tree? How heap differ from tree? Construct an AVL tree for data 24,12,8,15,35,30,57,40,45 and 78.[10] (2081)
• Define list. How can you use linked list to implement stack? Explain circular linked list.[10] (2081)
• Define circular queue. How queue differ from stack. Write a program to implement linear queue.[10] (2081)
• Convert the infix expression A+(((B-C)*(D-E)+F)/G$(H-I) into post expression using stack. [5] (2081)
• Write a program to find GCD of two numbers using recursion. [5] (2081)
• What is the application of spanning tree? Draw a MST of a graph containing any 8 vertices and 11 edges with arbitrary edge costs. [5] (2081)
• Sort the number {82, 73, 12, 39, 26, 88, 2, 9, 60, 41} using shell sort. [5] (2081)
• What is hashing? how do you apply linear probing and rehashing explain with example. [5] (2081)
• What is the algorithm for node insertion and deletion from specified position from doubly linked list. [5] (2081)
• Explain big oh notation in brief. Find big oh of the following function: $f(x) = 5x^4 + 9x^2 + 7x + 9$. [5] (2081)
• What is linear queue? Why do we need circular queue? Explain. [5] (2081)
• Write short notes on: a. Breadth First traversal of graph b. TOH [5] (2081)
• Define hash table and hash function. What is collision in hashing? Explain linear probing and quadratic probing with suitable example.[10] (2080)
• Explain AVL tree with example. Also, explain balancing algorithm for this tree.[10] (2080)
• Explain queue as an ADT. Write a program to implement linear queue. Compare linear queue with circular queue.[10] (2080)

Frequently asked questions

Based on the official syllabus.