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. |
Which type of linked list / s comprise / s a node containing a pointer to predecessor as well as successor? |
| A. | Doubly Linked List |
| B. | Circular Linked List |
| C. | Both a & b |
| D. | None of the above |
| Answer» D. None of the above | |
| 2. |
Traversal of a linked list always starts from the __________. |
| A. | First Node |
| B. | Middle Node |
| C. | Last Node |
| D. | None of the Above |
| Answer» B. Middle Node | |
| 3. |
Which type of linked list comprises the adjacently placed first and the last elements? |
| A. | Singly Linked List |
| B. | Doubly Linked List |
| C. | Circular Linked List |
| D. | All of the above |
| Answer» D. All of the above | |
| 4. |
Which extra element / s is / are present at the head of the list? |
| A. | Antinel |
| B. | Sentinel |
| C. | Both a & b |
| D. | None of the above |
| Answer» C. Both a & b | |
| 5. |
What does a node possessing zero degree in Trees known as? |
| A. | Branch Node |
| B. | Root Node |
| C. | Leaf Node |
| D. | Trunk Node |
| Answer» D. Trunk Node | |
| 6. |
How is the failure node represented by replacing each empty subtree in an Extended Binary Tree ? |
| A. | * |
| B. | |
| C. | o |
| D. | □ |
| Answer» E. | |
| 7. |
What would happen if the balance factor of a node in an AVL tree is ' 1 '? |
| A. | Heights of left and right subtrees become equal |
| B. | Height of left subtree is one more than the height of right subtree |
| C. | Height of left subtree is one less than the height of right tree |
| D. | None of the Above |
| Answer» C. Height of left subtree is one less than the height of right tree | |
| 8. |
It is a set of data values and associated operations that are specified accurately, independent of any particular implementation. |
| A. | Stack |
| B. | ADT |
| C. | Graph |
| D. | Tree |
| Answer» C. Graph | |
| 9. |
Which of the following is/are non-primitive data structures? |
| A. | Arrays, Linklist |
| B. | Stack, Queue |
| C. | Tree, Graph |
| D. | All of the above. |
| Answer» E. | |
| 10. |
The number of possible binary trees with 5 nodes is. |
| A. | 40 |
| B. | 41 |
| C. | 42 |
| D. | 32 |
| Answer» D. 32 | |
| 11. |
Match the following List-1 with List-2List-1 - - - - - - - - - - - - - - - - - - - - - - List-2P. Greedy algorithm - - - - - - - - - - - -1. Merge sort, quick sortQ. Divide and Conquer - - - - - - - - - - 2.Eight Queens Problem.R. Backtracking - - - - - - - - - - - - - - - 3.Dijkstra s algorithm, prim s algorithm |
| A. | P-3, Q-1, R-2 |
| B. | P-1, Q-3, R-2 |
| C. | P-1, Q-2, R-3 |
| D. | None of the above. |
| Answer» B. P-1, Q-3, R-2 | |
| 12. |
What is the complexity of the function f(n)= nlogn+logn+1 |
| A. | O(logn) |
| B. | O(nlogn) |
| C. | O(n) |
| D. | None of the above. |
| Answer» C. O(n) | |
| 13. |
Which unit measures the relative strength of two signals? |
| A. | decible |
| B. | hertz |
| C. | picko |
| D. | None of the above. |
| Answer» B. hertz | |
| 14. |
Bandwidth can be described as: |
| A. | The range of frequencies in a composite signal. |
| B. | The range of frequencies that a channel can pass. |
| C. | The number of bits per second that a channel can transmit. |
| D. | All of the above. |
| Answer» E. | |
| 15. |
Before data can be transmitted in a network, they must be transformed to. |
| A. | Binary |
| B. | Electromagnetic signals |
| C. | Radio signal |
| D. | None of the above. |
| Answer» C. Radio signal | |
| 16. |
If a binary tree has height 10 then what is the maximum number of nodes in that tree? |
| A. | 1000 |
| B. | 1023 |
| C. | 1024 |
| D. | 1002 |
| Answer» C. 1024 | |
| 17. |
The search time in hashing is |
| A. | O(n) |
| B. | O(logn) |
| C. | O(nlogn) |
| D. | O(1) |
| Answer» E. | |
| 18. |
In which tree, for every node the height of its left subtree and right subtree differ almost by one? |
| A. | Binary search tree |
| B. | AVL tree |
| C. | Threaded Binary Tree |
| D. | Complete Binary Tree |
| Answer» C. Threaded Binary Tree | |
| 19. |
In a binary tree you have deleted a node that have two children then it is replaced by its |
| A. | Preorder predecessor |
| B. | Inorder predecessor |
| C. | Inorder successor |
| D. | None of the above |
| Answer» D. None of the above | |
| 20. |
For evaluation the postfix expression which data structure you will use? |
| A. | Stack |
| B. | Queue |
| C. | List |
| D. | Tree |
| Answer» B. Queue | |
| 21. |
What is the postfix form of the following prefix *+pq-rs |
| A. | pq+rs-* |
| B. | pqrs+*- |
| C. | pq+*rs- |
| D. | None of the above. |
| Answer» B. pqrs+*- | |
| 22. |
The signal rate is called as |
| A. | pulse rate |
| B. | modulation rate |
| C. | baud rate |
| D. | All of the above. |
| Answer» E. | |
| 23. |
What is the most appropriate data structure to implement a priority queue? |
| A. | Heap |
| B. | Circular array |
| C. | Linked list |
| D. | Binary tree |
| Answer» B. Circular array | |
| 24. |
If a binary tree has 25 nodes, then how many null branches are there? |
| A. | 54 |
| B. | 27 |
| C. | 26 |
| D. | None of the above |
| Answer» D. None of the above | |
| 25. |
If a complete graph has n vertices then what will be the no of edges? |
| A. | n-1 |
| B. | (n-1)/2 |
| C. | (1/2) n (n-1) |
| D. | None of the above. |
| Answer» D. None of the above. | |
| 26. |
Which principle works on Queue? |
| A. | FILO |
| B. | FIFO |
| C. | LILO |
| D. | Both a and b above |
| Answer» C. LILO | |
| 27. |
What is the Complexity of Binary Search Algorithm? |
| A. | O(n) |
| B. | O(log n) |
| C. | O(n2) |
| D. | O(n log n) |
| Answer» C. O(n2) | |
| 28. |
An empty list is the one which has no _________ . |
| A. | nodes |
| B. | data |
| C. | both a and b |
| D. | address |
| Answer» D. address | |
| 29. |
What is the pecularity of Red - black Trees? |
| A. | In red-black trees, the root do not contain data. |
| B. | In red-black trees, the leaf nodes are not relevant and do not contain data. |
| C. | In red-black trees, the leaf nodes are relevant but do not contain data. |
| D. | Both a and c above |
| Answer» C. In red-black trees, the leaf nodes are relevant but do not contain data. | |
| 30. |
________ is a tree where each parent node have only one associated child node. |
| A. | Balanced Binary Tree |
| B. | Rooted Complete Binary Tree |
| C. | Complete Binary Tree |
| D. | Degenerate Tree |
| Answer» E. | |
| 31. |
Which among the following belongs to the category of an In-Order Traversal? |
| A. | Root -> Left Sub Tree -> Right Sub Tree |
| B. | Root -> Right Sub Tree -> Left Sub Tree |
| C. | Right Sub Tree -> Left Sub Tree ->Root |
| D. | Left Sub Tree -> Root -> Right Sub Tree |
| Answer» E. | |
| 32. |
Key value pair is usually seen in __________. |
| A. | Hash Tables |
| B. | Heaps |
| C. | Both a and b |
| D. | Skip list |
| Answer» B. Heaps | |
| 33. |
Which of the following statements is true for Binary search Trees? |
| A. | The left subtree of a node contains only nodes with keys less than the node's key. |
| B. | The right subtree of a node contains only nodes with keys greater than the node's key. |
| C. | Both a and b above |
| D. | Both left and right subtree nodes contains only nodes with keys less than the node's key. |
| Answer» D. Both left and right subtree nodes contains only nodes with keys less than the node's key. | |
| 34. |
Where can we use Breadth First Search(BFS)? |
| A. | Binary trees |
| B. | Stacks |
| C. | Graphs |
| D. | Both a and c |
| Answer» D. Both a and c | |
| 35. |
In _____________, the heights of the two child subtrees of any node differ by at most one. |
| A. | Binary Tree |
| B. | Red Black Tree |
| C. | Splay Tree |
| D. | AVL Tree |
| Answer» E. | |
| 36. |
Which Linked List have the last node of the list pointing to the first node? |
| A. | Circular Doubly Linked List |
| B. | Circular Linked List |
| C. | Circular Singly Linked List |
| D. | Doubly Linked List |
| Answer» D. Doubly Linked List | |
| 37. |
Which of the following is the faster operation in AVL Trees? |
| A. | Insertion |
| B. | Deletion |
| C. | Updation |
| D. | Retrieval |
| Answer» E. | |
| 38. |
Which principle works on Stack? |
| A. | FILO |
| B. | FIFO |
| C. | LILO |
| D. | LIFO or FILO |
| Answer» E. | |
| 39. |
In a heap the element with the greatest key is always located in which node? |
| A. | leaf |
| B. | root |
| C. | first node of left sub tree |
| D. | first node of right sub tree |
| Answer» C. first node of left sub tree | |
| 40. |
Which among the following belongs to the category of a Pre-order Traversal? |
| A. | Root -> Left Sub Tree -> Right Sub Tree |
| B. | Root -> Right Sub Tree -> Left Sub Tree |
| C. | Right Sub Tree -> Left Sub Tree -> Root |
| D. | Left Sub Tree -> Right Sub Tree -> Root |
| Answer» B. Root -> Right Sub Tree -> Left Sub Tree | |
| 41. |
If every node ' u ' in ' G ' is adjacent to every other node ' v ' in ' G ', A graph is said to be ___________. |
| A. | isolated |
| B. | complete |
| C. | finite |
| D. | strongly connected |
| Answer» C. finite | |
| 42. |
Which of the following is the fastest ways to store and retrieve data? |
| A. | Sorting |
| B. | Hashing |
| C. | Indexing |
| D. | both A and C |
| Answer» C. Indexing | |
| 43. |
What should we call a binary tree whose every node has either zero or two children? |
| A. | Complete Binary Tree |
| B. | Binary Search Tree |
| C. | Extended Binary Tree |
| D. | None of Above |
| Answer» D. None of Above | |
| 44. |
Why the elements of an Array are stored successively in Memory Cells? |
| A. | by this way computer can keep track only the address of the first element and the addresses of the other elements can calculated |
| B. | the architecture of computer memory does not allow arrays to store other than serially |
| C. | Both of above |
| D. | None of above |
| Answer» B. the architecture of computer memory does not allow arrays to store other than serially | |
| 45. |
What is the difference between Linear Array and a Record? |
| A. | An array is suitable for homogeneous data but the data items in a record may have different data type. |
| B. | In a record, there may not be a natural ordering in opposed to linear array. |
| C. | A record form a hierarchical structure but a linear array does not |
| D. | All of above |
| Answer» E. | |
| 46. |
You have to sort a list L consisting of a sorted list, followed by a few random elements. Which of the following sorting methods would be especially suitable for such a task? |
| A. | Bubble sort |
| B. | Selection sort |
| C. | Quick sort |
| D. | Insertion sort |
| Answer» E. | |
| 47. |
The operation of processing each element in the list is known as, _________. |
| A. | Sorting |
| B. | Merging |
| C. | Inserting |
| D. | Traversal |
| Answer» E. | |
| 48. |
When the time factor determining the efficiency of the algorithm is measured? |
| A. | Counting microseconds |
| B. | Counting the number of key operations |
| C. | Counting the number of statements |
| D. | Counting the kilobytes of algorithm |
| Answer» C. Counting the number of statements | |
| 49. |
Which of the following data structure is not a Linear Data Structure? |
| A. | Arrays |
| B. | Linked lists |
| C. | Both of these |
| D. | None of these |
| Answer» E. | |
| 50. |
Data Structure: The postfix expression PQ + RS * can be evaluated using a |
| A. | Stack |
| B. | Tree |
| C. | Queue |
| D. | LinkList |
| Answer» B. Tree | |