A job has four pages A, B, C, D and the main memory has two page frames only. The job needs to process its pages in following order: ABACABDBACD Assuming that a page interrupt occurs when a new page is brought in the main memory, irrespective of whether the page is swapped out or not. The number of page interrupts in FIFO and LRU page replacement algorithms are (A) 9 and 7 (B) 7 and 6 (C) 9 and 8 (D) 8 and 6

A job has four pages A, B, C, D and the main memory has two page frames only. The job needs to process its pages in following order: ABACABDBACD Assuming that a page interrupt occurs when a new page is brought in the main memory, irrespective of whether the page is swapped out or not. The number of page interrupts in FIFO and LRU page replacement algorithms are (A) 9 and 7 (B) 7 and 6 (C) 9 and 8 (D) 8 and 6
by

1 Answer

Answer :

(C) 9 and 8
by

Related questions

Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the pages. The page reference string is : 1 2 3 2 5 6 3 4 6 3 7 3 1 5 3 6 3 4 2 4 3 4 5 1 The number of page faults in LRU and optimal page replacement algorithms are respectively (without including initial page faults to fill available page frames with pages): (A) 9 and 6 (B) 10 and 7 (C) 9 and 7 (D) 10 and 6

Description : Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the pages. The page reference string is :  1 2 3 2 5 6 3 4 6 3 7 3 1 5 3 6 3 4 2 4 3 4 5 ... to fill available page frames with pages): (A) 9 and 6 (B) 10 and 7 (C) 9 and 7 (D) 10 and 6

Last Answer : (B) 10 and 7

Suppose that the virtual Address space has eight pages and physical memory with four page frames. If LRU page replacement algorithm is used, .............. number of page faults occur with the reference string. 0 2 1 3 5 4 6 3 7 4 7 3 3 5 5 3 1 1 1 7 2 3 4 1 (A) 11 (B) 12 (C) 10 (D) 9

Description : Suppose that the virtual Address space has eight pages and physical memory with four page frames. If LRU page replacement algorithm is used, .............. number of page faults occur with the reference string. 0 2 1 3 5 4 6 3 7 4 7 3 3 5 5 3 1 1 1 7 2 3 4 1 (A) 11 (B) 12 (C) 10 (D) 9

Last Answer : (A) 11

A LRU page replacement is used with four page frames and eight pages. How many page faults will occur with the reference string 0172327103 if the four frames are initially empty? (A) 6 (B) 7 (C) 5 (D) 8

Description : A LRU page replacement is used with four page frames and eight pages. How many page faults will occur with the reference string 0172327103 if the four frames are initially empty? (A) 6 (B) 7 (C) 5 (D) 8

Last Answer : (B) 7

Consider the reference string 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are .......... and ........... respectively. (A) 10, 9 (B) 9, 9 (C) 10, 10 (D) 9, 10

Description : Consider the reference string 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are .......... and ........... respectively. (A) 10, 9 (B) 9, 9 (C) 10, 10 (D) 9, 10

Last Answer : (D) 9, 10

A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are respectively: (1) 14 and 15 (2) 14 and 29 (3) 15 and 14 (4) 16 and 32

Description : A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are respectively: (1) 14 and 15 (2) 14 and 29 (3) 15 and 14 (4) 16 and 32

Last Answer : (3) 15 and 14

The ……………. Determines when a page should be brought into main memory. A) Fetch policy B) Placement policy C) Replacement policy D) Resident set management

Description : The ……………. Determines when a page should be brought into main memory. A) Fetch policy B) Placement policy C) Replacement policy D) Resident set management

Last Answer : A) Fetch policy

Suppose that the number of instructions executed between page faults is directly proportional to the number of page frames allocated to a program. If the available memory is doubled, the mean interval between page faults is also doubled. Further, consider that a normal instruction takes one micro second, but if a page fault occurs, it takes 2001 micro seconds. If a program takes 60 sec to run, during which time it gets 15000 page faults, how long would it take to run if twice as much memory were available? (A) 60 sec (B) 30 sec (C) 45 sec (D) 10 sec

Description : Suppose that the number of instructions executed between page faults is directly proportional to the number of page frames allocated to a program. If the available memory is doubled, the mean interval between page faults is also ... memory were available? (A) 60 sec (B) 30 sec (C) 45 sec (D) 10 sec

