Tribhuvan University
Bachelor of Science in Computer Science and Information Technology
Semester 3 · TU Board 2074
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.
Attempt any two questions (2 x 10 = 20)
- 1.
Illustrate the algorithm for Binary search tree with example.
Answer comingAlso asked in 2078
- 2.
What do you mean by circular list? Differentiate between stack as a circular list and Queue as a circular list.
- 3.
Explain the procedure for construction of Huffman algorithm with example.
- 4.
Differentiate between structure and union.
- 5.
Describe the Big 'O' notation.
- 6.
Explain the infix to post fix conversion algorithm.
- 7.
Explain the Tower of Hanoi (TOH) with practical example.
- 8.
What do you mean by double linked list? Explain with example.
- 9.
What are the types of binary tree? Compare between them.
- 10.
Differentiate between pre-order traversal and in order traversal.
- 11.
What do you mean by sorting? Explain the Bubble sort with example.
- 12.
Differentiate between sequential searching and binary searching.
Answer comingAlso asked in 2079
- 13.
Discuss the Kruskal's algorithm with example.
— The End —