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

Introduction to Data Structures & Algorithms
1.
How do you find complexity of algorithms? Explain. [5]
2.
Write short notes on: a. Divide and Conquer sorting b. AVL Tree [5]
Lists
1.
Explain circular linked list with example. How do you implement linked list operation in singly linked list? Explain. [10]
2.
Explain array implementation of list. [5]
Queue
1.
Define Queue. Write are different applications of queue? Explain queue operations with example. [10]
2.
What is priority queue? Why do you need this type of queue? [5]
Recursion
1.
Write a recursive program to find nth fibonacci number. [5]
Searching and Hashing
1.
Write a program to implement sequential search algorithm. [5]
Sorting
1.
Hand test selection sort with array of numbers 4, 71, 32, 19, 61, 2, -5 in descending order. [5]
Stack
1.
Evaluate the expression ABCD-x+ using stack where A=5, B=4, C=3 and D=7. [5]
Trees and Graphs
1.
What is binary search tree? Write a program to implement insertion and deletion algorithms in binary search tree. [10]
2.
What is graph traversal? Explain. [5]