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.
| 251. |
Variable which can be accessed by all modules of the program is called as __________. |
| A. | Global Variable |
| B. | Static Variable |
| C. | Auto Variable |
| D. | Local Variable |
| Answer» B. Static Variable | |
| 252. |
ADT is called as Abstract because |
| A. | It is completely independent data type |
| B. | It is collection of different data types |
| C. | Implementation Details are hidden |
| D. | None of these |
| Answer» D. None of these | |
| 253. |
Term Data Structure refers to _________ and interrelationship between them. |
| A. | Programming Language Statement |
| B. | Coding Standards |
| C. | Organization of data element |
| D. | None of these |
| Answer» D. None of these | |
| 254. |
Data must be represented, organized, stored, processed and managed in a way that facilitates_________. |
| A. | Easy access |
| B. | Retrieval |
| C. | Both (a) and (b) |
| D. | Withdrawal |
| Answer» D. Withdrawal | |
| 255. |
The hierarchical relationship between data elements can be easily represented using a nonlinear data structure called_______. |
| A. | Tree |
| B. | Root node |
| C. | Child nodes |
| D. | None of the above |
| Answer» B. Root node | |
| 256. |
The OS of a computer may periodically collect all the free memory space to form contiguous block of free space. This is called |
| A. | Concatenation |
| B. | Garbage collection |
| C. | Collision |
| D. | Dynamic Memory Allocation |
| Answer» C. Collision | |
| 257. |
__________ is a collection of data elements of similar data types. |
| A. | String |
| B. | Arrays |
| C. | Both (a) and (b) |
| D. | |
| Answer» C. Both (a) and (b) | |
| 258. |
In an array representation of binary tree the right child of root will be at location of? |
| A. | 2 |
| B. | 3 |
| C. | 4 |
| D. | 6 |
| Answer» C. 4 | |
| 259. |
Data items that cannot be divided are called as? |
| A. | Group Items |
| B. | Attribute and Entity |
| C. | Elementary Items |
| D. | File items |
| Answer» D. File items | |
| 260. |
Operation(s) that an algorithm must fulfill is/are |
| A. | Compute the function |
| B. | Convert each input to correct output |
| C. | Intented functional parameters |
| D. | All of the above |
| Answer» E. | |
| 261. |
___________ is neither an algorithm nor a program. |
| A. | Computing |
| B. | Pseudo code |
| C. | Computer science |
| D. | None of the above |
| Answer» C. Computer science | |
| 262. |
A collection of distinguishable members or elements is known to be |
| A. | Set |
| B. | Combination |
| C. | Composition |
| D. | Collaboration |
| Answer» B. Combination | |
| 263. |
The concepts in programming languages are essential knowledge to anyone who wants to become skilled in_________________. |
| A. | Computer programming |
| B. | Data structures |
| C. | Decoding |
| D. | None of the above |
| Answer» B. Data structures | |
| 264. |
If elements of the data structure forms a sequence of list then it is called as ____________. |
| A. | Linear data structure |
| B. | Non-primitive data structure |
| C. | Primitive data structure |
| D. | None of these |
| Answer» B. Non-primitive data structure | |
| 265. |
Outputs of a function can also be referred to |
| A. | Instances |
| B. | Parameters |
| C. | Range |
| D. | Domain |
| Answer» D. Domain | |
| 266. |
Factorial's definition contains a recursive part and |
| A. | Data cases |
| B. | Symmetric case |
| C. | Reflexive cases |
| D. | Base cases |
| Answer» E. | |
| 267. |
Relation between two sets P and Q in qiven form is P ⊂ Q is |
| A. | P is subset of Q |
| B. | Q is subset of P |
| C. | All Elements are equal |
| D. | None of Elements are equal |
| Answer» B. Q is subset of P | |
| 268. |
The data structure which is one ended is ……………… |
| A. | queue |
| B. | stack |
| C. | tree |
| D. | graph |
| Answer» C. tree | |
| 269. |
Which of the following can be used as a criterion for classification of data structures used in language processing ? |
| A. | nature of a data structure |
| B. | purpose of a data structure |
| C. | lifetime of a data structure |
| D. | all of the above. |
| Answer» E. | |
| 270. |
Linear arrays are also called ………………. |
| A. | Straight line array |
| B. | One-dimensional array |
| C. | Vertical array |
| D. | Horizontal array |
| Answer» C. Vertical array | |
| 271. |
Members of a set are drawn from a larger population known as |
| A. | Data type |
| B. | Primitive type |
| C. | Compound type |
| D. | Base type |
| Answer» E. | |
| 272. |
Atomic Data is also called as _____________. |
| A. | Scalar Data |
| B. | Dynamic Data |
| C. | Textual Data |
| D. | None of these |
| Answer» B. Dynamic Data | |
| 273. |
Non Primitive data Structures are those which define set of _________. |
| A. | Static Elements |
| B. | Primitive Elements |
| C. | Derived Elements |
| D. | None of these |
| Answer» D. None of these | |
| 274. |
Number of steps composed by an algorithm should be |
| A. | 10 |
| B. | 20 |
| C. | Finite |
| D. | Infinite |
| Answer» D. Infinite | |
| 275. |
What is true about Interface in data structure? |
| A. | Each data structure has an interface. |
| B. | Interface represents the set of operations that a data structure supports. |
| C. | An interface only provides the list of supported operations, type of parameters they can accept and return type of these operations. |
| D. | All of the above |
| Answer» E. | |
| 276. |
Single and non-decomposable data is called ______________. |
| A. | Composite Data |
| B. | Textual Data |
| C. | Atomic Data |
| D. | Numeric Data |
| Answer» D. Numeric Data | |
| 277. |
What is the process of finding the location of a given data element in the data structure called? |
| A. | Deletion |
| B. | Insertion |
| C. | Traversing |
| D. | Searching |
| Answer» E. | |
| 278. |
A set cannot have |
| A. | Unique values |
| B. | Uniform values |
| C. | Duplicate values |
| D. | Sequenced values |
| Answer» D. Sequenced values | |
| 279. |
Set on which partial order is defined is called |
| A. | Poset |
| B. | Relation |
| C. | Sequence |
| D. | Coset |
| Answer» B. Relation | |
| 280. |
Interface of ADT can be defined in terms of |
| A. | Type |
| B. | Set of operations |
| C. | Set of assertions |
| D. | Both a and b |
| Answer» E. | |
| 281. |
Term that makes realization of a data type as a software component is called |
| A. | Actual data type |
| B. | Abstract data type |
| C. | Visual data type |
| D. | Component data type |
| Answer» C. Visual data type | |
| 282. |
A solution is assumed to be efficient if it is able to solve problem within required |
| A. | Constraints |
| B. | Processing |
| C. | Decision making |
| D. | Developers |
| Answer» B. Processing | |
| 283. |
An implementation for an ADT is called |
| A. | Data process |
| B. | Data movement |
| C. | Data structure |
| D. | Data member |
| Answer» D. Data member | |
| 284. |
A data item can be thought of a member of a |
| A. | Type |
| B. | Function |
| C. | Standard |
| D. | Structure |
| Answer» B. Function | |
| 285. |
Defining a data type in terms of an ADT is of form |
| A. | Logical |
| B. | Physical |
| C. | Composite |
| D. | Visual |
| Answer» B. Physical | |
| 286. |
An ADT doesn't specify implementation of |
| A. | Class |
| B. | Operations |
| C. | Datatype |
| D. | Interface |
| Answer» D. Interface | |
| 287. |
A simple type whose values contain no subparts, is called |
| A. | Integer type |
| B. | String type |
| C. | Boolean type |
| D. | Aggregate type |
| Answer» B. String type | |
| 288. |
Data types are of form |
| A. | Physical |
| B. | Logical |
| C. | Both a and b |
| D. | Composite |
| Answer» D. Composite | |
| 289. |
Data types formation can be of |
| A. | 2 types |
| B. | 3 types |
| C. | 4 types |
| D. | 5 types |
| Answer» B. 3 types | |
| 290. |
Critical resource for a program is most often its |
| A. | Running time |
| B. | Compile time |
| C. | Storage |
| D. | Testing time |
| Answer» B. Compile time | |
| 291. |
Algorithm that begins with First position in array and looks at each value in turn until it is found is known to be |
| A. | Linear seaching |
| B. | Binary searching |
| C. | Sequential searching |
| D. | Tree searching |
| Answer» D. Tree searching | |
| 292. |
Rate at which cost of algorithm grows as size of its input grows is called its |
| A. | Input growth |
| B. | Outcome growth |
| C. | Growth rate |
| D. | Processing rate |
| Answer» D. Processing rate | |
| 293. |
Efficiency of an algorithm is measured by |
| A. | Absolute analysis |
| B. | Cost analysis |
| C. | Relative analysis |
| D. | Asymptotic analysis |
| Answer» E. | |
| 294. |
A growth rate of n, is referred to as |
| A. | Absolute growth rate |
| B. | Linear growth rate |
| C. | Exponential growth rate |
| D. | Quadratic growth rate |
| Answer» C. Exponential growth rate | |
| 295. |
An analysis that estimates resource consumption of an algorithm is known to be |
| A. | Relative analysis |
| B. | Absolute analysis |
| C. | Asymptotic analysis |
| D. | Cost analysis |
| Answer» D. Cost analysis | |
| 296. |
Implementation of operations associated with an ADT is done by a |
| A. | Member function |
| B. | Member type |
| C. | Member object |
| D. | Member data-type |
| Answer» B. Member type | |
| 297. |
When data is input in numeric form, data type in program is classified as |
| A. | rational string |
| B. | string |
| C. | irrational string |
| D. | real integers |
| Answer» C. irrational string | |
| 298. |
When there are range of numbers involved in a program, it can be stored as |
| A. | real numbers |
| B. | original numbers |
| C. | rational numbers |
| D. | irrational numbers |
| Answer» B. original numbers | |
| 299. |
In line '200 IF NAME$="***" THEN Average= Total Mark/N' of BASIC program, NAME$ is classified as |
| A. | string variable |
| B. | string constant |
| C. | rational string |
| D. | irrational string |
| Answer» B. string constant | |
| 300. |
Data Structure in which one predecessor may have one or more successor , that data structure is called as __________. |
| A. | Non Linear Data Structure |
| B. | Linear Data Structure |
| C. | Primitive Data Structure |
| D. | Non Primitive Data Structure |
| Answer» B. Linear Data Structure | |