0% found this document useful (0 votes)
144 views

COA Sessional - II - 2018 With Solutions

This document contains a sessional exam from Ambala College of Engineering and Applied Research for the course Computer Organization and Architecture. It includes 4 questions asking students to: 1) Analyze the format of an instruction word in a computer's memory and draw the timing diagram for a control signal. 2) Analyze the control memory and multiplexers used in a microprogrammed computer. 3) Convert arithmetic expressions to reverse polish notation. 4) Explain microinstruction sequencing, determine the clock cycles for tasks in a pipeline, and draw a time space diagram for a pipeline processing tasks.

Uploaded by

poonam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
144 views

COA Sessional - II - 2018 With Solutions

This document contains a sessional exam from Ambala College of Engineering and Applied Research for the course Computer Organization and Architecture. It includes 4 questions asking students to: 1) Analyze the format of an instruction word in a computer's memory and draw the timing diagram for a control signal. 2) Analyze the control memory and multiplexers used in a microprogrammed computer. 3) Convert arithmetic expressions to reverse polish notation. 4) Explain microinstruction sequencing, determine the clock cycles for tasks in a pipeline, and draw a time space diagram for a pipeline processing tasks.

Uploaded by

poonam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Ambala College of Engineering and Applied Research (ACE)

Department of Computer Science and Engineering


Sessional II
Course Name: Computer Organization and Architecture
Course Code: CSE-307N
Class/Semester: B. Tech. /5th semester
Time: 1.45 Hr. Max. Marks: 45
Note: Attempt any three questions. All questions carry equal marks.

Q1. (a) A computer has a memory unit with 256K words of 32 bits each. A binary instruction code is
stored in one word of memory. The instruction has four parts; an indirect bit, an operation code, a
register part to specify one of 64 registers and an address part.
i. How many bits are there in the operation code, the register code part, and address part?
ii. Draw the instruction word format and indicate the number of bits in each part?
iii. How many bits are there in data and address inputs of memory?
Ans.

(b) Draw a timing diagram assuming SC is cleared to 0 at Time T3 if control signal C7 is active. i.e.
C7T3: SC0
Ans

Q2. (a) The control memory in a microprogrammed computer has 4096 words of 24 bits each.

i. How many bits are there in the control address register?


ii. How many bits are there in each of the four inputs of the multiplexers used?
iii. What are the number of inputs in each multiplexer and how many multiplexers are needed?
(b) Differentiate between a hardwired control unit and microprogrammed control unit.
Ans

Q3. (a) Convert the following arithmetic expressions into reverse polish notation:
i. (A + B ↑ D) / (E-F) + G
ii. A * (B+D)/ E- F * (G + H / K)
Ans. i. ABD↑+EF-/G+
ii. ABD+*E/FGHK/+*-
(b) What do you mean by microinstruction sequencing? Explain.
Ans.

Q4. (a) Determine the number of clock cycles that it takes to process 200 tasks in a six segment pipeline.
Ans

(b) Draw a time space diagram for a six segment pipeline showing the time it takes to process eight
tasks.
(c) Write a note on vector processing.
Ans.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy