Consider a disk with 16384 bytes per track having a rotation time of 16 msec and average seek time of 40 msec. What is the time in msec to read a block of 1024 bytes from this disk? (A) 57 msec (B) 49 msec (C) 48 msec (D) 17 msec

Consider a disk with 16384 bytes per track having a rotation time of 16 msec and average seek time of 40 msec. What is the time in msec to read a block of 1024 bytes from this disk? (A) 57 msec (B) 49 msec (C) 48 msec (D) 17 msec
by

1 Answer

Answer :

Answer: B
by

Related questions

Suppose that the time to do a null remote procedure call (RPC) (i.e, 0 data bytes) is 1.0 msec, with an additional 1.5 msec for every 1K of data. How long does it take to read 32 K from the file server as 32 1K RPCs? (A) 49 msec (B) 80 msec (C) 48 msec (D) 100 msec

Description : Suppose that the time to do a null remote procedure call (RPC) (i.e, 0 data bytes) is 1.0 msec, with an additional 1.5 msec for every 1K of data. How long does it take to read 32 K from the file server as 32 1K RPCs? (A) 49 msec (B) 80 msec (C) 48 msec (D) 100 msec

Last Answer : (B) 80 msec

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

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 

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

............. is the time required to move the disk arm to the required track. A) Seek time B) Rotational delay C) Latency time D) Access time

Description : ............. is the time required to move the disk arm to the required track. A) Seek time B) Rotational delay C) Latency time D) Access time

Last Answer : A) Seek time

How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size ? (A) 332.8 KB (B) 83.6 KB (C) 266.2 KB (D) 256.6 KB

Description : How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size ? (A) 332.8 KB (B) 83.6 KB (C) 266.2 KB (D) 256.6 KB

Last Answer : (A) 332.8 KB

Which of the following information about the UNIX file system is not correct? (A) Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks. (B) An i-node contains accounting information as well as enough information to locate all the disk blocks that holds the file’s data. (C) Each i-node is 256-bytes long. (D) All the files and directories are stored in data blocks.

