Boolean Logic
Gbogbo ọrọ náà
Underneath every calculation a computer performs there are switches, and each switch can only be open or closed. Out of that one crude ingredient, arranged with enough care, comes arithmetic. This is not a metaphor. A circuit built from three kinds of gate, none of which knows anything about numbers, can be wired so that it adds two binary digits together and produces the right answer every time, and one such circuit appears on the specimen paper for this qualification.
This lesson gives you the three gates the specification examines, NOT, AND and OR, together with their truth tables. You will build truth tables for circuits made of combinations of them, interpret the results to work out what a circuit is actually for, write a Boolean expression that describes a circuit, and go the other way by designing a circuit that implements an expression. Everything here is small, exact and checkable, which makes it some of the most reliably scoreable content in the whole specification.
Ebumnobi
- Construct truth tables for the following logic gates:
- NOT
- AND
- OR. NOT AND OR Construct truth tables for simple logic circuits.
- Interpret the results of simple truth tables. Create, modify and interpret simple logic circuit diagrams.
- Be able to write a Boolean expression to represent a logic circuit and to draw a logic circuit that implements a Boolean expression.
Maapụ uche
E seela isiokwu a ka ị hụ otu echiche si ejikọta.
Mepee maapụ uche na ngwa
Akwụkwọ Ọmụmụ
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.
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 gives an output of 1 only when both of its inputs are 1? A. NOT B. AND C. OR D. None of these Answer: B
- How many rows are needed in a truth table for a logic circuit with three inputs? A. 3 B. 4 C. 6 D. 8 Answer: D
- What is the output of an OR gate when both of its inputs are 0? A. 0 B. 1 C. It depends on the previous input D. The gate has no output Answer: A
- In the notation used by this specification, how is A AND B written? A. A + B B. A with a bar over it C. A and B joined by a dot D. A minus B Answer: C
- A circuit has output Q given by NOT A ANDed with B. What is Q when A = 1 and B = 1? A. 0 B. 1 C. Undefined D. It alternates Answer: A
Rue ajuju ndi a n'ime ngwa ahu
Rue ajuju ndi a n'ime ngwa ahu
Akwụkwọ A Na-atụ Aro
Meecha Ajụjụ Ule Ọmarịcha
Ị chọrọ ime ajụjụ ule ọmarịcha gbasara Boolean Logic? Budata ngwa Green Bridge CBT iji nweta ajụjụ ule ọmarịcha na nyocha zuru ezu gbasara isiokwu a.
Budata Ngwa Ahụ Na Google Playstore
Ihe nile ichoro iji nwee ihe ịga nke ọma na JAMB, WAEC & NECO.
