Semester
Subject
Year
Bachelors In Information Technology
Institute of Science and Technology, TU
Data Structures and Algorithms (BIT201)
Year Asked: 2078, syllabus wise question
Algorithms
1.
Explain big oh(O) notation with suitable example. [5]
Background and Concept of Data Structures
1.
What is data Structure? Explain an array as an abstract data type. [5]
Graph
1.
What is shortest path algorithm? Use Dijkstra's algorithm to find shortest path between the vertices of a and z in the graph given below.
[10]
2.
What is graph traversal? Explain breadth first search. [5]
Queue
1.
Define priority queue. How do you implement priority queue? Explain. [5]
2.
How can you implement queue using linked list? Explain. [5]
Recursion
1.
Define recursion. Explain Tower of Hanoi algorithm in detail. [5]
Searching
1.
Explain sequential search. How is it different from binary search? [5]
2.
Define hashing. Explain quadratic probing with example. [5]
Sorting
1.
Explain merge sort along with its time complexity. Use this algorithm to sort array of numbers given below: 25, 37, 48, 25, 23, 17, 31, 45, 7, 21, 15, 8, 11 [10]
Stack
1.
Explain algorithm to convert an infix expression to postfix using stack? Use this algorithm to convert (A+B)*C-D to postfix. [10]
Tree
1.
What is binary tree? Explain different application of binary tree. [5]