Searching for truth tables : 8 results found | RSS Feed for this search

Using a truth table to derive a Boolean expression

Description

An interaction that shows the user how to derive a Boolean expression from a truth table.

Subjects

electronics | truth tables | physics | boolean logic | MATHEMATICS | Engineering | Teaching | Design and delivery of programmes | UK EL05 = SCQF 5 | Intermediate level | Intermediate | NICAT 2 | CQFW 2 | Intermediate | GSCE A-C | NVQ 2 | | UK EL10 = SCQF 10 | Honours degree | Graduate diploma | UK EL06 = SCQF 6 | Advanced courses | NICAT 3 | CQFW 3 | Advanced | A/AS Level | NVQ 3 | Higher | SVQ 3 | H000 | EDUCATION / TRAINING / TEACHING | ENGINEERING | SCIENCES and MATHEMATICS | G | X | R

License

Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ http://creativecommons.org/licenses/by-nc-sa/2.0/uk/

Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dc

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Deriving a Boolean expression from a circuit diagram

Description

An interaction which shows how a Boolean expression can be derived directly from a circuit diagram.

Subjects

logic | circuit diagrams | electronics | physics | truth tables | boolean logic | MATHEMATICS | Engineering | Teaching | Design and delivery of programmes | UK EL05 = SCQF 5 | Intermediate level | Intermediate | NICAT 2 | CQFW 2 | Intermediate | GSCE A-C | NVQ 2 | | UK EL10 = SCQF 10 | Honours degree | Graduate diploma | UK EL06 = SCQF 6 | Advanced courses | NICAT 3 | CQFW 3 | Advanced | A/AS Level | NVQ 3 | Higher | SVQ 3 | H000 | EDUCATION / TRAINING / TEACHING | ENGINEERING | SCIENCES and MATHEMATICS | G | X | R

License

Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ http://creativecommons.org/licenses/by-nc-sa/2.0/uk/

Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dc

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Truth tables

Description

An interaction which shows that different truth tables will produce different K-maps.

Subjects

electronics | physics | truth tables | circuits | k-map | boolean logic | MATHEMATICS | Engineering | Teaching | Design and delivery of programmes | UK EL05 = SCQF 5 | Intermediate level | Intermediate | NICAT 2 | CQFW 2 | Intermediate | GSCE A-C | NVQ 2 | | UK EL10 = SCQF 10 | Honours degree | Graduate diploma | UK EL06 = SCQF 6 | Advanced courses | NICAT 3 | CQFW 3 | Advanced | A/AS Level | NVQ 3 | Higher | SVQ 3 | H000 | EDUCATION / TRAINING / TEACHING | ENGINEERING | SCIENCES and MATHEMATICS | G | X | R

License

Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ http://creativecommons.org/licenses/by-nc-sa/2.0/uk/

Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dc

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Deriving a Karnaugh map from a truth table

Description

A drag and drop exercise that requires the user to drag the 0 and 1 at the bottom of the cells of a Karnaugh map to produce a map for the truth table.

Subjects

electroncs | truth tables | physics | karnaugh maps | MATHEMATICS | Engineering | Teaching | Design and delivery of programmes | UK EL05 = SCQF 5 | Intermediate level | Intermediate | NICAT 2 | CQFW 2 | Intermediate | GSCE A-C | NVQ 2 | | UK EL10 = SCQF 10 | Honours degree | Graduate diploma | UK EL06 = SCQF 6 | Advanced courses | NICAT 3 | CQFW 3 | Advanced | A/AS Level | NVQ 3 | Higher | SVQ 3 | H000 | EDUCATION / TRAINING / TEACHING | ENGINEERING | SCIENCES and MATHEMATICS | G | X | R

License

Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ http://creativecommons.org/licenses/by-nc-sa/2.0/uk/

Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dc

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Deriving a Boolean expression from a truth table

Description

An interaction which shows how a Booean expression can be derived from a truth table.

Subjects

