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.

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.
by

1 Answer

Answer :

(B) 16.4 m.sec. 
by

Related questions

In a paging system, it takes 30 ns to search translation Look-aside Buffer (TLB) and 90 ns to access the main memory. If the TLB hit ratio is 70%, the effective memory access time is: (1) 48 ns (2) 147 ns (3) 120 ns (4) 84 ns

Description : In a paging system, it takes 30 ns to search translation Look-aside Buffer (TLB) and 90 ns to access the main memory. If the TLB hit ratio is 70%, the effective memory access time is: (1) 48 ns (2) 147 ns (3) 120 ns (4) 84 ns

Last Answer : Answer: 2

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%.

Let the page fault service time be 10 millisecond(ms) in a computer with average memory access time being 20 nanosecond(ns). If one page fault is generated for every 106 memory accesses, what is the effective access time for memory? (A) 21 ns (B) 23 ns (C) 30 ns (D) 35 ns

Description : Let the page fault service time be 10 millisecond(ms) in a computer with average memory access time being 20 nanosecond(ns). If one page fault is generated for every 106 memory accesses, what is the effective access time for memory? (A) 21 ns (B) 23 ns (C) 30 ns (D) 35 ns

Last Answer : (C) 30 ns

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

For the implementation of a paging scheme, suppose the average process size be x bytes, the page size be y bytes, and each page entry requires z bytes. The optimum page size that minimizes the total overhead due to the page table and the internal fragmentation loss is given by (A) x/2 (B) xz/2 (C) √2xz (D) (√xz)/2

Description : For the implementation of a paging scheme, suppose the average process size be x bytes, the page size be y bytes, and each page entry requires z bytes. The optimum page size that minimizes the total overhead due to the page ... fragmentation loss is given by (A) x/2 (B) xz/2 (C) √2xz (D) (√xz)/2

Last Answer : (C) √2xz 

A node X on a 10 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2 Mbps. Token bucket is initially filled with 16 megabits. The maximum duration taken by X to transmit at full rate of 10 Mbps is ............ secs. (1) 1 (2) 2 (3) 3 (4) 4

Description : A node X on a 10 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2 Mbps. Token bucket is initially filled with 16 megabits. The maximum duration taken by X to transmit at full rate of 10 Mbps is ............ secs. (1) 1 (2) 2 (3) 3 (4) 4

Last Answer : (2) 2 

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

Description : 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 ... replacement algorithms are (A) 9 and 7 (B) 7 and 6 (C) 9 and 8 (D) 8 and 6

Last Answer : (C) 9 and 8

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)

In a one Kilometer race A beats B by 28 meters or 7 seconds. Find out the time taken by A to finish the race. A. 4 Mins 3 secs B. 3 min 4 secs C. 5 mins D. 4 mins 20 secs

Description : In a one Kilometer race A beats B by 28 meters or 7 seconds. Find out the time taken by A to finish the race. A. 4 Mins 3 secs B. 3 min 4 secs C. 5 mins D. 4 mins 20 secs

Last Answer : ANSWER: A

In a one Kilometer race A beats B by 28 meters or 7 seconds. Find out the time taken by A to finish the race. A. 4 Mins 3 secs B. 3 min 4 secs C. 5 mins D. 4 mins 20 secs

Description : In a one Kilometer race A beats B by 28 meters or 7 seconds. Find out the time taken by A to finish the race. A. 4 Mins 3 secs B. 3 min 4 secs C. 5 mins D. 4 mins 20 secs

Last Answer : ANSWER: A

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

A software project was estimated at 352 Function Points (FP). A four person team will be assigned to this project consisting of an architect, two programmers, and a tester. The salary of the architect is Rs.80,000 per month, the programmer Rs.60,000 per month and the tester Rs.50,000 per month. The average productivity for the team is 8 FP per person month. Which of the following represents the projected cost of the project? (1) Rs.28,16,000 (2) Rs.20,90,000 (3) Rs.26,95,000 (4) Rs.27,50,000

Description : A software project was estimated at 352 Function Points (FP). A four person team will be assigned to this project consisting of an architect, two programmers, and a tester. The salary of the architect is Rs.80,000 per month, the ... ) Rs.28,16,000 (2) Rs.20,90,000 (3) Rs.26,95,000 (4) Rs.27,50,000

Last Answer : (4) Rs.27,50,000 

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50'. What number is missing? -Riddles

