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.
Attempts any Two Questions (2 x 10 = 20)
What is stack? What are the different applications of stack? Explain stack operations with example.
Differentiate between singly linked list and doubly linked list. How do you insert and delete a node from doubly linked list? Explain.
What is shortest path? Explain Dijkstra algorithm for finding shortest path using suitable example.
Attempts any eight questions (2 x 10 = 20)
What is dynamic memory allocation? Compare data structure with abstract data type.
Explain algorithm for evaluation of postfix expression using stack
Explain queue as an ADT.
Write a recursive program to find GCD of two numbers.
What is linked list? How is it different from array?
Hand test bubble sort with array of numbers 53, 42, 78, 3, 5, 2, 15 in ascending order.
What is hashing? Explain concept of hash table and hash function with example.
What is minimum spanning tree? Explain
Write short notes on: