A byte addressable computer has a memory capacity of 2 m Kbytes and can perform 2 n operations. An instruction involving 3 operands and one operator needs a maximum of (A) 3m bits (B) m + n bits (C) 3m + n bits (D) 3m + n + 30 bits

A byte addressable computer has a memory capacity of 2 m Kbytes and can perform 2 n operations. An instruction involving 3 operands and one operator needs a maximum of (A) 3m bits (B) m + n bits (C) 3m + n bits (D) 3m + n + 30 bits

by

1 Answer

Answer :

(D) 3m + n + 30 bits
by

Related questions

Because we wish to allow each ASCII code to occupy one location in memory, most memories are _____ addressable. a. BYTE b. NIBBLE c. WORD (16 bits) d. DOUBLEWORD (32 bits)

Description : Because we wish to allow each ASCII code to occupy one location in memory, most memories are _____ addressable. a. BYTE b. NIBBLE c. WORD (16 bits) d. DOUBLEWORD (32 bits)

Last Answer : a. BYTE

Execution of instruction specified by instruction to perform: a. Operation b. Operands c. Both a &b d. None of these

Description : Execution of instruction specified by instruction to perform: a. Operation b. Operands c. Both a &b d. None of these

Last Answer : a. Operation

Which of the following is incorrect for virtual memory? (1) Large programs can be written (2) More I/O is required (3) More addressable memory available (4) Faster and easy swapping of process

Description : Which of the following is incorrect for virtual memory? (1) Large programs can be written (2) More I/O is required (3) More addressable memory available (4) Faster and easy swapping of process

Last Answer : Answer: 2

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

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

Ingiven lines of code MOV AX,BL have different type of operands according to assembler for 8086 architecture these identifiers must be of. a. Different type only in byte b. Same type either in word or byte c. Botha &b d. None of these

Description : Ingiven lines of code MOV AX,BL have different type of operands according to assembler for 8086 architecture these identifiers must be of. a. Different type only in byte b. Same type either in word or byte c. Botha &b d. None of these

Last Answer : b. Same type either in word or byte

The proper definition of a modern digital computer is A) An electronic automated machine that can solve problems involving words and numbers B) A more sophistic and modified electronic pocket calculator C) Any machine that can perform mathematical operations D) A machine that works on binary code

Description : The proper definition of a modern digital computer is A) An electronic automated machine that can solve problems involving words and numbers B) A more sophistic and modified electronic pocket calculator C) Any machine that can perform mathematical operations D) A machine that works on binary code

Last Answer : Answer : A

The proper definition of a modern digital computer is a. An electronic automated machine that can solve problems involving words and numbers b. A more sophistic and modified electronic pocket calculator c. Any machine that can perform mathematical operations d. A machine that works on binary code

Description : The proper definition of a modern digital computer is a. An electronic automated machine that can solve problems involving words and numbers b. A more sophistic and modified electronic pocket calculator c. Any machine that can perform mathematical operations d. A machine that works on binary code

Last Answer : A machine that works on binary code

The proper definition of a modern digital computer is a. An electronic automated machine that can solve problems involving words and numbers b. A more sophistic and modified electronic pocket calculator c. Any machine that can perform mathematical operations d. A machine that works on binary code

Description : The proper definition of a modern digital computer is a. An electronic automated machine that can solve problems involving words and numbers b. A more sophistic and modified electronic pocket calculator c. Any machine that can perform mathematical operations d. A machine that works on binary code

Last Answer : d. A machine that works on binary code

If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n ≤ m, the expected number of collisions involving a particular key K is (A) less than 1 (B) less than lg n (C) greater than 1 (D) greater than lg n

Description : If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n ≤ m, the expected number of collisions involving a particular key K is (A) less than 1 (B) less than lg n (C) greater than 1 (D) greater than lg n

Last Answer : (A) less than 1

If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n≤m, the expected number of collisions involving a particular key x is less than ................... (1) 1 (2) 1/n (3) 1/m (4) n/m

Description : If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n≤m, the expected number of collisions involving a particular key x is less than ................... (1) 1 (2) 1/n (3) 1/m (4) n/m

Last Answer : Answer: 1

A group of bits that tell the computer to perform a specific operation is known as_______ A. Instruction code B. Micro-operation C. Accumulator D. Register

