Scribd
Upload
29 views2 pages

Btech Cse It 3 Sem Data Structure rcs3c002 2020

Uploaded by

kanhapadhi2429
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views2 pages

Btech Cse It 3 Sem Data Structure rcs3c002 2020

Uploaded by

kanhapadhi2429
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

http://www.bputonline.

com

Registration No :

Total Number of Pages : 02 B.Tech


RCS3C002
3rd Semester Regular Examination 2019-20
DATA STRUCTURE
BRANCH : CSE, IT
Max Marks : 100
Time : 3 Hours
Q.CODE : HR910
Answer Question No.1 (Part-1) which is compulsory, any EIGHT from Part-II and any TWO
from Part-III.
The figures in the right hand margin indicate marks.

Part-I
Q1 Only Short Answer Type Questions (Answer All-10) (2 x 10)
a) Which data structures are applied when dealing with a recursive function?
b) How many minimum number of queues needed to implement the priority queue?
c) Write the advantage of the heap over a stack?
d) How does dynamic memory allocation help in managing data?
e) What are the asymptotic notation?
f) Define a complete binary tree.
g) Differentiate NULL and VOID.
h) How does variable declaration affect memory allocation?
i) How many stacks are required to implement a Queue.
j) Distinguish between file and structure storage structure.

Part-II
Q2 Only Focused-Short Answer Type Questions- (Answer Any Eight out of Twelve) (6 x 8)
a) Write an algorithm for inserting and deleting an element from doubly linked list?
b) List out the applications of stack. Write the algorithms for PUSH & POP operations
done using stacks.
c) Simulate the insertion sort using sorting algorithm and show the step by step of the
given values: 23, 11, 37, 28, 15, 19,55, 9.
d) Enlist the advantage of circular queue over ordinary queue. Design a function
CQINSERT for static implementation of circular queue.
e) Convert the following infix expression to prefix notation
E: (A+B*C*(M*N^P+T)-G+H)
f) Construct a binary tree from the following traversal
In order: 4 2 5 1 6 7 3 8 Post order: 4 5 2 6 7 8 3 1
g) Give a basic algorithm for searching operation using linear searching technique.
h) Explain the difference between depth-first and breadth-first traversing techniques at a
graph.
i) Write an algorithm for bubble sort and find out its time complexity.
j) What is a tree? Describe the terminologies used in tree.
k) Illustrate a c program to find the desired element in an array using binary search and
compute its time complexity.
l) Write short note on ADT, Hashing Technique, B+ tree

http://www.bputonline.com
http://www.bputonline.com

Part-III
Only Long Answer Type Questions (Answer Any Two out of Four)
Q3 Draw an AVL tree whose elements are inserted in the following order: mar, may, nov, (16)
aug, apr, jan, dec, jul, feb, jun, oct, sep

Q4 Write the recursive algorithm for tree traversal. (16)

Q5 Specify the heapify algorithm and design the tree with the elements : 21, 9, 15, 19, 12, (16)
14, 8, 7, 13, 6.

Q6 Demonstrate insertion of the keys 5, 28, 19, 15, 20, 33, 12, 17, 10 into a hash table (16)
with separate chaining based collision resolution stratergy. Let the table have 9 slots
and use the division hash function.

http://www.bputonline.com

You might also like