0% found this document useful (0 votes)
26 views2 pages

A2 CS Past Paper 3 Y21-24 - 176

The document includes a logic circuit with a truth table that needs to be completed, along with a Boolean expression derived from the circuit. It also involves filling out a Karnaugh map and simplifying the expression. Additionally, it discusses direct access methods for locating records in sequential and random files.

Uploaded by

shawnchang2007
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
26 views2 pages

A2 CS Past Paper 3 Y21-24 - 176

The document includes a logic circuit with a truth table that needs to be completed, along with a Boolean expression derived from the circuit. It also involves filling out a Karnaugh map and simplifying the expression. Additionally, it discusses direct access methods for locating records in sequential and random files.

Uploaded by

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

7

6 The diagram shows a logic circuit.

P
A
S

Q
B Z

T
R
C

(a) Complete the truth table for the given logic circuit.
Show your working.

Working space
A B C P Q R S T Z
0 0 0 1 1 1 1 1 0

0 0 1 1 1 0 1 0 1
0 1 0 1 0 1 1 0 1
0 1 1
1 0 0 1 0 1
1 0 0 0 1 1 0 0 0

1 0 1 0 1 0 1 0 1
1 1 0 0 0 1 1 0 1
1 1 1
0 0 0 1 0 1
[3]

(b) Write the Boolean expression that corresponds to the logic circuit as a sum-of-products.
A'B'C + A'BC' + A'BC + AB'C + ABC' + ABC
Z = ............................................................................................................................................
= B'C + BC' + BC = B + C
...................................................................................................................................................

...................................................................................................................................................

............................................................................................................................................. [2]

© UCLES 2024 9618/32/M/J/24 [Turn over


(c) (i) Complete the Karnaugh map (K-map) for this Boolean expression:
–– – – – – –– –
A.B.C + A.B.C + A.B.C + A.B.C + A.B.C + A.B.C

BC
A 00 01 11 10

0 1 0 1 1

1 1 0 1 1
[2]

(ii) Draw loop(s) around appropriate group(s) in the K-map to produce an optimal
sum-of-products. [2]

(iii) Write the Boolean expression from your answer to part c(ii) as a simplified
sum-of-products.
B + C'
...........................................................................................................................................

..................................................................................................................................... [1]

7 (a) Outline what is meant by direct access as a method of file access.


The target record can be found without reading other records. The location of the record is
...................................................................................................................................................
calculated using its key value and hashing function
...................................................................................................................................................

...................................................................................................................................................

............................................................................................................................................. [2]

(b) Explain how direct access is used to locate a specific record in sequential files and random
files.
A index is stored for key values of all records in the file. The index is
(i) Sequential files ..................................................................................................................
searched so the location of the target record in the file can be found
...........................................................................................................................................

...........................................................................................................................................

..................................................................................................................................... [2]

(ii) A hashing function uses the key value of the target record to find the expected
Random files .....................................................................................................................
address of the target record.
...........................................................................................................................................

...........................................................................................................................................

..................................................................................................................................... [2]

© UCLES 2024 9618/32/M/J/24

You might also like