Computer Science (9-1) - 0984 CIE

Boolean Logic

Gbogbo ọrọ náà

Deep inside every processor, decisions are made by tiny circuits that know only true and false, 1 and 0. These are logic gates, and by wiring them together a computer can add, compare and choose. Learn the handful of gates and you can read the logic of any digital circuit and predict exactly what it will output.

In this lesson you will recognise the standard symbol for each gate, learn precisely when each one outputs a 1, and then move between the three ways of describing logic: a problem in words, a logic expression, and a truth table. You will build a circuit, complete its truth table, and write the matching expression.

Ebumnobi

1 Identify and use the standard symbols for logic gates
2 Define and understand the functions of logic gates
3 (a) Use logic gates to create given logic circuits from a: (i) problem statement (ii) logic expression (iii) truth table (b) Complete a truth table from a: (i) problem statement (ii) logic expression (iii) logic circuit (c) Write a logic expression from a: (i) problem statement (ii) logic circuit (iii) truth table

Nkuzi Olu

Gee ntị na nkuzi a na ngwa

Maapụ uche

E seela isiokwu a ka ị hụ otu echiche si ejikọta.

Mepee maapụ uche na ngwa

Kaadị ncheta

Omume ncheta ngwa ngwa n'ihe a na-anwale n'isiokwu a.

Mee omume kaadị ndị a na ngwa

Akwụkwọ Ọmụmụ

Computers are built from millions of logic gates. Each gate takes one or more binary inputs and produces a single binary output, following a fixed rule. The system is called Boolean logic because every value is one of just two states, true or false (1 or 0). Logic questions ask you to move confidently between a problem in words, a logic expression, a circuit and a truth table, so knowing each gate cold is essential.

Ndetu Nkuzi Zuru Ezu di na Ngwa Green Bridge

Nweta ngwa Green Bridge CBT na ekwenti gi ma o bu kompiuta maka ulo akwukwo IGCSE zuru oke: akwukwo ule ndi gara aga, usoro nyocha, eserese uche, kaadi omumu na nkuzi olu.

Akwụkwọ ndụmọdụ zuru oke nwere eserese

Onye inyeaka mmụta AI

Ule nnwale nwere oge a na-ahazi ozugbo i mechara

Budata ngwa ekwentị Budata ngwa kọmputa

Ọ dị na Android, Windows, macOS, na Linux Ngwa iOS na-abia n'oge na-adighi anya

Nnyocha Ọmụmụ

Ekele diri gi maka imecha ihe karịrị na Boolean Logic. Ugbu a na ị na-enyochakwa isi echiche na echiche ndị dị mkpa, ọ bụ oge iji nwalee ihe ị ma. Ngwa a na-enye ụdị ajụjụ ọmụmụ dị iche iche emebere iji kwado nghọta gị wee nyere gị aka ịmata otú ị ghọtara ihe ndị a kụziri.

Ị ga-ahụ ngwakọta nke ụdị ajụjụ dị iche iche, gụnyere ajụjụ chọrọ ịhọrọ otu n’ime ọtụtụ azịza, ajụjụ chọrọ mkpirisi azịza, na ajụjụ ede ede. A na-arụpụta ajụjụ ọ bụla nke ọma iji nwalee akụkụ dị iche iche nke ihe ọmụma gị na nkà nke ịtụgharị uche.

Jiri akụkụ a nke nyocha ka ohere iji kụziere ihe ị matara banyere isiokwu ahụ ma chọpụta ebe ọ bụla ị nwere ike ịchọ ọmụmụ ihe ọzọ. Ekwela ka nsogbu ọ bụla ị na-eche ihu mee ka ị daa mba; kama, lee ha anya dị ka ohere maka ịzụlite onwe gị na imeziwanye.

Which gate outputs 1 only when both inputs are 1? A. OR B. AND C. NOR D. XOR Answer: B
Which gate outputs 1 only when the two inputs are different? A. AND B. NAND C. XOR D. NOR Answer: C
A NOR gate outputs 1 when: A. both inputs are 1 B. either input is 1 C. both inputs are 0 D. the inputs differ Answer: C
The logic expression A.B represents which gate? A. OR B. AND C. NOT D. XOR Answer: B
How many rows are needed in a truth table for a circuit with two inputs? A. 2 B. 3 C. 4 D. 8 Answer: C

Rue ajuju ndi a n'ime ngwa ahu