Recents in Beach

Operating System MCQ For WBJECA ( SET - 4) - VVI

WBJECA MCQ FOR NEW SYLLABUS

Operating System MCQ ( SET - 4)

O.S MCQ

  1. Which of the following is a service not supported by hte operating system ?

    1. I/O operation
    2. Protection
    3. Accounting
    4. Compilation
    Answer: D
    Explantion: None

  2. In partitioned memory allocation scheme, the _______________

    1. superiority of the first fit and besti-fit algorithms depend on the sequence of memory requests.
    2. best fit algorithm is always better than the first fit algorithm
    3. first fit algorithm is always better than the best fit algorithm
    4. none of the above
    Answer: A
    Explantion: None

  3. Suppose that a process is in " BLOCKED " state waiting for some I/O service. When the service is completed, it goes to the ?

    1. TERMINATED state
    2. SUSPENDED state
    3. BLOCKED state
    4. READY state
    Answer: D
    Explantion: None.

  4. Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock ?

    I. Time-stamp ordering
    II. 2-Phase locking

    1. II only
    2. I only
    3. both I and II
    4. neither I nor II
    Answer: B
    Explantion: None

  5. The first-fit, best-fit and the worst-fit algorithms can be used for ?

    1. linked allocation of memory
    2. contiguous allocation of memory
    3. indexed allocation of memory
    4. None of above
    Answer: B
    Explantion: None

  6. In a paged segmented scheme of memory management, the segment table itself must have a page table because ?

    1. the processor's description base register points to a page table
    2. the segment table is often too large to fit in one page
    3. each segment is spread over a number of pages
    4. segment tables point to page tables base register points to a page table
    Answer: C
    Explantion: None

  7. Which of the following statements are true ?

    1. Round robin is better than FCFS in terms of response time
    2. Shortest remaining time first scheduling may cause starvation
    3. Preemptive scheduling may cause starvation
    1. I only
    2. I and II
    3. I and III
    4. I,II and III
    Answer: D
    Explantion: None

  8. In which one of the following page replacement policies, Belady's anomaly may occur ?

    1. LRU
    2. MRU
    3. FIFO
    4. Optimal
    Answer: C
    Explantion: None

  9. Tn Round CPU scheduling, as the time quantum is increased, the average trun around time ?

    1. varies irregularly
    2. remains constant
    3. increases
    4. decreases
    Answer: A
    Explantion: None

  10. 10

    Which of the following scheduling algorithms gives minimum average waiting time ?

    1. SJF
    2. Priority
    3. FCFS
    4. Round-robin
    Answer: A
    Explantion: None

Tags:

Post a Comment

0 Comments