McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) , Information Technology Engineering (IT) , Bachelor of Science in Computer Science FY (BSc CS) , Bachelor of Science in Information Technology FY (BSc IT) , Bachelor of Computer Applications (BCA) .
Chapters
| 301. |
The term push and pop is related to |
| A. | Array |
| B. | Lists |
| C. | Stacks |
| D. | Trees |
| Answer» C. Stacks | |
| 302. |
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 |
| Answer» D. all of the above | |
| 303. |
The operation of processing each element in the list is known as …… |
| A. | sorting |
| B. | merging |
| C. | inserting |
| D. | traversal |
| Answer» D. traversal | |
| 304. |
The situation when in a linked list START=NULL is …. |
| A. | Underflow |
| B. | Overflow |
| C. | Houseful |
| D. | Saturated |
| Answer» A. Underflow | |
| 305. |
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 |
| Answer» D. List traversed in two directions | |
| 306. |
Which is the pointer associated with the availability list? |
| A. | FIRST |
| B. | AVAIL |
| C. | TOP |
| D. | REAR |
| Answer» B. AVAIL | |
| 307. |
Which of the following data structure can’t store the non-homogeneous data elements? |
| A. | Arrays |
| B. | Records |
| C. | Pointers |
| D. | Stacks |
| Answer» A. Arrays | |
| 308. |
Which of the following is non-liner data structure? |
| A. | Stacks |
| B. | List |
| C. | Strings |
| D. | Trees |
| Answer» D. Trees | |
| 309. |
To represent hierarchical relationship between elements, which data structure is suitable? |
| A. | Dequeue |
| B. | Priority |
| C. | Tree |
| D. | Graph |
| Answer» C. Tree | |
| 310. |
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» A. Input restricted dequeue | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.