Institute of Science and Technology
Bachelor Level / third-semester / Science
Computer Science and Information Technology( CSC206 )
Data Structure and Algorithm
Full Marks: 60 + 20 + 20
Pass Marks: 24 + 8 + 8
Time: 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.
Attempt any two questions (2 x 10 = 20)
Illustrate the algorithm for Binary search tree with example.
What do you mean by circular list? Differentiate between stack as a circular list and Queue as a circular list.
Explain the procedure for construction of Huffman algorithm with example.
Attempts any eight questions (8 x 5 = 40)
Differentiate between structure and union.
Describe the Big ‘O’ notation.
Explain the infix to post fix conversion algorithm.
Explain the Tower of Hanoi (TOH) with practical example.
What do you mean by double linked list? Explain with example.
What are the types of binary tree? Compare between them.
Differentiate between pre-order traversal and in order traversal.
What do you mean by sorting? Explain the Bubble sort with example.
Differentiate between sequential searching and binary searching.
Discuss the Kruskal’s algorithm with example.