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

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
by

1 Answer

Answer :

(C) √2xz 
by

Related questions

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. 

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

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

Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the representation, which of the following operation cannot be implemented in O(1) time ? (A) Insertion at the front of the linked list. (B) Insertion at the end of the linked list. (C) Deletion of the front node of the linked list. (D) Deletion of the last node of the linked list.

Description : Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the ... the front node of the linked list. (D) Deletion of the last node of the linked list.

Last Answer : (D) Deletion of the last node of the linked list. 

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

Simplified Boolean equation for the following truth table is: Image(A) F = yz’ + y’z (B) F = xy’ + x’y (C) F = x’z + xz’ (D) F = x’z + xz’ + xyz

Description : Simplified Boolean equation for the following truth table is: (A) F = yz’ + y’z (B) F = xy’ + x’y (C) F = x’z + xz’ (D) F = x’z + xz’ + xyz 

Last Answer : (C) F = x’z + xz’ 

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

Compare the memory organization schemes of contiguous memory allocation, pure segmentation, and pure paging with respect to the following issues External fragmentation?

Description : Compare the memory organization schemes of contiguous memory allocation, pure segmentation, and pure paging with respect to the following issues External fragmentation?

Last Answer : 1. Compare the memory organization schemes of contiguous memory allocation, pure segmentation, and pure paging with respect to the following issues: a. External fragmentationb. Internal fragmentation

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

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

Suppose a digitized voice channel is made by digitizing 8 kHz bandwidth analog voice signal. It is required to sample the signal at twice the highest frequency (two samples per hertz). What is the bit rate required, if it is assumed that each sample requires 8 bits? (A) 32 kbps (B) 64 kbps (C) 128 kbps (D) 256 kbps

Description : Suppose a digitized voice channel is made by digitizing 8 kHz bandwidth analog voice signal. It is required to sample the signal at twice the highest frequency (two samples per hertz). What is the bit rate required, if it ... sample requires 8 bits? (A) 32 kbps (B) 64 kbps (C) 128 kbps (D) 256 kbps

Last Answer : (C) 128 kbps

Consider a system with twelve magnetic tape drives and three processes P1, P2 and P3. Process P1 requires maximum ten tape drives, process P2 may need as many as four tape drives and P3 may need upto nine tape drives. Suppose that at time t1, process P1 is holding five tape drives, process P2 is holding two tape drives and process P3 is holding three tape drives. At time t1, system is in: (A) safe state (B) unsafe state (C) deadlocked state (D) starvation state

Description : Consider a system with twelve magnetic tape drives and three processes P1, P2 and P3. Process P1 requires maximum ten tape drives, process P2 may need as many as four tape drives and P3 may need upto nine ... , system is in: (A) safe state (B) unsafe state (C) deadlocked state (D) starvation state

Last Answer : Answer: B

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

The given maximization assignment problem can be converted into a minimization problem by (A) subtracting each entry in a column from the maximum value in that column. (B) subtracting each entry in the table from the maximum value in that table. (C) adding each entry in a column from the maximum value in that column. (D) adding maximum value of the table to each entry in the table.

Description : The given maximization assignment problem can be converted into a minimization problem by (A) subtracting each entry in a column from the maximum value in that column. (B) subtracting each entry in the table ... value in that column. (D) adding maximum value of the table to each entry in the table.

Last Answer : (B) subtracting each entry in the table from the maximum value in that table.

Suppose d = {“john”:40, “peter”:45}, to delete the entry for “john” what command do we use a) d.delete(“john”:40) b) d.delete(“john”) c) del d[“john”]. d) del d(“john”:40)

Description : Suppose d = {“john”:40, “peter”:45}, to delete the entry for “john” what command do we use a) d.delete(“john”:40) b) d.delete(“john”) c) del d[“john”]. d) del d(“john”:40)

Last Answer : c) del d[“john”].

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 

Suppose list1 = [0.5 * x for x in range(0, 4)], list1 is : a) [0, 1, 2, 3]. b) [0, 1, 2, 3, 4]. c) [0.0, 0.5, 1.0, 1.5]. Page No 31 d) [0.0, 0.5, 1.0, 1.5, 2.0].].

Description : Suppose list1 = [0.5 * x for x in range(0, 4)], list1 is : a) [0, 1, 2, 3]. b) [0, 1, 2, 3, 4]. c) [0.0, 0.5, 1.0, 1.5]. d) [0.0, 0.5, 1.0, 1.5, 2.0].

Last Answer : c) [0.0, 0.5, 1.0, 1.5].

Suppose the function y and a fuzzy integer number around -4 for x are given as y=(x-3)2+2 Around -4={(2,0.3), (3,0.6), (4,1), (5,0.6), (6,0.3)} respectively. Then f(Around - 4) is given by: (A) {(2,0.6), (3,0.3), (6,1), (11,0.3)} (B) {(2,0.6), (3,1), (6,1), (11,0.3)} (C) {(2,0.6), (3,1), (6,0.6), (11,0.3)} (D) {(2,0.6), (3,0.3), (6,0.6), (11,0.3)}

