Machine Fundamentals
Learning Outcomes:
- Understanding the representation of numbers inside a computer
- Exploring unsigned, sign magnitude, two's complement representations, and floating point representation of real numbers
- Introducing basic propositional logic, logic operators and truth tables
- Understanding conjunctive and disjunctive normal forms (CNF and DNF), logical equivalences and proof by logical equivalences
- Studying predicate logic, domain of discourse, truth values of predicates, proof by existence and by contradiction, models and semantic entailment, and proofs by inference rules
- Designing Boolean logic circuits using AND, OR, NOT and NAND gates
- Constructing logic circuits using a DNF of minterms and Karnaugh maps
- Understanding full, half and ripple carry adders
- Exploring switching circuits, N-type and P-type transistors and canonical pull up/pull down circuit construction
- Programming in assembly language using the MIPS language
- Understanding regular expressions, nondeterministic and deterministic finite state automata
- Applying Thompson's construction and the subset construction
- Recognizing that not all sets can be defined by regular expressions
- Studying pushdown automata and Turing machines
Skills for module:
Mathematics
Logics
Problem Solving
Critical Thinking
Time Management
Machine Fundamentals
CS1870
Learning Outcomes
- Understanding the representation of numbers inside a computer
- Exploring unsigned, sign magnitude, two's complement representations, and floating point representation of real numbers
- Introducing basic propositional logic, logic operators and truth tables
- Understanding conjunctive and disjunctive normal forms (CNF and DNF), logical equivalences and proof by logical equivalences
- Studying predicate logic, domain of discourse, truth values of predicates, proof by existence and by contradiction, models and semantic entailment, and proofs by inference rules
- Designing Boolean logic circuits using AND, OR, NOT and NAND gates
- Constructing logic circuits using a DNF of minterms and Karnaugh maps
- Understanding full, half and ripple carry adders
- Exploring switching circuits, N-type and P-type transistors and canonical pull up/pull down circuit construction
- Programming in assembly language using the MIPS language
- Understanding regular expressions, nondeterministic and deterministic finite state automata
- Applying Thompson's construction and the subset construction
- Recognizing that not all sets can be defined by regular expressions
- Studying pushdown automata and Turing machines