Description : 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50'. What number is missing? -Riddles

Last Answer : 22

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

..................... provides a larger sized of virtual memory but require virtual memory which provides multidimensional memory. A) Paging method B) Segmentation method C) Paging and segmentation method D) None of these

Description : ..................... provides a larger sized of virtual memory but require virtual memory which provides multidimensional memory. A) Paging method B) Segmentation method C) Paging and segmentation method D) None of these

Last Answer : B) Segmentation method

Let A and B be two fuzzy integers defined as: A={(1,0.3), (2,0.6), (3,1), (4,0.7), (5,0.2)} B={(10,0.5), (11,1), (12,0.5)} Using fuzzy arithmetic operation given by Image (A) {(11,0.8), (13,1), (15,1)} (B) {(11,0.3), (12,0.5), (13,1), (14,1), (15,1), (16,0.5), (17,0.2)} (C) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,1), (16,0.5), (17,0.2)} (D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

Description : Let A and B be two fuzzy integers defined as: A={(1,0.3), (2,0.6), (3,1), (4,0.7), (5,0.2)} B={(10,0.5), (11,1), (12,0.5)} Using fuzzy arithmetic operation given by (A) {(11,0.8), (13,1), (15,1)} ( ... ,0.2)} (D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

Last Answer : (D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

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

The virtual address generated by a CPU is 32 bits. The Translation Lookaside Buffer (TLB) can hold total 64 page table entries and a 4-way set associative (i.e. with 4- cache lines in the set). The page size is 4 KB. The minimum size of TLB tag is (A) 12 bits (B) 15 bits (C) 16 bits (D) 20 bits

Description : The virtual address generated by a CPU is 32 bits. The Translation Lookaside Buffer (TLB) can hold total 64 page table entries and a 4-way set associative (i.e. with 4- cache lines in the set). The page size is 4 KB. The minimum size of TLB tag is (A) 12 bits (B) 15 bits (C) 16 bits (D) 20 bits

Last Answer : (C) 16 bits Explanation: VirtualAddress = 32 bits PageSize = 4KB = 12 bits therefore : VPNTag = 20 bits, OffsetTag = 12 bits TLBEntryLength = VPNTag = 20 bits TotalTLBEntries = 64, 4-way implies ... therefore : TLBIndex = 4 bits TLBTag = TLBEntryLength - TLBIndex = 20 - 4 = 16 bits

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

A disk drive has 100 cylinders, numbered 0 to 99. Disk requests come to the disk driver for cyclinders 12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at cyclinder 24. A seek takes 6 msec per cyclinder moved. How much seek time is needed for shortest seek time first (SSTF) algorithm? (A) 0.984 sec (B) 0.396 sec (C) 0.738 sec (D) 0.42 sec

Description : A disk drive has 100 cylinders, numbered 0 to 99. Disk requests come to the disk driver for cyclinders 12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at cyclinder 24. A seek takes ... (SSTF) algorithm? (A) 0.984 sec (B) 0.396 sec (C) 0.738 sec (D) 0.42 sec

Last Answer : C

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

The staff reading at a distance of 80 m from a level with the bubble at its centre is 1.31 m. When the bubble is moved by 5 divisions out of the centre, the reading is 1.39 m. The angular value of the one division of the bubble, is (A) 28.8 sec (B) 41.25 sec (C) 14.52 sec (D) 25.05

Description : The staff reading at a distance of 80 m from a level with the bubble at its centre is 1.31 m. When the bubble is moved by 5 divisions out of the centre, the reading is 1.39 m. The angular value of the one division of the bubble, is (A) 28.8 sec (B) 41.25 sec (C) 14.52 sec (D) 25.05

Last Answer : (B) 41.25 sec

Compute the value of adding the following two fuzzy integers: A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)} B = {(0.5,11), (1,12), (0.5,13)} Where fuzzy addition is defined as μA+B(z) = maxx+y=z (min(μA(x), μB(x))) Then, f(A+B) is equal to (A) {(0.5,12), (0.6,13), (1,14), (0.7,15), (0.7,16), (1,17), (1,18)} (B) {(0.5,12), (0.6,13), (1,14), (1,15), (1,16), (1,17), (1,18)} (C) {(0.3,12), (0.5,13), (0.5,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)}