Description : Which of the following information about the UNIX file system is not correct? (A) Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks. (B ... Each i-node is 256-bytes long. (D) All the files and directories are stored in data blocks. 

Last Answer : (C) Each i-node is 256-bytes long.

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

An Image is Square array of 256X256 pixel requires 65536 bytes, and after compression it reduced to 16384 X8 bytes. What will be the compression rate: a. 2 b. 3 c. 4 d. 5

Description : An Image is Square array of 256X256 pixel requires 65536 bytes, and after compression it reduced to 16384 X8 bytes. What will be the compression rate: a. 2 b. 3 c. 4 d. 5

Last Answer : a. 2

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 dynamic RAM has refresh cycle of 32 times per msec. Each refresh operation requires 100 nsec and a memory cycle requires 250 nsec. What percentage of memory’s total operating time is required for refreshes? (A) 0.64 (B) 0.96 (C) 2.00 (D) 0.32

Description : A dynamic RAM has refresh cycle of 32 times per msec. Each refresh operation requires 100 nsec and a memory cycle requires 250 nsec. What percentage of memory’s total operating time is required for refreshes? (A) 0.64 (B) 0.96 (C) 2.00 (D) 0.32

Last Answer : Answer: D Explanation: in 1ms : refresh = 32 times Memory cycle = 1ms/250ns = 106ns/250ns = 4000 times Therefore, % of refresh time = (32 x 100ns)/(4000 x 250ns) = 3200ns/1000000 x 100% = 0.32%

In the following question from among the given alternative select the one in which the set of numbers is most like the set of number given in the questions. GiveSet:(4, 25, 81) 16. (a) (4, 36, 79) (b) (9, 48, 81) (c) (16, 64, 100) (d) (9,49, 143) 17. In the following question, number of letters are skipped in between by a particular rule. Which of the following series observes the rule? (a) BAFHTU (b) ACEGJL (c) ACFJOU (d) ADFHJL

Description : In the following question from among the given alternative select the one in which the set of numbers is most like the set of number given in the questions. GiveSet:(4, 25, 81) 16. (a) (4, 36, 79) ... . Which of the following series observes the rule? (a) BAFHTU (b) ACEGJL (c) ACFJOU (d) ADFHJL

Last Answer : 16. (c) 17. (c)

In a packet switching network, if the message size is 48 bytes and each packet contains a header of 3 bytes. If 24 packets are required to transmit the message, the packet size is ................ (1) 2 bytes (2) 1 byte (3) 4 bytes (4) 5 bytes

Description : In a packet switching network, if the message size is 48 bytes and each packet contains a header of 3 bytes. If 24 packets are required to transmit the message, the packet size is ................ (1) 2 bytes (2) 1 byte (3) 4 bytes (4) 5 bytes

Last Answer : (4) 5 bytes 

A UNIX file system has 1 KB block size and 4-byte disk addresses. What is the maximum file size if the inode contains ten direct block entries, one single indirect block entry, one double indirect block entry and one triple indirect block entry? (A) 30 GB (B) 64 GB (C) 16 GB (D) 1 GB

Description : A UNIX file system has 1 KB block size and 4-byte disk addresses. What is the maximum file size if the inode contains ten direct block entries, one single indirect block entry, one double indirect block entry and one triple indirect block entry? (A) 30 GB (B) 64 GB (C) 16 GB (D) 1 GB

Last Answer : (C) 16 GB

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.

A disk has 500 bytes/sector,100 sectors / track, 20 heads and 1000 cylinders. Total capacity of disk is

Description : A disk has 500 bytes/sector,100 sectors / track, 20 heads and 1000 cylinders. Total capacity of disk is  (a) 1 GB (b) 100 MB (c) 10 MB (d) 10 GB

Last Answer : A disk has 500 bytes/sector,100 sectors / track, 20 heads and 1000 cylinders. Total capacity of disk is 1 GB

There are three different categories of jobs A, B and C. The average salary of the students who got the job of A and B categories is Rs.32 lakh per annum. The average salary of the student who got the job of B and C category is 54 lakh per annum. And the average salary of those students who got the job of A and C is Rs.44 lakh per annum. The most appropriate (or closet) range of average salary of all the three categories (if it is known that each student gets only one category for jobs i.e, A, B and C): A) lies between 30 & 44 B) lies between 48 & 56 C) lies between 38 & 45 D) lies between 49 & 50

Description : There are three different categories of jobs A, B and C. The average salary of the students who got the job of A and B categories is Rs.32 lakh per annum. The average salary of the student who got the job of B ... 30 & 44 B) lies between 48 & 56 C) lies between 38 & 45 D) lies between 49 & 50

Last Answer : Answer: C) Let the number of students who got the jobs of A, B and C categories is a, b and c respectively, ∴Total salary of Aand B = 32 (a +b) ∴Total salary of B and C = 54 (b+ ... the minimum salary must be Rs.38 lakh and the maximum salary cannot exceed 45, which is the highest of the three..

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

Insert the missing number: 4:17 : : 7:? (A) 48 (B) 49 (C) 50 (D) 51

Description : Insert the missing number: 4:17 : : 7:? (A) 48 (B) 49 (C) 50 (D) 51

Last Answer : Answer: C Square of 4 is 16 +1 = 17 Therefore Square of 7 is 49 +1 = 50

If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O blocks requests are: 98, 37, 14, 124, 65, 67 (A) 320 (B) 322 (C) 321 (D) 319

Description : If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O blocks requests are: 98, 37, 14, 124, 65, 67 (A) 320 (B) 322 (C) 321 (D) 319

Last Answer : (C) 321

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 

How many kilobytes is equal to 1024 bytes ?

Last Answer : 1024 bytes equals 1 kilobyte.

Which statement is valid? A) 1KB = 1024 bytes B) 1 MB=2048 bytes C) 1 MB = 1000 kilobytes D) 1 KB = 1000 bytes

Description : Which statement is valid? A) 1KB = 1024 bytes B) 1 MB=2048 bytes C) 1 MB = 1000 kilobytes D) 1 KB = 1000 bytes

Last Answer : Answer : A

