Related Questions

Which of the following assertions are CORRECT? P: Adding 7 to each entry in a list adds 7 to the mean of the list Q: Adding 7 to each entry in a list adds 7 to the standard deviation of the list R: Doubling each entry in a list doubles the mean of the list S: Doubling each entry in a list leaves the standard deviation of the list unchanged
Which List and Entry of Seventh Schedule of Indian Constitution are related to the election of the legislature of the State? 1. List - I, Entry 72  2. List - II, Entry 27 3. List - II, Entry 37 4. List - III, Entry 32 Select the correct answer using the codes given below.
When they had a meeting seven company executives __ T, U, V, W, X, Y and Z ___ sit at a rectangular table .Three executives sit along one side of the table , and three sit along the other side, each directly opposite one of the other three. The seventh sits at the head of the table . There is no seat at the foot of the table . Ualways sits in one of te two seats farthest from the head of the table. Y and V always sit next to each other .V never sits next to Z . If Z does not sit at the head of the table, W sits there. If W sits directly opposite T, X must sit next to which of the following excutives?
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?
Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Note that ‘_’ denotes an empty location in the table.
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: