Scribd
Upload
23 views4 pages

Ds 4

data structure

Uploaded by

Sumedh R
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
23 views4 pages

Ds 4

data structure

Uploaded by

Sumedh R
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/ 4

SE-37

Seat Total No. of Pages : 4


No.

S.Y. B.Tech. (Computer Science and Engineering) (Part - II)


(Semester - III) (CBCS) Examination, March - 2023
DATA STRUCTURES
Sub. Code : 73278

Day and Date : Saturday, 17 - 06 - 2023 Total Marks : 70


Time : 02.30 p.m. to 05.00 p.m.
Instructions : 1) All questions are Compulsory.
2) Assume suitable data wherever necessary.
3) Figures to the right indicate full marks.

Q1) Solve MCQs. (1 Marks Each) :


i) Which of the following is/are the levels of implementation of data structure
a) Abstract level b) Application level
2

c) Implementation level d) All of the above


47

ii) _________ is not the component of data structure.


a) Operations b) Storage Structures
c) Algorithms d) None of above
iii) Which data structure allows deleting data elements from and inserting at
rear?
a) Stacks b) Queues
c) Dequeues d) Binary search tree
iv) In __________, search start at the beginning of the list and check every
element in the list.
a) Linear search b) Binary search
c) Hash Search d) Binary Tree search
v) Which of the following is not the internal sort?
a) Insertion Sort b) Bubble Sort
c) Merge Sort d) Heap Sort
P.T.O.
SE-37
vi) In a queue. the initial values of front pointer f rare pointer r should be
_______ and respectively.
a) 0 and 1 b) 0 and –1
c) –1 and 0 d) 1 and 0
vii) Which of the following statement is true?
i) Using singly linked lists and circular list, it is not possible to traverse
the list backwards.
ii) To find the predecessor, it is required to traverse the list from the
first node in case of singly linked list.
a) i-only b) ii-only
c) Both i and ii d) None of both
viii) Each node in a linked list has two pairs of ________ and ________.
a) Link field and information field
b) Link field and avail field
2
c) Avail field and information field
47

d) Address field and link field


ix) Finding the location of the element with a given value is :
a) Traversal b) Search
c) Sort d) None of above
x) Linked lists are best suited
a) for relatively permanent collections of data
b) for the size of the structure and the data in the structure are constantly
changing
c) for both of above situation
d) for none of above situation
xi) The time complexity of quick sort is _________.
a) O(n) b) O(n2)
c) O(n log n) d) O(log n)

-2-
SE-37
xii) The property of binary tree is
a) The first subset is called left subtree
b) The second subtree is called right subtree
c) The root cannot contain NULL
d) The right subtree can be empty
xiii) In general, the binary search method needs no more than ______
comparisons.
a) [log2n]–l b) [logn]+l
c) [log2n] d) [log2n]+l
xiv) A graph is a collection of nodes, called _________ And line segments
called arcs or that connect pair of nodes.
a) vertices, edges b) edges, vertices
c) vertices, path d) graph node, edge

Q2) Solve any 2 of the following (7 Marks Each) :


2

a) What is data structure? Explain the classification of data structures in


47

details.
b) Explain working of the Selection Sort Algorithm. Comment on Complexity
of Merge Sort.
c) Convert the following infix expression to postfix using stack
(a + b) * (c / d – e) show the contents of stack at every step of conversion.

Q3) Solve any 2 of the following (7 Marks Each) :


a) Explain Priority queue in details? Write a note on applications of Priority
queues.
b) List and explain the Asymptotic Notations for analysis of Algorithms.
c) Explain the following operations on the circular linked list :
i) Insertion
ii) Searching
iii) traversing

-3-
SE-37
Q4) Solve any 2 of the following (7 Marks Each) :
a) Explain following tree terminologies with suitable example :
i) Terminal Nodes
ii) Degree of a Node
iii) Degree of a Tree
b) What is use of Binary Search Tree? Construct BST for foflowing set of
key values. 55, 45, 30, 65, 54, 32, 35, 50, 61
c) Explain Graph basic concepts and its storage representation.

Q5) Solve any 2 of the following (7 Marks Each) :


a) Explain Heap sort with example.
b) Difference between DFS and BFS.
c) Explain tree traversal techniques with example.
i) Inorder
ii) Preorder
2
47

iii) Postorder



-4-

You might also like