adplus-dvertising
frame-decoration

Question

In computers, application software executes

a.

all the time

b.

when required

c.

any time

d.

for few hours

Posted under Systems Programming

Answer: (b).when required

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. In computers, application software executes

Similar Questions

Discover Related MCQs

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

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

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

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

Q. Special purpose software are

Q. Computer general-purpose software is basically a

Q. Operating system for the laptop computer called MacLite is

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

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

Q. System generation

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

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

Q. Language processor includes

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

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

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

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

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 ?

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

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?