Description : Suppose the function y and a fuzzy integer number around -4 for x are given as y=(x-3)2+2 Around -4={(2,0.3), (3,0.6), (4,1), (5,0.6), (6,0.3)} respectively. Then f(Around - 4) is given by: (A) {(2,0.6), (3,0.3), ... 6), (3,1), (6,0.6), (11,0.3)} (D) {(2,0.6), (3,0.3), (6,0.6), (11,0.3)}

Last Answer : (C) {(2,0.6), (3,1), (6,0.6), (11,0.3)}

Suppose there are four processes in execution with 12 instances of a Resource R in a system. The maximum need of each process and current allocation are given below: Image With reference to current allocation, is system safe? If so, what is the safe sequence? (A) No (B) Yes, P1 P2 P3 P4 (C) Yes, P4 P3 P1 P2 (D) Yes, P2 P1 P3 P4

Description : Suppose there are four processes in execution with 12 instances of a Resource R in a system. The maximum need of each process and current allocation are given below: With reference to current allocation, is system safe? If so, ... B) Yes, P1 P2 P3 P4 (C) Yes, P4 P3 P1 P2 (D) Yes, P2 P1 P3 P4

Last Answer : (C) Yes, P4 P3 P1 P2

If a = (xy)/(x+y), b = (xz)/(x+z), and c = (yz)/(y+z), where a, b and c are non-zero, then what is x equal to ? -Maths 9th

Description : If a = (xy)/(x+y), b = (xz)/(x+z), and c = (yz)/(y+z), where a, b and c are non-zero, then what is x equal to ? -Maths 9th

Last Answer : answer:

If a function is described by F = (3x + z, y 2 − sin x 2 z, xz + ye x5 ), then the divergence theorem value in the region 0<x<1, 0<y<3 and 0<z<2 will be a) 13 b) 26 c) 39 d) 51

Description : If a function is described by F = (3x + z, y 2 − sin x 2 z, xz + ye x5 ), then the divergence theorem value in the region 0

Last Answer : c) 39

The total number of overhead bytes in a SONET frame row is ____________________.

Description : The total number of overhead bytes in a SONET frame row is ____________________.

Last Answer : 4

Given an image of size 1024 × 1024 pixels in which intensity of each pixel is an 8-bit quality. It requires ............... of storage space if the image is not compressed. (A) one Terabyte (B) one Megabyte (C) 8 Megabytes (D) 8 Terabytes

Description : Given an image of size 1024 × 1024 pixels in which intensity of each pixel is an 8-bit quality. It requires ............... of storage space if the image is not compressed. (A) one Terabyte (B) one Megabyte (C) 8 Megabytes (D) 8 Terabytes

Last Answer : (B) one Megabyte

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

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

Which of the following is true ? I. Implementation of self-join is possible in SQL with table alias. II. Outer-join operation is basic operation in relational algebra. III. Natural join and outer join operations are equivalent. (A) I and II are correct. (B) II and III are correct. (C) Only III is correct. (D) Only I is correct.

Description : Which of the following is true ? I. Implementation of self-join is possible in SQL with table alias. II. Outer-join operation is basic operation in relational algebra. III. Natural join and outer join operations are ... (B) II and III are correct. (C) Only III is correct. (D) Only I is correct.

Last Answer : (D) Only I is correct.

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

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

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

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

Last Answer : Answer: B

Consider the following statements: (a) Revised simplex method requires lesser computations than the simplex method. (b) Revised simplex method automatically generates the inverse of the current basis matrix. (c) Less number of entries are needed in each table of revised simplex method than usual simplex method. Which of these statements are correct? (A) (a) and (b) only (B) (a) and (c) only (C) (b) and (c) only (D) (a), (b) and (c)

Description : Consider the following statements: (a) Revised simplex method requires lesser computations than the simplex method. (b) Revised simplex method automatically generates the inverse of the current basis matrix. (c) Less number of entries are needed ... c) only (C) (b) and (c) only (D) (a), (b) and (c)

Last Answer : (D) (a), (b) and (c)

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)

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

The maximum size of the data that the application layer can pass on to the TCP layer below is ......... (1) 216 bytes (2) 216 bytes + TCP header length (3) 216 bytes - TCP header length (4) 215 bytes

Description : The maximum size of the data that the application layer can pass on to the TCP layer below is ......... (1) 216 bytes (2) 216 bytes + TCP header length (3) 216 bytes - TCP header length (4) 215 bytes

Last Answer : Answer: Marks to all

If z equals yf x2 - y2 show that ydz divided by dx plus xdz divided by dy equals xz divided by y?

Description : If z equals yf x2 - y2 show that ydz divided by dx plus xdz divided by dy equals xz divided by y?

Last Answer : 4

