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

Introduction to Data Structures & Algorithms
1.
What is dynamic memory allocation? Compare data structure with abstract data type. [5]
2.
Write short notes on: a. Tail recursion b. Collision resolution techniques [5]
Lists
1.
Differentiate between singly linked list and doubly linked list. How do you insert and delete a node from doubly linked list? Explain. [10]
2.
What is linked list? How is it different from array? [5]
Queue
1.
Explain queue as an ADT. [5]
Recursion
1.
Write a recursive program to find GCD of two numbers. [5]
Searching and Hashing
1.
What is hashing? Explain concept of hash table and hash function with example. [5]
Sorting
1.
Hand test bubble sort with array of numbers 53, 42, 78, 3, 5, 2, 15 in ascending order. [5]
Stack
1.
What is stack? What are the different applications of stack? Explain stack operations with example. [10]
2.
Explain algorithm for evaluation of postfix expression using stack. [5]
Trees and Graphs
1.
What is shortest path? Explain Dijkstra algorithm for finding shortest path using suitable example. [10]
2.
What is minimum spanning tree? Explain. [5]