MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 657 Mcqs, each offering curated multiple-choice questions to sharpen your Testing Subject knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
A linear list in which the last node points to the first node is ........ |
| A. | singly linked list |
| B. | circular linked list |
| C. | doubly linked list |
| D. | none of the above |
| Answer» C. doubly linked list | |
| 2. |
A linear list in which the pointer points only to the successive node is ...... |
| A. | singly linked list |
| B. | circular linked list |
| C. | doubly linked list |
| D. | none of the above |
| Answer» B. circular linked list | |
| 3. |
A ........ is a linear list in which insertions and deletions are made to from either end of the structure. |
| A. | circular queue |
| B. | random of queue |
| C. | priority |
| D. | dequeue |
| Answer» E. | |
| 4. |
.......... refers to a linear collection of data items. |
| A. | List |
| B. | Tree |
| C. | Graph |
| D. | Edge |
| Answer» B. Tree | |
| 5. |
In a linked list the .......... field contains the address of next element in the list. |
| A. | Link field |
| B. | Next element field |
| C. | Start field |
| D. | Info field |
| Answer» B. Next element field | |
| 6. |
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 |
| Answer» D. linked list | |
| 7. |
A ...... indicates the end of the list. |
| A. | Guard |
| B. | Sentinel |
| C. | End pointer |
| D. | Last pointer |
| Answer» C. End pointer | |
| 8. |
A run list is ...... |
| A. | small batches of records from a file |
| B. | number of elements having same value |
| C. | number of records |
| D. | number of files in external storage |
| Answer» B. number of elements having same value | |
| 9. |
LLINK is the pointer pointing to the ... |
| A. | successor node |
| B. | predecessor node |
| C. | head node |
| D. | last node |
| Answer» C. head node | |
| 10. |
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 |
| Answer» B. last record of the actual data | |
| 11. |
Each node in a linked list must contain at least ..... |
| A. | Three fields |
| B. | Two fields |
| C. | Four fields |
| D. | Five fields |
| Answer» C. Four fields | |
| 12. |
Value of first linked list index is .... |
| A. | 0 |
| B. | 1 |
| C. | -1 |
| D. | 2 |
| Answer» B. 1 | |
| 13. |
The situation when in a linked list START=NULL is .... |
| A. | Underflow |
| B. | Overflow |
| C. | Houseful |
| D. | Saturated |
| Answer» B. Overflow | |
| 14. |
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. | data structure |
| D. | for none of above situation |
| Answer» C. data structure | |
| 15. |
Which is the pointer associated with the availability list? |
| A. | FIRST |
| B. | AVAIL |
| C. | TOP |
| D. | REAR |
| Answer» C. TOP | |
| 16. |
Each node in singly linked list has ........ fields. |
| A. | 2 |
| B. | 3 |
| C. | 1 |
| D. | 4 |
| Answer» B. 3 | |
| 17. |
If node N is a terminal node in a binary tree then its ......... |
| A. | Right tree is empty |
| B. | Left tree is empty |
| C. | Both left u0026 right sub trees are empty |
| D. | Root node is empty |
| Answer» D. Root node is empty | |
| 18. |
A graph is said to be ....... if its edges are assigned data. |
| A. | Tagged |
| B. | Marked |
| C. | Lebeled |
| D. | Sticked |
| Answer» D. Sticked | |
| 19. |
In threaded binary tree ......... points to higher nodes in tree. |
| A. | Info |
| B. | Root |
| C. | Threads |
| D. | Child |
| Answer» D. Child | |
| 20. |
If every node u in G adjacent to every other node v in G, A graph is said to be |
| A. | isolated |
| B. | complete |
| C. | finite |
| D. | strongly connected |
| Answer» C. finite | |
| 21. |
In-order traversing a tree resulted E A C K F H D B G; the pre-order traversal would return. |
| A. | FAEKCDBHG |
| B. | FAEKCDHGB |
| C. | EAFKHDCBG |
| D. | FEAKDCHBG |
| Answer» C. EAFKHDCBG | |
| 22. |
A graph is said to be ....... if every node u in G is adjacent to every other node v in G. |
| A. | Absolute |
| B. | Entire |
| C. | Inclusive |
| D. | Complete |
| Answer» E. | |
| 23. |
Three standards ways of traversing a binary tree T with root R ....... |
| A. | Prefix, infix, postfix |
| B. | Pre-process, in-process, post-process |
| C. | Pre-traversal, in-traversal, post-traversal |
| D. | Pre-order, in-order, post-order |
| Answer» E. | |
| 24. |
In linked representation of Binary trees LEFT[k] contains the ........ of at the node N, where k is the location. |
| A. | Data |
| B. | Location and left child |
| C. | Right child address |
| D. | Null value |
| Answer» B. Location and left child | |
| 25. |
A connected graph T without any cycles is called . |
| A. | a tree graph |
| B. | free tree |
| C. | a tree |
| D. | All of above |
| Answer» E. | |
| 26. |
The post order traversal of a binary tree is DEBFCA. Find out the pre order Traversal. |
| A. | ABFCDE |
| B. | ADBFEC |
| C. | ABDECF |
| D. | ABDCEF |
| Answer» D. ABDCEF | |
| 27. |
If every node u in G is adjacent to every other node v in G,A graph is said to be ........ |
| A. | isolated |
| B. | complete |
| C. | finite |
| D. | strongly connected. |
| Answer» C. finite | |
| 28. |
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 node and v is an edge. |
| D. | both u and v are edges. |
| Answer» C. u is node and v is an edge. | |
| 29. |
The in order traversal of tree will yield a sorted listing of elements of tree in .... |
| A. | Binary trees |
| B. | Binary search trees |
| C. | Merging |
| D. | AVL Trees |
| Answer» C. Merging | |
| 30. |
In a graph if e=[u,v], then u and v are called |
| A. | endpoints of e |
| B. | adjacent nodes |
| C. | neighbours |
| D. | all of the above |
| Answer» E. | |
| 31. |
A binary tree whose every node has either zero or two children is called ......... |
| A. | Complete binary tree |
| B. | Binary Search tree |
| C. | Extended binary tree |
| D. | E2 tree |
| Answer» D. E2 tree | |
| 32. |
In a head tree ..... |
| A. | values in a node is greater than every value every value in left sub tree and smaller than right sub tree. |
| B. | values in a node is greater than every value in children of it. |
| C. | conditions. |
| D. | terms. |
| Answer» C. conditions. | |
| 33. |
In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called ......... |
| A. | Leaf |
| B. | Branch |
| C. | Path |
| D. | Thread |
| Answer» E. | |
| 34. |
The in-order traversal of tree will yield a sorted listing of elements of tree in ........ |
| A. | binary trees |
| B. | binary search trees |
| C. | heaps |
| D. | binary heaps |
| Answer» D. binary heaps | |
| 35. |
While converting binary tree into extended binary tree, all the original nodes in binary tree are ....... |
| A. | Internal nodes on extended tree |
| B. | External nodes on extended tree |
| C. | Vanished on extended tree |
| D. | Intermediate nodes on extended tree |
| Answer» B. External nodes on extended tree | |
| 36. |
A terminal node in a binary tree is called ............ |
| A. | Root |
| B. | Leaf |
| C. | Child |
| D. | Branch |
| Answer» C. Child | |
| 37. |
The post order traversal of binary tree is DEBFCA. Find out the pre order traversal. |
| A. | ABFCDE |
| B. | ADBFEC |
| C. | ABDECF |
| D. | ABDCEF |
| Answer» D. ABDCEF | |
| 38. |
In a extended-binary tree nodes with 2 children are called ........ |
| A. | Interior node |
| B. | Domestic node |
| C. | Internal node |
| D. | Inner node |
| Answer» D. Inner node | |
| 39. |
In a 2-tree, nodes with 0 children are called ............ |
| A. | Exterior node |
| B. | Outside node |
| C. | Outer node |
| D. | External node |
| Answer» E. | |
| 40. |
The depth of complete binary tree is given by ...... |
| A. | Dn = n log2n |
| B. | Dn= n log2n+1 |
| C. | Dn = log2n |
| D. | Dn = log2n+1 |
| Answer» E. | |
| 41. |
A binary tree whose every node has either zero or two children is called ....... |
| A. | complete binary tree |
| B. | binary search tree |
| C. | extended binary tree |
| D. | data structure |
| Answer» D. data structure | |
| 42. |
In a graph if e=[u,v], Then u and v are called ........ |
| A. | End points of e |
| B. | Adjacent nodes |
| C. | Neighbours |
| D. | All of the above |
| Answer» E. | |
| 43. |
Which indicates pre-order traversal? |
| A. | Left sub-tree, Right sub-tree and root |
| B. | Right sub-tree, Left sub-tree and root |
| C. | Root, Left sub-tree, Right sub-tree |
| D. | Right sub-tree, root, Left sub-tree |
| Answer» D. Right sub-tree, root, Left sub-tree | |
| 44. |
Linked representation of binary tree needs ......... parallel arrays. |
| A. | 4 |
| B. | 2 |
| C. | 3 |
| D. | 5 |
| Answer» D. 5 | |
| 45. |
TREE[1]=NULL indicates tree is ........ |
| A. | Overflow |
| B. | Underflow |
| C. | Empty |
| D. | Full |
| Answer» D. Full | |
| 46. |
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 |
| Answer» E. | |
| 47. |
Trees are said .......... if they are similar and have same contents at corresponding nodes. |
| A. | Duplicate |
| B. | Carbon copy |
| C. | Replica |
| D. | Copies |
| Answer» E. | |
| 48. |
Sequential representation of binary tree uses ........ |
| A. | Array with pointers |
| B. | Single linear array |
| C. | Two dimentional arrays |
| D. | Three dimentional arrays |
| Answer» B. Single linear array | |
| 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 |
| Answer» C. Forerunner | |
| 50. |
In Binary trees nodes with no successor are called ...... |
| A. | End nodes |
| B. | Terminal nodes |
| C. | Final nodes |
| D. | Last nodes |
| Answer» C. Final nodes | |