Description : A group of bits that tell the computer to perform a specific operation is known as_______ A. Instruction code B. Micro-operation C. Accumulator D. Register

Last Answer : A. Instruction code

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

compiler optimization, operator strength reduction uses mathematical identities to replace slow math operations with faster operations. Which of the following code replacements is an illustration of operator strength reduction? (A) Replace P + P by 2 * P or Replace 3 + 4 by 7. (B) Replace P * 32 by P<<5 (C) Replace P * 0 by 0 (D) Replace (P<<4) – P by P * 15

Description : compiler optimization, operator strength reduction uses mathematical identities to replace slow math operations with faster operations. Which of the following code replacements is an illustration of operator strength reduction? (A) Replace P + ... * P or Replace 3 + 4 by 7. (B) Replace P * 32 by P

Last Answer : (B) Replace P * 32 by P

In the international standard ASCII encoding, each character needs 7 bits of storage; however, in an ASCII string one byte (8 bits) is usually used for each character. Explain why this is done?

Description : In the international standard ASCII encoding, each character needs 7 bits of storage; however, in an ASCII string one byte (8 bits) is usually used for each character. Explain why this is done?

Last Answer : Welcome to ask-public. I don’t want to do your homework for you, but I will get you started. The extra bit is called a parity bit. If you don’t know what that means, you can do some Web searching to learn more. If you are still stuck, I can explain further.

The compiler converts all operands upto the type of the largest operand is called (A) Type Promotion (B) Type Evaluation (C) Type Conversion (D) Type Declaration

Description : The compiler converts all operands upto the type of the largest operand is called (A) Type Promotion (B) Type Evaluation (C) Type Conversion (D) Type Declaration

Last Answer : (A) Type Promotion 

The instruction set can have variable-length instruction format primarily due to: a. Varying number of operands b. Varying length of opcodes in some CPU ce. Both d. None

Description : The instruction set can have variable-length instruction format primarily due to: a. Varying number of operands b. Varying length of opcodes in some CPU ce. Both d. None

Last Answer : ce. Both

Which of the following is the most efficient to perform arithmetic operations on the numbers? (A) Sign-magnitude (B) 1’s complement (C) 2’s complement (D) 9’s complement

Description : Which of the following is the most efficient to perform arithmetic operations on the numbers? (A) Sign-magnitude (B) 1’s complement (C) 2’s complement (D) 9’s complement

Last Answer : (C) 2’s complement

A cantilever beam of span 3m carries a point load 100 N at the free end. The maximum B.M in the beam will be (a) 100 N-m (b) 300 N-m (c) 150 N-m (d) 600 N-m

Description : A cantilever beam of span 3m carries a point load 100 N at the free end. The maximum B.M in the beam will be (a) 100 N-m (b) 300 N-m (c) 150 N-m (d) 600 N-m

Last Answer : (b) 300 N-m

Station A uses 32 byte packets to transmit messages to station B using sliding window protocol. The round trip delay between A and B is 40 milli seconds and the bottleneck bandwidth on the path between A and B is 64 kbps. The optimal window size of A is (1) 20 (2) 10 (3) 30 (4) 40

Description : Station A uses 32 byte packets to transmit messages to station B using sliding window protocol. The round trip delay between A and B is 40 milli seconds and the bottleneck bandwidth on the path between A and B is 64 kbps. The optimal window size of A is (1) 20 (2) 10 (3) 30 (4) 40

Last Answer : (2) 10

Consider the fractional knapsack instance n = 4, (p1, p2, p3, p4) = (10, 10, 12, 18), (w1, w2, w3, w4) = (2, 4, 6, 9) and M = 15. The maximum profit is given by (Assume p and w denotes profit and weight of objects respectively) (A) 40 (B) 38 (C) 32 (D) 30

Description : Consider the fractional knapsack instance n = 4, (p1, p2, p3, p4) = (10, 10, 12, 18), (w1, w2, w3, w4) = (2, 4, 6, 9) and M = 15. The maximum profit is given by (Assume p and w denotes profit and weight of objects respectively) (A) 40 (B) 38 (C) 32 (D) 30

Last Answer : (B) 38

What is the control unit's function in the CPU? a. To transfer data to primary storage b. to store program instruction c. to perform logic operations d. to decode program instruction

Description : What is the control unit's function in the CPU? a. To transfer data to primary storage b. to store program instruction c. to perform logic operations d. to decode program instruction

