MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 139 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.
| 101. |
Which of the following data structure is non-linear type? |
| A. | strings |
| B. | lists |
| C. | stacks |
| D. | tree |
| Answer» E. | |
| 102. |
…………………. Is a directed tree in which outdegree of each node is less than or equal to two. |
| A. | unary tree |
| B. | binary tree |
| C. | trinary tree |
| D. | both b and c |
| Answer» C. trinary tree | |
| 103. |
A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1. |
| A. | directed tree |
| B. | undirected tree |
| C. | dis-joint tree |
| D. | direction oriented tree |
| Answer» B. undirected tree | |
| 104. |
Which is/are the application(s) of stack |
| A. | function calls |
| B. | large number arithmetic |
| C. | evaluation of arithmetic expressions |
| D. | all of the above |
| Answer» E. | |
| 105. |
Any node is the path from the root to the node is called |
| A. | successor node |
| B. | ancestor node |
| C. | internal node |
| D. | none of the above |
| Answer» C. internal node | |
| 106. |
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 |
| Answer» E. | |
| 107. |
Which of the following is not the type of queue? |
| A. | ordinary queue |
| B. | single ended queue |
| C. | circular queue |
| D. | priority queue |
| Answer» C. circular queue | |
| 108. |
In general, the binary search method needs no more than ……………. comparisons. |
| A. | [log2n]-1 |
| B. | [logn]+1 |
| C. | [log2n] |
| D. | [log2n]+1 |
| Answer» E. | |
| 109. |
A ……….. is a graph that has weights of costs associated with its edges. |
| A. | network |
| B. | weighted graph |
| C. | both a and b |
| D. | none a and b |
| Answer» D. none a and b | |
| 110. |
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, paths |
| D. | graph node, edges |
| Answer» B. edges, vertices | |
| 111. |
There is an extra element at the head of the list called a ………. |
| A. | antinel |
| B. | sentinel |
| C. | list header |
| D. | list head |
| Answer» C. list header | |
| 112. |
………… is not the operation that can be performed on queue. |
| A. | insertion |
| B. | deletion |
| C. | retrieval |
| D. | traversal |
| Answer» E. | |
| 113. |
What will be the value of top, if there is a size of stack STACK_SIZE is 5 |
| A. | 5 |
| B. | 6 |
| C. | 4 |
| D. | none |
| Answer» D. none | |
| 114. |
The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists. |
| A. | lists |
| B. | linked lists |
| C. | trees |
| D. | queues |
| Answer» C. trees | |
| 115. |
In a circular queue the value of r will be .. |
| A. | r=r+1 |
| B. | r=(r+1)% [queue_size – 1] |
| C. | r=(r+1)% queue_size |
| D. | r=(r-1)% queue_size |
| Answer» D. r=(r-1)% queue_size | |
| 116. |
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 |
| Answer» C. -1 and 0 | |
| 117. |
A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2. |
| A. | partite |
| B. | bipartite |
| C. | rooted |
| D. | bisects |
| Answer» C. rooted | |
| 118. |
Which of the following is not the internal sort? |
| A. | insertion sort |
| B. | bubble sort |
| C. | merge sort |
| D. | heap sort |
| Answer» D. heap sort | |
| 119. |
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 |
| Answer» B. binary search | |
| 120. |
The number of comparisons done by sequential search is ……………… |
| A. | (n/2)+1 |
| B. | (n+1)/2 |
| C. | (n-1)/2 |
| D. | (n+2)/2 |
| Answer» C. (n-1)/2 | |
| 121. |
In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex. |
| A. | depth first |
| B. | breadth first |
| C. | with first |
| D. | depth limited |
| Answer» B. breadth first | |
| 122. |
A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph. |
| A. | weakly connected |
| B. | strongly connected |
| C. | tightly connected |
| D. | linearly connected |
| Answer» C. tightly connected | |
| 123. |
To represent hierarchical relationship between elements, Which data structure is suitable? |
| A. | dequeue |
| B. | priority |
| C. | tree |
| D. | graph |
| Answer» D. graph | |
| 124. |
Which of the following data structure is linear type? |
| A. | graph |
| B. | trees |
| C. | binary tree |
| D. | stack |
| Answer» E. | |
| 125. |
Which of the following data structure is non linear type? |
| A. | strings |
| B. | lists |
| C. | stacks |
| D. | graph |
| Answer» E. | |
| 126. |
Identify the data structure which allows deletions at both ends of the list but insertion at only one end. |
| A. | input restricted dequeue |
| B. | output restricted qequeue |
| C. | priority queues |
| D. | stack |
| Answer» B. output restricted qequeue | |
| 127. |
Which data structure is used in breadth first search of a graph to hold nodes? |
| A. | stack |
| B. | queue |
| C. | tree |
| D. | array |
| Answer» C. tree | |
| 128. |
Herder node is used as sentinel in ….. |
| A. | graphs |
| B. | stacks |
| C. | binary tree |
| D. | queues |
| Answer» D. queues | |
| 129. |
Which of the following is non-liner data structure? |
| A. | stacks |
| B. | list |
| C. | strings |
| D. | trees |
| Answer» E. | |
| 130. |
A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out. |
| A. | queue linked list |
| B. | stacks linked list |
| C. | both of them |
| D. | neither of them |
| Answer» B. stacks linked list | |
| 131. |
Which of the following data structure can’t store the non-homogeneous data elements? |
| A. | arrays |
| B. | records |
| C. | pointers |
| D. | stacks |
| Answer» B. records | |
| 132. |
Which data structure allows deleting data elements from and inserting at rear? |
| A. | stacks |
| B. | queues |
| C. | dequeues |
| D. | binary search tree |
| Answer» C. dequeues | |
| 133. |
………… is very useful in situation when data have to stored and then retrieved in reverse order. |
| A. | stack |
| B. | queue |
| C. | list |
| D. | link list |
| Answer» B. queue | |
| 134. |
Which of the following is not the part of ADT description? |
| A. | data |
| B. | operations |
| C. | both of the above |
| D. | none of the above |
| Answer» E. | |
| 135. |
……………. Is a pile in which items are added at one end and removed from the other. |
| A. | stack |
| B. | queue |
| C. | list |
| D. | none of the above |
| Answer» C. list | |
| 136. |
…………… is not the component of data structure. |
| A. | operations |
| B. | storage structures |
| C. | algorithms |
| D. | none of above |
| Answer» E. | |
| 137. |
Stack is also called as |
| A. | last in first out |
| B. | first in last out |
| C. | last in last out |
| D. | first in first out |
| Answer» B. first in last out | |
| 138. |
A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called …… |
| A. | avl tree |
| B. | red-black tree |
| C. | lemma tree |
| D. | none of the above |
| Answer» E. | |
| 139. |
Which if the following is/are the levels of implementation of data structure |
| A. | abstract level |
| B. | application level |
| C. | implementation level |
| D. | all of the above |
| Answer» E. | |