Description : Compute the value of adding the following two fuzzy integers: A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)} B = {(0.5,11), (1,12), (0.5,13)} Where fuzzy addition is defined as μA+B(z) = maxx+y=z (min(μA(x), μB( ... ,18)} (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)}

Last Answer : (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} 

Two filling tap can fill a dumper in 14 and 28 min. respectively and when the waste tap is open, they can together fill it in 35 min. The waste pipe can empty the full dumper in – A) 152/9 hrs. B) 137/7 hrs. C) 60/9 hrs. D) 140/11 hrs.

Description : Two filling tap can fill a dumper in 14 and 28 min. respectively and when the waste tap is open, they can together fill it in 35 min. The waste pipe can empty the full dumper in – A) 152/9 hrs. B) 137/7 hrs. C) 60/9 hrs. D) 140/11 hrs.

Last Answer :  D 1/14 + 1/28 – 1/35 =>10 + 5 – 4/140 =>11/140 =>140/11 => hence answer is 140/11 hours.

A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following statement is correct? (A) OS maintains only scheduling and accounting information for each thread. (B) OS maintains only CPU registers for each thread. (C) OS does not maintain a separate stack for each thread. (D) OS does not maintain virtual memory state for each thread.

Description : A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following ... separate stack for each thread. (D) OS does not maintain virtual memory state for each thread.

Last Answer : (B) OS maintains only CPU registers for each thread.

24 14 26 ? 28 16 30 a) 13 b) 17 c) 15 d) 11 e) 20

Description : 24 14 26 ? 28 16 30 a) 13 b) 17 c) 15 d) 11 e) 20

Last Answer : The series consists of two series 1 and 2: Series 1 : 24 26 28 30 +2 +2 +2 Series 2 : 14 15 16 +1 +1 Answer: c)

vIf the price of Mango is Rs. 130 per kg, Apple is Rs. 140 per kg and Orange is Rs. 80 per kg, then what is the ratio of their cost at vendor A? 1) 11 : 14 : 16 2) 39 : 28: 20 3) 39 : 28 : 21 4) 15 : 14 : 11 5) 39 : 26 : 20

Description : If the price of Mango is Rs. 130 per kg, Apple is Rs. 140 per kg and Orange is Rs. 80 per kg, then what is the ratio of their cost at vendor A? 1) 11 : 14 : 16 2) 39 : 28: 20 3) 39 : 28 : 21 4) 15 : 14 : 11 5) 39 : 26 : 20

Last Answer : 2) 39 : 28: 20

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

A stone dropped from a baloon that was ascending at the rate of 30 ft/sec, reaches ground after 10 secs. The height of the baloon where stone was dropped was a.3420 ft b.107 dynes c.4520 ft d.2310 ft e.1310 ft

Description : A stone dropped from a baloon that was ascending at the rate of 30 ft/sec, reaches ground after 10 secs. The height of the baloon where stone was dropped was a.3420 ft b.107 dynes c.4520 ft d.2310 ft e.1310 ft

Last Answer : e. 1310 ft

The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is ............ (1) 16 (2) 63 (3) 64 (4) 65

Description : The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is ............ (1) 16 (2) 63 (3) 64 (4) 65

Last Answer : Answer: All

Assuming that the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O block requests are 98, 37, 14, 124, 65, 67: (A) 310 (B) 324 (C) 320 (D) 321

Description : Assuming that the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O block requests are 98, 37, 14, 124, 65, 67: (A) 310 (B) 324 (C) 320 (D) 321

Last Answer : (D) 321

Consider a 32 - bit microprocessor, with a 16 - bit external data bus, driven by an 8 MHz input clock. Assume that the microprocessor has a bus cycle whose minimum duration equals four input clock cycles. What is the maximum data transfer rate for this microprocessor? (A) 8x106 bytes/sec (B) 4x106 bytes/sec (C) 16x106 bytes/sec (D) 4x109 bytes/sec

Description : Consider a 32 - bit microprocessor, with a 16 - bit external data bus, driven by an 8 MHz input clock. Assume that the microprocessor has a bus cycle whose minimum duration equals four input clock cycles. What ... (A) 8x106 bytes/sec (B) 4x106 bytes/sec (C) 16x106 bytes/sec (D) 4x109 bytes/sec 

Last Answer : (B) 4x106 bytes/sec

A Pitot tube indicates 5 cm of water (manometer) when it is being used for measuring velocity of air. The velocity of air in m/sec is (A) 5 (B) 14.1 (C) 56.22 (D) 28.2