Which is valid statement A) 1 KB = 1024 Bytes B) 1 MB = 1024 Bytes C) 1 KB = 1000 Bytes D) 1 MB = 1000 Bytes

Description : Which is valid statement A) 1 KB = 1024 Bytes B) 1 MB = 1024 Bytes C) 1 KB = 1000 Bytes D) 1 MB = 1000 Bytes

Last Answer : Answer : A

The term gigabyte refers to A) 1024 bytes B) 1024 kilobytes C) 1024 megabytes D) 1024 gigabyte

Description : The term gigabyte refers to A) 1024 bytes B) 1024 kilobytes C) 1024 megabytes D) 1024 gigabyte

Last Answer : Answer : C

Kilobyte equals to how many bytes? A. 1000 B. 1064 C. 1024 D. None of the above

Description : Kilobyte equals to how many bytes? A. 1000 B. 1064 C. 1024 D. None of the above

Last Answer : C. 1024

The term gigabyte refers to a. 1024 bytes b. 1024 kilobytes c. 1024 megabytes d. 1024 gigabyte

Description : The term gigabyte refers to a. 1024 bytes b. 1024 kilobytes c. 1024 megabytes d. 1024 gigabyte

Last Answer : 1024 megabytes

The term gigabyte refers to a. 1024 bytes b. 1024 kilobytes c. 1024 megabytes d. 1024 gigabyte

Description : The term gigabyte refers to a. 1024 bytes b. 1024 kilobytes c. 1024 megabytes d. 1024 gigabyte

Last Answer : 1024 megabytes

Which statement is valid? a. 1KB = 1024 bytes b. 1 MB=2048 bytes c. 1 MB = 1000 kilobytes d. 1 KB = 1000 bytes

Description : Which statement is valid? a. 1KB = 1024 bytes b. 1 MB=2048 bytes c. 1 MB = 1000 kilobytes d. 1 KB = 1000 bytes

Last Answer : 1KB = 1024 bytes

A UDP datagram of _____ bytes is acceptable to all implementations A. 516 B. 1024 C. 256 D. 512

Description : A UDP datagram of _____ bytes is acceptable to all implementations A. 516 B. 1024 C. 256 D. 512

Last Answer : A. 516

The maximum length (in bytes) of an IPv4 datagram is? A. 32 B. 1024 C. 65535 D. 512

Description : The maximum length (in bytes) of an IPv4 datagram is? A. 32 B. 1024 C. 65535 D. 512

Last Answer : C. 65535

Find the incorrect one: a) 1 KB = 1024 BYTES b) 1 MB = 1024 KB c) 1 GB = 1024 MB d) 1 TB = 1024 GB e) 1 PB = 1024 TB f) None of These

Description : Find the incorrect one: a) 1 KB = 1024 BYTES b) 1 MB = 1024 KB c) 1 GB = 1024 MB d) 1 TB = 1024 GB e) 1 PB = 1024 TB f) None of These

Last Answer : f) None of These

1 Kilobyte (KB) is _______: a) 1000 bits b) 1 Kilo KB c) Both (a) and (b) d) 1024 Bytes e) None of The Above

Description : 1 Kilobyte (KB) is _______: a) 1000 bits b) 1 Kilo KB c) Both (a) and (b) d) 1024 Bytes e) None of The Above

Last Answer : d) 1024 Bytes

Which among the following is correct: a) 1 KB = 8 Bytes b) 1 MB = 8 KB c) 1 KB = 1024 Bytes d) None of The Above

Description : Which among the following is correct: a) 1 KB = 8 Bytes b) 1 MB = 8 KB c) 1 KB = 1024 Bytes d) None of The Above

Last Answer : c) 1 KB = 1024 Bytes

In computer language, one kilobyte equals 1) 1000 bytes 2) 1024 bytes 3) 100 bytes 4) 8 bytes

Description : In computer language, one kilobyte equals 1) 1000 bytes 2) 1024 bytes 3) 100 bytes 4) 8 bytes

Last Answer : 2) 1024 bytes

One kilobyte is equal to 1) 1000 bytes 2) 1024 bytes 3) 100 bytes 4) 1023 bytes