Last Answer : b. to store program instruction

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

Four bits are used for packed sequence numbering in a sliding window protocol used in a computer network. What is the maximum window size ? (A) 4 (B) 8 (C) 15 (D) 16

Description : Four bits are used for packed sequence numbering in a sliding window protocol used in a computer network. What is the maximum window size ?  (A) 4 (B) 8 (C) 15 (D) 16

Last Answer : (C) 15 

For the 8-bit word 00111001, the check bits stored with it would be 0111. Suppose when the word is read from memory, the check bits are calculated to be 1101. What is the data word that was read from memory? (A) 10011001 (B) 00011001 (C) 00111000 (D) 11000110

Description : For the 8-bit word 00111001, the check bits stored with it would be 0111. Suppose when the word is read from memory, the check bits are calculated to be 1101. What is the data word that was read from memory? (A) 10011001 (B) 00011001 (C) 00111000 (D) 11000110

Last Answer : (B) 00011001

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 advantage of ............... is that it can reference memory without paying the price of having a full memory address in the instruction. (A) Direct addressing (B) Indexed addressing (C) Register addressing (D) Register Indirect addressing

Description : The advantage of ............... is that it can reference memory without paying the price of having a full memory address in the instruction. (A) Direct addressing (B) Indexed addressing (C) Register addressing (D) Register Indirect addressing

Last Answer : (D) Register Indirect addressing

Which instruction are 32 bits long , with extra 16 bits. a. Memory reference instruction b. Memory reference format c. Both d. None of these

Description : Which instruction are 32 bits long , with extra 16 bits. a. Memory reference instruction b. Memory reference format c. Both d. None of these

Last Answer : a. Memory reference instruction

What type of memory is not directly addressable by the CPU and requires special softw3are called EMS (expanded memory specification)? A) Extended B) Expanded C) Base D) Conventional

Description : What type of memory is not directly addressable by the CPU and requires special softw3are called EMS (expanded memory specification)? A) Extended B) Expanded C) Base D) Conventional

Last Answer : Answer : B

Control memory is part of __ that has addressable storage registers and used as temporary storage for data. a. ROM b. RAM c. CPU d. Memory

Description : Control memory is part of __ that has addressable storage registers and used as temporary storage for data. a. ROM b. RAM c. CPU d. Memory

Last Answer : b. RAM

What type of memory is not directly addressable by the CPU and requires special softw3are called EMS (expanded memory specification)? a. Extended b. Expanded c. Base d. Conventional

Description : What type of memory is not directly addressable by the CPU and requires special softw3are called EMS (expanded memory specification)? a. Extended b. Expanded c. Base d. Conventional

Last Answer : b. Expanded

What type of memory is not directly addressable by the CPU and requires special softw3are called EMS (expanded memory specification)? a. Extended b. Expanded c. Base d. Conventional

Description : What type of memory is not directly addressable by the CPU and requires special softw3are called EMS (expanded memory specification)? a. Extended b. Expanded c. Base d. Conventional

Last Answer : b. Expanded

In IT, associative memory is called as (1) Virtual memory (2) Cache memory (3) Content addressable memory (4) Main memory

Description : In IT, associative memory is called as (1) Virtual memory (2) Cache memory (3) Content addressable memory (4) Main memory

Last Answer : Content addressable memory

Which of the following is used for very high speed searching applications ? (1) Flash Memory (2) Content-addressable Memory (3) Dynamic Random Access Memory (4) Static Random Access Memory

Description : Which of the following is used for very high speed searching applications ? (1) Flash Memory (2) Content-addressable Memory (3) Dynamic Random Access Memory (4) Static Random Access Memory

Last Answer : Content-addressable Memory

Given the symbols A, B, C, D, E, F, G and H with the probabilities 1/30, 1/30, 1/30, 2/30, 3/30, 5/30, 5/30 and 12/30 respectively. The average Huffman code size in bits per symbol is: (A) 67/30 (B) 70/34 (C) 76/30 (D) 78/30

Description : Given the symbols A, B, C, D, E, F, G and H with the probabilities 1/30, 1/30, 1/30, 2/30, 3/30, 5/30, 5/30 and 12/30 respectively. The average Huffman code size in bits per symbol is: (A) 67/30 (B) 70/34 (C) 76/30 (D) 78/30

