Which of the follow mg algorithms is not a broadcast routing algorithm?
| A. | Flooding |
| B. | Multidestination routing |
| C. | Reverse path forwarding |
| D. | All of the above |
|
Option: C Explanation : Click on Discuss to view users comments. |
Which of the following differentiates between overloaded functions and overridden functions?
| A. | Overloading is a dynamic or runtime binding and overridden is a static or compile time binding. |
| B. | Overloading is a static or compile time binding and overriding is dynamic or runtime binding. |
| C. | Redefining a function in a friend class is called overloading, while redefining a function in a derived class is called as overridden function. |
| D. | Redefining a function in a derived class is called function overloading, while redefining a function in a friend class is called function overriding. |
|
Option: B Explanation : Click on Discuss to view users comments. |
Consider an array A[20. 10], assume 4 words per memory cell and the base address of array A is 100. What is the address of A[11,5]? Assume row major storage.
| A. | 560 |
| B. | 565 |
| C. | 570 |
| D. | 575 |
|
Option: A Explanation :
Answer is A
A[20, 10]
W = 4 words
Base (A) =100
A [11, 5] in row major m x n
loc [ a [i] [j] = base (a) + w [n (Row location of item)] + column location of item]
= 100 + 4 [10 (11) + 5]
= 100 + 4[110+5]
=100 + 115 *4
= 560
Click on Discuss to view users comments. |
Consider the following justifications for commonly using the two-level CPU scheduling :
I. It is used when memory is too small to hold all the ready processes.
II. Because its performance is same as that of the FIFO.
III. Because it facilitates putting some set of processes into memory and a choice is made from that.
IV. Because it does not allow to adjust the set of in-core processes.
Which of the following is true?
| A. | I, III and IV |
| B. | I and II |
| C. | III and IV |
| D. | I and III |
|
Option: D Explanation : Click on Discuss to view users comments. |
