Diploma MSBTE
Subject: DSU
Sample Question Paper (MCQ with Answers)
Q
1 - A procedure that calls itself is called
C - recursive
Q
2 - What data structure can be used to check if a syntax has balanced
paranthesis ?
D - stack
Q
3 - A linked-list is a dynamic structure
A - true
Q
4 - Binary search tree has best case run-time complexity of Ο(log n). What
could the worst case?
A - Ο(n)
Q
5 - Graph traversal is different from a tree traversal, because
C - trees have
root.
D -
None is true as tree is a subset of graph.
Q
6 - In context with time-complexity, find the odd out −
A -
Deletion from Linked List.
C -
Adding edge in Adjacency Matrix
D - Heapify a
Binary Heap
Q
7 - Linked list search complexity is
B - Ο(n)
Q
8 - Which of the following algorithm cannot be desiged without recursion −
D - None of the
above
Q
9 - If we choose Prim's Algorithm for uniquely weighted spanning tree
instead of Kruskal's Algorithm, then
A -
we'll get a different spanning tree.
B - we'll get the
same spanning tree.
C -
spanning will have less edges.
D -
spanning will not cover all vertices.
Q
10 - Which of the following algorithm does not divide the list −
A - linear search
11) The complexity of merge sort algorithm is ……
A. O(n)
B. O(logn)
C. O(n2)
D. O(n logn)
12) ………. is putting an element in the appropriate place in
a sorted list yields a larger sorted order list.
A. Insertion
B. Extraction
C. Selection
D. Distribution
13) …………order is the best possible for array sorting
algorithm which sorts n item.
A. O(n logn)
B. O(n2)
C. O(n+logn)
D. O(logn)
14) ……… is rearranging pairs of elements which are out of
order, until no such pairs remain.
A. Insertion
B. Exchange
C. Selection
D. Distribution
15) ………… is the method used by card sorter.
A. Radix sort
B. Insertion
C. Heap
D. Quick
16) Which of the following sorting algorithm is of divide
and conquer type?
A. Bubble sort
B. Insertion sort
C. Merge sort
D. Selection sort
17) …….. sorting algorithm is frequently used when n is
small where n is total number of elements.
A. Heap
B. Insertion
C. Bubble
D. Quick
18) Which of the following sorting algorithm is of priority
queue sorting type?
A. Bubble sort
B. Insertion sort
C. Merge sort
D. Selection sort
19) Which of the following is not the required condition
for a binary search algorithm?
A. The list must be sorted
B. There should be direct access to the middle element in
any sublist
C. There must be a mechanism to
delete and/or insert elements in the list.
D. Number values should only be present
20) Partition and exchange sort is ……..
A. quick sort
B. tree sort
C. heap sort
D. bubble sort
21) The term push and pop is related to
A. Array
B. Lists
C. Stacks
D. Trees
22) Which is the pointer associated with the stack?
A. FIRST
B. FRONT
C. TOP
D. REAR
23) The elements are removal from a stack in ………. order.
A. Reverse
B. Hierarchical
C. Alternative
D. Sequential
24) The insertion operation in the stack is called ………
A. insert
B. push
C. pop
D. top
25) …… is the term used to insert an element into stack.
A. Push
B. Pull
C. Pop
D. Pump
26) Stack follows the strategy of ……..
A. LIFO
B. FIFO
C. LRU
D. RANDOM
27) ………. is the term used to delete an element from the
stack.
A. Push
B. Pull
C. Pop
D. Pump
28) Deletion operation is done using ……… in a queue.
A. front
B. rear
C. top
D. list
29) A pointer variable which contains the location at the
top element of the stack is called …..
A. Top
B. Last
C. Final
D. End
30) Which of the following is an application of stack?
A. finding factorial
B. tower of Hanoi
C. infix to postfix
D. all of the above
31) Linked lists are best suited …..
A. for relatively permanent collections of data.
B. the size of the structure and the
data in the structure are constantly changing.
C. data structure
D. for none of the above situation
32) The operation of processing each element in the list is
known as ……
A. sorting
B. merging
C. inserting
D. traversal
33) The situation when in a linked list START=NULL is ….
A. Underflow
B. Overflow
C. Houseful
D. Saturated
34) Each node in singly linked list has …….. fields.
A. 2
B. 3
C. 1
D. 4
35) Which of the following are two-way lists?
A. Grounded header list
B. Circular header list
C. Linked list with header and trailer nodes
D. List traversed in two directions
36) Which is the pointer associated with the availability
list?
A. FIRST
B. AVAIL
C. TOP
D. REAR
37) Value of first linked list index is ….
A. 0
B. 1
C. -1
D. 2
38) In linked lists, there are no NULL links in
A. single linked list
B. linear doubly linked list
C. circular linked list
D. linked list
39) Each node in a linked list must contain at least …..
A. Three fields
B. Two fields
C. Four fields
D. Five fields
40) The dummy header in linked list contain …..
A. first record of the actual data
B. last record of the actual data
C. pointer to the last record of the actual data
D. middle record of the actual data
41) The operation of processing each element in the list is
known as ……
A. sorting
B. merging
C. inserting
D. traversal
42) Another name for the directed graph is ……….
A. Direct graph
B. Digraph
C. Dir-graph
D. Digraph
43) Binary trees with threads are called as …….
A. Threaded trees
B. Pointer trees
C. Special trees
D. Special pointer trees
44) Graph G is ………….. if for any pair u, v of nodes in G
there is a path from u to v or path from v to u.
A. Literally connected
B. Widely Connected
C. Unliterally connected
D. Literally connected
45) In Binary trees, nodes with no successor are called ……
A. End nodes
B. Terminal nodes
C. Final nodes
D. Last nodes
46) A connected graph T without any cycles is called ……..
A. free graph
B. no cycle graph
C. non-cycle graph
D. circular graph
47) Trees are said ………. if they are similar and have the
same contents at corresponding nodes.
A. Duplicate
B. Carbon copy
C. Replica
D. Copies
48) A connected graph T without any cycles is called a ……..
A. A tree graph
B. Free tree
C. A tree d
D. All of the above
49) Every node N in a binary tree T except the root has a
unique parent called the ……… of N.
A. Antecedents
B. Predecessor
C. Forerunner
D. Precursor
50) In a graph if E=(u,v) means ……
A. u is adjacent to v but v is not adjacent to u
B. e begins at u and ends at v
C. u is processor and v is the successor
D. both b and c
Thank You! Share with your friends
Welcome to msbtesolution.xyz , Here we provide you all materials what you want? .
We provide you free materials like :
1. Important MCQs
2. Important Topics
3. Important Questions
4. Programs
5. Manual Practicals
6. Syllabus
7. Sample Question Paper
8. Model Answer Paper
9. Previous Year Paper
10. Micro-Projects and Final Year Project
Contact us :
Instagram: @msbte_solution
Youtube: MSBTE IT Solution