Logic Systems N4 — Document

April 2020 — N4 — Logic Systems

N4 2020 Nated Engineering

↓ Download PDF 📄 222.7 KB

Preparing document

📋 Document Analysis

🎯 100 marks ⏱️ 3h 📄 5 pages 📝 31 items found

See full analysis

Questions — A Preview of What to Expect in the Document

This section provides a quick preview of questions from the document. It may not display every question or the complete wording of each one. For the full content, including diagrams, tables and other information, view the original PDF above.

Q1— Section header —

1.1Write down the symbols of the octal number system. (1\

1.2What is the deci mal value of a binary 1 in the second position to the right of the radix comma?

1.3Write down the biggest symbol in the hexadecimal number system. (1\

1.4Determine the two's complement of (2\

1.5Which one of the SYNCHRONOUS or ASYNCHRONOUS binary counter uses the output from the previous flip flop to clock the next one?

1.6How many select lines are needed for a 4 1 multiplexer? (1\

1.7State the main difference between a full adder and a half adder. (1\

1.8Explain small scale integration (2\

1.9Simplify each Boolean expression below

1.9.1(AA\+BB

1.9.2AC+1A

1.9.3BCD+BBCD

1.9.4AB+ABA (4 (4\

1.10Determine the simplest Boolean exp ression for each Karnaugh map iven below. Redraw each map in the ANSWER BOOK and show the groupings.

1.10.3(3 (6\ [20]20

Q2— Section header —

2.1Convert each of the numbers below to their BINARY e quivalent and then complete the calculati ons in the binary number system. Show all conversions.

2.1.1168 B7,A-73,6 Use two's complement subtraction. C onvert the final answer to the octal system.

2.1.21016 213,45A,B Convert the final ans wer to the hexadecimal system.

2.1.3810 745,14,25 Convert the final answer to the decimal system (3 (18\ What does ASCII stand for? (2\

Q3— Section header —

3.1Draw the circuit diagram of the Boolean expression below. Do not change or simplify the expression:

3.1.1F=[(AB\C]A(ABAC\ (6\

3.1.2F=ABC(ABC\ (4\

3.1.3F=ABABABC (5\

3.2Simplify the Boolean expressions below by using Boolean laws. Draw the simplified circuit diagrams by using NAND gates only.

3.2.1F=A(ABC\ABC\ABC\

3.2.2F=ABABCBC (2 (10\ [25]25

Q4— Section header —

Q5— Section header —

Mark Allocation

Total100 marks

Sections20 + 25 + 25 + 10 = 80 marks

Paper information

TitleDocument

SubjectLogic Systems

LevelN4

Document typeQuestion paper

Year2020

MonthApril

Pages5

Downloads2

Examination context

Decade2020s

Years ago6y

SeasonAutumn (SH)

Start dayWednesday

Exam periodApril 2020

Days since exam2,383

About Logic Systems examination preparation

This TVET examination resource can be used as part of a structured revision programme. Past papers are most useful when learners attempt questions independently, work within a realistic time limit, and review their answers afterwards.

How to use this resource for revision

A TVET past examination paper is most useful when it is treated as an active revision exercise. Try the questions yourself before checking the corresponding memorandum. Where you make an error, identify the reason — was it a knowledge gap, a calculation mistake, an interpretation issue, or an examination technique problem?

For stronger examination practice, complete the paper without unnecessary interruptions and keep track of the questions that take the most time. Afterwards, review the memorandum and separate knowledge gaps from mistakes caused by interpretation, calculation, structure, or examination technique.

understanding question requirements

applying subject knowledge

working under time constraints

checking answers

identifying revision priorities

A practical revision approach

Start by completing the resource without looking at the memorandum. Review incorrect and incomplete answers afterwards and make a short revision list based on the areas that caused difficulty.

File details

File size222.7 KB

Pages5

Archived on8 September 2026

File age46d

ContributorFreeMode

FingerprintA3066642B06D

Questions and learner discussion

No questions or discussions have been posted yet.