

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Main points of this past exam are: Cache Memory, Virtual Memory, De Morgan, Truth Tables, Derive, Boolean Expression, Minimal Boolean, Error Detection, Arithmetic,, Complement Representation
Typology: Exams
1 / 3
This page cannot be seen from the preview
Don't miss anything!


Semester 1 Examinations 2008/
Module Code: COMH
School: School of Computing & Mathematics
Programme Title: Higher Certificate in Science in Computing in Information Technology Support – Stage 1 & ACCS Bachelor of Science in Computing – Stage 1 Higher Certificate in Science in Computing - Stage 1 Bachelor of Science (Honours) in Software Development & Computer Networking - Stage 1 Bachelor of Science (Honours) in Software Development - Stage 1
Programme Code: KITSU_6_Y1, KITSE_6_Y1, KCOMP_7_Y1, KCOME_6_Y1, KDNET_8_Y1, KSDEV_8_Y
External Examiner(s): Mr. A. O Leary Internal Examiner(s): Mr. D. Long, Mr. S. Lankford, Mr. J. McEnery
Instructions: Answer Question 1 and TWO other questions.
Duration: 2 HOURS
Sitting: Winter 2008
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 what is meant by cache memory. (7 marks)
b) Explain the term “Virtual Memory”. (7 marks)
c) Using truth tables, prove the following theorems of De Morgan:
i. x. y = x + y
ii. x. + y = x. y (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 1 0 1 0 1 0 1 1 X 1 0 0 0 1 0 1 0 1 1 0 X 1 1 1 1 (7 marks)
e) Compare hamming codes with parity as a means of error detection. Which form of error detection is better and why? (6 marks)
f) Perform the following arithmetic, using 8 bits and using two’s complement representation: 26 - 14 (6 marks)
[40 marks]