Description : A Pitot tube indicates 5 cm of water (manometer) when it is being used for measuring velocity of air. The velocity of air in m/sec is (A) 5 (B) 14.1 (C) 56.22 (D) 28.2

Last Answer : (D) 28.2

What is the output of the following? i = 5 while True: if i%0O9 == 0: break print(i) i += 1 a) 5 6 7 8 b) 5 6 7 8 9 c) 5 6 7 8 9 10 11 12 13 14 15 …. d) error

Description : What is the output of the following? i = 5 while True: if i%0O9 == 0: break print(i) i += 1 a) 5 6 7 8 b) 5 6 7 8 9 c) 5 6 7 8 9 10 11 12 13 14 15 …. d) error

Last Answer : d) error

The average price of 10 books is Rs. 12 while the average price of 8 of these books is Rs. 11.75. Of the remaining two books, if the price of one book is 60% more than the price of the other, what is the price of each of these two books? A.Rs 10 and Rs 16 B.Rs 12 and Rs 24 C.Rs 24 and Rs 18 D.Rs 28 and Rs 12 E.None of these

Description : The average price of 10 books is Rs. 12 while the average price of 8 of these books is Rs. 11.75. Of the remaining two books, if the price of one book is 60% more than the price of the other, what is the price of ... and Rs 16 B.Rs 12 and Rs 24 C.Rs 24 and Rs 18 D.Rs 28 and Rs 12 E.None of these

Last Answer : Answer - A (Rs 10 and Rs 16) Explanation - Total price of the two books = Rs. [(12 x 10) - (11.75 x 8)] = Rs. (120 - 94) = Rs. 26 Let the price of one book be Rs.x Then, the price of other book = Rs. (x ... /5)x= (8/5)x so, x +(8/5)x=26 , x=10 The prices of the two books are Rs. 10 and Rs. 16

A terminal multiplexer has six 1200 bps terminals and ‘n’ 300 bps terminals connected to it. If the outgoing line is 9600 bps, what is the value of n ? (A) 4 (B) 8 (C) 16 (D) 28

Description : A terminal multiplexer has six 1200 bps terminals and ‘n’ 300 bps terminals connected to it. If the outgoing line is 9600 bps, what is the value of n ? (A) 4 (B) 8 (C) 16 (D) 28

Last Answer : (B) 8

............ is a special type of stored procedure that is automatically invoked whenever the data in the table is modified. A) Procedure B) Trigger C) Curser D) None of the above

Description : ............ is a special type of stored procedure that is automatically invoked whenever the data in the table is modified. A) Procedure B) Trigger C) Curser D) None of the above

Last Answer : B) Trigger

Consider a project with the following functional units : Number of user inputs = 50 Number of user outputs = 40 Number of user enquiries = 35 Number of user files = 06 Number of external interfaces = 04 Assuming all complexity adjustment factors and weighing factors as average, the function points for the project will be (A) 135 (B) 722 (C) 675 (D) 672

Description : Consider a project with the following functional units : Number of user inputs = 50 Number of user outputs = 40 Number of user enquiries = 35 Number of user files = 06 Number of external interfaces = 04 ... average, the function points for the project will be (A) 135 (B) 722 (C) 675 (D) 672

Last Answer : (D) 672

A bed of spherical particles (specific gravity 2.5) of uniform size 1500 μm is 0.5 m in diameter and 0.5 m high. In packed bed state, the porosity may be taken as 0.4. Ergun's equation for the above fluid-particle system (in SI units) is given below : Δ P/L = 375 × 10 3 VOM + 10.94 × 10 6 V2 OM (SI units) If water is to be used as the fluidising medium, the minimum fluidisation velocity, VOM is (A) 12 mm/s (B) 16 mm/s (C) 24 mm/s (D) 28 mm/s

Description : A bed of spherical particles (specific gravity 2.5) of uniform size 1500 μm is 0.5 m in diameter and 0.5 m high. In packed bed state, the porosity may be taken as 0.4. Ergun's equation for the above fluid-particle ... fluidisation velocity, VOM is (A) 12 mm/s (B) 16 mm/s (C) 24 mm/s (D) 28 mm/s

Last Answer : (B) 16 mm/s

