Boolean Logic
Muhtasari
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.
Malengo
- 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.
Ramani ya mawazo
Mada hii imechorwa ili uone jinsi mawazo yanavyounganika.
Fungua ramani ya mawazo kwenye programu
Maelezo ya Somo
Dokezo Kamili la Somo Linapatikana kwenye Programu ya Green Bridge
Pata programu ya Green Bridge CBT kwenye simu au kompyuta yako kwa maktaba kamili ya IGCSE: mitihani ya miaka iliyopita, miongozo ya usahihishaji, ramani za mawazo, kadi za marudio na masomo ya sauti.
Tathmini ya Somo
Hongera kwa kukamilisha somo la Boolean Logic. Sasa kwa kuwa umechunguza dhana na mawazo muhimu, ni wakati wa kuweka ujuzi wako kwa mtihani. Sehemu hii inatoa mazoezi mbalimbali maswali yaliyoundwa ili kuimarisha uelewaji wako na kukusaidia kupima ufahamu wako wa nyenzo.
Utakutana na mchanganyiko wa aina mbalimbali za maswali, ikiwemo maswali ya kuchagua jibu sahihi, maswali ya majibu mafupi, na maswali ya insha. Kila swali limebuniwa kwa umakini ili kupima vipengele tofauti vya maarifa yako na ujuzi wa kufikiri kwa makini.
Tumia sehemu hii ya tathmini kama fursa ya kuimarisha uelewa wako wa mada na kubaini maeneo yoyote ambapo unaweza kuhitaji kusoma zaidi. Usikatishwe tamaa na changamoto zozote utakazokutana nazo; badala yake, zitazame kama fursa za kukua na kuboresha.
- 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
Fanyia kazi maswali haya kwenye programu
Fanyia kazi maswali haya kwenye programu
Vitabu Vinavyopendekezwa
Fanya Mazoezi ya Maswali ya Majaribio
Ungependa kufanya mazoezi ya maswali ya majaribio kuhusu Boolean Logic? Pakua programu ya Green Bridge CBT ili kupata maswali ya majaribio na tathmini kamili za mazoezi kuhusu mada hii.
Pakua Programu Kwenye Google Playstore
Kila kitu unachohitaji ili kufaulu katika JAMB, WAEC & NECO.
