Q. 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?

View solution

Q. Dividing a project into segments and smaller units in order to simplify analysis, design and programming efforts is called

View solution

Q. 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 ?

View solution

Q. The segment base is specified using the register named is

View solution

Q. If special forms are needed for printing the output, the programmer specifies these forms through

View solution

Q. The function(s) of the Storage Assignment is/are:

View solution

Q. Instruction steps which can be written within the diamond-shaped box, of a flowchart is

View solution

Q. Language processor includes

View solution

Q. Register or main memory location which contains the effective address of the operand is known as

View solution

Q. Name given to the organized collection of software that controls the overall operation of a computer is

View solution

Q. System generation

View solution

Q. While running DOS on a PC, command which can be used to duplicate the entire diskette is

View solution

Q. A system program which sets up an executable program in main memory ready for execution, is

View solution

Q. Operating system for the laptop computer called MacLite is

View solution

Q. Computer general-purpose software is basically a

View solution

Q. Special purpose software are

View solution

Q. In computers, operating system and utility programs are examples of

View solution

Q. Control, usage and allocation of different hardware components of computer is done by

View solution

Q. Computer software which is designed only for the use of particular customer or organization is called

View solution

Q. Computer software designed for the use of sale to general public is called

View solution