Description : One kilobyte is equal to 1) 1000 bytes 2) 1024 bytes 3) 100 bytes 4) 1023 bytes

Last Answer : 2) 1024 bytes

1024 bytes equals: 1) 1 KB 2) 2 MB 3) 1 GB 4) 1TB

Description : 1024 bytes equals: 1) 1 KB 2) 2 MB 3) 1 GB 4) 1TB

Last Answer : 1) 1 KB

1024 bytes equals: 1 1 KB 2 2 MB 3 1 GB 4 1TB

Description : 1024 bytes equals: 1 1 KB 2 2 MB 3 1 GB 4 1TB

Last Answer : 1 1 KB

The term gigabyte refers to a. 1024 bytes b. 1024 kilobytes c. 1024 megabytes d. 1024 gigabyte

Description : The term gigabyte refers to a. 1024 bytes b. 1024 kilobytes c. 1024 megabytes d. 1024 gigabyte

Last Answer : c. 1024 megabytes

Which statement is valid? a. 1KB = 1024 bytes b. 1 MB=2048 bytes c. 1 MB = 1000 kilobytes d. 1 KB = 1000 bytes

Description : Which statement is valid? a. 1KB = 1024 bytes b. 1 MB=2048 bytes c. 1 MB = 1000 kilobytes d. 1 KB = 1000 bytes

Last Answer : a. 1KB = 1024 bytes

The term gigabyte refers to a. 1024 bytes b. 1024 kilobytes c. 1024 megabytes d. 1024 gigabyte

Description : The term gigabyte refers to a. 1024 bytes b. 1024 kilobytes c. 1024 megabytes d. 1024 gigabyte

Last Answer : c. 1024 megabytes

A Gigabyte is equal to (A) 1024 Megabytes (B) 1024 Kilobytes (C) 1024 Terabytes (D) 1024 Bytes

Description : A Gigabyte is equal to (A) 1024 Megabytes (B) 1024 Kilobytes (C) 1024 Terabytes (D) 1024 Bytes

Last Answer : (A) 1024 Megabytes

1024 bytes equals : (1) 1 TB (2) 1 GB (3) 1 MB (4) 1 KB

Description : 1024 bytes equals : (1) 1 TB (2) 1 GB (3) 1 MB (4) 1 KB

Last Answer : 1 KB

Four channels are multiplexed using TDM. If each channel sends 100 bytes/second and we multiplex 1 byte per channel, then the bit rate for the link is ............... (A) 400 bps (B) 800 bps (C) 1600 bps (D) 3200 bps

Description : Four channels are multiplexed using TDM. If each channel sends 100 bytes/second and we multiplex 1 byte per channel, then the bit rate for the link is ............... (A) 400 bps (B) 800 bps (C) 1600 bps (D) 3200 bps

Last Answer : (D) 3200 bps Answer: D Explanation: The multiplexer is shown in the Figure. Each frame carries 1 byte from each channel; the size of each frame, therefore, is 4 bytes, or 32 bits. Because each ... channel, the frame rate must be 100 frames per second. The bit rate is 100 32 = 3200 bps. 

How many kg of dal at Rs.8.40 per kg be mixed with32 kg of dall at Rs10.20 per kg to get a mixture worth Rs.9.60 per kg? a) 23 b) 49 c) 43 d) 72 e) 16

Description : How many kg of dal at Rs.8.40 per kg be mixed with32 kg of dall at Rs10.20 per kg to get a mixture worth Rs.9.60 per kg? a) 23 b) 49 c) 43 d) 72 e) 16

Last Answer : E By the rule of allegation ,we have Quantity of 1st kind dall : Quantity of 2nd kind dall = 60 : 120  => Quantity of 1st kind dall:32 = 1:2  Quantity of 1st kind dall =32 *1/2 = 16

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

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

................. maintains the list of free disk blocks in the Unix file system. (A) I-node (B) Boot block (C) Super block (D) File allocation table

Description : ................. maintains the list of free disk blocks in the Unix file system. (A) I-node (B) Boot block (C) Super block (D) File allocation table

Last Answer : (C) Super block