MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 721 Mcqs, each offering curated multiple-choice questions to sharpen your Technical Programming knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Each data item in a record may be a group item composed of sub-items; those items which areindecomposable are called ________ |
| A. | elementary items. |
| B. | atoms. |
| C. | scalars. |
| D. | structure. |
| Answer» E. | |
| 2. |
The logical or mathematical model of a particular organization of data is called a _______________. |
| A. | data structure. |
| B. | algorithms. |
| C. | structure. |
| D. | logic structure. |
| Answer» B. algorithms. | |
| 3. |
The time required in best case for search operation in binary tree is ____________. |
| A. | O(n). |
| B. | O(2n). |
| C. | O(log n). |
| D. | O( log 2n). |
| Answer» D. O( log 2n). | |
| 4. |
Binary search algorithm cannot be applied to________ concept. |
| A. | unsorted linked list. |
| B. | sorted binary trees. |
| C. | sorted linear array. |
| D. | pointer array. |
| Answer» B. sorted binary trees. | |
| 5. |
In a graph G if e=(u,v), then u and v are called ___________. |
| A. | endpoints. |
| B. | adjacent nodes. |
| C. | neighbours. |
| D. | all of the above. |
| Answer» E. | |
| 6. |
B-tree of order n is a order-n multiway tree in which each non-root node contains |
| A. | at most (n – 1)/2 keys |
| B. | exact (n – 1)/2 keys |
| C. | at least 2n keys |
| D. | at least (n – 1)/2 keys |
| Answer» E. | |
| 7. |
Which of the following is true while inserting a new node in the list? |
| A. | Check there is node in the list. |
| B. | Check in the free node in the pool. |
| C. | There is no node. |
| D. | Underflow. |
| Answer» C. There is no node. | |
| 8. |
Linked lists are suitable for which of the following problems? |
| A. | Insertion sort |
| B. | Binary search |
| C. | Radix sort |
| D. | dequeue. |
| Answer» C. Radix sort | |
| 9. |
The concatenation of two list can performed in O(1) time. Which of the following variation oflinked 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 | |
| 10. |
The earliest use of__________ sorting was in conjunction with network analysis. |
| A. | topological. |
| B. | bubble. |
| C. | radix. |
| D. | heap. |
| Answer» B. bubble. | |
| 11. |
What is the average case time complexity for finding the height of the binary tree? |
| A. | h = O(loglogn) |
| B. | h = O(nlogn) |
| C. | h = O(n) |
| D. | h = O(log n) |
| Answer» E. | |
| 12. |
The elements of an array are allocated in spaces________. |
| A. | successively. |
| B. | randomly. |
| C. | alternately. |
| D. | on any order. |
| Answer» B. randomly. | |
| 13. |
The pointer of the last node contains a special value called_____________. |
| A. | null pointer. |
| B. | index pointer. |
| C. | pointer link. |
| D. | address pointer. |
| Answer» C. pointer link. | |
| 14. |
The number of possible undirected graphs which may have self loops but no multiple edges andhave n vertices is |
| A. | 2((n*(n-1))/2) |
| B. | 2((n*(n+1))/2) |
| C. | 2((n-1)*(n-1))/2) |
| D. | 2((n*n)/2) |
| Answer» E. | |
| 15. |
Each node in a singly linked lists have ______ fields |
| A. | 2 |
| B. | 3 |
| C. | 4 |
| D. | 5 |
| Answer» B. 3 | |
| 16. |
In a linked list the _________field contains the address of next element in the list. |
| A. | Link field. |
| B. | Next element field. |
| C. | Start field. |
| D. | Info field . |
| Answer» B. Next element field. | |
| 17. |
Divide and conquer is an important algorithm design paradigm based on _______. |
| A. | multi-branched recursion. |
| B. | single-branched recursion. |
| C. | two-way recursion. |
| D. | None. |
| Answer» B. single-branched recursion. | |
| 18. |
Given an empty AVL tree, how would you construct AVL tree when a set of numbers are givenwithout performing any rotations? |
| A. | just build the tree with the given input |
| B. | find the median of the set of elements given, make it as root and construct the tree |
| C. | use trial and error |
| D. | use dynamic programming to build the tree |
| Answer» C. use trial and error | |
| 19. |
Which of the following is not an application of binary search? |
| A. | To find the lower/upper bound in an ordered sequence |
| B. | Union of intervals |
| C. | Debugging |
| D. | To search in unordered list |
| Answer» E. | |
| 20. |
The complexity of Binary search algorithm is ____________. |
| A. | O(n). |
| B. | O(log n ). |
| C. | O(n2). |
| D. | O(n log n). |
| Answer» C. O(n2). | |
| 21. |
If every node u in G is adjacent to every other node v in G, A graph is said to be _______. |
| A. | isolate. |
| B. | complete. |
| C. | finite. |
| D. | Strongly connected. |
| Answer» C. finite. | |
| 22. |
A variable whose size is determined at compile time and cannot be changed at run time is_________. |
| A. | static variable. |
| B. | dynamic variable. |
| C. | not a variable. |
| D. | data variable. |
| Answer» B. dynamic variable. | |
| 23. |
__________involves maintaining two tables in memory. |
| A. | Arranging. |
| B. | Bonding. |
| C. | Combing. |
| D. | Chaining. |
| Answer» E. | |
| 24. |
Number of vertices with odd degrees in a graph having a eulerian walk is |
| A. | 0 |
| B. | Can’t be predicted |
| C. | 2 |
| D. | either 0 or 2 |
| Answer» E. | |
| 25. |
If the elements A, B, C and D are placed in a stack and are deleted one at a time, what is the order ofremoval? |
| A. | ABCD |
| B. | DCBA |
| C. | DCAB |
| D. | ABDC |
| Answer» C. DCAB | |
| 26. |
____________ is finding a path/tour through the graph such that every vertex is visited exactly once. |
| A. | Travelling Salesman tour. |
| B. | Eulerian tour. |
| C. | Hamiltonian tour. |
| D. | None. |
| Answer» D. None. | |
| 27. |
The data items in a record form a ________ structure which can be described by means of level numbers. |
| A. | hierarchical. |
| B. | procedural. |
| C. | indexed. |
| D. | leveled. |
| Answer» B. procedural. | |
| 28. |
Data items that are divided into subitems are called ___________. |
| A. | single items. |
| B. | group items. |
| C. | elementary items. |
| D. | entity items. |
| Answer» C. elementary items. | |
| 29. |
The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is |
| A. | log2N |
| B. | n-1 |
| C. | n |
| D. | None of the above |
| Answer» C. n | |
| 30. |
Sub algorithms fall into two basic categories: function sub algorithms and ____________ sub algorithms. |
| A. | procedure. |
| B. | argument. |
| C. | processor. |
| D. | methods. |
| Answer» B. argument. | |
| 31. |
When elements are deleted the nodes go to_________. |
| A. | registers. |
| B. | free pool. |
| C. | recycle bin. |
| D. | gets deleted permanently. |
| Answer» C. recycle bin. | |
| 32. |
A queue follows |
| A. | FIFO (First In First Out) principle |
| B. | LIFO (Last In First Out) principle |
| C. | Ordered array |
| D. | Linear tree |
| Answer» B. LIFO (Last In First Out) principle | |
| 33. |
A connected graph T without any cycles is called _____________. |
| A. | a tree graph. |
| B. | free tree. |
| C. | a tree. |
| D. | all of the above. |
| Answer» E. | |
| 34. |
The post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be |
| A. | T Q R S O P |
| B. | T O Q R P S |
| C. | T Q O P S R |
| D. | T Q O S P R |
| Answer» D. T Q O S P R | |
| 35. |
A self – balancing binary search tree can be used to implement |
| A. | Priority queue |
| B. | Hash table |
| C. | Heap sort |
| D. | Priority queue and Heap sort |
| Answer» B. Hash table | |
| 36. |
trees are B-trees of order 4. They are an isometric of trees. |
| A. | AVL |
| B. | AA |
| C. | 2-3 |
| D. | Red-Black |
| Answer» E. | |
| 37. |
In a binary search tree, which of the following traversals would print the numbers in the ascendingorder? |
| A. | Level-order traversal |
| B. | Pre-order traversal |
| C. | Post-order traversal |
| D. | In-order traversal |
| Answer» E. | |
| 38. |
The Postfix equivalent of the Prefix Notation * + ab - cd is |
| A. | ab + cd - * |
| B. | abcd +-* |
| C. | ab+cd*- |
| D. | ab+-cd* |
| Answer» B. abcd +-* | |
| 39. |
The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How manyiterations will be done to sort the array? |
| A. | 4 |
| B. | 2 |
| C. | 1 |
| Answer» B. 2 | |
| 40. |
The possibility of two different keys k1 & k2 yielding the same hash address is called__________. |
| A. | merge. |
| B. | obstacle. |
| C. | overlapping. |
| D. | collision. |
| Answer» D. collision. | |
| 41. |
Program module contains its own list of variables called ____________. |
| A. | global. |
| B. | scope. |
| C. | local. |
| D. | external. |
| Answer» D. external. | |
| 42. |
What is the value of the postfix expression 6 3 2 4 + – *? |
| A. | 1 |
| B. | 40 |
| C. | 74 |
| D. | -18 |
| Answer» E. | |
| 43. |
The queue which wraps around upon reaching the end of the array is called as____________. |
| A. | circular queue. |
| B. | linked queue. |
| C. | doubly linked list. |
| D. | representation of queue. |
| Answer» B. linked queue. | |
| 44. |
The prefix form of an infix expression (p + q) – (r * t) is? |
| A. | + pq – *rt |
| B. | – +pqr * t |
| C. | – +pq * rt |
| D. | – + * pqrt |
| Answer» D. – + * pqrt | |
| 45. |
What is the advantage of selection sort over other sorting techniques? |
| A. | It requires no additional storage space |
| B. | It is scalable |
| C. | It works best for inputs which are already sorted |
| D. | It is faster than any other sorting technique |
| Answer» B. It is scalable | |
| 46. |
The sequence (1,1) (2,1) (3,1) (1,2) (2,2) (3,2) . . . .represents _________. |
| A. | row major order. |
| B. | column major order. |
| C. | random order. |
| D. | successive order. |
| Answer» C. random order. | |
| 47. |
Maximum degree in any vector in a graph with n vertices is ________. |
| A. | n. |
| B. | n-1. |
| C. | n+1. |
| D. | 2n+1. |
| Answer» C. n+1. | |
| 48. |
Circular Queue is also known as |
| A. | Ring Buffer |
| B. | Square Buffer |
| C. | Rectangle Buffer |
| D. | Curve Buffer |
| Answer» B. Square Buffer | |
| 49. |
Which of the following is useful in traversing a given graph by Breath first search? |
| A. | Stack. |
| B. | Set. |
| C. | List. |
| D. | Queue. |
| Answer» E. | |
| 50. |
Which of the following should be used to sort a huge database on a fixed-length key field? |
| A. | Insertion sort |
| B. | Merge sort |
| C. | LSD radix sort |
| D. | Quick sort |
| Answer» D. Quick sort | |