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
| 501. |
The special list which consists of unused memory space is called __________. |
| A. | Free space. |
| B. | Empty space. |
| C. | Available space. |
| D. | Free storage list. |
| Answer» D. Free storage list. | |
| 502. |
To insert a new node in linked list free node will be available in ___________. |
| A. | Available list. |
| B. | Avail list. |
| C. | Free node list. |
| D. | Memory space list. |
| Answer» B. Avail list. | |
| 503. |
A ______________ list is a header list where the node points back to the header node. |
| A. | Circular header. |
| B. | Grounded header. |
| C. | Two way header. |
| D. | One way header. |
| Answer» A. Circular header. | |
| 504. |
How many pointers are necessarily changed for the insertion in a Linked List? |
| A. | 1. |
| B. | 2. |
| C. | 3. |
| D. | 5. |
| Answer» B. 2. | |
| 505. |
An algorithm that calls itself directly or indirectly is known as ____________. |
| A. | Sub algorithm. . |
| B. | Recursion. |
| C. | Polish notation. |
| D. | Traversal algorithm. |
| Answer» B. Recursion. | |
| 506. |
Minimum number of fields in each node of a doubly linked list is____ |
| A. | 2 |
| B. | 3 |
| C. | 4 |
| D. | None of the above |
| Answer» B. 3 | |
| 507. |
A graph in which all vertices have equal degree is known as ____ |
| A. | Complete graph |
| B. | Regular graph |
| C. | Multi graph |
| D. | Simple graph |
| Answer» A. Complete graph | |
| 508. |
A vertex of in-degree zero in a directed graph is called a/an |
| A. | Root vertex |
| B. | Isolated vertex |
| C. | Sink |
| D. | Articulation point |
| Answer» C. Sink | |
| 509. |
A graph is a tree if and only if graph is |
| A. | Directed graph |
| B. | Contains no cycles |
| C. | Planar |
| D. | Completely connected |
| Answer» B. Contains no cycles | |
| 510. |
The elements of a linked list are stored |
| A. | In a structure |
| B. | In an array |
| C. | Anywhere the computer has space for them |
| D. | In contiguous memory locations |
| Answer» C. Anywhere the computer has space for them | |
| 511. |
A parentheses checker program would be best implemented using |
| A. | List |
| B. | Queue |
| C. | Stack |
| D. | Any of the above |
| Answer» C. Stack | |
| 512. |
To perform level-order traversal on a binary tree, which of the following data structure will be required? |
| A. | Hash table |
| B. | Queue |
| C. | Binary search tree |
| D. | Stack |
| Answer» B. Queue | |
| 513. |
Which of the following data structure is required to convert arithmetic expression in infix to its equivalent postfix notation? |
| A. | Queue |
| B. | Linked list |
| C. | Binary search tree |
| D. | None of above |
| Answer» D. None of above | |
| 514. |
A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree. |
| A. | Threaded tree |
| B. | Complete binary tree |
| C. | M-way search tree |
| D. | Full binary tree |
| Answer» B. Complete binary tree | |
| 515. |
Which of following data structure is more appropriate for implementing quick sort iteratively? |
| A. | Deque |
| B. | Queue |
| C. | Stack |
| D. | Priority queue |
| Answer» C. Stack | |
| 516. |
The number of edges in a complete graph of n vertices is |
| A. | n(n+1)/2 |
| B. | n(n-1)/2 |
| C. | n2/2 |
| D. | n |
| Answer» B. n(n-1)/2 | |
| 517. |
If two trees have same structure and but different node content, then they are called ___ |
| A. | Synonyms trees |
| B. | Joint trees |
| C. | Equivalent trees |
| D. | Similar trees |
| Answer» D. Similar trees | |
| 518. |
If two trees have same structure and node content, then they are called ____ |
| A. | Synonyms trees |
| B. | Joint trees |
| C. | Equivalent trees |
| D. | Similar trees |
| Answer» C. Equivalent trees | |
| 519. |
Finding the location of a given item in a collection of items is called …… |
| A. | Discovering |
| B. | Finding |
| C. | Searching |
| D. | Mining |
| Answer» C. Searching | |
| 520. |
Quick sort is also known as …….. |
| A. | merge sort |
| B. | tree sort |
| C. | shell sort |
| D. | partition and exchange sort |
| Answer» D. partition and exchange sort | |
| 521. |
………. sorting is good to use when alphabetizing a large list of names. |
| A. | Merge |
| B. | Heap |
| C. | Radix |
| D. | Bubble |
| Answer» C. Radix | |
| 522. |
The total number of comparisons in a bubble sort is …. |
| A. | O(n logn) |
| B. | O(2n) |
| C. | O(n2) |
| D. | O(n) |
| Answer» A. O(n logn) | |
| 523. |
……… 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» B. FIFO, First In First Out | |
| 524. |
New nodes are added to the ……… of the queue. |
| A. | Front |
| B. | Back |
| C. | Middle |
| D. | Both A and B |
| Answer» B. Back | |
| 525. |
The term push and pop is related to |
| A. | Array |
| B. | Lists |
| C. | Stacks |
| D. | Trees |
| Answer» C. Stacks | |
| 526. |
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 | |
| 527. |
The operation of processing each element in the list is known as …… |
| A. | sorting |
| B. | merging |
| C. | inserting |
| D. | traversal |
| Answer» D. traversal | |
| 528. |
The situation when in a linked list START=NULL is …. |
| A. | Underflow |
| B. | Overflow |
| C. | Houseful |
| D. | Saturated |
| Answer» A. Underflow | |
| 529. |
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 | |
| 530. |
Which is the pointer associated with the availability list? |
| A. | FIRST |
| B. | AVAIL |
| C. | TOP |
| D. | REAR |
| Answer» B. AVAIL | |
| 531. |
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 | |
| 532. |
Which of the following is non-liner data structure? |
| A. | Stacks |
| B. | List |
| C. | Strings |
| D. | Trees |
| Answer» D. Trees | |
| 533. |
To represent hierarchical relationship between elements, which data structure is suitable? |
| A. | Dequeue |
| B. | Priority |
| C. | Tree |
| D. | Graph |
| Answer» C. Tree | |
| 534. |
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.