32_TG_V2_Computer Science_10_Revision_Presentation of Data

  • docx
  • 01.05.2020
Публикация на сайте для учителей

Публикация педагогических разработок

Бесплатное участие. Свидетельство автора сразу.
Мгновенные 10 документов в портфолио.

Иконка файла материала 32_TG_V2_Computer Science_10_Revision_Presentation of Data.docx

You can demonstrate several ways of conversion and choose the best option for you with the students

 

http://cdn.cs50.net/2016/x/psets/0/pset0/bulbs.html

 

Demonstrate using a calculator in programmer mode to check the results of a translation operation.

Perform a mutual evaluation to verify the results by demonstrating the correct template with the fields filled in.

Consider using logical functions in spreadsheets, or using a branching algorithm using logical bundles AND, OR, NOT.

2-input AND Gate

For a 2-input AND gate, the output Q is true if BOTH input A “AND” input B are both true, giving the Boolean Expression of: ( Q = A and B ).

Symbol

Truth Table

boolean algebra AND gate truth table

A

B

Q

0

0

0

0

1

0

1

0

0

1

1

1

Boolean Expression Q = A.B

Read as A AND B gives Q

Note that the Boolean Expression for a two input AND gate can be written as: A.B or just simply AB without the decimal point.

2-input OR (Inclusive OR) Gate

For a 2-input OR gate, the output Q is true if EITHER input A “OR” input B is true, giving the Boolean Expression of: ( Q = A or B ).

Symbol

Truth Table

boolean algebra OR gate truth table

A

B

Q

0

0

0

0

1

1

1

0

1

1

1

1

Boolean Expression Q = A+B

Read as A OR B gives Q

NOT Gate (Inverter)

For a single input NOT gate, the output Q is ONLY true when the input is “NOT” true, the output is the inverse or complement of the input giving the Boolean Expression of: ( Q = NOT A ).

Symbol

Truth Table

boolean algebra NOT gate truth table

A

Q

0

1

1

0

Boolean Expression Q = NOT A or A

Read as inversion of A gives Q

The NAND and the NOR Gates are a combination of the AND and OR Gates respectively with that of a NOT Gate (inverter)

2-input NAND (Not AND) Gate

For a 2-input NAND gate, the output Q is true if BOTH input A and input B are NOT true, giving the Boolean Expression of: ( Q = not(A AND B) ).

Symbol

Truth Table

NAND gate truth table

A

B

Q

0

0

1

0

1

1

1

0

1

1

1

0

Boolean Expression Q = A .B

Read as A AND B gives NOT-Q

 


 

Скачано с www.znanio.ru

Посмотрите также