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.
Long Answer Questions:
Attempt any TWO Questions (2 x 10 = 20)
Define Queue. Write are different applications of queue? Explain queue operations with example.
Explain circular linked list with example. How do you implement linked list operation in singly linked list? Explain.
What is binary search tree? Write a program to implement insertion and deletion algorithms in binary search tree.
Short Answer Questions:
Attempt any EIGHT Questions (8 x 5 = 40)
How do you find complexity of algorithms? Explain
Evaluate the expression ABCD-x+ using stack where A=5, B=4, C=3 and D=7
What is priority queue? Why do you need this type of queue?
Write a recursive program to find nth fibonacci number.
Explain array implementation of list.
Hand test selection sort with array of numbers 4, 71, 32, 19, 61, 2, -5 in descending order.
Write a program to implement sequential search algorithm.
What is graph traversal? Explain.
Write short notes on: