Questions related to Data Structure and Algorithm - Hamro CSIT

Advertisement

Advertisement

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.

Answered Data Structure and Algorithm Asked on 2079 Exam

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.

Answered Data Structure and Algorithm Asked on 2079 Exam

Evaluate the postfix expression 574-*8/4+ using stack.

Answered Data Structure and Algorithm Asked on 2079 Exam

Find the MST of following graph using Prim’s algorithm.

Answered Data Structure and Algorithm Asked on 2079 Exam

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.

Answered Data Structure and Algorithm Asked on 2079 Exam

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}

Answered Data Structure and Algorithm Asked on 2079 Exam

Write short noes on:

a. Priority Queue

b. Breadth First traversal of a graph

Answered Data Structure and Algorithm Asked on 2079 Exam

Define queue. Explain about enqueue and dequeue operation in circular queue.

Answered Data Structure and Algorithm Asked on 2079 Exam

Why do we need asymptotic notation? Describe about Big oh notation with its curve.

Answered Data Structure and Algorithm Asked on 2079 Exam

Sort the numbers 82,73,12,39,26,88,2,9,60,41 using shell sort.

Answered Data Structure and Algorithm Asked on 2079 Exam

HAMROCSIT.COM

Copyright 2023 | HAMROCSIT.COM | All Right Reserved