Last Answer : Answer: C Explanation: T = Ninstr x 1µs + 15,000 x 2,000 µs = 60s Ninstr x 1µs = 60,000,000 µs - 30,000,000 µs = 30,000,000 µs Ninstr = 30,000,000 The number of instruction ... doesn't mean that the program runs twice as fast as on the first system. Here, the performance increase is of 25%.

Explain LRU page replacement algorithm for following reference string. 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1 Calculate the page fault.

Description : Explain LRU page replacement algorithm for following reference string. 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1 Calculate the page fault.

Last Answer : LRU: The Least Recently Used (LRU) page replacement policy replaces the page that has not been used for the longest period of time. LRU replacement associates with each page the time of that page's last use. ... in question so assume frame size as 3 or 4) LRU: Assume frame size=3

In a demand paging memory system, page table is held in registers. The time taken to service a page fault is 8 m.sec. if an empty frame is available or if the replaced page is not modified, and it takes 20 m.secs., if the replaced page is modified. What is the average access time to service a page fault assuming that the page to be replaced is modified 70% of the time ? (A) 11.6 m.sec. (B) 16.4 m.sec. (C) 28 m.sec. (D) 14 m.sec.

Description : In a demand paging memory system, page table is held in registers. The time taken to service a page fault is 8 m.sec. if an empty frame is available or if the replaced page is not modified, and it takes 20 m.secs., if the replaced ... ? (A) 11.6 m.sec. (B) 16.4 m.sec. (C) 28 m.sec. (D) 14 m.sec.

Last Answer : (B) 16.4 m.sec. 

With ................ a page is brought into main memory only when the reference is made to a location on that page. A) demand paging B) main paging C) prepaging D) postpaging

Description : With ................ a page is brought into main memory only when the reference is made to a location on that page. A) demand paging B) main paging C) prepaging D) postpaging

Last Answer : A) demand paging

A virtual memory has a page size of 1K words. There are eight pages and four blocks. The associative memory page table contains the following entries: Image Which of the following list of virtual addresses (in decimal) will not cause any page fault if referenced by the CPU? (A) 1024, 3072, 4096, 6144 (B) 1234, 4012, 5000, 6200 (C) 1020, 3012, 6120, 8100 (D) 2021, 4050, 5112, 7100

Description : A virtual memory has a page size of 1K words. There are eight pages and four blocks. The associative memory page table contains the following entries:  Which of the following list of virtual addresses (in ... 1234, 4012, 5000, 6200 (C) 1020, 3012, 6120, 8100 (D) 2021, 4050, 5112, 7100

Last Answer : Answer: C Explanation: The pages which are not in main memory are: 1020 will not cause page fault (1024-2047) 3012 will not cause page fault (3072-4095) 6120 will not cause page fault (4096-5119) 8100 will not cause page fault (6144-7167)

Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk service are not influenced by file allocation method. (C) Caching the directories and index blocks in main memory can also help in reducing disk arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Description : Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk ... arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Last Answer : (B) The number of requests for disk service are not influenced by file allocation method.

Which of the following is not the function of Microkernel? A) File management B) Low-level memory management C) Inter-process communication D) I/O interrupts management

Description : Which of the following is not the function of Microkernel? A) File management B) Low-level memory management C) Inter-process communication D) I/O interrupts management

Last Answer : A) File management

With …………………. A page is written out to secondary memory only when it has been selected for replacement. A) pre-cleaning B) demand cleaning C) required cleaning D) fast cleaning

Description : With …………………. A page is written out to secondary memory only when it has been selected for replacement. A) pre-cleaning B) demand cleaning C) required cleaning D) fast cleaning

Last Answer : B) demand cleaning

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

Description : 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 ... ? (A) I, III and IV (B) I and II (C) III and IV (D) I and III

Last Answer : (D) I and III

8086 is interfaced to two 8259s (Programmable interrupt controllers). If 8259s are in master slave configuration the number of interrupts available to the 8086 microprocessor is a) 8 b) 16 c) 15 d) 64

Description : 8086 is interfaced to two 8259s (Programmable interrupt controllers). If 8259s are in master slave configuration the number of interrupts available to the 8086 microprocessor is a) 8 b) 16 c) 15 d) 64

Last Answer : a) 8

