computer-4-sem-data-struct-using-c-170842-may-2019
computer-4-sem-data-struct-using-c-170842-may-2019
computer-4-sem-data-struct-using-c-170842-may-2019
www.hsbteonline.com
SECTION-C Q.31 Give differences between sequential search
and binary search. (CO-6)
Note:Short answer type questions. Attempt any eight
questions. 8x5=40 Q.32 Sort the following list of elements using bubble
sort. Show result after each step. (CO-6)
Q.23 Explain the various types of data structures.
(CO-1) 6 10 2 9 1 5 7
Q.24 Give five differences between a Array and a SECTION-D
Linked List. (CO-2)
Note:Long answer type questions. Attempt any three
Q.25 Explain linear and non linear data structures. questions. 3x10=30
(CO-1)
Q.33 What are different types of Arrays? Explain how
Q.26 Give algorithm for adding a element in the element of arrays are stored in memory?
beginning of the linked list. (CO-3) (CO-2)
Q.27 Define Array. Give algorithm for traversing an Q.34 Explain Sequential search technique with
array. (CO-2) suitable example? Give algorithm. (CO-6)
Q.28 Give algorithm for deleting an element form the Q.35 Convert the following expressions into postfix
stack. (CO-4) notation using Stack (CO-4)
Q.29 What is the limitation of a linear queue. How is it A + B * C + D / E -F
removed. (CO-4)
Q.36 Write short note on (CO-1)
Q.30 Give inorder, postorder and preorder traversal
of the following tree. (CO-5) a) Structured programming
b) Tower of Hanoi
A
B C
D E F
www.hsbteonline.com