logo

CuriousTab

CuriousTab

Discussion


Home Computer Science Operating Systems Concepts Comments

  • Question
  • For how many processes which are sharing common data, the Dekker's algorithm implements mutual exclusion?


  • Options
  • A. 1
  • B. 2
  • C. 3
  • D. 4
  • E. None of the above

  • Correct Answer


  • Explanation
    Dekker's algorithm is the first known correct solution to the mutual exclusion problem in concurrent programming. The solution is attributed to Dutch mathematician Th. J. Dekker by Edsger W. Dijkstra in his manuscript on cooperating sequential processes. It allows two threads to share a single-use resource without conflict, using only shared memory for communication.

    It avoids the strict alternation of a naive turn-taking algorithm, and was one of the first mutual exclusion algorithms to be invented.

    Source: http://en.wikipedia.org/wiki/Dekker's_algorithm


    Operating Systems Concepts problems


    Search Results


    • 1. Which of the following is not applications software?

    • Options
    • A. Word processing
    • B. Spreadsheet
    • C. UNIX
    • D. Desktop publishing
    • E. None of the above
    • Discuss
    • 2. 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?

    • Options
    • A. FORMAT command
    • B. DIR command
    • C. VER command
    • D. DISK command
    • E. None of the above
    • Discuss
    • 3. Job Control Language (JCL) statements are used to

    • Options
    • A. Read the input from the slow-speed card reader to the high-speed magnetic disk
    • B. Specify, to the operating system, the beginning and end of a job in a batch
    • C. Allocate the CPU to a job
    • D. All of the above
    • E. None of the above
    • Discuss
    • 4. In analyzing the compilation of PL/I program, the description "creation of more optimal matrix" is associated with

    • Options
    • A. Assembly and output
    • B. Code generation
    • C. Syntax analysis
    • D. Machine independent optimization
    • E. None of the above
    • Discuss
    • 5. The computational technique used to compute the disk storage address of individual records is called:

    • Options
    • A. bubble memory
    • B. key fielding
    • C. dynamic reallocation
    • D. hashing
    • E. None of the above
    • Discuss
    • 6. The system/370 assembler language

    • Options
    • A. allows the programmer to write base registers and displacements explicitly in the source program.
    • B. is used to remember which of the general-purpose registers are currently available as base registers, and what base addresses they contain.
    • C. allows multiple programs to reside in separate areas of core at the same time.
    • D. is a term that refers to the control programs of an operating system.
    • E. None of the above
    • Discuss
    • 7. A program that converts a high-level language program to a set of instructions that can run on a computer is called a

    • Options
    • A. Compiler
    • B. Debugger
    • C. Editor
    • D. All of the above
    • E. None of the above
    • Discuss
    • 8. In analyzing the compilation of PL/I program, the description "resolving symbolic address (labels) and generating machine language" is associated with

    • Options
    • A. Assembly and output
    • B. Code generation
    • C. Storage assignment
    • D. Syntax analysis
    • E. None of the above
    • Discuss
    • 9. If you want to execute more than one program at a time, the systems software you are using must be capable of:

    • Options
    • A. word processing
    • B. virtual memory
    • C. compiling
    • D. multitasking
    • E. None of the above
    • Discuss
    • 10. Which of the following is not true about the memory management?

    • Options
    • A. virtual memory is used only in multi-user systems
    • B. segmentation suffers from external fragmentation
    • C. paging suffers from internal fragmentation
    • D. segmented memory can be paged
    • E. None of the above
    • Discuss


    Comments

    There are no comments.

Enter a new Comment