Boolean Logic
Akopọ
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.
Awọn Afojusun
- 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
Ẹ̀kọ́ Ohùn
Gbọ́ ẹ̀kọ́ yìí nínú áàpù
Àwòrán ọpọlọ
A ti ṣe àwòrán kókó yìí kí o lè rí bí àwọn èrò ṣe so pọ̀.
Ṣí àwòrán ọpọlọ nínú áàpù
Káàdì ìrántí
Ìdánrawò kíákíá lórí ohun tí wọ́n ń dán wò nínú kókó yìí.
Ṣe ìdánrawò káàdì wọ̀nyí nínú áàpù
Akọ̀wé Ẹ̀kọ́
Àkọsílẹ̀ Ẹ̀kọ́ Pípé wà lórí Ohun Èlò Green Bridge
Gba ohun èlò Green Bridge CBT sórí fóònù tàbí kọ̀mpútà rẹ fún gbogbo ilé ìkàwé IGCSE: ìwé ìdánwò àtijọ́, ìlànà ìdíwọ̀n, àwòrán èrò, káàdì ìkẹ́kọ̀ọ́ àti ẹ̀kọ́ ohùn.
Ìdánwò Ẹ̀kọ́
Oriire fun ipari ẹkọ lori Boolean Logic. Ni bayi ti o ti ṣawari naa awọn imọran bọtini ati awọn imọran, o to akoko lati fi imọ rẹ si idanwo. Ẹka yii nfunni ni ọpọlọpọ awọn adaṣe awọn ibeere ti a ṣe lati fun oye rẹ lokun ati ṣe iranlọwọ fun ọ lati ṣe iwọn oye ohun elo naa.
Iwọ yoo pade adalu awọn iru ibeere, pẹlu awọn ibeere olumulo pupọ, awọn ibeere idahun kukuru, ati awọn ibeere iwe kikọ. Gbogbo ibeere kọọkan ni a ṣe pẹlu iṣaro lati ṣe ayẹwo awọn ẹya oriṣiriṣi ti imọ rẹ ati awọn ogbon ironu pataki.
Lo ise abala yii gege bi anfaani lati mu oye re lori koko-ọrọ naa lagbara ati lati ṣe idanimọ eyikeyi agbegbe ti o le nilo afikun ikẹkọ. Maṣe jẹ ki awọn italaya eyikeyi ti o ba pade da ọ lójú; dipo, wo wọn gẹgẹ bi awọn anfaani fun idagbasoke ati ilọsiwaju.
- 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
Ṣiṣẹ́ lórí àwọn ìbéèrè wọ̀nyí nínú ohun èlò náà
Ṣiṣẹ́ lórí àwọn ìbéèrè wọ̀nyí nínú ohun èlò náà
Awọn Iwe Itọsọna Ti a Gba Nimọran
Ṣe Adaṣe Awọn Ibeere Idanwo Adaṣe
Ṣe o fẹ ṣe adaṣe awọn ibeere idanwo adaṣe nipa Boolean Logic? Ṣe igbasilẹ ohun elo Green Bridge CBT lati wọle si awọn ibeere idanwo adaṣe ati awọn ayẹwo adaṣe kikun fun koko-ọrọ yii.
Ṣe igbasilẹ ohun elo naa lori Google Playstore
Gbogbo ohun ti o nilo lati ṣe dara julọ ninu JAMB, WAEC ati NECO.
