Scribd
Upload
43 views3 pages

DIT Level 1 Computer Systems Architecture I - June Final Examination 2016

The document outlines the instructions and questions for a computer systems architecture exam. It includes 7 questions testing knowledge of computer components, binary arithmetic, 2's complement, K-maps, Boolean algebra, and logic circuit design.

Uploaded by

danielchewe083
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
43 views3 pages

DIT Level 1 Computer Systems Architecture I - June Final Examination 2016

The document outlines the instructions and questions for a computer systems architecture exam. It includes 7 questions testing knowledge of computer components, binary arithmetic, 2's complement, K-maps, Boolean algebra, and logic circuit design.

Uploaded by

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

DEPARTMENT OF BUSINESS STUDIES

COMPUTER STUDIES SECTION

DIPLOMA IN INFORMATION TECHNOLOGY

CERTIFICATE (LEVEL 1) LOCAL

COMPUTER SYSTEMS ARCHITECTURE I

DECEMBER END OF SEMESTER FINAL EXAMINATION - 2016

Time Allowed : 3 Hours


Marks Obtainable : 100%
Pass Mark : 50%
Date : Thursday, 23rd June 2016
Time : 09:00 Hrs.

INSTRUCTIONS TO CANDIDATES

1. Write your particulars on the answer booklet clearly


2. There are Seven (7) questions in this paper.
3. Attempt any Five (5) questions.
4. All questions carry Equal marks.
5. TRY NOT to spend more than 35 minutes per question
6. Cellular Phones and Programmable Calculators are not allowed in the examination
room.
DO NOT TURN THIS PAGE UNTIL YOU ARE TOLD TO DO SO.
QUESTION ONE

a) Define the term Computer System (2 marks)


b) State the Five (5) components of a Computer System (5 marks)
c) Describe the difference between RAM and ROM (5 marks)
d) With the aid of relevant examples, Describe the following;
i) Processor (4 marks)
ii) Storage (4 marks)
(Total 20 Marks)
QUESTION TWO

a) Perform the following computer arithmetic;


i) 1110112 + 1100102 (3 marks)
ii) 1010002 - 1011112 (3 marks)
iii) 54138 + 36718 (3 marks)
iv) 60028 – 51368 (3 marks)
v) D01F16 + AB7216 (3 marks)
vi) EA6316 – 8DF716 (3 marks)
b) Explain the term “Volatility” with reference to memory (2 marks)
(Total 20 Marks)
QUESTION THREE

a) Use 2’s complement arithmetic to add the following pairs of numbers;


i) 25 and 12 (5 marks)
ii) 37 and -24 (5 marks)
iii) -48 and 23 (5 marks)
b) Memory locations in personal computers are usually given in Hexadecimal. If a computer
programmer writes a program with Four Classes, with each class requiring 20210, 17510,
22210 and 75910 memory locations respectively, determine the last memory location that
will be used if the program starts at memory location number 2C8D16. Give the working
and the result in Hexadecimal. (5 marks)
(Total 20 Marks)

QUESTION FOUR

Using K-map techniques, design the logic circuit to implement Function X using NAND logic
Only, given that function X = f (A, B, C, D), and X is a Majority function, meaning that the
output is True only when two or more of the input variables are True otherwise the output is
false for any other combination of the inputs.
(Total 20 Marks)

QUESTION FIVE

a) Define the terms Minterm and Maxterm (4 marks)


b) Describe what a K-map is and state its use. (4 marks)
c) How many Bits are there in 47MB of a data file? (2 marks)
d) Obtain the expression for the following circuit given that the final output is U
(10 marks)
(Total 20 Marks)
QUESTION SIX

a) Prove the following Boolean identities


i) A + A.B + A.B = A + B (4 marks)
ii) A.B.C + A.B.C + A.B.C + A.B.C = A.B + B.C + A.C (4 marks)
iii) X.Y + Y.Z + Y.Z = X.Y + Z (4 marks)
b) Simplify the following Boolean equations
i) X = B ( C ( D + E + C) + F.C) (4 marks)
ii) Y = (B.C.D + C) C.D (4 marks)
(Total 20 Marks)

QUESTION SEVEN

A circuit has four inputs, A, B, C, D, representing the sixteen natural binary integers from
0000 (0) to 1111 (15). A is the most significant bit and D is the least significant bit. The
output of the circuit, F, is true is the input is divisible by a multiple of 4, 5, 6, or 7, with the
exception of 15, in which case the output is false. Zero is not divisible by 4, 5, 6, or 7.

a) Draw the truth table to represent this algorithm (4 marks)


b) Draw the K-map for F and hence obtain the simplified expression for F. (4 marks)
c) Draw the simplified circuit F using AND-OR-NOT logic. (2 marks)
d) Convert F into NAND Logic Only and draw the resultant circuit. (5 marks)
e) Convert F into NOR Logic Only and draw the resultant circuit. (5 marks)
(Total 20 Marks)

You might also like