Questions
Syllabus
Qns. By Syllabus

Semester

Subject

Year

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: 2074, syllabus wise question

Introduction to Data Structures & Algorithms
1.
Differentiate between structure and union. [5]
2.
Describe the Big 'O' notation. [5]
Lists
1.
What do you mean by double linked list? Explain with example. [5]
Recursion
1.
Explain the Tower of Hanoi (TOH) with practical example. [5]
Searching and Hashing
1.
Differentiate between sequential searching and binary searching. [5]
Sorting
1.
What do you mean by sorting? Explain the Bubble sort with example. [5]
Stack
1.
What do you mean by circular list? Differentiate between stack as a circular list and Queue as a circular list. [10]
2.
Explain the infix to post fix conversion algorithm. [5]
Trees and Graphs
1.
Illustrate the algorithm for Binary search tree with example. [10]
2.
Explain the procedure for construction of Huffman algorithm with example. [10]
3.
What are the types of binary tree? Compare between them. [5]
4.
Differentiate between pre-order traversal and in order traversal. [5]
5.
Discuss the Kruskal's algorithm with example. [5]