Assume that we need to download text documents at the rate of 100 pages per minute. A page is an average of 24 lines with 80 characters in each line and each character requires 8 bits. Then the required bit rate of the channel is ................ (A) 1.636 Kbps (B) 1.636 Mbps (C) 2.272 Mbps (D) 3.272 Kbps

Description : Assume that we need to download text documents at the rate of 100 pages per minute. A page is an average of 24 lines with 80 characters in each line and each character requires 8 bits. Then the required bit rate of the channel is ... ...... (A) 1.636 Kbps (B) 1.636 Mbps (C) 2.272 Mbps (D) 3.272 Kbps

Last Answer : Answer: Marks given to all

Consider a disk queue with request for input/output to block on cylinders 98, 183, 37, 122, 14, 124, 65, 67 in that order. Assume that disk head is initially positioned at cylinder 53 and moving towards cylinder number 0. The total number of head movements using Shortest Seek Time First (SSTF) and SCAN algorithms are respectively (A) 236 and 252 cylinders (B) 640 and 236 cylinders (C) 235 and 640 cylinders (D) 235 and 252 cylinders

Description : Consider a disk queue with request for input/output to block on cylinders  98, 183, 37, 122, 14, 124, 65, 67  in that order. Assume that disk head is initially positioned at cylinder 53 and moving ... and 252 cylinders (B) 640 and 236 cylinders (C) 235 and 640 cylinders (D) 235 and 252 cylinders

Last Answer : Answer: 236 and 208 cylinders Explanation: SSTF Initial head position =53 The closest queue to initial head position=65 head moves from 53 to 65=12 head moves from 65 to 67=2 head moves from 67 ... 122=24 head moves from 122 to 124=2 head moves from 124 to 183=59 Total head movement=208 

Page stealing 1) Is a sign of an efficient system 2) Is taking page frames from other working sets 3) Should be the tuning goal 4) Is taking larger disk spaces for pages paged out

Description : Page stealing 1) Is a sign of an efficient system 2) Is taking page frames from other working sets 3) Should be the tuning goal 4) Is taking larger disk spaces for pages paged out

Last Answer : 2) Is taking page frames from other working sets

Page stealing 1 Is a sign of an efficient system 2 Is taking page frames from other working sets 3 Should be the tuning goal 4 Is taking larger disk spaces for pages paged out

Description : Page stealing 1 Is a sign of an efficient system 2 Is taking page frames from other working sets 3 Should be the tuning goal 4 Is taking larger disk spaces for pages paged out

Last Answer : 2 Is taking page frames from other working sets

Which of the following 8085 microprocessor hardware interrupt has the lowest priority? (A) RST 6.5 (B) RST 7.5 (C) TRAP (D) INTR

Description : Which of the following 8085 microprocessor hardware interrupt has the lowest priority? (A) RST 6.5 (B) RST 7.5 (C) TRAP (D) INTR 

Last Answer : Answer: D

What is meant by Maskable interrupts? a) An interrupt which can never be turned off. b) An interrupt that can be turned off by the programmer. c) none

Description : What is meant by Maskable interrupts? a) An interrupt which can never be turned off. b) An interrupt that can be turned off by the programmer. c) none

Last Answer : b) An interrupt that can be turned off by the programmer.

hat is the output of the following? i = 5 while True: if i%0O11 == 0: Page No 12 break print(i) i += 1 a) 5 6 7 8 9 10 b) 5 6 7 8 c) 5 6 d) error

Description : hat is the output of the following? i = 5 while True: if i%0O11 == 0: Page No 12 break print(i) i += 1 a) 5 6 7 8 9 10 b) 5 6 7 8 c) 5 6 d) error

Last Answer : b) 5 6 7 8

Which of the following algorithms sort n integers, having the range 0 to (n2 -1), in ascending order in O(n) time ? (A) Selection sort (B) Bubble sort (C) Radix sort (D) Insertion sort

Description : Which of the following algorithms sort n integers, having the range 0 to (n2 -1), in ascending order in O(n) time ? (A) Selection sort (B) Bubble sort (C) Radix sort (D) Insertion sort

Last Answer : (C) Radix sort

State true of false. i) With paging, each process is divided into relatively small, fixed-size pages. ii) Segmentation provides for the use of pieces of varying size. A) Partition management B) Memory management C) Disk management D) All of the above

