2079
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.
Why do we need to balance the binary search tree? Justify with an example. Create an AVL tree from the data 24, 12, 8, 15, 35, 30, 57, 40, 45, 78.
How recursive algorithm uses stack to store intermediate results? Illustrate with an example. Convert the infix expression A+B-(CD/E+F)-GH into postfix expression using stack.
How do you insert and delete a node at kth position of the doubly linked list? Describe the process of implementing stack and queue using linked list.
Attempt any EIGHT question.
Sort the numbers 82,73,12,39,26,88,2,9,60,41 using shell sort.
Why do we need asymptotic notation? Describe about Big O notation with its curve.
Define queue. Explain about enqueue and dequeue operation in circular queue.
Write a program to implement binary search.
Find the MST of following graph using Prim’s algorithm.
Assume you have to store the data {0,1,2,4,5,7} into a hash table of size 5, with hash function, h(x)=x%5. Apply linear probing and double hashing as collision resolution techniques.
In which case the position of pivot element in quick sort always either in the last or the first position? Create a max heap from the numbers. {10,12,53,34,23,77,59,66,5,8}
Evaluate the postfix expression 574-*8/4+ using stack.
Write short noes on:
a. Priority Queue
b. Breadth First traversal of a graph
*** END OF QUESTION PAPER ***
Definition A Binary Search Tree (BST) is a binary tree in which: - The left child of a node contains a value less than the node's value. - The right child of a node contains a value greater than the n
Part A: Use of Stack in Recursive Algorithms Definition of Recursion A recursive algorithm is an algorithm that solves a problem by calling itself with a smaller subproblem until a base condition is
Definition A Doubly Linked List (DLL) is a linear data structure in which each node contains: - Data - Previous pointer (prev) - Next pointer (next) Steps for Insertion at Kth Position 1. Create a ne
Shell Sort 1. Definition Shell Sort is an improved version of Insertion Sort that allows the exchange of elements far apart by using a sequence of gaps. The gap is reduced step by step until it bec
1. Need for Asymptotic Notation Asymptotic notation is used to describe the performance of algorithms in terms of time and space complexity as input size increases. Why it is needed: - Ignores machi
And more questions available on this page.