Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
4 views

Msci 3 Sem Ap Data Structure Using C and CPP Fbef310 2020

Uploaded by

kanhapadhi2429
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Msci 3 Sem Ap Data Structure Using C and CPP Fbef310 2020

Uploaded by

kanhapadhi2429
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

http://www.bputonline.

com

Registration No :

Total Number of Pages : 01 M.Sc.I


FBEF310
3rd Semester Back Examination 2019-20
DATA STRUCTURE USING C &C++
BRANCH : M.Sc.I(AP)
Time : 3 Hours
Max Marks : 70
Q.CODE : HB918
Answer Question No.1 which is compulsory and any FIVE from the rest.
The figures in the right hand margin indicate marks.

Q1 Answer the following questions : (2 x 10)


a) List out few of the Application of tree data-structure?
b) What are the notations used in Evaluation of Arithmetic Expressions using
prefix and postfix forms?
c) How can you check whether if binary tree is height balanced or not ?
d) State the difference between queues and linked lists.
e) Distinguish between Abstract Data Type, Data Type and Data Structure.
f) What are the categories of AVL rotations?
g) How many stacks are required to implement a Queue.
h) What would be the asymptotic time complexity to add an element in the linked
list?
i) Which data structure is used for implementing recursion?
j) Specify the worst case and average case complexities of a binary search tree.

Q2 a) Write a C program to merge two sorted linked list. (5)


b) Implement the pseudo code for insertion & deletion operation in a linear queue. (5)

Q3 a) Convert the following infix expression to prefix notation (5)


E: (A+B*C*(M*N^P+T)-G+H)
b) Evaluate the given expression postfix expression (5)
E: ABC*D/+) where A=2, B=3, C=4, D=6

Q4 a) Draw a binary search tree whose elements are inserted in the following order (5)
50, 70, 90, 93, 100, 20, 10, 12, 9, 85.
b) Define a tree. Describe the terminologies used in tree. (5)

Q5 a) Explain the difference between depth-first and breadth-first traversing (5)


techniques at a graph.
b) Write an algorithm for bubble sort and find out its time complexity. (5)

Q6 Insert the following nodes in an AVL tree. Nodes are 55, 66, 77, 15, 11, 33, 22, (10)
35, 25, 44, 88, 99

Q7 Write a program to arrange the list of numbers in ascending order using quick (10)
sort.

Q8 Write short Notes on any TWO : (5 x 2)


a) Heap sort.
b) BFS
c) Hashing Technique

http://www.bputonline.com

You might also like