Home / CSE / Operating System Concepts :: Section 3

CSE :: Operating System Concepts

  1. In memory systems, boundary registers

  2. A.
    are used for temporary program variable storage
    B.
    are only necessary with fixed partitions
    C.
    track page boundaries
    D.
    track the beginning and ending of programs
    E.
    None of the above

  3. Which of the following is true for machine language.

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

  5. Which of the following is not applications software?

  6. A.
    Word processing
    B.
    Spreadsheet
    C.
    UNIX
    D.
    Desktop publishing
    E.
    None of the above

  7. Scissoring enables

  8. A.
    a part of data to be displayed
    B.
    entire data to be displayed
    C.
    full data display on full area of screen
    D.
    no data to be displayed
    E.
    None of the above

  9. A relocate program form is one which

  10. A.
    cannot be made to execute in any area of storage other than the one designated for it at the time of its coding or translation.
    B.
    consists of a program and relevant information for its relocation.
    C.
    can itself performs the relocation of its address-sensitive portions.
    D.
    all of the above
    E.
    None of the above

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

  12. A.
    word processing
    B.
    virtual memory
    C.
    compiling
    D.
    multitasking
    E.
    None of the above

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

  14. A.
    Assembly and output
    B.
    Code generation
    C.
    Storage assignment
    D.
    Syntax analysis
    E.
    None of the above

  15. Round-robin scheduling

  16. A.
    allows interactive tasks quicker access to the processor
    B.
    is quite complex to implement
    C.
    gives each task the same chance at the processor
    D.
    allows processor-bound tasks more time in the processor
    E.
    None of the above

  17. What is the name of the system which deals with the running of the actual computer and not with the programming problems?

  18. A.
    Operating system
    B.
    Systems program
    C.
    Object program
    D.
    Source program
    E.
    None of the above

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

  20. A.
    hold and wait
    B.
    deadlock avoidance
    C.
    race around condition
    D.
    buffer overflow
    E.
    None of the above