Ask Question, Ask an Expert

+1-415-315-9853

info@mywordsolution.com

Ask Computer Engineering Expert

problem 1) Describe the general operation of the following flags.

i) Z(Zero)

ii) C(Carry)

iii) N(Negetive)

iv) V (Overflow)

b) Draw a neat diagram of associative memory organization and describe the function of the following components .with necessary diagrams.

i) input register

ii) mask register

iii) output register

iv) match logic

v) match register

problem 2)a) Describe polled and daisy chain techniques of handling multiple interrupts with neat figures.

b) Consider a typical segment table as shown.

Segment number Segment base address     Segment length

      0                             0D116                    25816

      1                              8FC16                    00E16

The virtual address format is

|------3bits------|------9 bits------|
|--segment------|------offset------|

What are the physical address for the following virtual addresses?

i) 1FE16

ii) 20A16

c) A set associative cache has a total of 64 blocks divided into sets of 4 blocks each. Main memory has 1024 blocks with 16 words per block. How many bits are needed in each of the tag, set and word fields of the main memory address?

d) Suppose a main memory has 4 page frames and initially all page frames are empty. Consider the following stream of references:

1, 2, 3, 4, 5, 1, 2, 6, 1, 2, 3, 4, 5, 6, 5.

Compute the hit ratio using LRU replacement policy.

Computer Engineering, Engineering

  • Category:- Computer Engineering
  • Reference No.:- M96535

Have any Question? 


Related Questions in Computer Engineering

1 devise a plan to compute the cost of computer crime2 what

1. Devise a plan to compute the cost of computer crime. 2. What major crimes would you include in the preceding study? 3. From your study, identify the most expensive attacks. 4. Devise techniques to study the problem of ...

The data in below table lists country code and the order to

The data in below table lists country code and the order to remittance (OTR) time for hardware / software installations for the last 76 installations (from first to last). OTR is the time it takes from an order being pla ...

Assignmentcreate a four slide powerpoint presentation in

Assignment Create a four slide PowerPoint presentation in which you: 1. Slide 1: Insert a title slide including your name, course, quarter, and professor's name. 2. Slide 2: Insert a picture of the person or of something ...

Verify the rsa with crt example in the chapter by computing

Verify the RSA with CRT example in the chapter by computing yd = 15103 mod 143 using the square-and-multiply algorithm.  An RSA encryption scheme has the set-up parameters p = 31 and q = 37. The public key is e = 17. 1. ...

1 again based on 1 above is it possible to continue

1. Again based on 1 above, is it possible to continue operating a sensor network with a selected number of sensors taken out? Is it possible to identify those nodes? 2. Devise ways (some cryptographic) of securing wirele ...

1 what is information extortion describe how such an attack

1. What is information extortion? Describe how such an attack can cause losses, using an example not found in the text. 2. Why do employees constitute one of the greatest threats to information security? 3. What measures ...

1 prove that any file in the dgux system with a link count

1. Prove that any file in the DG/UX system with a link count greater than 1 must have an explicit MAC label. 2. In the DG/UX system, why is the virus prevention region below the user region? 3. In the DG/UX system, why i ...

Give your suggestion on by using an extra table that stored

Give your suggestion on: By using an extra table that stored space positions it would be possible to significantly improve the efficiency of the expansions loop.

Filtering using phase one of the limitations of the

Filtering using phase) One of the limitations of the noise-smoothing linear filters is that their frequency response has zero phase. This means the phase distortions due to noise remain unaffected by these algorithms. To ...

1 in a graph if we know that the shortest path from node a

1. In a graph, if we know that the shortest path from node A to node G is (A → B → E → G), what is the shortest path from node G to node A? 2. Assume the shortest path in a graph from node A to node H is A → B → H. Also ...

  • 4,153,160 Questions Asked
  • 13,132 Experts
  • 2,558,936 Questions Answered

Ask Experts for help!!

Looking for Assignment Help?

Start excelling in your Courses, Get help with Assignment

Write us your full requirement for evaluation and you will receive response within 20 minutes turnaround time.

Ask Now Help with Problems, Get a Best Answer

Section onea in an atwood machine suppose two objects of

SECTION ONE (a) In an Atwood Machine, suppose two objects of unequal mass are hung vertically over a frictionless

Part 1you work in hr for a company that operates a factory

Part 1: You work in HR for a company that operates a factory manufacturing fiberglass. There are several hundred empl

Details on advanced accounting paperthis paper is intended

DETAILS ON ADVANCED ACCOUNTING PAPER This paper is intended for students to apply the theoretical knowledge around ac

Create a provider database and related reports and queries

Create a provider database and related reports and queries to capture contact information for potential PC component pro

Describe what you learned about the impact of economic

Describe what you learned about the impact of economic, social, and demographic trends affecting the US labor environmen