Description : State true of false. i) With paging, each process is divided into relatively small, fixed-size pages. ii) Segmentation provides for the use of pieces of varying size. A) Partition management B) Memory management C) Disk management D) All of the above

Last Answer : B) Memory management

What characteristics of Read Only memory ROM, makes it useful? 1) ROM information can be easily updated. 2) ROM provides very large amounts of inexpensive Data storage. 3) Data in ROM is Nonvolatile, that is , it remains there even without electrical power 4) ROM chips are easily Swapped between different brands of computers

Description : What characteristics of Read Only memory ROM, makes it useful? 1) ROM information can be easily updated. 2) ROM provides very large amounts of inexpensive Data storage. 3) Data in ... remains there even without electrical power 4) ROM chips are easily Swapped between different brands of computers

Last Answer : 3) Data in ROM is Nonvolatile, that is , it remains there even without electrical power

.......... displays the information about the active document such as page number, section number, number of pages, insertion point, position, etc. A) View Bar B) Menu Bar C) Status Bar D) Ruler Lin

Description : .......... displays the information about the active document such as page number, section number, number of pages, insertion point, position, etc. A) View Bar B) Menu Bar C) Status Bar D) Ruler Lin

Last Answer : C) Status Bar

Which of the following scheduling algorithms may cause starvation? a. First-come-first-served b. Round Robin c. Priority d. Shortest process next e. Shortest remaining time first (1) a, c and e (2) c, d and e (3) b, d and e (4) b, c and d

Description : Which of the following scheduling algorithms may cause starvation? a. First-come-first-served b. Round Robin c. Priority d. Shortest process next e. Shortest remaining time first (1) a, c and e (2) c, d and e (3) b, d and e (4) b, c and d

Last Answer : Answer: 2

What is the bit rate for transmitting uncompressed 800x600 pixel colour frames with 8 bits/pixel at 40 frames/second ? (A) 2.4 Mbps (B) 15.36 Mbps (C) 153.6 Mbps (D) 1536 Mbps

Description : What is the bit rate for transmitting uncompressed 800x600 pixel colour frames with 8 bits/pixel at 40 frames/second ? (A) 2.4 Mbps (B) 15.36 Mbps (C) 153.6 Mbps (D) 1536 Mbps 

Last Answer : (C) 153.6 Mbps Explanation: The number of bits/sec is just 800x600x40x8 or 153.6 Mbps.

A network with bandwidth of 10 Mbps can pass only an average of 15,000 frames per minute with each frame carrying an average of 8,000 bits. What is the throughput of this network ? (A) 2 Mbps (B) 60 Mbps (C) 120 Mbps (D) 10 Mbps

Description : A network with bandwidth of 10 Mbps can pass only an average of 15,000 frames per minute with each frame carrying an average of 8,000 bits. What is the throughput of this network ? (A) 2 Mbps (B) 60 Mbps (C) 120 Mbps (D) 10 Mbps

Last Answer : (A) 2 Mbps Explanation: In data transmission, throughput is the amount of data moved successfully from one place to another in a given period of time, and typically measured in bits per second (bps), ... second (Mbps) or gigabits per second (Gbps). Here, Throughput = 15000 x 8000/60 = 2 Mbps 

Match the following mechanisms for interrupting the execution of a process and their uses. i) Interrupt a) Call to an operating system function ii) Trap b) Reaction to an asynchronous external event iii) Supervisor Call c) Handling of a error or an exception condition A) i-a, ii-b, iii-c B) i-c, ii-a, iii-b C) i-b, ii-c, iii-a D) i-a, ii-c, iii-b

Description : Match the following mechanisms for interrupting the execution of a process and their uses. i) Interrupt a) Call to an operating system function ii) Trap b) Reaction to an asynchronous external event iii) Supervisor Call c) Handling of a error ... -a, iii-b C) i-b, ii-c, iii-a D) i-a, ii-c, iii-b

Last Answer : C) i-b, ii-c, iii-a

A sender uses the Stop-and-Wait ARQ protocol for reliable transmission of frames. Frames are of size 1000 bytes and the transmission rate at the sender is 80 Kbps (1Kbps = 1000 bits/second). Size of an acknowledgement is 100 bytes and the transmission rate at the receiver is 8 Kbps. The one-way propagation delay is 100 milliseconds. Assuming no frame is lost, the sender throughput is __________ bytes/second. a. 2500 b. 2000 c. 1500 d. 500

