Computers and Technology, 26.11.2019 21:31 saharaapollonio

Consider the following structure of the instruction register.

op code address-1 address-2
6 bits 18 bits 18 bits

a. what is the maximum number of distinct operation codes that can be recognized and executed by the processor on this machine?
b. what is the maximum memory size on this machine (in kb)?
c. how many bytes are required for each operation?

Answers: 1

Show answers

Another question on Computers and Technology

Computers and Technology, 24.06.2019 20:30

Where is permanent data in the computer stored whenever gym starts his laptop he sees some commands in numbers appearing on the screen these instructions are being preceded by the control unit in

Answers: 1

Answer

Computers and Technology, 25.06.2019 06:50

Write a program that will askthe user to enter the amount of a purchase. the program should thencompute the state and county sales tax. assume the state sales tax is4 percent and the county sales tax is 2 percent. the program should displaythe amount of the purchase, the state tax, the county sales tax, the total salestax, and the total of the sale. (which is the sum of theamount of purchase plus the total sales tax). hint: use the value 0.02 torepresent 2 percent, and 0.04 to represent 4 percent.

Answers: 2

Answer

Computers and Technology, 25.06.2019 06:50

A1-megabit computer memory chip contains many 27 ff capacitors. each capacitor has a plate area of 3.09 × 10−11 m 2 . determine the plate separation of such a capacitor (assume an empty parallel-plate configuration). the characteristic atomic diameter is 10−10 m = 1 ˚a, and the permittivity of a vacuum is 8.8542 × 10−12 c 2 /n · m2 . answer in units of ˚a.

Answers: 3

Answer

Computers and Technology, 25.06.2019 10:10

Suppose you and your friend live on the same street d miles away from each other. between your house and your friend’s house there are n motorized scooters positioned at distances x1, x2, . . , xn miles from your house towards your friend’s house. each scooter has a battery that may or may not be fully charged. let’s say that the scooters can take you distances d1, d2, . . , dn miles down the road. each scooter also has a price p1, p2, . . , pn that it takes to activate. any time you encounter another scooter, you may take the new scooter and leave your old scooter behind. there is an additional scooter at your house that you start with and it can go distance d0 miles and it is free to activate: p0 = 0. you wish to go to your friend’s house minimizing the total amount of money spent activating the scooters. design a dynamic programming algorithm that returns the minimum cost to get to your friend’s house using scooters x0, . . , xn.

Answers: 1

Answer

You know the right answer?

Consider the following structure of the instruction register.

op code address-1 address-...

Questions