Scribd
Upload
26 views2 pages

Assignment - CO - Module I

Assignment

Uploaded by

koushal2023
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
26 views2 pages

Assignment - CO - Module I

Assignment

Uploaded by

koushal2023
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/ 2

GLA University, Mathura

Department of Computer Engineering and Applications

Assignment

Subject: Computer Organization


Subject Code: BCSC1005
Submission deadline: 23 September, 2024

1. A software developer is designing a new program that requires frequent access to both
instructions and data during its execution.
How does the Von Neumann architecture facilitate the seamless integration of instructions
and data in a way that enables efficient program execution? Provide specific examples to
illustrate its advantage in programming.

2. Suppose a robotics engineer is working on programming a robot's movement. The robot


can move forward and backward in a grid pattern depending on the control commands. The
robot’s initial position is recorded at the 35th grid in an 8-bit processor. Compute the net
movement of the robot if it follows the following commands.

Command 1: Move the robot forward by +45 units.


Command 2: Move the robot backward by -92 units.

3. An electrical engineer is designing a data acquisition system for a precision measurement


application. The system requires representing a floating-point number in both single and
double precision using the IEEE 754 standard.
In the data acquisition system, the engineer needs to convert the decimal number -87.34 &
+78.213 into IEEE 754 single and double precision hexadecimal notation. Perform the
conversion and provide the resulting hexadecimal representations for both single and
double precision formats.

4. Differentiate
i. Multiplexer and Demultiplexer
ii. Binary adder and CLA
iii. Memory read and Memory write
iv. Full Adder and Full Subtractor

5. Imagine a customer adds multiple items to their shopping cart. How would you use
a stack to manage the cart items efficiently, ensuring that the last item added is the
first one removed when the customer proceeds to checkout? Explain PUSH and
POP operations. Convert the following arithmetic expression into reverse polish
notation (RPN) and show the stack operations for evaluating it.

a) 7 * 5 + (5 + 6) + (4 * 6 + 2)
b) 5 + 10 * 6 + (3 + 5) + 7 * (6 + 2)
c) 8 * 3 + (4 + 8) + (4 * 7 + 2) + 2 + 3
d) (A + B) * C - (D - E) * (F + G)
e) (((110/ (30-8))*50)+5)-((15/(10-5))*2)
(10+3)[2∗3+(3∗9/3)]
f)
6−3+(4∗3)

6. A computer architecture researcher is investigating the efficiency of different


multiplication algorithms for signed numbers. In the research study, the researcher
wants to explore the performance of Booth's algorithm for the multiplication of two
signed numbers represented in 2’s complement. Multiply -9 and -13 using Booth's
algorithm, and store the result in the register.

7. How do eight processor registers of 4-bit each utilize a common bus architecture to
transfer its binary content to the bus? Design the configuration with proper labeling.

8. Write 14-bit control word for the following microoperations:

(i) R1 ← R2 + R3
(ii) R4 ← R4
(iii) R5 ← R5 – 1
(iv) R6 ← Shl R1
(v) R7 ← Input

9. Design a combinational logic to add and subtract two 4-bit binary numbers. Also,
design a logic to indicate the overflow condition.

10. Write a program to evaluate the following arithmetic statement by using three, two,
one and zero address instructions:

(i) A-B+(C+D)/E+F/G+(J*K)
(ii) (A*B+C)+D/E+F*G+I*J

You might also like