logic | electronics | physics | truth tables | boolean logic | MATHEMATICS | Engineering | Teaching | Design and delivery of programmes | UK EL05 = SCQF 5 | Intermediate level | Intermediate | NICAT 2 | CQFW 2 | Intermediate | GSCE A-C | NVQ 2 | | UK EL10 = SCQF 10 | Honours degree | Graduate diploma | UK EL06 = SCQF 6 | Advanced courses | NICAT 3 | CQFW 3 | Advanced | A/AS Level | NVQ 3 | Higher | SVQ 3 | H000 | EDUCATION / TRAINING / TEACHING | ENGINEERING | SCIENCES and MATHEMATICS | G | X | R

License

Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ http://creativecommons.org/licenses/by-nc-sa/2.0/uk/

Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dc

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Discrete Structures

Description

This course describes discrete mathematics, which involves processes that consist of sequences of individual steps (as compared to calculus, which describes processes that change in a continuous manner). The principal topics presented in this course are logic and proof, induction and recursion, discrete probability, and finite state machines. This free course may be completed online at any time. See course site for detailed overview and learning outcomes. (Computer Science 202)

Subjects

discrete structures | truth tables | negations | tautologies | conditional statements | modus ponens | modus tollens | generalization | specialization | elimination | quantified | quantifiers | number theory | divisibility | induction | sequences | notation | set theory | recursion | automata | Computer science | I100

License

Attribution 2.0 UK: England & Wales Attribution 2.0 UK: England & Wales http://creativecommons.org/licenses/by/2.0/uk/ http://creativecommons.org/licenses/by/2.0/uk/

Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dc

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Logic and Critical Thinking

Description

This course provides an introduction to critical thinking, informal logic, and a small amount of formal logic; its purpose is to provide students with the basic tools of analytical reasoning. This free course may be completed online at any time. See course site for detailed overview and learning outcomes. (Philosophy 102)

Subjects

philosophy | meaning | argument | validity | fallacies | induction | deduction | logic | truth tables | formalization | venn diagrams | syllogism | scientific reasoning | causality | correlation | strategic reasoning | creative thinking | morality | relativism | reflective equilibrium | philosophical studies | V000

License

Attribution 2.0 UK: England & Wales Attribution 2.0 UK: England & Wales http://creativecommons.org/licenses/by/2.0/uk/ http://creativecommons.org/licenses/by/2.0/uk/

Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dc

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

DG5235 Programmable Logic Devices

Description

This unit is designed to enable candidates to gain some knowledge and understanding of the principles and benefits of using programmable logic devices (PLDs) compared to alternatives and to allow the candidates to develop some of the necessary skills required in using the associated design tools. Outcomes On completion of the unit candidates should be able to: 1. explain the architecture and technology used within PLDs 2. compare PLDs with alternative devices 3. use PLD design tools.

Subjects

DG52 35 | PROM (programmable read-only memory) | PAL (programmable array logic) | PLA (programmable logic array) | CPLDs (complex programmable logic devices) | Atmel WinCUPL | truth tables | X: Engineering | ENGINEERING | SCQF Level 8

License

Except where expressly indicated otherwise on the face of these materials (i) copyright in these materials is owned by the Scottish Qualification Authority (SQA), and (ii) none of these materials may be Used without the express, prior, written consent of the Colleges Open Learning Exchange Group (COLEG) and SQA, except if and to the extent that such Use is permitted under COLEG's conditions of Contribution and Use of Learning Materials through COLEG’s Repository, for the purposes of which these materials are COLEG Materials. Except where expressly indicated otherwise on the face of these materials (i) copyright in these materials is owned by the Scottish Qualification Authority (SQA), and (ii) none of these materials may be Used without the express, prior, written consent of the Colleges Open Learning Exchange Group (COLEG) and SQA, except if and to the extent that such Use is permitted under COLEG's conditions of Contribution and Use of Learning Materials through COLEG’s Repository, for the purposes of which these materials are COLEG Materials. Licensed to colleges in Scotland only Licensed to colleges in Scotland only http://content.resourceshare.ac.uk/xmlui/bitstream/handle/10949/17761/LicenceSQAMaterialsCOLEG.pdf?sequence=1 http://content.resourceshare.ac.uk/xmlui/bitstream/handle/10949/17761/LicenceSQAMaterialsCOLEG.pdf?sequence=1 SQA SQA

Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dc

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata