61. | Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes? |
Answer: (c).O(log n)
|
62. | Dividing a project into segments and smaller units in order to simplify analysis, design and programming efforts is called |
Answer: (b).Modular approach
|
63. | In what module multiple instances of execution will yield the same result even if one instance has not terminated before the next one has begun ? |
Answer: (b).Re-entrable module
|
64. | The segment base is specified using the register named is |
Answer: (a).ORG instructions
|
65. | If special forms are needed for printing the output, the programmer specifies these forms through |
Answer: (b).JCL
|
66. | The function(s) of the Storage Assignment is/are: |
Answer: (d).All of the above
|
67. | Instruction steps which can be written within the diamond-shaped box, of a flowchart is |
Answer: (b).IS A < 10
|
68. | Language processor includes |
Answer: (d).all of these
|
69. | Register or main memory location which contains the effective address of the operand is known as |
Answer: (a).pointer
|
70. | Name given to the organized collection of software that controls the overall operation of a computer is |
Answer: (c).operating system
|