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.
| 301. |
If element in array has two subscripts, then array is |
| A. | single dimension |
| B. | three dimension |
| C. | four dimension |
| D. | two dimension |
| Answer» E. | |
| 302. |
In line '300 IF NAME$="***" THEN Average= Total Mark/N' of BASIC program, "***" is classified as |
| A. | rational string |
| B. | string variable |
| C. | irrational string |
| D. | string constant |
| Answer» E. | |
| 303. |
Which of the following abstract data types can be used to represent a many to many relation? |
| A. | Plex |
| B. | Graph |
| C. | Both (a) and (b) |
| D. | Tree |
| Answer» D. Tree | |
| 304. |
In analysis of algorithm, approximate relationship between the size of the job and the amount of work required to do is expressed by using _________. |
| A. | Central tendency |
| B. | Differential equation |
| C. | Order of magnitude |
| D. | Order of execution |
| Answer» E. | |
| 305. |
__________ is a single elementary unit of information representing an attribute of an entity. |
| A. | Entity Set |
| B. | Record |
| C. | File |
| D. | Field |
| Answer» E. | |
| 306. |
A collection of elements having an specific order is called |
| A. | Program |
| B. | Sequence |
| C. | Structure |
| D. | Relation |
| Answer» C. Structure | |
| 307. |
In Average case, if operation takes f(n) time in execution, then m operations will take? |
| A. | (n) |
| B. | f(m) |
| C. | mf(n) |
| D. | nf(m) |
| Answer» D. nf(m) | |
| 308. |
Inputs of a function can also be referred to |
| A. | Domain |
| B. | Range |
| C. | Parameters |
| D. | Instances |
| Answer» B. Range | |
| 309. |
A random access file is organized most like a(n): |
| A. | Array |
| B. | Object |
| C. | Class |
| D. | Pointer |
| Answer» B. Object | |
| 310. |
A collection of values are known as |
| A. | Chain |
| B. | Type |
| C. | Stack |
| D. | Array |
| Answer» C. Stack | |
| 311. |
The simplest type of data structure is ……………… |
| A. | Multidimensional array |
| B. | Linear array |
| C. | Two dimensional array |
| D. | Three dimensional array |
| Answer» C. Two dimensional array | |
| 312. |
The logical or mathematical model of a particular organization of data is called a ……… |
| A. | Data structure |
| B. | Data arrangement |
| C. | Data configuration |
| D. | Data formation |
| Answer» B. Data arrangement | |
| 313. |
A given algorithm is able to compute |
| A. | 2 functions only |
| B. | Particular function |
| C. | Multiple functions |
| D. | Infinite functions |
| Answer» C. Multiple functions | |
| 314. |
A function or a mapping of inputs to outputs is called |
| A. | Process |
| B. | Program |
| C. | Algorithm |
| D. | Problem |
| Answer» E. | |
| 315. |
A problem definition should not include any |
| A. | Inputs |
| B. | Outputs |
| C. | Constraints |
| D. | Steps |
| Answer» D. Steps | |
| 316. |
Space requirement of a data item, defined by its variables are referred to as |
| A. | Data structure |
| B. | Data process |
| C. | Data object |
| D. | Data member |
| Answer» E. | |
| 317. |
In mathematical means, problems can be viewed as |
| A. | Operations |
| B. | Functions |
| C. | Mechanism |
| D. | Design pattern |
| Answer» C. Mechanism | |
| 318. |
O(1) means computing time is __________________ |
| A. | Constant |
| B. | Quadratic |
| C. | Linear |
| D. | Cubic |
| Answer» B. Quadratic | |
| 319. |
Records can be accessed by unique numbers, that are known to be |
| A. | Record-match query |
| B. | Exact-match query |
| C. | Data-match query |
| D. | Query-match |
| Answer» C. Data-match query | |
| 320. |
A sequence is also referred to as a |
| A. | Tuple |
| B. | Instsance |
| C. | Domain |
| D. | Attribute |
| Answer» B. Instsance | |
| 321. |
A ________is a linear list of data elements in which the addition of a new element or the deletion of an element occurs only at one end. |
| A. | Top |
| B. | Push and pop |
| C. | Stack |
| D. | None of the above |
| Answer» D. None of the above | |
| 322. |
In line '400 IF NAME$="***" THEN Average= Total Mark/N' of BASIC program, AVERAGE is considered as |
| A. | real numbers |
| B. | rational variables |
| C. | negative integers |
| D. | irrational numbers |
| Answer» B. rational variables | |
| 323. |
An algorithm must have |
| A. | Correct guidelines |
| B. | Infinite length |
| C. | Termination |
| D. | Both a and b |
| Answer» E. | |
| 324. |
Which one of the below mentioned is linear data structure? |
| A. | Queue |
| B. | Stack |
| C. | Arrays |
| D. | All of these |
| Answer» E. | |
| 325. |
An instantiation of an algorithm in a computer programming language is called |
| A. | Algorithm |
| B. | Problem solving |
| C. | Program |
| D. | Process method |
| Answer» D. Process method | |
| 326. |
The way in which the data item or items are logically related defines ….. |
| A. | storage structure |
| B. | data structure |
| C. | data relationship |
| D. | data operation |
| Answer» C. data relationship | |
| 327. |
When divisions of decimals are involved in a program, these numbers are stored in |
| A. | rational numbers |
| B. | irrational numbers |
| C. | real numbers |
| D. | original numbers |
| Answer» D. original numbers | |
| 328. |
Which of the following algorithms has very high compression ratio, used by 7zip and xz? |
| A. | LZSS |
| B. | LZO |
| C. | LZMA |
| D. | LZW |
| Answer» D. LZW | |
| 329. |
A record or a piece of information whose value is generated from a type, is called |
| A. | Data process |
| B. | Data movement |
| C. | Data action |
| D. | Data item |
| Answer» E. | |
| 330. |
Which of the following is true about LempelZivWelch (LZW) algorithm? |
| A. | Optimized for compressing plain text |
| B. | Used by GIF images and Unix's compress utility |
| C. | Used by WinRAR in tandem with Huffman coding |
| D. | used by ZIP, gzip, and PNG images |
| Answer» C. Used by WinRAR in tandem with Huffman coding | |
| 331. |
Which of the following is Lossless Data Compression Algorithms? |
| A. | LZ77 |
| B. | LZR |
| C. | DEFLATE |
| D. | All of the above |
| Answer» E. | |
| 332. |
Lossyimage compressionis used indigital cameras, to increase storage capacities. |
| A. | True |
| B. | False |
| C. | May be True or False |
| D. | Can't Say |
| Answer» B. False | |
| 333. |
Which of the following is not a audio compression algorithms? |
| A. | ALAC |
| B. | DST |
| C. | JSAC |
| D. | OSQ |
| Answer» D. OSQ | |
| 334. |
The upper bound on the time complexity of the nondeterministic sorting algorithm is? |
| A. | O(n) |
| B. | O(n log n) |
| C. | O(1) |
| D. | O( log n) |
| Answer» B. O(n log n) | |
| 335. |
To write fixed-length records, use file open mode: |
| A. | ios::app |
| B. | ios::ate |
| C. | ios::trunc |
| D. | ios::binary |
| Answer» E. | |
| 336. |
Sum of reciprocals from 1 to n, called |
| A. | Hammer series |
| B. | Recurrence series |
| C. | Non-recurrence series |
| D. | Harmonic series |
| Answer» E. | |
| 337. |
Which is an example of a dynamic data structure? |
| A. | Linked list |
| B. | Memory location |
| C. | Stack |
| D. | String |
| Answer» B. Memory location | |
| 338. |
How many types of compression there? |
| A. | 4 |
| B. | 3 |
| C. | 2 |
| D. | 5 |
| Answer» D. 5 | |
| 339. |
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 | |
| 340. |
Which of the following analysis known as empirical analysis of an algorithm? |
| A. | A Posterior Analysis |
| B. | A Priori Analysis |
| C. | A Feasibility Analysis |
| D. | A Independent Analysis |
| Answer» B. A Priori Analysis | |
| 341. |
Which model is used to organize data in the main memory is called data structure? |
| A. | Logical |
| B. | Mathematical |
| C. | Debugging |
| D. | All of the above |
| Answer» E. | |
| 342. |
A record is modifiable only when medication does not affect its |
| A. | Resource requirements |
| B. | Degradation requirements |
| C. | Space requirements |
| D. | Reference requirements |
| Answer» D. Reference requirements | |
| 343. |
An algorithm with running-time of a highest-order term containing a factor of n^2 is said to have a |
| A. | Quadratic growth rate |
| B. | Exponential growth rate |
| C. | Absolute growth rate |
| D. | Linear growth rate |
| Answer» B. Exponential growth rate | |
| 344. |
What plays an important role in programming? |
| A. | Data |
| B. | Computer |
| C. | Information |
| D. | None of the above |
| Answer» B. Computer | |
| 345. |
An implementation for function that transforms an input to corresponding output is called |
| A. | Algorithms |
| B. | Program |
| C. | Pattern |
| D. | Processing |
| Answer» B. Program | |
| 346. |
Relation defining a function by means of an expression that includes one or more instances of itself is known to be |
| A. | Structured relation |
| B. | Recurrence relation |
| C. | Sequenced relation |
| D. | Absolute relation |
| Answer» C. Sequenced relation | |
| 347. |
Data structure that allows extremely fast exact-match search, is known to be |
| A. | Arrays |
| B. | Pointers |
| C. | Stacks |
| D. | Hash tables |
| Answer» E. | |
| 348. |
A function can be thought as a matching between |
| A. | Inputs |
| B. | Outputs |
| C. | Parameters |
| D. | Both a and b |
| Answer» E. | |
| 349. |
A relation that can be used to partition a set into equivalence classes is called |
| A. | Symmetric |
| B. | Asymmetric |
| C. | Equivalence |
| D. | Non-equivalence |
| Answer» D. Non-equivalence | |
| 350. |
A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a |
| A. | queue |
| B. | stack |
| C. | tree |
| D. | linked list |
| Answer» B. stack | |