Algorithms on Data Structure and Algorithms related Questions and Answers - Page 2

Question 11 : In a stack algorithm, the set of pages in a k-frame memory is always a subset of pages in a __________ frame memory.
1. k-1
2. k
3. k+1
4. k(k+1)
View Answer   Discuss with Members

Question 12 : In a stack algorithm, the set of pages in a k-frame memory is always a subset of pages in a __________ frame memory.
1. k-1
2. k
3. k+1
4. k(k+1)
View Answer   Discuss with Members

Question 13 : Optimal page replacement algorithm is also called as __________
1. LIFO
2. NRU
3. Clairvoyant replacement algorithm
4. Page buffering
View Answer   Discuss with Members

Question 14 : __________ algorithm associates with each page the time when the page was brought into memory.
1. Optimal page replacement
2. FIFO
3. LRU replacement algorithm
4. Counting based replacement
View Answer   Discuss with Members

Question 15 : Which of the following page replacement algorithms return the minimum number of page faults?
1. LRU replacement algorithm
2. Optimal page replacement algorithm
3. FIFO
4. Counting based replacement
View Answer   Discuss with Members

Question 16 : Which of the following is the main drawback of FIFO page replacement algorithm?
1. Requirement of large memory
2. Frame allocation
3. Reduction in multiprogramming
4. Reduced optimality
View Answer   Discuss with Members

Question 17 : In a FIFO algorithm, when a page is to be replaced, which of the following page is chosen?
1. Oldest page
2. Newest page
3. Frequently occurred page in past
4. Frequently occurred page in future
View Answer   Discuss with Members

Question 18 : FIFO algorithm is used by __________ operating system.
1. Linux
2. Mac
3. Windows
4. VAX/VMS
View Answer   Discuss with Members

Question 19 : In a optimal page replacement algorithm, when a page is to be replaced, which of the following pages is chosen?
1. Oldest page
2. Newest page
3. Frequently occurred page in the future
4. Not frequently occurred page in the future
View Answer   Discuss with Members

Question 20 : What is the competitive analysis of the FIFO algorithm?
1. k/k+1
2. k+1
3. k(k+1)
4. k/(k-h+1)
View Answer   Discuss with Members


View 11 - 20 of 55 Questions

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter