Boolean Logic
Bayani Gaba-gaba
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.
Manufura
- 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.
Taswirar tunani
An zana wannan batu don ka ga yadda ra'ayoyi ke hadewa.
Bude taswirar tunani a cikin manhaja
Takardar Darasi
Cikakken Bayanin Darasi Yana Kan Manhajar Green Bridge
Sami manhajar Green Bridge CBT a wayarka ko kwamfutarka domin cikakken laburaren IGCSE: takardun jarrabawar baya, tsarin kimantawa, taswirar tunani, katunan karatu da darussan sauti.
Nazarin Darasi
Barka da kammala darasi akan Boolean Logic. Yanzu da kuka bincika mahimman raayoyi da raayoyi, lokaci yayi da zaku gwada ilimin ku. Wannan sashe yana ba da ayyuka iri-iri Tambayoyin da aka tsara don ƙarfafa fahimtar ku da kuma taimaka muku auna fahimtar ku game da kayan.
Za ka gamu da haɗe-haɗen nau'ikan tambayoyi, ciki har da tambayoyin zaɓi da yawa, tambayoyin gajeren amsa, da tambayoyin rubutu. Kowace tambaya an ƙirƙira ta da kyau don auna fannoni daban-daban na iliminka da ƙwarewar tunani mai zurfi.
Yi wannan ɓangaren na kimantawa a matsayin wata dama don ƙarfafa fahimtarka kan batun kuma don gano duk wani yanki da kake buƙatar ƙarin karatu. Kada ka yanke ƙauna da duk wani ƙalubale da ka fuskanta; maimakon haka, ka kallesu a matsayin damar haɓaka da ingantawa.
- 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
Yi aikin wadannan tambayoyi a cikin manhaja
Yi aikin wadannan tambayoyi a cikin manhaja
Littattafan da ake ba da shawarar karantawa
Yi Aikin Tambayoyin Gwaji
Kana son yin aikin tambayoyin gwaji kan Boolean Logic? Sauke manhajar Green Bridge CBT don samun tambayoyin gwaji da cikakkun jarrabawa akan wannan batu.
Sauke Manhajar Daga Google Playstore
Duk abin da kake buƙata don yin fice a JAMB, WAEC & NECO.
