MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 60 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.
| 51. |
What would be the asymptotic time complexity to insert an element at the second position in the linked list? |
| A. | O(1) |
| B. | O(n) |
| C. | O(n2) |
| D. | O(n3) |
| Answer» B. O(n) | |
| 52. |
The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used? |
| A. | Singly linked list |
| B. | Doubly linked list |
| C. | Circular doubly linked list |
| D. | Array implementation of list |
| Answer» D. Array implementation of list | |
| 53. |
Given an array arr = {5,6,77,88,99} and key = 88; How many iterations are done until the element is found? |
| A. | 1 |
| B. | 3 |
| C. | 4 |
| D. | 2 |
| Answer» E. | |
| 54. |
In a binary search tree, which of the following traversals would print the numbers in the ascending order? |
| A. | Level-order traversal |
| B. | Pre-order traversal |
| C. | Post-order traversal |
| D. | In-order traversal |
| Answer» E. | |
| 55. |
Given an array arr = {45,77,89,90,94,99,100} and key = 100; What are the mid values(corresponding array elements) generated in the first and second iterations? |
| A. | 90 and 99 |
| B. | 90 and 100 |
| C. | 89 and 94 |
| D. | 94 and 99 |
| Answer» B. 90 and 100 | |
| 56. |
In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called_______ tree. |
| A. | directed. |
| B. | structure. |
| C. | ordered. |
| D. | degree of. |
| Answer» D. degree of. | |
| 57. |
Which of the following is not an advantage of optimised bubble sort over other sorting techniques in case of sorted elements? |
| A. | It is faster |
| B. | Consumes less memory |
| C. | Detects whether the input is already sorted |
| D. | Consumes less time |
| Answer» D. Consumes less time | |
| 58. |
Five node splitting operations occurred when an entry is inserted into a B-tree. Then how many nodes are written? |
| A. | 14 |
| B. | 7 |
| C. | 11 |
| D. | 5 |
| Answer» D. 5 | |
| 59. |
What is the possible number of binary trees that can be created with 3 nodes, giving the sequence N, M, L when traversed in post-order. |
| A. | 15 |
| B. | 3 |
| C. | 5 |
| D. | 8 |
| Answer» D. 8 | |
| 60. |
A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75? |
| A. | 7, 8, 26, 13, 75, 40, 70, 35 |
| B. | 26, 13, 7, 8, 70, 75, 40, 35 |
| C. | 7, 8, 13, 26, 35, 40, 70, 75 |
| D. | 8, 7, 26, 13, 40, 75, 70, 35 |
| Answer» E. | |