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) , Electronics and Communication Engineering , Common Topics in Competitive and Entrance exams .
| 301. |
The complexity of the average case of an algorithm is |
| A. | Much more complicated to analyze than that of worst case |
| B. | Much more simpler to analyze than that of worst case |
| C. | Sometimes more complicated and some other times simpler than that of worst case |
| D. | None of the above |
| Answer» A. Much more complicated to analyze than that of worst case | |
| 302. |
The following data structure allows deleting data elements from front and inserting at rear |
| A. | Stacks |
| B. | Queues |
| C. | Deques |
| D. | Binary search tree |
| Answer» B. Queues | |
| 303. |
This data structure allows deletions at both ends of the list but insertion at only one end. |
| A. | Input-restricted deque |
| B. | Output-restricted deque |
| C. | Priority queues |
| D. | None of the above |
| Answer» A. Input-restricted deque | |
| 304. |
The following data structure is non-linear type |
| A. | Strings |
| B. | Lists |
| C. | Stacks |
| D. | None of the above |
| Answer» D. None of the above | |
| 305. |
The following data structure is linear type |
| A. | Strings |
| B. | Lists |
| C. | Queues |
| D. | All of the above |
| Answer» D. All of the above | |
| 306. |
To represent hierarchical relationship be- tween elements, the following data structure is not suitable |
| A. | Deque |
| B. | Priority |
| C. | Tree |
| D. | All of above |
| Answer» C. Tree | |
| 307. |
A binary tree whose every node has either zero or two children is called |
| A. | Complete binary tree |
| B. | Binary search tree |
| C. | Extended binary tree |
| D. | None of above |
| Answer» C. Extended binary tree | |
| 308. |
The depth of a complete binary tree is given by |
| A. | Dn = n log2n |
| B. | Dn = n log2n+1 |
| C. | Dn = log2n |
| D. | Dn = log2n+1 |
| Answer» D. Dn = log2n+1 | |
| 309. |
The complexity of Binary search algorithm is |
| A. | O(n) |
| B. | O(log ) |
| C. | O(n log n) |
| D. | None of the above |
| Answer» B. O(log ) | |
| 310. |
The complexity of Bubble sort algorithm is |
| A. | O(n) |
| B. | O (n2) |
| C. | O(n log n) |
| D. | None of the above |
| Answer» B. O (n2) | |
| 311. |
When in order traversing a tree resulted E A C K F H D B G; the preorder traversal would return |
| A. | FAEKCDBHG |
| B. | FAEKCDHGB |
| C. | EAFKHDCBG |
| D. | FEAKDCHBG |
| Answer» B. FAEKCDHGB | |
| 312. |
When representing any algebraic expression E the following uses only binary operations in a 2-tree |
| A. | the variable in E will appear as external nodes and operations in internal nodes |
| B. | the operations in E will appear as exter- nal nodes and variables in internal nodes |
| C. | the variables and operations in E will appear only in internal nodes |
| D. | None of the above |
| Answer» A. the variable in E will appear as external nodes and operations in internal nodes | |
| 313. |
When converting binary tree into extended binary tree, all the original nodes in binary tree are |
| A. | internal nodes on extended tree |
| B. | external nodes on extended tree |
| C. | vanished on extended tree |
| D. | None of the above |
| Answer» A. internal nodes on extended tree | |
| 314. |
The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal |
| A. | ABFCDE |
| B. | ADBFEC |
| C. | ABDECF |
| D. | None of the above |
| Answer» C. ABDECF | |
| 315. |
Which of the following data structure is lin- ear data structure? |
| A. | Trees |
| B. | Graphs |
| C. | Arrays |
| D. | None of the above |
| Answer» C. Arrays | |
| 316. |
The operation of processing each element in the list is known as |
| A. | Merging |
| B. | Inserting |
| C. | Traversal |
| D. | All the above |
| Answer» C. Traversal | |
| 317. |
Finding the location of the element with a given value is called |
| A. | Traversal |
| B. | Search |
| C. | Sort |
| D. | All of the above |
| Answer» B. Search | |
| 318. |
Arrays are best data structures for |
| A. | relatively permanent collections of data |
| B. | the size of the structure and the data in the structure are constantly changing |
| C. | both of above situation |
| D. | none of above situation |
| Answer» A. relatively permanent collections of data | |
| 319. |
Linked lists are best suited for |
| A. | relatively permanent collections of data |
| B. | the size of the structure and the data in the structure are constantly changing |
| C. | both of above situation |
| D. | none of above situation |
| Answer» B. the size of the structure and the data in the structure are constantly changing | |
| 320. |
Each array declaration need not give, implicitly or explicitly, the information about the |
| A. | name of array |
| B. | data type of array |
| C. | first data from the set to be stored |
| D. | index set of the array |
| Answer» C. first data from the set to be stored | |
| 321. |
The complexity of merge sort algorithm is |
| A. | O(n) |
| B. | O(log n) |
| C. | O(n log n) |
| D. | None of these |
| Answer» C. O(n log n) | |
| 322. |
The indirect change of the values of a vari- able in one module by another module is called |
| A. | internal change |
| B. | inter-module change |
| C. | side effect |
| D. | all the above |
| Answer» C. side effect | |
| 323. |
Two main measures for the efficiency of an algorithm are |
| A. | Time and space |
| B. | Processor and memory |
| C. | Complexity and capacity |
| D. | Data and space |
| Answer» A. Time and space | |
| 324. |
The time factor when determining the effi- ciency of algorithm is measured by |
| A. | Counting the number of key operations |
| B. | Counting the number of statements |
| C. | Counting the kilobytes of algorithm |
| D. | None of the above |
| Answer» A. Counting the number of key operations | |
| 325. |
The space factor when determining the effi- ciency of algorithm is measured by |
| A. | Counting the maximum memory needed by the algorithm |
| B. | Counting the minimum memory needed by the algorithm |
| C. | Counting the average memory needed by the algorithm |
| D. | Counting the maximum disk space needed by the algorithm |
| Answer» A. Counting the maximum memory needed by the algorithm | |
| 326. |
All the above* Which of the following data structures are indexed structures |
| A. | linear arrays |
| B. | linked lists |
| C. | both of above |
| D. | none of above |
| Answer» A. linear arrays | |
| 327. |
Which of the following is not the required condition for binary search algorithm |
| A. | there must be mechanism to delete and/ or insert elements in list |
| B. | the list must be sorted |
| C. | there should be the direct access to the middle element in any sublist |
| D. | none of the above |
| Answer» A. there must be mechanism to delete and/ or insert elements in list | |
| 328. |
Which of the following is not a limitation of binary search algorithm ? |
| A. | binary search algorithm is not efficient when the data elements are more than 1000. |
| B. | must use a sorted array |
| C. | requirement of sorted array is expen- sive when a lot of insertion and dele- tions are needed |
| D. | there must be a mechanism to access middle element directly |
| Answer» A. binary search algorithm is not efficient when the data elements are more than 1000. | |
| 329. |
Two dimensional arrays are also called |
| A. | tables arrays |
| B. | matrix arrays |
| C. | both of the above |
| D. | none of the above |
| Answer» C. both of the above | |
| 330. |
The term “push” and “pop” is related to the |
| A. | Array |
| B. | Lists |
| C. | stacks |
| D. | all of above |
| Answer» C. stacks | |
| 331. |
A data structure where elements can be added or removed at either end but not in the middle is referred as |
| A. | Linked lists |
| B. | Stacks |
| C. | Queues |
| D. | Deque |
| Answer» D. Deque | |
| 332. |
The following sorting algorithm is of divide- and-conquer type |
| A. | Bubble sort |
| B. | Insertion sort |
| C. | Quick sort |
| D. | None of the above |
| Answer» C. Quick sort | |
|
Explanation: Quick sort is a divide-and-conquer sorting algorithm that works by partitioning a list of items into two smaller lists and then sorting each of these lists recursively. It is an efficient and widely used algorithm, with an average case time complexity of O(n log n). Bubble sort and insertion sort are both comparison-based sorting algorithms, but they do not use the divide-and-conquer approach. Bubble sort works by repeatedly swapping adjacent elements that are out of order, while insertion sort works by iteratively inserting each element into its correct position in the sorted list. Both of these algorithms have a time complexity of O(n^2) in the worst case. |
|
| 333. |
An algorithm that calls itself directly or indi- rectly is known as |
| A. | Recursion |
| B. | Polish notation |
| C. | Traversal algorithm |
| D. | None of the above |
| Answer» A. Recursion | |
| 334. |
The elements of an array are stored suc- cessively in memory cells because |
| A. | by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated |
| B. | the architecture of computer memory does not allow arrays to store other than serially |
| C. | A and B both false |
| D. | A and B both true |
| Answer» A. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated | |
| 335. |
The memory address of the first element of an array is called |
| A. | base address |
| B. | floor address |
| C. | foundation address |
| D. | first address |
| Answer» A. base address | |
| 336. |
The memory address of fifth element of an array can be calculated by the formula |
| A. | LOC(Array[5])=Base(Array[5])+(5-lower boun(D), where w is the number of words per memory cell for the array |
| B. | LOC(Array[5])=Base(Array[4])+(5-Upper boun(D), where w is the number of words per memory cell for the array |
| C. | LOC(Array[5]=Base(Array)+w(5-lower bou |
| D. | , where w is the number of words per memory cell for the array |
| Answer» C. LOC(Array[5]=Base(Array)+w(5-lower bou | |
| 337. |
The following data structure can’t store the non-homogeneous data elements |
| A. | Arrays |
| B. | Records |
| C. | Pointers |
| D. | None of the above |
| Answer» A. Arrays | |
| 338. |
The in order traversal of tree will yield a sorted listing of elements of tree in |
| A. | Binary trees |
| B. | Binary search trees |
| C. | Heaps |
| D. | None of above |
| Answer» B. Binary search trees | |
| 339. |
In a Heap tree values in a node is greater than |
| A. | every value in left sub tree and smaller than right sub tree |
| B. | every value in children of it |
| C. | Both of above conditions are true |
| D. | None of above conditions are true |
| Answer» B. every value in children of it | |
| 340. |
In a graph if e=[u, v], Then u and v are called |
| A. | endpoints of e |
| B. | adjacent nodes |
| C. | neighbors |
| D. | all of the above |
| Answer» D. all of the above | |
| 341. |
A connected graph T without any cycles is called |
| A. | tree graph |
| B. | free tree |
| C. | tree |
| D. | All of the above |
| Answer» D. All of the above | |
| 342. |
The difference between linear array and a record is |
| A. | An array is suitable for homogeneous data but hte 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» D. All of above | |
| 343. |
The following data structure store the ho- mogeneous data elements |
| A. | Arrays |
| B. | Records |
| C. | Pointers |
| D. | None of the above |
| Answer» A. Arrays | |
| 344. |
Which of the following data structure is not linear data structure? |
| A. | Arrays |
| B. | Linked lists |
| C. | A and B are true |
| D. | None is true |
| Answer» C. A and B are true | |
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.