Bachelors Level/Second Year/Third Semester/Science csit/third semester/data structures and algorithms/syllabus wise questions

B.Sc Computer Science and Information Technology

Institute of Science and Technology, TU

Data Structures and Algorithms (CSC211)

Year Asked: 2081, syllabus wise question

Introduction to Data Structures & Algorithms
1.
Explain big oh notation in brief. Find big oh of the following function: $f(x) = 5x^4 + 9x^2 + 7x + 9$. [5]
2.
Write short notes on: a. Breadth First traversal of graph b. TOH [5]
Lists
1.
Define list. How can you use linked list to implement stack? Explain circular linked list. [10]
2.
What is the algorithm for node insertion and deletion from specified position from doubly linked list. [5]
Queue
1.
Define circular queue. How queue differ from stack. Write a program to implement linear queue. [10]
2.
What is linear queue? Why do we need circular queue? Explain. [5]
Recursion
1.
Write a program to find GCD of two numbers using recursion. [5]
Searching and Hashing
1.
What is hashing? how do you apply linear probing and rehashing explain with example. [5]
Sorting
1.
Sort the number {82, 73, 12, 39, 26, 88, 2, 9, 60, 41} using shell sort. [5]
Stack
1.
Convert the infix expression A+(((B-C)*(D-E)+F)/G$(H-I) into post expression using stack. [5]
Trees and Graphs
1.
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]
2.
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]