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.
| 351. |
Uncompressed video requires a ________ data rate. |
| A. | high |
| B. | low |
| C. | medium |
| D. | very high |
| Answer» E. | |
| 352. |
Lossy compression reduces bits by removing unnecessary or less important information. |
| A. | True |
| B. | False |
| C. | May be True or False |
| D. | Can't Say |
| Answer» B. False | |
| 353. |
Duplicate-valued elements can be attributed in a |
| A. | Set |
| B. | Entities |
| C. | Sequence |
| D. | Structure |
| Answer» D. Structure | |
| 354. |
What is the type of the algorithm used in solving the 8 Queens problem? |
| A. | Backtracking |
| B. | Dynamic |
| C. | Branch and Bound |
| D. | both a and b |
| Answer» B. Dynamic | |
| 355. |
R is an equivalence relation on set S if it has property of |
| A. | Reflexive |
| B. | Symmetric |
| C. | Transitive |
| D. | All of the above |
| Answer» E. | |
| 356. |
How many cases are there, which are used to compare various data structure's execution time in a relative manner? |
| A. | 2 |
| B. | 3 |
| C. | 4 |
| D. | 5 |
| Answer» C. 4 | |
| 357. |
Which of the following analysis known as theoretical analysis of an algorithm? |
| A. | A Posterior Analysis |
| B. | A Priori Analysis |
| C. | A Feasibility Analysis |
| D. | A Independent Analysis |
| Answer» C. A Feasibility Analysis | |
| 358. |
The [] notation is |
| A. | Symmetric |
| B. | Reflexive |
| C. | Transitive |
| D. | All of the above |
| Answer» E. | |
| 359. |
If a binary relation is antisymmetric and transitive is referred to as |
| A. | Impartial order |
| B. | Partial order |
| C. | Comparable order |
| D. | Non-comparable order |
| Answer» C. Comparable order | |
| 360. |
Data is nothing but ____________. |
| A. | Bunch of Information |
| B. | Piece of Information |
| C. | Programming Statement |
| D. | None of these |
| Answer» C. Programming Statement | |
| 361. |
ADT stands for |
| A. | Array data type |
| B. | Actual data type |
| C. | Abstract data type |
| D. | Assertion data type |
| Answer» D. Assertion data type | |
| 362. |
In command "110 DIM num(10)" in BASIC language, '110' declares |
| A. | one-dimensional array |
| B. | two-dimensional array |
| C. | three-dimension array |
| D. | mulch-dimension array |
| Answer» B. two-dimensional array | |
| 363. |
For parameters, a specific selection of values is called |
| A. | Parameters |
| B. | Instances |
| C. | Member |
| D. | Entity |
| Answer» C. Member | |
| 364. |
Data structure that support efficient insertion of new records, is said to be |
| A. | Array |
| B. | Hash table |
| C. | Pointer |
| D. | Stack |
| Answer» C. Pointer | |
| 365. |
Total order is also called |
| A. | Uniform order |
| B. | Static order |
| C. | Linear order |
| D. | Paired order |
| Answer» D. Paired order | |
| 366. |
Which of the following sorting algorithm is of divide-and-conquer type? |
| A. | Bubble sort |
| B. | Insertion sort |
| C. | Quick sort |
| D. | All of above |
| Answer» D. All of above | |
| 367. |
A list which displays the relationship of adjacency between elements is said to be |
| A. | linear |
| B. | non linear |
| C. | linked list |
| D. | trees |
| Answer» B. non linear | |
| 368. |
_______ is the process of encoding information using fewer bits than the original representation. |
| A. | Data loss |
| B. | Data compression |
| C. | Data transmit |
| D. | Data gain |
| Answer» C. Data transmit | |
| 369. |
_________________ defines a set of primitive elements which do not involves any other element as its sub-part. |
| A. | Non Linear Data Structure |
| B. | Linear Data Structure |
| C. | Non-Primitive Data Structure |
| D. | Primitive Data Structure |
| Answer» E. | |
| 370. |
Data that can be broken down into small pieces and each sub-field having the some meaning is called as ___________. |
| A. | Dynamic Data |
| B. | Composite Data |
| C. | Textual Data |
| D. | Atomic Data |
| Answer» C. Textual Data | |
| 371. |
Which of the following is not a Characteristics of a Data Structure? |
| A. | Completeness |
| B. | Correctness |
| C. | Time Complexity |
| D. | Space Complexity |
| Answer» B. Correctness | |
| 372. |
Which file open mode would be used to write data only to the end of an existing file? |
| A. | ios::app |
| B. | ios::in |
| C. | ios::out |
| D. | ios::trunc |
| Answer» B. ios::in | |
| 373. |
A data structure requires a certain amount of space for each |
| A. | Data process |
| B. | Data movement |
| C. | Data item |
| D. | Data action |
| Answer» D. Data action | |
| 374. |
In problem solving solution defined constraints should be of form |
| A. | Inputs and outputs |
| B. | How the problem should be solved |
| C. | Used Resources |
| D. | Used Mechanisms |
| Answer» D. Used Mechanisms | |
| 375. |
In line '500 IF NAME$="***" THEN Average= Total Mark/N' of BASIC program, Total Mark and N are considered as |
| A. | set of integers |
| B. | negative odd numbers |
| C. | positive even numbers |
| D. | positive odd numbers |
| Answer» B. negative odd numbers | |
| 376. |
In a function, values that make up an input are known to be |
| A. | Member |
| B. | Domain |
| C. | Instances |
| D. | Parameters |
| Answer» E. | |
| 377. |
An ADT and data related to its implementation together make up a |
| A. | Type |
| B. | Class |
| C. | Object |
| D. | Member |
| Answer» C. Object | |
| 378. |
Each member of a set can be thought of an/a |
| A. | Primitive element of type |
| B. | Set itself |
| C. | Both a and b |
| D. | Data element of set |
| Answer» D. Data element of set | |
| 379. |
A data structure is a group of data elements grouped together under ______. |
| A. | One name |
| B. | Different names |
| C. | Multiple names |
| D. | Same name |
| Answer» B. Different names | |
| 380. |
For selecting a data structure, approach to be followed is known as |
| A. | Two-step approach |
| B. | Three-step approach |
| C. | Four-step approach |
| D. | Five-step approach |
| Answer» C. Four-step approach | |
| 381. |
If every pair of distinct elements in a partial order are comparable, then order is called a |
| A. | Total order |
| B. | Partial order |
| C. | Non-comparable order |
| D. | Comparable order |
| Answer» B. Partial order | |
| 382. |
A task to be performed is known as |
| A. | Operation |
| B. | Work |
| C. | Function |
| D. | Problem |
| Answer» E. | |
| 383. |
An ADT is defined to be a mathematical model of a user-defined type along with the collection of all ____________ operations on that model |
| A. | Primitive |
| B. | Structured |
| C. | Cardinality |
| D. | Assignment |
| Answer» B. Structured | |
| 384. |
Implementing a data type as a data structure is of form |
| A. | Composite |
| B. | Logical |
| C. | Physical |
| D. | Absolute |
| Answer» D. Absolute | |
| 385. |
To represent hierarchical relationship between elements, Which data structure is suitable? |
| A. | Dequeue |
| B. | Priority |
| C. | Tree |
| D. | Graph |
| Answer» D. Graph | |
| 386. |
When new data are to be inserted into a data structure, but there is not available space; this situation is usually called …. |
| A. | Underflow |
| B. | overflow |
| C. | houseful |
| D. | saturated |
| Answer» C. houseful | |
| 387. |
Which of the following is not the part of ADT description? |
| A. | Data |
| B. | Operations |
| C. | Both of the above |
| D. | None of the above |
| Answer» E. | |
| 388. |
Which of the following data structure is non linear type? |
| A. | Strings |
| B. | Lists |
| C. | Stacks |
| D. | Graph |
| Answer» E. | |
| 389. |
Which of the following is/are the levels of implementation of data structure |
| A. | Abstract level |
| B. | Application level |
| C. | Implementation level |
| D. | All of the above |
| Answer» E. | |
| 390. |
Match the following.a) Completeness i) How long does it take to find a solutionb) Time Complexity ii) How much memory need to perform the search.c) 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 | |
| 391. |
Which of the following is non-liner data structure? |
| A. | Stacks |
| B. | List |
| C. | Strings |
| D. | Trees |
| Answer» E. | |
| 392. |
…………… is not the component of data structure. |
| A. | Operations |
| B. | Storage Structures |
| C. | Algorithms |
| D. | None of the above |
| Answer» E. | |
| 393. |
……………….. level is where the model becomes compatible executable code. |
| A. | Abstract level |
| B. | Application level |
| C. | Implementation level |
| D. | All of the above |
| Answer» D. All of the above | |
| 394. |
In simple chaining, what data structure is appropriate? |
| A. | Singly linked list |
| B. | Doubly linked list |
| C. | Circular linked list |
| D. | Binary trees |
| Answer» C. Circular linked list | |
| 395. |
In simple uniform hashing, what is the search complexity? |
| A. | O(n) |
| B. | O(logn) |
| C. | O(nlogn) |
| D. | O(1) |
| Answer» E. | |
| 396. |
What is simple uniform hashing? |
| A. | Every element has equal probability of hashing into any of the slots |
| B. | A weighted probabilistic method is used to hash elements into the slots |
| C. | All of the mentioned d |
| D. | None of the mentioned |
| Answer» B. A weighted probabilistic method is used to hash elements into the slots | |
| 397. |
What is the load factor? |
| A. | Average array size |
| B. | Average key size |
| C. | Average chain length |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 398. |
What can be the techniques to avoid collision? |
| A. | Make the hash function appear random |
| B. | Use the chaining method |
| C. | Use uniform hashing |
| D. | All of the mentioned |
| Answer» E. | |
| 399. |
What is a hash function? |
| A. | A function has allocated memory to keys |
| B. | A function that computes the location of the key in the array |
| C. | A function that creates an array |
| D. | None of the mentioned |
| Answer» C. A function that creates an array | |
| 400. |
What is the search complexity in direct addressing? |
| A. | O(n) |
| B. | O(logn) |
| C. | O(nlogn) |
| D. | O(1) |
| Answer» E. | |