1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
andrezito [222]
2 years ago
5

3. Problem 5. A digital computer has a memory unit with 24 bits per word. The instruction set consists of 150 different operatio

ns. All instructions have an operation code part (opcode) and an address part (allowing for only one address). Each instruction is stored in one word of memory. a. How many bits are needed for the opcode? b. How many bits are left for the address part of the instruction? c. What is the maximum allowable size for memory? d. What is the largest unsigned binary number that can be accommodated in one word of memory?
Computers and Technology
1 answer:
igomit [66]2 years ago
5 0

Answer:

a) 8 bits b) 16 bits. c) 2¹⁶ * 24 bits d) 2²⁴ -1

Explanation:

a) In order to be able to accommodate 150 different instructions, the number of bits needed must be equal to the minimum power of 2 that satisfies this equation:

2n > 150, i.e. n=8.  

b) If the total number of bits for a word is 24, and 8 are used for the op code, there are 16 bits left for the address part.

c) If the address part has 16 bits, this means that the total addressable space is just 2¹⁶, so the maximum allowable size is 2¹⁶ * 24 bits.

d) As we have 24 bits to be filled, the largest unsigned binary number is just 2²⁴ – 1 .

(As we need to leave a position for all zeros).

You might be interested in
A year in the modern Gregorian Calendar consists of 365 days. In reality, the earth takes longer to rotate around the sun. To ac
GREYUIT [131]

Answer:

import java.util.Scanner;

public class LabProgram {

  public static void main(String[] args) {

      Scanner scnr = new Scanner(System.in);

      int inputYear;

      boolean isLeapYear;

      isLeapYear = false;

      inputYear = scnr.nextInt();

      // If a year is divisible by 400,  then it is a leap year

      if (inputYear % 400 == 0)

          isLeapYear = true;

      // If a year is divisible by 100,  then it is not a leap year

      if (inputYear % 100 == 0)

          isLeapYear = false;

      // If a year is divisible by 4,  then it is a leap year

      if (inputYear % 4 == 0)

          isLeapYear = true;

      if(isLeapYear)

          System.out.println(inputYear + " is a leap year.");

      else

          System.out.println(inputYear + " is not a leap year.");

  }

}

Explanation:

  • Take the year as an input from user and store it to inputYear variable.
  • If the year is a century year, check if the year is divisible by 400 ( the year must be evenly divisible by 400 ),  then set the boolean isLeapYear to true. If a year is divisible by 100,  then set the boolean isLeapYear to false. If a year is divisible by 4,  then set the boolean isLeapYear to true.
  • Check if isLeapYear is true, then print that it is a leap year. Otherwise, print that it is not a leap year.

Output:

1712

1712 is a leap year.

4 0
3 years ago
Read 2 more answers
What does the poster exemplify?
zloy xaker [14]

Answer:

try D

Explanation:

8 0
3 years ago
Read 2 more answers
Norman recently joined a team of technicians who work face-to-face. The team members have the expertise and experience needed to
almond37 [142]

Answer:

research and development team

Explanation:

Research and development team is a team in an organization that have the expertise, experience and responsibility to come up with innovative activities that will be undertaken by the corporations or organization in other to develop new services or products, or improve on existing ones.

3 0
3 years ago
Write a program (using functions) starting from directives to compute and display the transpose of a matrix of dimension m x n.
pentagon [3]

Answer:

#include <iostream>

#include <cstdlib>

using namespace std;

int m, n;

void transpose(int matrix[]){

  int transp[m][n];

  for (int i = 0; i < n; i++){

     for (int j = 0; j < m; j++){

        transp[j][i] = matrix[i][j];

        cout<< transp[j][i]<< " ";

     }

     cout<< "\n";

  }

}

int main(){

  cout<< "Enter the value for n: ";

  cin>> n;

  cout>> "Enter the value for m: ";

  cin>> m;

  int mymatrix[n][m];

  for (int i = 0; i < n; i++){

     for (int j = 0; j < m; j++){

        mymatrix[i][j] = (rand() % 50);

     }

  }

  transpose(mymatrix);

}

Explanation:

The C source code defined a void transpose function that accepts a matrix or a two-dimensional array and prints the transpose on the screen. The program gets user input for the row (n) and column (m) length of the arrays. The C standard library function rand() is used to assign random numbers to the array items.

3 0
3 years ago
Algorithm and flowchart:- calculate d=a+b-c​
Keith_Richards [23]

Answer:

a=c

hope it helps

4 0
3 years ago
Other questions:
  • Problem 1 (Authentication): Consider the following authentication protocol, which uses a classical cryptosystem. Alice generates
    5·1 answer
  • To apply the rule of thirds you first? PLZ HURRY AND ANSWER THIS
    5·2 answers
  • How can touch typing quickly but accurately improve your earnings (the money you can make)
    15·2 answers
  • Can somebody help me?
    11·1 answer
  • At what depth does an employer need to use a protection system to ensure the safety of workers in a trench or excavation?
    8·2 answers
  • Do you agree with the EU's decision that people should be able to ask Google to remove search results that contain incorrect, un
    11·2 answers
  • Java-Script Concept quiz:
    6·1 answer
  • Consider the following incomplete method. Method findNext is intended to return the index of the first occurrence of the value v
    15·1 answer
  • An epic games service is unavailable at the moment
    8·1 answer
  • If you want to access your home network from your distant garage, a ________ might help boost the signal.
    15·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!