Computer Science - 4CP0 PearsonEdexcel

Logic

Gbogbo ọrọ náà

A burglar alarm that only sounds when a window is open AND the system is armed, OR when the panic button is pressed, is making a decision with exactly the same building blocks that control billions of transistors inside a CPU. Every decision a digital circuit makes, however complicated it looks from the outside, is built from a tiny handful of logic gates combining binary inputs into a binary output.

In this lesson you will learn what the AND, OR and NOT gates do and how the derived XOR gate is built from them, how to write Boolean expressions for a logic statement, how to build a complete and correct truth table for any expression, and how to turn a real-world problem into a logic statement of your own.

Ebumnobi

Be able to construct and interpret truth tables for a given logic statement (AND, OR, NOT)
Be able to produce logic statements for a given problem

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ụ

A logic gate takes one or more binary inputs (each either 0 or 1) and produces a single binary output, based on a fixed rule. A Boolean expression is the written form of that rule, combining input names with the operators AND, OR and NOT. Three gates form the basis of every digital circuit.

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 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 Boolean operator produces an output of 1 only when both of its inputs are 1? A) OR B) NOT C) AND D) XOR Answer: C
How many rows does a complete truth table need for a logic statement with 3 inputs? A) 3 B) 6 C) 8 D) 9 Answer: C
For inputs A=1 and B=0, what is the output of X = A XOR B? A) 0 B) 1 C) Undefined D) 2 Answer: B
Which gate takes only one input? A) AND B) OR C) NOT D) XOR Answer: C
In standard binary counting order, what are the four input rows for a 2-input truth table (A then B)? A) 11, 10, 01, 00 B) 00, 01, 10, 11 C) 00, 10, 01, 11 D) 01, 10, 00, 11 Answer: B

Rue ajuju ndi a n'ime ngwa ahu