A unix file system has 1-KB blocks and 4-byte disk addresses. What is the maximum file size if i-nodes contain 10 direct entries and one single, double and triple indirect entry each? (A) 32 GB (B) 64 GB (C) 16 GB (D) 1 GB

Description : A unix file system has 1-KB blocks and 4-byte disk addresses. What is the maximum file size if i-nodes contain 10 direct entries and one single, double and triple indirect entry each? (A) 32 GB (B) 64 GB (C) 16 GB (D) 1 GB

Last Answer : (C) 16 GB

What are the problems involved in an IP Fragmentation Process? A. Loss of any fragment results in rejection of all datagrams B. Management of buffer space is essential to handle reassembly process C. No necessity of initializing the timer after the reception of initial fragment D. Multiple attempts can be made to recover ICMP error message due to connection-oriented IP service a. A & B b. C & D c. B& C d. A & D

Description : What are the problems involved in an IP Fragmentation Process? A. Loss of any fragment results in rejection of all datagrams B. Management of buffer space is essential to handle reassembly process C. No necessity of initializing ... -oriented IP service a. A & B b. C & D c. B& C d. A & D

Last Answer : a. A & B

Which of the following fields in IPv4 datagram is not related to fragmentation? (A) Type of service (B) Fragment offset (C) Flags (D) Identification

Description : Which of the following fields in IPv4 datagram is not related to fragmentation? (A) Type of service (B) Fragment offset (C) Flags (D) Identification

Last Answer : (A) Type of service 

Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be (A) n/2 - 1 (B) n/2 + 1 (C) (n-1)/2 (D) (n+1)/2

Description : Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be (A) n/2 - 1 (B) n/2 + 1 (C) (n-1)/2 (D) (n+1)/2

Last Answer : (C) (n-1)/2

Suppose there are n stations in a slotted LAN. Each station attempts to transmit with a probability P in each time slot. The probability that only one station transmits in a given slot is .................. (1) nP(1-P)n-1 (2) nP (3) P(1-P)n-1 (4) nP(1-P)n-1

Description : Suppose there are n stations in a slotted LAN. Each station attempts to transmit with a probability P in each time slot. The probability that only one station transmits in a given slot is .................. (1) nP(1-P)n-1 (2) nP (3) P(1-P)n-1 (4) nP(1-P)n-1

Last Answer :  nP(1-P)n-1

...... is a procedure that requires users to enter an identification code and a matchingpassword. 1) Paging 2) Logging on 3) Time-Sharing 4) Multitasking

Description : ...... is a procedure that requires users to enter an identification code and a matchingpassword. 1) Paging 2) Logging on 3) Time-Sharing 4) Multitasking

Last Answer : 2) Logging on

If an integer occupies 4 bytes and a character occupies 1 byte of memory, each element of the following structure would occupy how many bytes ? struct name { int age; char name[30]; }; A) 30 B) 32 C) 34 D) 36

Description : If an integer occupies 4 bytes and a character occupies 1 byte of memory, each element of the following structure would occupy how many bytes ? struct name { int age; char name[30]; }; A) 30 B) 32 C) 34 D) 36

Last Answer : C) 34

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. 

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.

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%

Multiply x2 + 4y2 + z2 + 2xy + xz – 2yz by (-z + x-2y). -Maths 9th

Description : Multiply x2 + 4y2 + z2 + 2xy + xz – 2yz by (-z + x-2y). -Maths 9th

Last Answer : Multiply this question

Multiply x2 + 4y2 + z2 + 2xy + xz – 2yz by (-z + x-2y). -Maths 9th

Description : Multiply x2 + 4y2 + z2 + 2xy + xz – 2yz by (-z + x-2y). -Maths 9th

Last Answer : Multiply this question

Find the divergence of the field, P = x 2 yz i + xz k a) xyz + 2x b) 2xyz + x c) xyz + 2z d) 2xyz + z

Description : Find the divergence of the field, P = x 2 yz i + xz k a) xyz + 2x b) 2xyz + x c) xyz + 2z d) 2xyz + z

Last Answer : b) 2xyz + x

A manufacturing industry plans to improve its energy performance under PAT through implementation of an energy conservation scheme. After implementation, calculate the Plant Energy Performance (PEP) with 2015-16 as the reference year. What is your inference? Given that:  The current year (2016-17 ) Annual Production – 28,750 T ,  Current year (2016-17 ) Annual Energy Consumption– 23,834 MWh,  Reference year (2015-16 ) production - 34,000 T,  Reference year (2015-16 ) Energy consumption - 27,200 MWh.

Description : A manufacturing industry plans to improve its energy performance under PAT through  implementation of an energy conservation scheme. After implementation, calculate the  Plant Energy Performance (PEP) with 2015-16 as the ... 34,000 T,   Reference year (2015-16 ) Energy consumption - 27,200 MWh.

Last Answer : Production factor (PF) = 28750/34000 = 0.846 …………………….1 mark Ref year equivalent energy (RYEE) = Ref Year Energy Use (RYEU) x PF   = 27,200 x 0.846= 23011MWh