Description : A sender uses the Stop-and-Wait ARQ protocol for reliable transmission of frames. Frames are of size 1000 bytes and the transmission rate at the sender is 80 Kbps (1Kbps = 1000 bits/second). Size of ... is lost, the sender throughput is __________ bytes/second. a. 2500 b. 2000 c. 1500 d. 500

Last Answer : a. 2500

Ajay reads at an average rate of 30 pages per hour, while Vikram reads at an average rate of 40 pages per hour. If Ajay starts reading a novel at 4:30 PM and Vikram begins reading an identical copy of the same book at 5:20 PM, at what time will they be reading the same page? a) 7:50 PM b) 8:15 PM c) 8:40 PM d) 9:00 PM e) 9:25 PM

Description : Ajay reads at an average rate of 30 pages per hour, while Vikram reads at an average rate of 40 pages per hour. If Ajay starts reading a novel at 4:30 PM and Vikram begins reading an identical copy of the same book at 5:20 PM, at ... same page? a) 7:50 PM b) 8:15 PM c) 8:40 PM d) 9:00 PM e) 9:25 PM

Last Answer : Ajay reads at average rate of 30 pages per hour ie. 1 page in every two minutes. Therefore, by 5:20 PM, he would have covered 25 pages By 6:20 PM, Ajay would have read 25+30 pages and Vikram would have ... and he will also finish 100 pages Hence, both of them will be on same page at 7:50 Answer: a)

What is the output of the following? i = 1 while True: if i%2 == 0: break print(i) i += 2 a) 1 Page No 13 b) 1 2 c) 1 2 3 4 5 6 … d) 1 3 5 7 9 11 …

Description : What is the output of the following? i = 1 while True: if i%2 == 0: break print(i) i += 2 a) 1 Page No 13 b) 1 2 c) 1 2 3 4 5 6 … d) 1 3 5 7 9 11 …

Last Answer : d) 1 3 5 7 9 11 …

The essential difference between traps and interrupts is (A) traps are asynchronous and interrupts are synchronous with the program (B) traps are synchronous and interrupts are asynchronous with the program (C) traps are synchronous and interrupts are asynchronous with the I/O devices. (D) None of these.

Description : The essential difference between traps and interrupts is (A) traps are asynchronous and interrupts are synchronous with the program (B) traps are synchronous and interrupts are asynchronous with the program ( ... synchronous and interrupts are asynchronous with the I/O devices. (D) None of these.

Last Answer : (B) traps are synchronous and interrupts are asynchronous with the program

8085 microprocessor has ............. hardware interrupts. (A) 2 (B) 3 (C) 4 (D) 5

Description : 8085 microprocessor has ............. hardware interrupts. (A) 2 (B) 3 (C) 4 (D) 5

Last Answer : (D) 5

Find the false statement: (A) In Modern Cryptography, symmetric key algorithms use same key both for Encryption and Decryption. (B) The Symmetric cipher DES (Data Encryption Standard) was widely used in the industry for security product. (C) The AES (Advanced Encryption Standard) cryptosystem allows variable key lengths of size 56 bits and 124 bits. (D) Public key algorithms use two different keys for Encryption and Decryption.

Description : Find the false statement: (A) In Modern Cryptography, symmetric key algorithms use same key both for Encryption and Decryption. (B) The Symmetric cipher DES (Data Encryption Standard) was widely used ... and 124 bits. (D) Public key algorithms use two different keys for Encryption and Decryption.

Last Answer : (C) The AES (Advanced Encryption Standard) cryptosystem allows variable key lengths of size 56 bits and 124 bits.

If link transmits 4000 frames per second and each slot has 8 bits, the transmission rate of circuit of this TDM is ............... (A) 64 Kbps (B) 32 Mbps (C) 32 Kbps (D) 64 Mbps

Description : If link transmits 4000 frames per second and each slot has 8 bits, the transmission rate of circuit of this TDM is ............... (A) 64 Kbps (B) 32 Mbps (C) 32 Kbps (D) 64 Mbps

Last Answer : (C) 32 Kbps

The methods or algorithms which are used to increase the performance of disk storage sub-system is called ............. A) Disk performing B) Disk scheduling C) Disk storing D) Disk extending

