Complement Number System - Computer Architecture - Past Exam, Exams of Computer Architecture and Organization

Main points of this past exam are: Operating System, Microsoft Word, Virtual Memory, De Morgan, Truth Tables, Minimal Boolean Expression, K-Map, Handle, Complement Representation, Arithmetic

Typology: Exams

2012/2013

Uploaded on 03/27/2013

kiran
kiran 🇮🇳

3.6

(10)

107 documents

1 / 4

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CORK INSTITUTE OF TECHNOLOGY
INSTITIÚID TEICNEOLAÍOCHTA CHORCAÍ
Semester 1 Examinations 2010/11
Module Title: Computer Architecture
Module Code: COMH6002
School: Computing
Programme Title: Higher Certificate in Science in Computing in Information Technology Support
Bachelor of Science in IT Management
Bachelor of Science in Computing
Bachelor of Science in Software Development
Bachelor of Science in Software Development with Computer Networking
Bachelor of Science (Honours) in WEB Development
Programme Code: KITSU_6_Y1
KITMN_8_Y1
KCOMP_7_Y1
KSDEV_8_Y1
KDNET_8_Y1
KWEBD_8_Y1
External Examiner(s): Mr. A .O’Leary
Internal Examiner(s): Mr. S. Lankford
Dr. J. Creagh
Mr. D. Long
Mr. J. McInerney
Instructions: Answer Question 1 and TWO other questions.
Duration: 2 Hours
Sitting: Autumn 2011
Requirements for this examination: Answer Question 1 and TWO other questions.
Note to Candidates: Please check the Programme Title and the Module Title to ensure that you have received the correct
examination paper.
If in doubt please contact an Invigilator.
pf3
pf4

Partial preview of the text

Download Complement Number System - Computer Architecture - Past Exam and more Exams Computer Architecture and Organization in PDF only on Docsity!

CORK INSTITUTE OF TECHNOLOGY

INSTITIÚID TEICNEOLAÍOCHTA CHORCAÍ

Semester 1 Examinations 2010/

Module Title: Computer Architecture

Module Code: COMH

School: Computing

Programme Title: Higher Certificate in Science in Computing in Information Technology Support Bachelor of Science in IT Management Bachelor of Science in Computing Bachelor of Science in Software Development Bachelor of Science in Software Development with Computer Networking Bachelor of Science (Honours) in WEB Development

Programme Code: KITSU_6_Y KITMN_8_Y KCOMP_7_Y KSDEV_8_Y KDNET_8_Y KWEBD_8_Y

External Examiner(s): Mr. A .O’Leary Internal Examiner(s): Mr. S. Lankford Dr. J. Creagh Mr. D. Long Mr. J. McInerney

Instructions: Answer Question 1 and TWO other questions.

Duration: 2 Hours

Sitting: Autumn 2011

Requirements for this examination: Answer Question 1 and TWO other questions.

Note to Candidates: Please check the Programme Title and the Module Title to ensure that you have received the correct examination paper. If in doubt please contact an Invigilator.

a) Describe the interactions between the different parts of the operating system and an application such as Microsoft Word when a user edits a letter. (7 marks)

b) Describe what is meant by virtual memory and where can it be found? (7 marks)

c) Using truth tables, prove the following theorems of De Morgan.

i. ABA. B ii. A. BAB (7 marks)

d) Using a K-map, derive the minimal Boolean expression for the following truth table:

A B C Output 0 0 0 X 0 0 1 0 0 1 0 0 0 1 1 X 1 0 0 0 1 0 1 0 1 1 0 X 1 1 1 1 (7 marks)

e) What is meant by the term Overflow when talking about One's and Two’s complement as a means of representing integers. Do computers handle this problem well? (6 marks)

f) Perform the following arithmetic, using 8 bits and using One’s complement representation:

  • 24 - 16 (6 marks)

a) Convert the Hexadecimal code, FFE 16 , into its corresponding Decimal value (4 marks)

b) i) Convert the following from Hexadecimal to Binary: B7 16 (3 marks) ii) Convert the following Decimal to BCD code: 1310 (3 marks)

c) What are Grey codes and when are they used? (4 marks)

d) What is the range of numbers, using n bits, in Signed Magnitude representation? (3 marks)

e) In computer systems, why is the 2s complement number system preferred over the Sign and Magnitude number system? (3 marks)

f) Assume the following 32-bit floating-point representation:

Using this format, code the following in floating point format: -6.125 (10 marks)

sign bit of mantissa 8 bit exponent in two’s complement 23 bit mantissa