summaryrefslogtreecommitdiff
path: root/src/2023/February/26.tex
diff options
context:
space:
mode:
authorFuwn <[email protected]>2023-03-17 20:41:53 -0700
committerFuwn <[email protected]>2023-03-17 20:41:53 -0700
commit734e826e2d70f7a6aeb36158dbed16209f0d8b7a (patch)
treee91c032cb147e0864e1048b953b7d95e38cfb090 /src/2023/February/26.tex
downloadwri_350_documentation_log_assignment-734e826e2d70f7a6aeb36158dbed16209f0d8b7a.tar.xz
wri_350_documentation_log_assignment-734e826e2d70f7a6aeb36158dbed16209f0d8b7a.zip
feat: complete book
Diffstat (limited to 'src/2023/February/26.tex')
-rw-r--r--src/2023/February/26.tex11
1 files changed, 11 insertions, 0 deletions
diff --git a/src/2023/February/26.tex b/src/2023/February/26.tex
new file mode 100644
index 0000000..5ba1dc2
--- /dev/null
+++ b/src/2023/February/26.tex
@@ -0,0 +1,11 @@
+\mytitle{More Finite State Machines}{\co}
+
+The quiz this week was one of the simplest the whole term. Luckily, this was
+another one of those assignments that closely related to the material that we
+covered in class and on the homeworks from previous weeks.
+
+Similar to the discussions that we had in class, we were given a single problem
+to solve which included describing the finite state machine of an up/
+down-counter, drawing out the transition diagram of the counter, and finally,
+implementing the transition table and Karnough map that we had completed many
+times in this and the previous computer science classes.