Data Structures and Algorithms

• Chapter 1: Fundamentals of Data Structures and Algorithms. Notes and past questions on Fundamentals of Data Structures and Algorithms for TU BIT Data Structures and Algorithms.
• Chapter 2: Algorithm Analysis and Complexity. Notes and past questions on Algorithm Analysis and Complexity for TU BIT Data Structures and Algorithms.
• Chapter 3: Linear Data Structures: Stacks and Queues. Notes and past questions on Linear Data Structures: Stacks and Queues for TU BIT Data Structures and Algorithms.
• Chapter 4: Linked Lists. Notes and past questions on Linked Lists for TU BIT Data Structures and Algorithms.
• Chapter 5: Recursion and Advanced Techniques. Notes and past questions on Recursion and Advanced Techniques for TU BIT Data Structures and Algorithms.
• Chapter 6: Sorting Algorithms. Notes and past questions on Sorting Algorithms for TU BIT Data Structures and Algorithms.
• Chapter 7: Searching and Hashing. Notes and past questions on Searching and Hashing for TU BIT Data Structures and Algorithms.
• Chapter 8: Trees and Binary Search Trees. Notes and past questions on Trees and Binary Search Trees for TU BIT Data Structures and Algorithms.
• Chapter 9: Graphs and Graph Algorithms. Notes and past questions on Graphs and Graph Algorithms for TU BIT Data Structures and Algorithms.

• Why do we need sorting?Trace the Quick sort for the input {12, -9, 56, 23, 4, 8, 6, 9, 23, 21}.[2+8] (2082)
• Define primitive data type with example.What are the advantages of hashing?With your own example show the hash collision and how do you h... (2082)
• Distinguish between static and dynamic list structure.Explain about linked list implementation of stack and queue.[2+8] (2082)
• Why do we need circular queue? Explain. [5] (2082)
• Traverse the following graph using BFS and DFS. [5] (2082)
• Convert the infix expression 7 * 8 + 10 - 2 to postfix using stack. [5] (2082)
• Explain the insertion and deletion of a node at first and last position of doubly circular linked list. [5] (2082)
• Define time and space complexity. Discuss about Round Robin Algorithm for MST. [1+4] (2082)
• Traverse the following tree in pre-order and in-order. [5] (2082)
• Define binary tree and binary search tree. List the applications of Binary tree. [2+3] (2082)
• List the limitation of recursion. How do you delete the node in BST? [2+3] (2082)
• What is simple queue? Describe about any three types of graphs. [2+3] (2082)
• What is stack? Explain different stack operations. Explain algorithm to evaluate postfix expression.[10] (2080)
• Explain almost complete binary tree with example. How do you insert, search, and delete nodes in a binary search tree? Explain with suita... (2080)
• Discuss the limitation of choosing first element as pivot in quick sort. Using merge sort algorithm, sort the numbers 40, 6, 5,21, 3, 100... (2080)

Frequently asked questions

Based on the official syllabus.