MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 282 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.
| 251. |
Which of the following sorting methods will be the best if number of swappings done, is the only measure of efficienty? |
| A. | bubble sort |
| B. | selection sort |
| C. | insertion sort |
| D. | merge sort |
| Answer» C. insertion sort | |
| 252. |
Each node in a linear list contains an item called _______ which points to the next node in the list. |
| A. | node |
| B. | link |
| C. | variable |
| Answer» C. variable | |
| 253. |
An array is referenced by its name.Similarly,a linked list is referenced by____ |
| A. | address of the first node |
| B. | address of the last node |
| C. | both (a)and(b) |
| D. | none of these |
| Answer» B. address of the last node | |
| 254. |
Total number of comparision in bubble sort is____ |
| A. | o(nlogn) |
| B. | o(n2) |
| C. | o(n) |
| D. | none of these |
| Answer» C. o(n) | |
| 255. |
Given a file size n the number of times a given file is passed through in bubble sort is____ |
| A. | n2 |
| B. | n-1 |
| C. | nlogn |
| D. | logn |
| Answer» B. n-1 | |
| 256. |
How will you print\n on screen? |
| A. | printf("\\n"); |
| B. | printf(\\\n\); |
| C. | echo\\\\n; |
| D. | printf("\\\\n"); |
| Answer» E. | |
| 257. |
Array is |
| A. | data in physical order |
| B. | data in logical order |
| C. | both a& b |
| D. | none of the above |
| Answer» B. data in logical order | |
| 258. |
The smallest element of an array’s index is called its |
| A. | lower bound |
| B. | upper bound |
| C. | range |
| D. | extraction |
| Answer» B. upper bound | |
| 259. |
The advantages of linked list over an array for representing a list is________ |
| A. | space used is less |
| B. | deletion is easier |
| C. | insertion is easier |
| D. | both (a) and (b) |
| Answer» E. | |
| 260. |
The result of 0001 1010 << 2 is____ |
| A. | 0101 1100 |
| B. | 0110 1000 |
| C. | 0001 1110 |
| D. | none of these |
| Answer» C. 0001 1110 | |
| 261. |
It exports a set of operations |
| A. | true, false |
| B. | false, true |
| C. | true, true |
| D. | false, false |
| Answer» D. false, false | |
| 262. |
A graph is said to be complete if there is no edge between every pair of vertices. |
| A. | true, false, true |
| B. | true, true, false |
| C. | true, true, true |
| D. | false, true, true |
| Answer» C. true, true, true | |
| 263. |
The time complexity of binary search is O(logn). |
| A. | true, false |
| B. | false, true |
| C. | false, false |
| D. | true, true |
| Answer» E. | |
| 264. |
A graph is said to be complete if there is an edge between every pair of vertices. |
| A. | true, true |
| B. | false, true |
| C. | false, false |
| D. | true, false |
| Answer» B. false, true | |
| 265. |
To find the predecessor, it is required to traverse the list from the first node in case of singly linked list. |
| A. | i-only |
| B. | ii-only |
| C. | both i and ii |
| D. | none of both |
| Answer» D. none of both | |
| 266. |
Space Complexity iii) Is the strategy guaranteed to find the solution when there in one. |
| A. | a-iii, b-ii, c-i |
| B. | a-i, b-ii, c-iii |
| C. | a-iii, b-i, c-ii |
| D. | a-i, b-iii, c-ii |
| Answer» D. a-i, b-iii, c-ii | |
| 267. |
Nodes that are not root and not leaf are called as internal nodes. |
| A. | true, true |
| B. | true, false |
| C. | false, true |
| D. | false, false |
| Answer» D. false, false | |
| 268. |
A node is child node if out degree is one. |
| A. | true, true |
| B. | true, false |
| C. | false, true |
| D. | false, false |
| Answer» C. false, true | |
| 269. |
Insertion b) Deletion c) Retrieval d) Traversal |
| A. | only a,b and c |
| B. | only a and b |
| C. | all of the above |
| D. | none of the above |
| Answer» E. | |
| 270. |
In strictly binary tree, the out-degree of every node is either o or 2. |
| A. | true, false |
| B. | false, true |
| C. | true, true |
| D. | false, false |
| Answer» D. false, false | |
| 271. |
The space factor when determining the efficiency 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» B. counting the minimum memory needed by the algorithm | |
| 272. |
The time factor when determining the efficiency of algorithm is measured by |
| 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 | |
| 273. |
Two main measures for the efficiency of an algorithm are |
| A. | processor and memory |
| B. | complexity and capacity |
| C. | time and space |
| D. | data and space |
| Answer» D. data and space | |
| 274. |
________ is the problem of deciding whether or not a given String pattern P appears in a text T. |
| A. | pattern matching |
| B. | searching |
| C. | sorting |
| D. | deletion |
| Answer» B. searching | |
| 275. |
_________ operation of word processing involves replacing one string in the text by another. |
| A. | insertion |
| B. | deletion |
| C. | searching |
| D. | replacement |
| Answer» E. | |
| 276. |
The number of characters in a string is called its ______. |
| A. | length |
| B. | breath |
| C. | width |
| D. | none |
| Answer» D. none | |
| 277. |
Groups of consecutive elements in a string, such as words, phrases and sentences are called ________. |
| A. | main strings |
| B. | substring |
| C. | index |
| D. | block |
| Answer» C. index | |
| 278. |
String with zero characters is called ________ string. |
| A. | null |
| B. | binary |
| C. | totalled |
| D. | list |
| Answer» B. binary | |
| 279. |
A computer which can access an individual byte is called a ________ machine. |
| A. | memory addressable |
| B. | byte addressable |
| C. | bit |
| D. | byte |
| Answer» C. bit | |
| 280. |
Finite sequence S of zero or more characters is called _______. |
| A. | array |
| B. | list |
| C. | string |
| D. | block |
| Answer» D. block | |
| 281. |
Each programming language contains a ______ set that is used to communicate with the computer. |
| A. | character |
| B. | integer |
| C. | float |
| D. | numeric |
| Answer» B. integer | |
| 282. |
Computers are used for processing numerical data called _______ data. |
| A. | float |
| B. | local |
| C. | character |
| D. | non-local |
| Answer» D. non-local | |