Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Exam 1 for Practice - Introduction to Computer Architecture I | CS 170, Exams of Computer Architecture and Organization

Exam 1 Material Type: Exam; Professor: Ibrahim; Class: INTRO COMPUTER ARCHITECTURE I; Subject: Computer Science; University: Old Dominion University; Term: Fall 2007;

Typology: Exams

Pre 2010

Uploaded on 10/18/2008

koofers-user-x8l
koofers-user-x8l 🇺🇸

5

(1)

10 documents

1 / 7

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CS 170 - Introduction to Computer Architecture
Sample Test - 1
Date: Tuesday 09/20/2007
Exam Time: 75 minutes
Time: 4:20 PM To 5:35
Please, Show all your work steps.
No Credit will be given if you write the final answer without showing your work
steps.
Question1: (Assume all numbers are unsigned)
a) Convert the following Hex numbers to Octal.
1. ADD
2. 3879
pf3
pf4
pf5

Partial preview of the text

Download Exam 1 for Practice - Introduction to Computer Architecture I | CS 170 and more Exams Computer Architecture and Organization in PDF only on Docsity!

CS 170 - Introduction to Computer Architecture

Sample Test - 1

Date: Tuesday 09/20/

Exam Time: 75 minutes

Time: 4:20 PM To 5:

Please, Show all your work steps. No Credit will be given if you write the final answer without showing your work steps.

Question1: (Assume all numbers are unsigned)

a) Convert the following Hex numbers to Octal.

1. ADD

b) Convert the following Octal numbers to Hex.

Question3: (Assume all numbers are signed) All the binary numbers are in two’s complement representation. (Check the overflow condition and if an overflow occurred just write an overflow occurred and ignore the result)

  1. Add the following binary numbers:

a. 1 1 0 1 0 1

1 0 1 0 1 0

b. 0 1 1 0 0 1

1 0 1 0 1 0

c. 0 1 1 1 0 1

0 0 0 0 1 0

  1. Subtract the following binary numbers:

a. 1 1 1 1 0 1

1 0 0 1 1 0

b. 0 1 0 1 0 0

0 0 1 0 1 0

c. 0 0 0 1 0 1

0 0 1 0 0 0

A ( A + B )+( B + AA )( A + B )=( A ⋅ B )