Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 123 views

    MCQ 4 & 5

    Uploaded by

    nithyasavi
    The document contains 25 multiple choice questions about operating system concepts like scheduling, context switching, synchronization, and real-time operating systems. Specifically: - Round robin scheduling can result in more context switches if the time quantum is too large. - A counter can be used to distribute the time slice across all tasks in a round-robin fashion. - For the critical section problem, any solution must satisfy the properties of mutual exclusion, progress, and bounded waiting. - Dispatch latency refers to the time taken to stop one process and start another running on the CPU.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd

    MCQ 4 & 5

    Uploaded by

    nithyasavi
    123 views4 pages
    The document contains 25 multiple choice questions about operating system concepts like scheduling, context switching, synchronization, and real-time operating systems. Specifically: - Round robin scheduling can result in more context switches if the time quantum is too large. - A counter can be used to distribute the time slice across all tasks in a round-robin fashion. - For the critical section problem, any solution must satisfy the properties of mutual exclusion, progress, and bounded waiting. - Dispatch latency refers to the time taken to stop one process and start another running on the CPU.

    Original Description:

    embedded system

    Original Title

    mcq 4 & 5

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains 25 multiple choice questions about operating system concepts like scheduling, context switching, synchronization, and real-time operating systems. Specifically: - Round robin scheduling can result in more context switches if the time quantum is too large. - A counter can be used to distribute the time slice across all tasks in a round-robin fashion. - For the critical section problem, any solution must satisfy the properties of mutual exclusion, progress, and bounded waiting. - Dispatch latency refers to the time taken to stop one process and start another running on the CPU.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    123 views4 pages

    MCQ 4 & 5

    Uploaded by

    nithyasavi
    The document contains 25 multiple choice questions about operating system concepts like scheduling, context switching, synchronization, and real-time operating systems. Specifically: - Round robin scheduling can result in more context switches if the time quantum is too large. - A counter can be used to distribute the time slice across all tasks in a round-robin fashion. - For the critical section problem, any solution must satisfy the properties of mutual exclusion, progress, and bounded waiting. - Dispatch latency refers to the time taken to stop one process and start another running on the CPU.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    of 4

    Unit Iv & V mcq

    1. In the Round Robin (RR) scheduling; if the time quantum (q) is too large, then:

    a) Scheduling is same as First Come First Served (FCFS).


    b) more context switches will occur.
    c) the average turnaround time decreases.
    d) no effect.

    2.Which of the following can be used to distribute the time slice across all the task?
    a) timer b) counter c) round-robin d) task slicing

    3. Any solution to the critical section problem must satisfy the following three criteria:

    a) disabling interrupts, testandset instruction, and semaphores.


    b) request, use and release
    c) mutual exclusion, no preemption, and circular-wait.
    d) mutual exclusion, progress, and bounded waiting

    4. What does TCR stand for?


    a) temperature-compensated refresh
    b) temperature-compensated recovery
    c) texas CAS-RAS
    d) temperature CAS-RAS

    5. Dispatch latency is :
    a) the speed of dispatching a process from running to the ready state
    b) the time of dispatching a process from running to ready state and keeping the CPU idle
    c) the time to stop one process and start running another one
    d) none of the mentioned
    6. Which activity is concerned with identifying the task at the final embedded systems?
    a) high-level transformation
    b) compilation
    c) scheduling
    d) task-level concurrency management
    7. Scheduling is done so as to :
    a) increase CPU utilization
    b) decrease CPU utilization
    c) keep the CPU more idle
    d) None of the mentioned
    8. Which part of the COOL input comprises information about the available hardware
    platform components?
    a) target technology
    b) design constraints
    c) both behaviour and design constraints
    d) behaviour
    9. Which of the following are header files?
    a) #include
    b) file
    c) struct()
    d) proc()
    10. In indirect communication between processes P and Q :
    a) there is another process R to handle and pass on the messages between P and Q
    b) there is another machine between the two processes to help communication
    c) there is a mailbox to help communication between P and Q
    d) none of the mentioned
    11. Which of the following is also known as loader?
    a) locater
    b) linker
    c) assembler
    d) compiler
    12. Which code is written as part of the ISR?
    a) data receive code
    b) sequential code
    c) data transfer code
    d) concurrent code
    13. For real time operating systems, interrupt latency should be
    a) minimal
    b) maximum
    c) zero
    d) dependent on the scheduling
    14. Which allows the parallel development of the hardware and software in the simulation?
    a) high-level language simulation
    b) low-level language simulation
    c) cpu simulator
    d) onboard simulator
    15. A semaphore is a shared integer variable
    a) that can not drop below zero
    b) that can not be more than zero
    c) that can not drop below one
    d) that can not be more than one
    16. Which of the following do not belong to queues for processes ?
    a) Job Queue
    b) PCB queue
    c) Device Queue
    d) Ready Queue
    17. Which of the following allows a lower priority task to run despite the higher priority task is
    active and waiting to preempt?
    a) message queue
    b) message passing
    c) semaphore
    d) priority inversion
    18. Which of the following are used to test the software?
    a) data entity
    b) data entry
    c) data table
    d) data book
    19. Process synchronization can be done on
    a) hardware level b) software level
    c) both hardware and software level d) none of the mentioned
    20. Which of the following can simulate the processor, memory, and peripherals?
    a) input simulator
    b) peripheral simulator
    c) memory simulator
    d) cpu simulator
    21. Which allows the UNIX software to be ported using a simple recompilation?
    a) pSOS+
    b) UNIX compatible library
    c) pSOS+m
    d) pOS+kernel
    22. Which of the following can simulate the LCD controllers and parallel ports?
    a) memory simulator
    b) sds
    c) input simulator
    d) output tools
    23. Which of the following provides a low-level method of debugging software?
    a) high-level simulator
    b) low-level simulator
    c) onboard debugger
    d) cpu simulator
    24.Which of the following does not interrupt a running process ?
    a) A device b) Timer c) Scheduler process d) Power failure
    25. Which of the following works by dividing the processor’s time?
    a) single task operating system
    b) multitask operating system
    c) kernel
    d) applications

    You might also like