2080
Bsc CSIT / Semester 3 / Science
Computer Science and Information Technology
Data Structure and Algorithms
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.
Attempt any TWO question.
Explain queue as an ADT. Write a program to implement linear queue. Compare linear queue with circular queue.
Define hash table and hash function. What is collision in hashing? Explain linear probing and quadratic probing with suitable example.
Explain AVL tree with example. Also, explain balancing algorithm for this tree.
Attempt any EIGHT question.
What is asymptotic analysis? Explain theta notation with example.
Explain push and pop operations of stack. What are different applications of stack?
Explain tail recursion with example. Compare recursion with iteration.
Trace selection sort algorithm with array of numbers 2, 81, 6, 45, 11, 21, 23, 41, and 11.
Explain binary search with an example. What is the time complexity of binary search?
Write Dijkstra’s algorithm to find shortest path between any two vertices of a graph.
Write a program to implement insertion sort.
How can you use linked list to implement stack? Explain.
Write short notes on:
a. Abstract data type
b. Circular linked list
*** END OF QUESTION PAPER ***
1. Asymptotic Analysis Definition Asymptotic analysis is a method used to analyze the performance of an algorithm by measuring how its time or space complexity grows as the input size (n) becomes ver
Queue as an Abstract Data Type (ADT) Definition A Queue is a linear data structure that follows the FIFO (First In, First Out) principle. The element inserted first is removed first. Queue ADT Spe
Hash Table Definition A Hash Table is a data structure that stores data in an array and allows fast insertion, deletion, and searching by using a hash function to compute an index. Example If keys
AVL Tree (Definition & Concept) Definition An AVL Tree is a self-balancing Binary Search Tree (BST) in which the difference between the heights of the left and right subtrees of any node is at most 1
Stack (Definition) A Stack is a linear data structure that follows the LIFO (Last In, First Out) principle. The element inserted last is removed first. Examples: - Stack of plates - Undo/Redo op
And more questions available on this page.