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. |
If you traverse a tree in the Inorder and find sorted listing of elements then it is a |
| A. | Binary search tree |
| B. | Binary tree |
| C. | Heap |
| D. | None of the above. |
| Answer» B. Binary tree | |
| 2. |
From the given below option find out the linear type data structure. |
| A. | Strings |
| B. | Lists |
| C. | Queues |
| D. | All of the above |
| Answer» C. Queues | |
| 3. |
There are different ways of traversing a binary tree. What are those traversing technique? |
| A. | Prefix, infix, postfix |
| B. | Pre-order, in-order, post-order |
| C. | Pre-traversal, in-traversal, post-traversal |
| D. | None of the above. |
| Answer» C. Pre-traversal, in-traversal, post-traversal | |
| 4. |
Evaluate the postfix expression 3574-2^*+ |
| A. | 41 |
| B. | 45 |
| C. | 48 |
| D. | None of the above. |
| Answer» D. None of the above. | |
| 5. |
Which method is used to remove the elements from a Stack? |
| A. | Push() |
| B. | Remove() |
| C. | pop() |
| D. | Ispop() |
| Answer» D. Ispop() | |
| 6. |
Which of the following is the fastest sorting algorithm to sort a list? |
| A. | Quick sort |
| B. | Bubble sort |
| C. | Binary sort |
| D. | Linear sort |
| Answer» B. Bubble sort | |
| 7. |
Which type of Arrays are used to store the information in a matrix form? (Data Structure) |
| A. | Multidimensional Arrays |
| B. | Arrays |
| C. | Dimensional Arrays |
| D. | Both A and C |
| Answer» B. Arrays | |
| 8. |
R Tree s are typically used in which way that are differing from B Tree's? |
| A. | Spatial access methods |
| B. | Vectors |
| C. | Both A and B |
| D. | FAT |
| Answer» D. FAT | |
| 9. |
The Element Indices of an array can compute at ___________. |
| A. | Cannot be computed |
| B. | Compile time |
| C. | Run time |
| D. | Both A and C |
| Answer» D. Both A and C | |
| 10. |
Which of the following is / are the Applications of B Tree s? |
| A. | Databases |
| B. | File Systems |
| C. | Both A and B |
| D. | Memory |
| Answer» D. Memory | |
| 11. |
A graph with n vertices will definitely have a parallel edge or a self loop if the total number of edges is____________. |
| A. | greater than n 1 |
| B. | less than n ( n 1 ) |
| C. | greater than n ( n 1 ) / 2 |
| D. | less than n2 / 2 |
| Answer» B. less than n ( n 1 ) | |
| 12. |
From where the insertion starts with a B tree? |
| A. | Root node |
| B. | Any node |
| C. | Could be A or B |
| D. | Leaf node |
| Answer» E. | |
| 13. |
What will you get when propagation speed is multiplied by propagation time? |
| A. | Distance a signal or bit has travelled |
| B. | Throughput |
| C. | Latency |
| D. | None of the above. |
| Answer» B. Throughput | |
| 14. |
Which of the following is/are channelization protocol? |
| A. | FDMA (Frequency-Division Multiple Access) |
| B. | TDMA (Time-Division Multiple Access) |
| C. | CDMA (Code-Division Multiple Access) |
| D. | All of the above. |
| Answer» E. | |
| 15. |
If you increase the frequency, the period of signal will be. |
| A. | No effect |
| B. | Increases |
| C. | Decreases |
| D. | Double |
| Answer» D. Double | |
| 16. |
Which of the following is random access protocol? |
| A. | ALOHA |
| B. | carrier sense multiple access (CSMA) |
| C. | carrier sense multiple access with collision detection (CSMA / CD) |
| D. | All of the above. |
| Answer» E. | |
| 17. |
If the maximum amplitude of a sine wave is 4 units, then minimum amplitude is. |
| A. | 4 |
| B. | 2 |
| C. | 3 |
| D. | -4 |
| Answer» E. | |
| 18. |
What is the ' next ' field of structure node in the Queue? |
| A. | Results into the storage of queue elements. |
| B. | Results into the storage of address of next node by holding the next element of queue. |
| C. | Results into the memory allocation of data elements to next node. |
| D. | Results into the address allocation data elements to next node. |
| Answer» C. Results into the memory allocation of data elements to next node. | |
| 19. |
Which among the below mentioned assertions is / are mainly associated with the feature of Spooling? |
| A. | Scheduling of processes |
| B. | Mainte ce of a queue of jobs to be printed |
| C. | A queue of client processes awaiting to gain the service from the service process |
| D. | All of the above |
| Answer» C. A queue of client processes awaiting to gain the service from the service process | |
| 20. |
Where is the root directory of a disk placed? |
| A. | Anywhere on the disk. |
| B. | At a fixed location on the system disk. |
| C. | At a fixed address in main memory. |
| D. | None of the above. |
| Answer» C. At a fixed address in main memory. | |
| 21. |
Which value is assigned/set at front and rear ends during the Initialization of a Queue? |
| A. | 0 |
| B. | 1 |
| C. | - 1 |
| D. | infinity |
| Answer» D. infinity | |
| 22. |
Which of the following ' C ' functions is precise to verify the emptiness of a Queue? |
| A. | int empty(Q*P){ if (P->R==-1)return (1);return(0);} |
| B. | int full (Q*P){if(P->R==MAX-1)return(1);return(0);} |
| C. | int empty (Q*P){if (Preturn(0);return(1);} |
| D. | int full (Q*P){if(Preturn(0);return(1);} |
| Answer» B. int full (Q*P){if(P->R==MAX-1)return(1);return(0);} | |