Semester
Subject
Year
Bachelors In Information Technology
Institute of Science and Technology, TU
Data Structures and Algorithms (BIT201)
Year Asked: 2082, syllabus wise question
Algorithms
1.
Define primitive data type with example. What are the advantages of hashing? With your own example show the hash collision and how do you handle it? Explain. [2+2+6]
2.
Define time and space complexity. Discuss about Round Robin Algorithm for MST. [1+4]
Graph
1.
Traverse the following graph using BFS and DFS. 
[5]
List
1.
Distinguish between static and dynamic list structure. Explain about linked list implementation of stack and queue. [2+8]
2.
Explain the insertion and deletion of a node at first and last position of doubly circular linked list. [5]
Queue
1.
Why do we need circular queue? Explain. [5]
2.
What is simple queue? Describe about any three types of graphs. [2+3]
Recursion
1.
List the limitation of recursion. How do you delete the node in BST? [2+3]
Sorting
1.
Why do we need sorting? Trace the Quick sort for the input {12, -9, 56, 23, 4, 8, 6, 9, 23, 21}. [2+8]
Stack
1.
Convert the infix expression 7 * 8 + 10 - 2 to postfix using stack. [5]
Tree
1.
Traverse the following tree in pre-order and in-order. 
[5]
2.
Define binary tree and binary search tree. List the applications of Binary tree. [2+3]