Q.1

The Memory Buffer Register (MBR)

  • is a hardware memory device which denotes the location of the current instruction being executed.
  • is a group of electrical circuits (hardware), that performs the intent of instructions fetched from memory.
  • contains the address of the memory location that is to be read from or stored into.
  • contains a copy of the designated memory location specified by the MAR after a "read" or the new contents of the memory prior to a "write".
  • None of the above
Q.2

An algorithm is best described as

  • A computer language
  • A step by step procedure for solving a problem
  • A branch of mathematics
  • All of the above
  • None of the above
Q.3

Scheduling is

  • allowing jobs to use the processor
  • unrelated to performance consideration
  • not required in uniprocessor systems
  • the same regard-less of the purpose of the system
  • None of the above
Q.4

Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait and

  • hold and wait
  • deadlock avoidance
  • race around condition
  • buffer overflow
  • None of the above
Q.5

The file structure that redefines its first record at a base of zero uses the term:

  • relative organization
  • key fielding
  • dynamic reallocation
  • hashing
  • None of the above
Q.6

In MS-DOS, relocatable object files and load modules have extensions

  • .OBJ and .COM or .EXE, respectively
  • .COM and .OBJ, respectively
  • .EXE and .OBJ, respectively
  • .DAS and .EXE, respectively
  • None of the above
Q.7

If you want to execute more than one program at a time, the systems software you are using must be capable of:

  • word processing
  • virtual memory
  • compiling
  • multitasking
  • None of the above
Q.8

In memory systems, boundary registers

  • are used for temporary program variable storage
  • are only necessary with fixed partitions
  • track page boundaries
  • track the beginning and ending of programs
  • None of the above
Q.9

Which of the following is not true about the memory management?

  • virtual memory is used only in multi-user systems
  • segmentation suffers from external fragmentation
  • paging suffers from internal fragmentation
  • segmented memory can be paged
  • None of the above
Q.10

The errors that can be pointed out by the compiler are

  • Syntax errors
  • Semantic errors
  • Logical errors
  • Internal errors
  • None of the above
Q.11

What scheduling algorithm allows processes that are logical runnable to be temporarily suspended?

  • preemptive scheduling
  • non-preemptive scheduling
  • FIFO
  • FCFS
  • None of the above
Q.12

If you do not know which version of MS-DOS you are working with, which command will you use after having booted your operating system?

  • FORMAT command
  • DIR command
  • VER command
  • DISK command
  • None of the above
Q.13

What is the name given to all the programs inside the computer with makes it usable?

  • Application software
  • System software
  • Firm ware
  • Shareware
  • None of the above
Q.14

The state transition initiated by the user process itself in an operating system is

  • block
  • dispatch
  • wake up
  • timer run out
  • None of the above
Q.15

The practice of "bundling" refers to

  • selling computers alone
  • selling peripheral devices with computer
  • selling software to run on computers
  • giving away software with a computer purchase
  • None of the above
Q.16

Access time is the highest in the case of

  • floppy disk
  • cache
  • swapping devices
  • magnetic disk
  • None of the above
Q.17

What is the name of the operating system that reads and reacts in terms of actual time.

  • Batch system
  • Quick response system
  • Real time system
  • Time sharing system
  • None of the above
Q.18

In analyzing the compilation of PL/I program, the description "resolving symbolic address (labels) and generating machine language" is associated with

  • Assembly and output
  • Code generation
  • Storage assignment
  • Syntax analysis
  • None of the above
Q.19

Which of the following is true for machine language.

  • Repeated execution of program segments
  • Depicting flow of data in a system
  • A sequence of instructions which, when followed properly, solves a problem
  • the language which communicates with the computer using only the binary digits 1 and 0.
  • None of the above
Q.20

Job Control Language (JCL) statements are used to

  • Read the input from the slow-speed card reader to the high-speed magnetic disk
  • Specify, to the operating system, the beginning and end of a job in a batch
  • Allocate the CPU to a job
  • All of the above
  • None of the above
Q.21

When a computer is first turned on or restarted, a special type of absolute loader is executed, called a

  • "Compile and Go" loader
  • Boot loader
  • Bootstrap loader
  • Relating loader
  • None of the above
Q.22

In an absolute loading scheme, which loader function is accomplished by loader

  • Reallocation
  • Allocation
  • Linking
  • Loading
  • None of the above
Q.23

A partitioned data set is most used for

  • a program or source library
  • storing program data
  • storing backup information
  • storing ISAM files
  • None of the above
Q.24

Page-map table is

  • A data file
  • A directory
  • Used for address translation
  • All of the above
  • None of the above
Q.25

Semaphores

  • synchronize critical resources to prevent deadlock
  • synchronize critical resources to prevent contention
  • are used to do I/O
  • are used for memory management
  • None of the above
Q.26

Which of the following program is not a utility?

  • Debugger
  • Editor
  • Spooler
  • All of the above
  • None of the above
Q.27

Special software to create a job queue is called a

  • Drive
  • Spooler
  • Interpreter
  • Linkage editor
  • None of the above
Q.28

Which of the following is not a characteristic of a daisy chaining priority control scheme?

  • priority is programmable
  • it is relatively easy to add more devices to the chain
  • the failure of one device may affect other devices on the chain
  • the number of control lines is independent of the number of devices on the chain
  • None of the above
Q.29

An incremental backup

  • should be done each month
  • uses more tapes
  • saves all files
  • saves only files that have recently changed
  • None of the above
Q.30

Round-robin scheduling

  • allows interactive tasks quicker access to the processor
  • is quite complex to implement
  • gives each task the same chance at the processor
  • allows processor-bound tasks more time in the processor
  • None of the above
0 h : 0 m : 1 s