Operating system

21. The higher versions of the operating systems are so written that programs designed for earlier versions can still be run. What is it called? A. Upgradability B. Upward mobility C. Universality D. Upward compatibility E. None of the above

Upgradability
Upward mobility
Universality
Upward compatibility E. None of the above

Detailed SolutionThe higher versions of the operating systems are so written that programs designed for earlier versions can still be run. What is it called? A. Upgradability B. Upward mobility C. Universality D. Upward compatibility E. None of the above

22. In which of the storage placement strategies a program is placed in the smallest available hole in the main memory? A. best fit B. first fit C. worst fit D. buddy E. None of the above

best fit
first fit
worst fit
buddy E. None of the above

Detailed SolutionIn which of the storage placement strategies a program is placed in the smallest available hole in the main memory? A. best fit B. first fit C. worst fit D. buddy E. None of the above

23. In which addressing mode, the effective address of the operand is generated by adding a constant value to the contents of register? A. absolute mode B. indirect mode C. immediate mode D. index mode E. None of the above

absolute mode
indirect mode
immediate mode
index mode E. None of the above

Detailed SolutionIn which addressing mode, the effective address of the operand is generated by adding a constant value to the contents of register? A. absolute mode B. indirect mode C. immediate mode D. index mode E. None of the above

24. Uniform Symbols Table A. contains all constants in the program B. a permanent table of decision rules in the form of patterns for matching with the uniform symbol table to discover syntactic structure C. consists of a full or partial list of the token’s as they appear in the program. Created by Lexical analysis and used for syntax analysis and interpretation D. a permanent table which lists all key words and special symbols of the language in symbolic form E. None of the above

contains all constants in the program
a permanent table of decision rules in the form of patterns for matching with the uniform symbol table to discover syntactic structure
consists of a full or partial list of the token's as they appear in the program. Created by Lexical analysis and used for syntax analysis and interpretation
a permanent table which lists all key words and special symbols of the language in symbolic form E. None of the above

Detailed SolutionUniform Symbols Table A. contains all constants in the program B. a permanent table of decision rules in the form of patterns for matching with the uniform symbol table to discover syntactic structure C. consists of a full or partial list of the token’s as they appear in the program. Created by Lexical analysis and used for syntax analysis and interpretation D. a permanent table which lists all key words and special symbols of the language in symbolic form E. None of the above

25. A linker A. creates a load module B. is not necessary with variable partitions C. must be run after the loader D. is not needed with a good compiler E. None of the above

creates a load module
is not necessary with variable partitions
must be run after the loader
is not needed with a good compiler E. None of the above

Detailed SolutionA linker A. creates a load module B. is not necessary with variable partitions C. must be run after the loader D. is not needed with a good compiler E. None of the above

26. Which of the following statements is not true about the FORTRAN language? A. FORTRAN is a high level language B. A FORTRAN program, written for the IBM-PC, is totally different from a FORTRAN program written for execution on the SUN machine C. FORTRAN is extensively used to write programs for performing scientific computations D. All of the above E. None of the above

FORTRAN is a high level language
A FORTRAN program, written for the IBM-PC, is totally different from a FORTRAN program written for execution on the SUN machine
FORTRAN is extensively used to write programs for performing scientific computations
All of the above E. None of the above

Detailed SolutionWhich of the following statements is not true about the FORTRAN language? A. FORTRAN is a high level language B. A FORTRAN program, written for the IBM-PC, is totally different from a FORTRAN program written for execution on the SUN machine C. FORTRAN is extensively used to write programs for performing scientific computations D. All of the above E. None of the above

27. System maintenance: A. is usually not necessary B. is necessary on all systems, regardless of how good C. is not required if the system is well written D. always requires several programs E. None of the above

is usually not necessary
is necessary on all systems, regardless of how good
is not required if the system is well written
always requires several programs E. None of the above

Detailed SolutionSystem maintenance: A. is usually not necessary B. is necessary on all systems, regardless of how good C. is not required if the system is well written D. always requires several programs E. None of the above

28. The command interpreter A. is usually the primary user interface B. requires fixed format commands C. is menu drive D. is quite different from the SCL interpreter E. None of the above

is usually the primary user interface
requires fixed format commands
is menu drive
is quite different from the SCL interpreter E. None of the above

Detailed SolutionThe command interpreter A. is usually the primary user interface B. requires fixed format commands C. is menu drive D. is quite different from the SCL interpreter E. None of the above

29. A task in a blocked state A. is executable B. is running C. must still be placed in the run queues D. is waiting for same temporarily unavailable resources E. None of the above

is executable
is running
must still be placed in the run queues
is waiting for same temporarily unavailable resources E. None of the above

Detailed SolutionA task in a blocked state A. is executable B. is running C. must still be placed in the run queues D. is waiting for same temporarily unavailable resources E. None of the above

Page 1Page 2Page 3Page 4Page 5
Test 1Test 2Test 3Test 4Test 5Test 6Test 7Test 8Test 9Test 10
Exit mobile version