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. |
The operation of processing each element in the list is known as ...... |
| A. | sorting |
| B. | merging |
| C. | inserting |
| D. | traversal |
| Answer» E. | |
| 2. |
The pointer associated with the stack is ........... |
| A. | front |
| B. | rear |
| C. | top |
| D. | link |
| Answer» D. link | |
| 3. |
Link fields holds pointers to the .......... element in the linked representation of stack. |
| A. | Neighbouring |
| B. | Last |
| C. | First |
| D. | Middle |
| Answer» B. Last | |
| 4. |
Binary trees with threads are called as ....... |
| A. | Threaded trees |
| B. | Pointer trees |
| C. | Special trees |
| D. | Special pointer trees |
| Answer» B. Pointer trees | |
| 5. |
Reversing a great deal of space for each stack in memory will ........... |
| A. | Decrease the numbers of times overflow may occur |
| B. | Increase the numbers of times overflow may occur |
| C. | Increase the number of times underflow may occur |
| D. | Increase the number of times underflow may occur. |
| Answer» B. Increase the numbers of times overflow may occur | |
| 6. |
The various operations that can be performed on stacks is/are ..... |
| A. | Insert an item into the stack |
| B. | Delete an item from the stack |
| C. | Display the contents of the stack |
| D. | All of the above |
| Answer» E. | |
| 7. |
The operations that can be done in a circular queue is/are ..... |
| A. | Insert from the front end |
| B. | Delete from front end |
| C. | Display queue contents |
| D. | All of the above |
| Answer» E. | |
| 8. |
The deletion operation in stack is called ...... |
| A. | insert |
| B. | push |
| C. | pop |
| D. | top |
| Answer» D. top | |
| 9. |
............. is a collection of elements such that each element has been assigned a processing priority. |
| A. | Priority queue |
| B. | Procedure queue |
| C. | Main queue |
| D. | Interrupt queue |
| Answer» B. Procedure queue | |
| 10. |
The term dequeue is the contraction of the name ........ |
| A. | Double ended queue |
| B. | Double sided queue |
| C. | Double headed queue |
| D. | Double address queue |
| Answer» B. Double sided queue | |
| 11. |
The value of REAR is increased by 1 when ....... |
| A. | An element is deleted in a queue |
| B. | An element is traversed in a queue |
| C. | An element is added in a queue |
| D. | An element is merged in a queue |
| Answer» D. An element is merged in a queue | |
| 12. |
The condition ........ indicate the queue is empty. |
| A. | Front=Null |
| B. | Null=Front |
| C. | Front=Rear |
| D. | Rear=Null |
| Answer» B. Null=Front | |
| 13. |
Deletion in the linked stack takes place by deleting ........ |
| A. | Node pointed by the start process. |
| B. | End of the list |
| C. | Beginning of the list |
| D. | Middle of the list |
| Answer» B. End of the list | |
| 14. |
A queue in which insertion and deletion takes places from any position is called ...... |
| A. | circular queue |
| B. | random of queue |
| C. | priority |
| D. | dequeue |
| Answer» D. dequeue | |
| 15. |
In dequeue, insertion and deletion takes place of .......... |
| A. | front, rear end |
| B. | only at rear end |
| C. | only at front end |
| D. | both the ends |
| Answer» E. | |
| 16. |
When does Top value of stack change in insertion process? |
| A. | Before insertion |
| B. | After insertion |
| C. | At the time of insertion |
| D. | While checking overflow |
| Answer» B. After insertion | |
| 17. |
The another name of dequeue is ......... |
| A. | divided queue |
| B. | distributed queue |
| C. | double ended queue |
| D. | design queue |
| Answer» D. design queue | |
| 18. |
Before inserting into stack one must check the condition ......... |
| A. | Overflow |
| B. | Underflow |
| C. | Maximum elements |
| D. | Existing elements |
| Answer» B. Underflow | |
| 19. |
The queue in which the insertion takes place in the first position after of last element is a ...... |
| A. | priority |
| B. | dequeue |
| C. | circular |
| D. | linked |
| Answer» D. linked | |
| 20. |
A pointer variable which contains the location at the top element of the stack is called ..... |
| A. | Top |
| B. | Last |
| C. | Final |
| D. | End |
| Answer» B. Last | |
| 21. |
Before deletion condition into stack ...... has to be checked. |
| A. | Overflow |
| B. | Underflow |
| C. | Maximum elements |
| D. | Existing elements |
| Answer» C. Maximum elements | |
| 22. |
Deletion operation is done using ......... in a queue. |
| A. | front |
| B. | rear |
| C. | top |
| D. | list |
| Answer» B. rear | |
| 23. |
...... is the term used to insert an element into stack. |
| A. | Push |
| B. | Pull |
| C. | Pop |
| D. | Pump |
| Answer» B. Pull | |
| 24. |
The elements are removal from a stack in .......... order. |
| A. | Reverse |
| B. | Hierarchical |
| C. | Alternative |
| D. | Sequential |
| Answer» B. Hierarchical | |
| 25. |
Which is the pointer associated with the stack? |
| A. | FIRST |
| B. | FRONT |
| C. | TOP |
| D. | REAR |
| Answer» D. REAR | |
| 26. |
The term push and pop is related to |
| A. | Array |
| B. | Lists |
| C. | Stacks |
| D. | Trees |
| Answer» D. Trees | |
| 27. |
.......... is the term used to delete an element from the stack. |
| A. | Push |
| B. | Pull |
| C. | Pop |
| D. | Pump |
| Answer» D. Pump | |
| 28. |
Stack follows the strategy of ........ |
| A. | LIFO |
| B. | FIFO |
| C. | LRU |
| D. | RANDOM |
| Answer» B. FIFO | |
| 29. |
The insertion operation in the stack is called ......... |
| A. | insert |
| B. | push |
| C. | pop |
| D. | top |
| Answer» C. pop | |
| 30. |
The retrieval of items in a stack is ........... operation. |
| A. | push |
| B. | pop |
| C. | retrieval |
| D. | access |
| Answer» C. retrieval | |
| 31. |
A queue is a ......... |
| A. | FIFO |
| B. | LIFO |
| C. | FILO |
| D. | LOFI |
| Answer» B. LIFO | |
| 32. |
What happens when you push a new node onto a stack? |
| A. | The new node is placed at the front of the linked list |
| B. | The new node is placed at the back of the linked list |
| C. | The new node is placed at the middle of the linked list |
| D. | No Changes happens |
| Answer» B. The new node is placed at the back of the linked list | |
| 33. |
In linked representation of stack the null pointer of the last node in the list signals .......... |
| A. | Beginning of the stack |
| B. | Bottom of the stack |
| C. | Middle of the stack |
| D. | In between some value |
| Answer» C. Middle of the stack | |
| 34. |
........ form of access is used to add remove nodes from a stack. |
| A. | LIFO |
| B. | FIFO |
| C. | Both A and B |
| D. | None of these |
| Answer» B. FIFO | |
| 35. |
New nodes are added to the ......... of the queue. |
| A. | Front |
| B. | Back |
| C. | Middle |
| D. | Both A and B |
| Answer» C. Middle | |
| 36. |
In the linked representation of the stack ......... behaves as the top pointer variable of stack. |
| A. | Stop pointer |
| B. | Begin pointer |
| C. | Start pointer |
| D. | Avail pointer |
| Answer» D. Avail pointer | |
| 37. |
......... form of access is used to add and remove nodes from a queue. |
| A. | LIFO, Last In First Out |
| B. | FIFO, First In First Out |
| C. | Both a and b |
| D. | None of these |
| Answer» C. Both a and b | |
| 38. |
In liked representation of stack ....... holds the elements of the stack. |
| A. | INFO fields |
| B. | TOP fields |
| C. | LINK fields |
| D. | NULL fields |
| Answer» B. TOP fields | |
| 39. |
A ........................ does not keep track of address of every element in the list. |
| A. | Stack |
| B. | String |
| C. | Linear array |
| D. | Queue |
| Answer» D. Queue | |
| 40. |
Each node in a linked list has two pairs of .............. and ................... |
| A. | Link field and information field |
| B. | Link field and avail field |
| C. | Avail field and information field |
| D. | Address field and link field |
| Answer» B. Link field and avail field | |
| 41. |
Arrays are best data structures ............ |
| 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 the above |
| Answer» B. For the size of the structure and the data in the structure are constantly changing | |
| 42. |
Linear arrays are also called ................... |
| A. | Straight line array |
| B. | One-dimensional array |
| C. | Vertical array |
| D. | Horizontal array |
| Answer» C. Vertical array | |
| 43. |
The simplest type of data structure is .................. |
| A. | Multidimensional array |
| B. | Linear array |
| C. | Two dimensional array |
| D. | Three dimensional array |
| Answer» C. Two dimensional array | |
| 44. |
The logical or mathematical model of a particular organization of data is called a ......... |
| A. | Data structure |
| B. | Data arrangement |
| C. | Data configuration |
| D. | Data formation |
| Answer» B. Data arrangement | |
| 45. |
The way in which the data item or items are logically related defines ..... |
| A. | storage structure |
| B. | data structure |
| C. | data relationship |
| D. | data operation |
| Answer» C. data relationship | |
| 46. |
The use of pointers to refer elements of a data structure in which elements are logically adjacent is .... |
| A. | pointers |
| B. | linked allocation |
| C. | stack |
| D. | queue |
| Answer» C. stack | |
| 47. |
Operations on a data structure may be ..... |
| A. | creation |
| B. | destruction |
| C. | selection |
| D. | all of the above |
| Answer» E. | |
| 48. |
A data structure where elements can be added or removed at either end but not in the middle is called ... |
| A. | linked lists |
| B. | stacks |
| C. | queues |
| D. | dequeue |
| Answer» E. | |
| 49. |
When new data are to be inserted into a data structure, but there is not available space; this situation is usually called .... |
| A. | Underflow |
| B. | overflow |
| C. | houseful |
| D. | saturated |
| Answer» C. houseful | |
| 50. |
State true or false.i) An empty tree is also a binary tree.ii) In strictly binary tree, the out-degree of every node is either o or 2. |
| A. | True, False |
| B. | False, True |
| C. | True, True |
| D. | False, False |
| Answer» D. False, False | |