Description : The methods or algorithms which are used to increase the performance of disk storage sub-system is called ............. A) Disk performing B) Disk scheduling C) Disk storing D) Disk extending

Last Answer : B) Disk scheduling

………… is not the component of data structure. A) Operations B) Storage Structures C) Algorithms D) None of above

Description : ………… is not the component of data structure. A) Operations B) Storage Structures C) Algorithms D) None of above

Last Answer : D) None of above

Which of the following algorithms has lowest worst case time complexity? a) Insertion sort b) Selection sort c) Quick sort d) Heap sort

Description : Which of the following algorithms has lowest worst case time complexity? a) Insertion sort b) Selection sort c) Quick sort d) Heap sort

Last Answer : d) Heap sort

Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Description : Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current ... ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Last Answer : (C) Greedy best first search algorithm

Code blocks allow many algorithms to be implemented with the following parameters : (A) clarity, elegance, performance (B) clarity, elegance, efficiency (C) elegance, performance, execution (D) execution, clarity, performance

Description : Code blocks allow many algorithms to be implemented with the following parameters : (A) clarity, elegance, performance (B) clarity, elegance, efficiency (C) elegance, performance, execution (D) execution, clarity, performance

Last Answer : (B) clarity, elegance, efficiency

Which of the following algorithms is not a broadcast routing algorithm ? (A) Flooding (B) Multidestination routing (C) Reverse path forwarding (D) All of the above

Description : Which of the following algorithms is not a broadcast routing algorithm ? (A) Flooding (B) Multidestination routing (C) Reverse path forwarding (D) All of the above

Last Answer : (D) All of the above

The finally block is executed: a) Only when a checked exception is thrown b) Only when a unchecked exception is thrown c) Only when an exception is thrown d) Irrespective of whether an exception is thrown or not e) None of The Above

Description : The finally block is executed: a) Only when a checked exception is thrown b) Only when a unchecked exception is thrown c) Only when an exception is thrown d) Irrespective of whether an exception is thrown or not e) None of The Above

Last Answer : d) Irrespective of whether an exception is thrown or not

The distance between two stations M and N is L kilometers. All frames are K bits long. The propagation delay per kilometer is t seconds. Let R bits/second be the channelcapacity. Assuming that processing delay is negligible, the minimum number of bits for the sequence number field in a frame for maximum utilization, when the sliding window protocol used is: a. A b. B c. C d. D

Description : The distance between two stations M and N is L kilometers. All frames are K bits long. The propagation delay per kilometer is t seconds. Let R bits/second be the channel capacity. Assuming that processing ... maximum utilization, when the sliding window protocol used is: a. A b. B c. C d. D

Last Answer : c. C

Breaking physical memory into fixed-sized bloclcs called as: (1) Packets (2) Page (3) Frames (4) Segments

Description : Breaking physical memory into fixed-sized bloclcs called as: (1) Packets (2) Page (3) Frames (4) Segments

Last Answer : Frames

A network with bandwidth of 10 Mbps can pass only an average of 12,000 frames per minute with each frame carrying an average of 10,000 bits. What is the throughput of this network ? (A) 1 Mbps (B) 2 Mbps (C) 10 Mbps (D) 12 Mbps

Description : A network with bandwidth of 10 Mbps can pass only an average of 12,000 frames per minute with each frame carrying an average of 10,000 bits. What is the throughput of this network ? (A) 1 Mbps (B) 2 Mbps (C) 10 Mbps (D) 12 Mbps

Last Answer : (B) 2 Mbps

If you are to use [Control-c] as the interrupt key instead of [Del], then you will have to use A. tty ^c B. stty intr \^c C. stty echoe D. stty echo \^a E. None of the above

Description : If you are to use [Control-c] as the interrupt key instead of [Del], then you will have to use A. tty ^c B. stty intr \^c C. stty echoe D. stty echo \^a E. None of the above

Last Answer : B. stty intr \^c

Interrupt which arises from illegal or erroneous use of an instruction or data is (A) Software interrupt (B) Internal interrupt (C) External interrupt (D) All of the above

Description : Interrupt which arises from illegal or erroneous use of an instruction or data is (A) Software interrupt (B) Internal interrupt (C) External interrupt (D) All of the above

Last Answer : (B) Internal interrupt