Scribd
Upload
139 views3 pages

Cape Computer Science Past Paper Project On Module 1 Questions - Computer Architecture

This document contains a past paper project on computer architecture for a CAPE Computer Science module. It includes questions on logic gates, binary counters, and drawing logic gate circuits from given truth tables. Specifically, it asks the student to draw an XOR gate from a truth table, explain how a 4-bit binary counter works and its counting range, design logic gate circuits for two truth tables, and write the truth table for a given logic gate circuit.

Uploaded by

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

Cape Computer Science Past Paper Project On Module 1 Questions - Computer Architecture

This document contains a past paper project on computer architecture for a CAPE Computer Science module. It includes questions on logic gates, binary counters, and drawing logic gate circuits from given truth tables. Specifically, it asks the student to draw an XOR gate from a truth table, explain how a 4-bit binary counter works and its counting range, design logic gate circuits for two truth tables, and write the truth table for a given logic gate circuit.

Uploaded by

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

CAPE COMPUTER SCIENCE PAST PAPER PROJECT ON

MODULE 1 QUESTIONS - COMPUTER ARCHITECTURE

NAME: OCKOURI BARNES


SUBJECT: COMPUTER SCIENCE
TEACHER: MR.F POWELL
THEME: MODULE 1 PAST PAPER QUESTIONS
TOPIC: COMPUTER ARCHITECTURE
LOGIC GATES ASSIGNMENT
[1] Using the truth table below draw the circuit of an exclusive OR gate using the primary logic
gates.

X Y Z
0 0 0
0 1 1
1 0 1
1 1 0

X
Z
Y

[2] Explain how a 4 bit binary counter works specifying the range of values counted.

A four bit counter would require four flip flops and for the counter that would mean two to the

power of N states (2n) which would determine how many counts each flip flop would have. For a

four bit counter the number of states may be (24 = 16) meaning it would have 16 states. A four

bit synchronous up counter start to count from 0 (0000 in binary) and increment

or count upwards to 15 (1111 in binary) and then start new counting cycle by getting reset. 
[3] Using the primary logic gates design and draw the circuit for the truth table below.

X Y Z
0 0 1
0 1 1
1 0 0
1 1 0

X
Z

[4] Write down the truth table (i.e. list all the possible input bit patterns and their corresponding
outputs) for the circuit below.

P
Q

TRUTH TABLE
P Q R (P,Q)
0 0 0
0 1 0
1 0 0
1 1 0

You might also like