Question 31 : A page that is not going to be used for the next 7 seconds will be swapped out over a page that is going to be used within the next 0.7 seconds.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 32 : As the number of frames available increases, the number of page faults decreases.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 33 : Under which of the following scenarios is page replacement algorithm required?
1. When total memory exceeds physical memory
2. To determine the number of frames for each process
3. When paging and segmentation are to be used
4. Execution of a process, not in memory
View Answer   Discuss with Members

Question 34 : Optimal page replacement algorithm is said to satisfy __________
1. Online algorithm
2. Stack algorithm
3. Queue algorithm
4. Array algorithm
View Answer   Discuss with Members

Question 35 : Time complexity of fractional knapsack problem is ____________
1. O(n log n)
2. O(n)
3. O(n²)
4. O(nW)
View Answer   Discuss with Members

Question 36 : Fractional knapsack problem is also known as __________
1. 0/1 knapsack problem
2. Continuous knapsack problem
3. Divisible knapsack problem
4. Non continuous knapsack problem
View Answer   Discuss with Members

Question 37 : In Huffman coding, data in a tree always occur?
1. roots
2. leaves
3. left sub trees
4. right sub trees
View Answer   Discuss with Members

Question 38 : How many printable characters does the ASCII character set consists of?
1. 120
2. 128
3. 100
4. 98
View Answer   Discuss with Members

Question 39 : The code length does not depend on the frequency of occurrence of characters.
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 40 : Fractional knapsack problem is solved most efficiently by which of the following algorithm?
1. Divide and conquer
2. Dynamic programming
3. Greedy algorithm
4. Backtracking
View Answer   Discuss with Members