Last Answer : (C) 76/30

Match the following. a) Completeness i) How long does it take to find a solution b) Time Complexity ii) How much memory need to perform the search. c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in one. A) a-iii, b-ii, c-i B) a-i, b-ii, c-iii C) a-iii, b-i, c-ii D) a-i, b-iii, c-ii

Description : Match the following. a) Completeness i) How long does it take to find a solution b) Time Complexity ii) How much memory need to perform the search. c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in ... , b-ii, c-iii C) a-iii, b-i, c-ii D) a-i, b-iii, c-ii

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

In a Computer a byte generally consists of: (A) 4 bits (B) 8 bits (C) 16 bits (D) 10 bits

Description : In a Computer a byte generally consists of: (A) 4 bits (B) 8 bits (C) 16 bits (D) 10 bits

Last Answer : (B) 8 bits

specify where to get the source and destination operands for the operation specified by the a. Operand fields and opcode b. Opcode and operand c. Source and destination d. Cpu and memory

Description : specify where to get the source and destination operands for the operation specified by the a. Operand fields and opcode b. Opcode and operand c. Source and destination d. Cpu and memory

Last Answer : a. Operand fields and opcode

The source/destination of operands can be the_ or one of the general-purpose register: a. Memory b. One c. both d. None of these

Description : The source/destination of operands can be the_ or one of the general-purpose register: a. Memory b. One c. both d. None of these

Last Answer : a. Memory

What is the store by register: a. data b. operands c. memory d. None of these

Description : What is the store by register: a. data b. operands c. memory d. None of these

Last Answer : a. data

Registers which are partially visible to users and used to hold conditional codes (bits set by the CPU hardware as the result of operations), are known as A) PC B) Flags C) Memory Address Registers D) General Purpose Registers

Description : Registers which are partially visible to users and used to hold conditional codes (bits set by the CPU hardware as the result of operations), are known as A) PC B) Flags C) Memory Address Registers D) General Purpose Registers

Last Answer : Answer : B

Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case. (1) O(1) (2) O(log n) (3) O(n) (4) O(n log n)

Description : Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case. (1) O(1) (2) O(log n) (3) O(n) (4) O(n log n)

Last Answer : (2) O(log n) 

A cantilever of length 3m carries a uniformly distributed load of 15KN/m over a length of 2m from the free end.If I= 108 mm4 and E= 2×105 N/mm2,find the slope at the free end? a.0.00326 rad b.0.00578 rad c.0.00677 rad d.0.00786 rad

Description : A cantilever of length 3m carries a uniformly distributed load of 15KN/m over a length of 2m from the free end.If I= 108 mm4 and E= 2×105 N/mm2,find the slope at the free end? a.0.00326 rad b.0.00578 rad c.0.00677 rad d.0.00786 rad

Last Answer : a.0.00326 rad

………. Costs for a computer based information system include the salaries of the system analysts and computer programmers. ………… costs for a computer based information system include the salaries of the computer operator and other data processing personnel. A) Development, Development B) Development, Operating C) Operating, Development C) Operating, Operating

Description : . Costs for a computer based information system include the salaries of the system analysts and computer programmers. costs for a computer based information system include the ... ) Development, Development B) Development, Operating C) Operating, Development C) Operating, Operating

Last Answer : B) Development, Operating

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

The .................. and .................... classes are abstract classes that support reading and writing of byte streams. A) reader, writer B) inputstream, outputstream C) objectinputstream, objectoutputstream D) none

Description : The .................. and .................... classes are abstract classes that support reading and writing of byte streams. A) reader, writer B) inputstream, outputstream C) objectinputstream, objectoutputstream D) none

Last Answer : B) inputstream, outputstream

The .................. and .................... classes are abstract classes that support reading and writing of byte streams. A) reader, writer B) inputstream, outputstream C) objectinputstream, objectoutputstream D) none

Description : The .................. and .................... classes are abstract classes that support reading and writing of byte streams. A) reader, writer B) inputstream, outputstream C) objectinputstream, objectoutputstream D) none

Last Answer : B) inputstream, outputstream

Which of the following is not the java primitive type A) Byte B) Float C) Character D) Long double

Description : Which of the following is not the java primitive type A) Byte B) Float C) Character D) Long double

Last Answer : D) Long double

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.