Tribhuvan University
Bachelor of Science in Computer Science and Information Technology
Semester 3 · Model question
Course Title: Data Structures and Algorithms (CSC211)
Full Marks: 60Pass Marks: 24Time: 3 hours
Candidates are required to give their answers in their own words as far as practicable. The figures in the margin indicate full marks.
Group A
(2 × 10 = 20)
- 1.10
Define queue as ADT. Describe its primitive operation on circular array implementation and singly linked list implementation.
- 2.10
Define Contiguous List as ADT. Write C program to implement the operation of Contiguous List.
- 3.10
What do you mean by MST. Explain Kruskal Algorithm with example.
Group B
(8 × 5 = 40)
- 4.5
State relative merits and demerits of contiguous list and linked list?
- 5.5
What is Data Structure? Show the status of stack converting following infix expression to prefix
A+(B*C-(D/E^F)*G) [Note ^ is the power]
- 6.5
What is singly linked list? Write an algorithm to add a node at the beginning and end of singly linked list.
- 7.5
What do you mean by breadth first search in graph? Explain with recursive tree.
- 8.5
Write recursive algorithm to get Fibonacci term. Illustrate it drawing recursive tree.
- 9.5
What is AVL tree? Draw the AVL tree when input is 1,2,3,4,5,6,7.
- 10.5
State problem Tower of Hanoi. Explain the algorithm to solve problem.
- 11.5
What is insertion sort? Trace and sort the following data using the insertion sorting algorithm.
90, 56, 80, 10, 22, 21, 45, 9
- 12.5
What is hashing? Explain the different types to resolute collision?
— The End —