MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 10 Mcqs, each offering curated multiple-choice questions to sharpen your C knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
THE_ADVANTAGE_OF_USING_LINKED_LISTS_OVER_ARRAYS_IS_THAT_________?$ |
| A. | Linked list is an example of linear data structure |
| B. | Insertion and deletion of an element can be done at any position in a linked list |
| C. | Linked list can be used to store a collection of homogenous and heterogeneous data types |
| D. | The size of a linked list is fixed |
| Answer» C. Linked list can be used to store a collection of homogenous and heterogeneous data types | |
| 2. |
Array is preferred over linked list for the implementation of _______? |
| A. | Radix sort |
| B. | Insertion sort |
| C. | Binary search |
| D. | Polynomial evaluation |
| Answer» D. Polynomial evaluation | |
| 3. |
Which of the following is an example for static memory allocation? |
| A. | Linked list |
| B. | Stack |
| C. | Queue |
| D. | Array |
| Answer» E. | |
| 4. |
Queue data structure works on the principle of ____________ |
| A. | Last In First Out (LIF0) |
| B. | First In Last Out (FILO) |
| C. | First In First Out (FIFO) |
| D. | Last In Last Out (LILO) |
| Answer» D. Last In Last Out (LILO) | |
| 5. |
Which of the following is an example for non linear data type? |
| A. | Tree |
| B. | Array |
| C. | Linked list |
| D. | Queue |
| Answer» B. Array | |
| 6. |
The type of linked list in which the node does not contain any pointer or reference to the previous node: |
| A. | Circularly singly linked list |
| B. | Singly linked list |
| C. | Circular doubly linked list |
| D. | Doubly linked list |
| Answer» C. Circular doubly linked list | |
| 7. |
Which of the following header files must necessarily be included to use dynamic memory allocation functions? |
| A. | stdlib.h |
| B. | stdio.h |
| C. | memory.h |
| D. | dos.h |
| Answer» B. stdio.h | |
| 8. |
Choose the statement which is incorrect with respect to dynamic memory allocation. |
| A. | Memory is allocated in a less structured area of memory, known as heap |
| B. | Used for unpredictable memory requirements |
| C. | Execution of the program is faster than that of static memory allocation |
| D. | Allocated memory can be changed during the run time of the program based on the requirement of the program |
| Answer» D. Allocated memory can be changed during the run time of the program based on the requirement of the program | |
| 9. |
The size of both stack and heap remains the same during run time. |
| A. | True |
| B. | False |
| Answer» C. | |
| 10. |
Local variables are stored in an area called ___________ |
| A. | Heap |
| B. | Permanent storage area |
| C. | Free memory |
| D. | Stack |
| Answer» E. | |