Skip to main content

Back to the full dot-point answer

WalesComputer ScienceQuick questions

Unit 3 Programming and System Development

Quick questions on Programs and logical operations: Karnaugh maps and program construction - WJEC A-Level Computer Science

5short Q&A pairs drawn directly from our worked dot-point answer. For full context and worked exam questions, read the parent dot-point page.

What are karnaugh maps?
Show answer
The map works because two adjacent cells differing in one variable means that variable can be true or false without affecting the output, so it drops out. Larger groups eliminate more variables, so always form the largest legal groups.
What are constructing programs?
Show answer
Programs are built from the three constructs (sequence, selection, iteration) and decomposed into procedures and functions, exactly as in Unit 1 but applied to more demanding problems. Readable structure, sensible identifiers and modular design make a program correct and maintainable.
What is not making groups as large as possible?
Show answer
A larger group eliminates more variables and gives a simpler result; settling for small groups leaves the expression un-minimised.
What is q1?
Show answer
State the only group sizes allowed when grouping 1s on a Karnaugh map. [1 mark]
What is q2?
Show answer
In a Karnaugh-map group, which variables are eliminated? [1 mark]

Have a question we have not covered?

This dot-point answer is short enough that we have not extracted many short questions yet. Read the full dot-point answer or ask Mo, our study assistant, in the chat for follow ups.

All Computer ScienceQ&A pages