Assuming there are n keys and each keys is in the range [0, m-1]. The run time of bucket sort is (A) O(n) (B) O(n lgn) (C) O(n lgm) (D) O(n+m)

Description : Assuming there are n keys and each keys is in the range [0, m-1]. The run time of bucket sort is (A) O(n) (B) O(n lgn) (C) O(n lgm) (D) O(n+m)

Last Answer : (D) O(n+m)

The radiation heat flux from a heating element at a temperature of 800°C, in a furnace maintained at 300°C is 8 kW/m2 . The flux, when the element temperature is increased to 1000°C for the same furnace temperature is (A) 11.2 kW/m2(B) 12.0 kW/m2(C) 14.6 kW/m2(D) 16.5 kW/m

Description : The radiation heat flux from a heating element at a temperature of 800°C, in a furnace maintained at 300°C is 8 kW/m2 . The flux, when the element temperature is increased to 1000°C for the same furnace temperature is (A) 11.2 kW/m2 (B) 12.0 kW/m2 (C) 14.6 kW/m2 (D) 16.5 kW/m

Last Answer : (D) 16.5 kW/m2

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 

The mean of 8 article was found to be 15. On rechecking, it was found that two article were wrongly taken as 11 and 9 instead of 16 and 14 respectively. Find the correct mean. A) 17.25 B) 13.65 C) 16.54 D) 16.25

Description : The mean of 8 article was found to be 15. On rechecking, it was found that two article were wrongly taken as 11 and 9 instead of 16 and 14 respectively. Find the correct mean. A) 17.25 B) 13.65 C) 16.54 D) 16.25

Last Answer : D) Calculated mean of 8 articles = 15 Incorrect sum of these 8 articles = (15*8) = 120. Correct sum of these 8 articles = (incorrect sum) - (sum of incorrect articles) + (sum of actual articles) = [120 ... (30)] = 130 Therefore, correct mean = 130/8 = 16.25 Hence, the correct mean is 16.25.

What will be the values of x, m and n after execution of the following statements? Int x, m, n; m=10; n=15; x= ++m + n++; A) x=25, m=10, n=15 B) x=27, m=10, n=15 C) x=26, m=11, n=16 D) x=27, m=11, n=16

Description : What will be the values of x, m and n after execution of the following statements? Int x, m, n; m=10; n=15; x= ++m + n++; A) x=25, m=10, n=15 B) x=27, m=10, n=15 C) x=26, m=11, n=16 D) x=27, m=11, n=16

Last Answer : C) x=26, m=11, n=16

Over taking time required for a vehicle with design speed 50 km ph and overtaking acceleration 1.25 m/sec2 to overtake a vehicle moving at a speed 30 km ph, is (A) 5.0 secs (B) 6.12 secs (C) 225.48 secs (D) 30 secs

Description : Over taking time required for a vehicle with design speed 50 km ph and overtaking acceleration 1.25 m/sec2 to overtake a vehicle moving at a speed 30 km ph, is (A) 5.0 secs (B) 6.12 secs (C) 225.48 secs (D) 30 secs

Last Answer : Answer: Option B

Vinay can do a work in 28 days. Vikram is 75% more efficient than vinay. The number of days taken by vikram to do the same piece of work. a) 12 days b) 14 days c) 16 days d) 18 days

Description : Vinay can do a work in 28 days. Vikram is 75% more efficient than vinay. The number of days taken by vikram to do the same piece of work.  a) 12 days b) 14 days c) 16 days d) 18 days

Last Answer : C Given a certain work done by vinay = 28 days Efficient percentage of vikram = 75% Ratio of time taken by vinay and vikram = 175 : 100 = 7:4 Suppose vikram takes ‘x’ days to do the work. 7:4 :: 28 : x 7x = 4*28 X= 4*28/7 X= 4*4 = 16 days So vikram takes 16 days to do the work.

In a relational database model, NULL values can be used for all but which one of the following? (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL. (B) To avoid confusion with actual legitimate data values like 0 (zero) for integer columns and ‘’ (the empty string) for string columns. (C) To leave columns in a tuple marked as “unknown” when the actual value is unknown. (D) To fill a column in a tuple when that column does not really “exist” for that particular tuple.

Description : In a relational database model, NULL values can be used for all but which one of the following? (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL. (B) To ... D) To fill a column in a tuple when that column does not really exist for that particular tuple.

Last Answer : (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL.

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

Description : 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

Last Answer : (A) 560