Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

In a stadium there are four stands Rajiv Gandhi stand, Sunil Gavaskar stand, Venkatesh Prasad stand and Pt. Din Dayal stand in which seats are alloted to commuters. The number of vacant  seats in Rajiv Gandhi stand, Sunil Gavaskar stand, Venkatesh Prasad stand and Pt. Din Dayal stand are 11, 8, 13 and 7 respectively. Anil is buying a ticket find the probability that he get a seat in Venkatesh Prasad stand.
What will be the output of the following PHP code?
How many persons are standing there in a straight line, all of them facing the north? I. Only one person stands to the left of Z. Only three person stand between Z and A. The person who is immediate right of A stand at the extreme right end of the line. II. Only two persons stand to the left of Z. Only two person stand between Z and H. H stand to the immediate right of A. A stands exactly in the middle of the line.
Suppose, you begin reading a book on page h and end on page k. If you read each page completely and the pages are numbered and read consecutively, then how many page shave you read?
Determine the number of page faults when references to pages occur in the following order : 1, 2, 4, 5, 2, 1, 2, 4. Assume that the main memory can accommodate 3 pages and the main memory already has the pages 1 and 2, with page one having brought earlier than page 2. (LRU page replacement algorithm is used) 
Recall that Belady’s anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements: S1: Random page replacement algorithm (where a page chosen at random is replaced) Suffers from Belady’s anomaly S2: LRU page replacement algorithm suffers from Belady’s anomaly Which of the following is CORRECT?
How many page faults occur in a system with LRU page replacement policy having 3 (initially empty) page frames for the following string of page reference - 5, 1, 2, 3, 4, 3, 2, 3, 1, 2, 4, 3?
Consider a main memory with 3 page frames in the following sequence of page reference 3, 4, 2, 3, 9, 1, 6, 3, 4, 9. What is the number of page fault using FIFO page replacement algorithm?
Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 Let a computer system has main memory size of 3 page frames which are initially empty and it is running on demand paged virtual memory system. The number of page faults under LRU and FIFO page replacement policy are respectively:
Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 on a demand paged virtual memory system running on a computer system that has main memory size of 3 page frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of page faults under the corresponding page replacement policy. Then