CSE 460
Homeworks
- Homework 1 : Due Thursday, Feb 2 at 2:30pm (at start of class)
- Boolean Algebra
- Logic Reduction
- Relations
- Sets
- Boole's expansion theorem
- Homework 2 : Due Thursday, Feb 16 at 2:30pm (at start of class)
- Tabular Methods
- Prime Implicants
- Computational techniques
- Cygwin Freeware (GPL) Tools.
- HW3ex.cpp:
Sample source code
- Homework 3: Due Thr Feb 23 at 2:30pm (at start of class)
- Computer Aided Design Tool for finding Prime Implicants
- Sample: PI.exe: Cygwin binary for Prime Implicant finder
- Sample: PI-verbose.exe: Cygwin binary for
Verbose Prime Implicant finder
- Results: Benchmark times (from board)
- Homework 4: Parts A and B: Due Thursday March 9 (at start of class)
- Part A: Optimizing with Don't Care inputs
- In-Class Example Input: HW4a_test.txt
- Test Case: HW4a_harder.txt
- Test Case: HW4a_hardest.txt
- Part B: Selecting Essential Prime Implicants (Greedy Method)
- 10 point bonus for fastest, minimal, correctly running program
- 5 point bonus for next three fastest, minimal, correctly running program
- Homework 4: Part C: Due Thursday March 23 (at start of class)
- Part C: Selecting minimal cost EPIs using Branch and Bound
- 10 point bonus for fastest, minimal, correctly running program
- 5 point bonus for next three fastest, minimal, correctly running program
- Homework 5: Due Thursday April 13 (at start of class)
- FPGA LUTs
- Decomposition
- Chortle
- Homework 6: Due Thr Apr 27, 2:30pm (at start of class)
- Finite State Machine (FSM) Design
- Minimal State Encoding
- Partition-Refinement algorithm for combining equivalent states
- Homing Sequences
- Synchronizing Sequences
- Distringuishing Sequences
- Deterministic and Non-deterministic Finite Automata
Copyright 2001, 2006
John W. Lockwood
Washington University
Saint Louis, MO
