Option A. Most Boot Report Option B. Master Byte Record Option C. Master Boot Record Option D. Most Burn Record True Answer C
Option A. lndo-Aryan Option B. Dravidian Option C. Austro-Asiatic Option D. Sino-Tibetan True Answer A
Option A. SMTP Option B. POP3 Option C. IMAP Option D. All of the above True Answer D
What will be the output of the following Python code?
string = "my name is x" for i in string: print (i, end=", ")
Option A. m, y, , n, a, m, e, , i, s, , x, Option B. m, y, , n, a, m, e, , i, s, , x Option C. my, name, is, x, Option D. error True Answer A
Option A. Hub Option B. Host Option C. Gateway Option D. Repeater True Answer B
Option A. Mathematical communication Option B. Capacity to memorize without understanding Option C. Capacity to listen to teacher Option D. Attitude of not asking questions even if the concept is not understood True Answer A
Function f is known at the following points The value computed using the trapezoidal rule is
Option A. 8.983 Option B. 9.003 Option C. 9.017 Option D. 9.045 True Answer D
Option A. Beyond Option B. And Option C. Yet Option D. Now True Answer A
Option A. start() Option B. printf() Option C. main() Option D. getch() True Answer C
Option A. 200.200.1.1 Option B. 10.10.1.1 Option C. 224.1.1.1 Option D. 127.0.0.1 True Answer D
Option A. Blank Presentation Option B. From Existing Presentation Option C. From Design Template Option D. All of above True Answer D
Option A. TRUE Option B. FALSE Option C. Option D. True Answer B
Option A. Photo Option B. Video Option C. Both Option D. None True Answer C
Option A. volatile Option B. true Option C. friend Option D. export True Answer A
Option A. TRUE Option B. FALSE Option C. Option D. True Answer A
Option A. Least-recently-used Option B. First-in-first-out Option C. Last-in-first-out Option D. Most-recently-used True Answer D
Page reference string for the program will be:- 1, 2, 3, 4, ------------100, 1, 2, 3, 4, ------------100, 1, 2, 3, 4, ------------100, The current status of 20 frames shows page numbers from 101 to 120. Implementation of optimal page replacement policy for above given page reference string would be as follows: So there would be 300 page faults in total (each access 100 page faults). Also it is visible that every time a replacement is done for the page which is most recently referred as it will be least recently referred in future. So for the given page reference string optimal page replacement policy is working same as most recently used policy and thus number of page faults will be same in both of them.
Option A. Audio aid Option B. Visual aid Option C. Audio-visual aid Option D. None of these True Answer B