Homeworks

Homework 1: Due Jan 31, 5:00pm
- Boolean Algebra
- Logic Reduction
- Relations
- Sets
Homework 2: Due Feb 14, 5:00pm
- Partial orders
- Lattice
- Boole's expansion theorem
- Atoms
Homework 3: Due Thr Feb 29, 5:00pm (extended)
- Logic Reduction
- Tabular Methods
- Prime Implicants
- Quine-McClusky algorithm
- Computational techniques
- Cygwin Freeware (GPL) Tools.
- HW3ex.cpp: Sample code for a homework 3 problem
- minterm.exe: Cygwin binary that implements mp3
Homework 4: Due Fri Mar 9, Noon (extended) with 10 point bonus
or Due Tue Mar 20, Midnight (late extended) without bonus.
- Testing for function equality
- Locating adjacent logical terms
- Computational techniques for logic reduction
- Complexity analysis
- PI.exe: Cygwin binary for Prime Implicant finder
- PI-verbose.exe: Cygwin binary for Verbose Prime Implicant finder
Homework 5: Due Wed Mar 28, 5pm
- Technology mapping of logic circuits
- NMOS/PMOS/CMOS
- FPGA LUTs
- Decomposition
Homework 6: Due Mon Apr 9, 5pm
- Binary Decision Diagrams (BDDs)
- Chortle Algorithm for LUT Mapping
Homework 7: Due Wed Apr 25, 5pm
- Finite State Machine (FSM) Design
- Minimal State Encoding
- Partition-Refinement algorithm for combining equivalent states
Homework 8: Due Wed Apr 25, 5pm
- DFA Minimization
- Homing Sequences
- Synchronizing Sequences
- Distringuishing Sequences