Computer Science | Vassar College https://www.cs.vassar.edu/ 2026-04-12T11:38:03+00:00 Computer Science | Vassar College https://www.cs.vassar.edu/ https://www.cs.vassar.edu/_media/favicon.ico text/html 2010-01-20T04:01:27+00:00 Anonymous (anonymous@undisclosed.example.com) top https://www.cs.vassar.edu/courses/cs224-201001/lectures/top?rev=1263960087&do=diff <html> <h2>Lectures: </h2> </html> [Chapter 1 - Powerpoint] [Chapter 2 - Powerpoint] [Chapter 2a - Powerpoint] [Chapter 3 - Powerpoint] [Chapter 3a - Powerpoint] [Chapter 4 - Powerpoint] [Chapter 5 - Powerpoint] [Chapter 6 - Powerpoint] [Chapter 7 - Powerpoint] [Chapter 7a - Powerpoint] [Chapter 8 - Powerpoint] [Chapter 9 - Powerpoint] [Chapter 10 - Powerpoint] [Chapter 11 - Powerpoint] [Chapter 12 - Powerpoint] [Chapter 13 - Powerpoint] ---------- <html> <h2>Other Mat… text/html 2010-05-02T14:19:36+00:00 Anonymous (anonymous@undisclosed.example.com) top https://www.cs.vassar.edu/courses/cs224-201001/assignments/top?rev=1272809976&do=diff <html> <h2>Assignments: </h2> </html> Assignment 1: pg 94: #2 (a,b), #4 (a,b) #5 (c,d), 6, 7, 8 - Due Wed, 2/3/2010 Assignment 1: (added) pg 97 #24 - also due Wed, 2/3/2010 Assignment 2: pg 98: #30, 34, 42, 44 due Wed, 2/10/2010 Assignment 3: pg 155: # 2, 4, 6 due Wed, 2/17/2010 text/html 2010-02-21T16:49:44+00:00 Anonymous (anonymous@undisclosed.example.com) top https://www.cs.vassar.edu/courses/cs224-201001/top?rev=1266770984&do=diff CMPU-224: Computer Organization <html> <h1>Vassar College, Spring 2010</h1> <h1>Syllabus</h1> </html> Course Wiki: <http://www.cs.vassar.edu/courses/cs224-201001/top> Professor: Barry Jones Office: OLB 118 text/html 2010-03-22T15:49:11+00:00 Anonymous (anonymous@undisclosed.example.com) assignment_5_link https://www.cs.vassar.edu/courses/cs224-201001/assignments/assignment_5_link?rev=1269272951&do=diff Assignment 5 Due Monday, March 29, 2010 * Simplify f(A,B,C,D) = ∑(0,1,2,8,9,12,13), d(A,B,C,D) = ∑(10,11,14,15) * Design a 2 bit countdown circuit with T FFs. Counts: 3 2 1 0 3 2 1 0 . . . * Design the circuit for the state diagram of Figure 1. x and y are two inputs. text/html 2010-02-17T18:03:26+00:00 Anonymous (anonymous@undisclosed.example.com) assignment_4_link https://www.cs.vassar.edu/courses/cs224-201001/assignments/assignment_4_link?rev=1266429806&do=diff Assignment 4 Due Wed, Feb. 24, 2010 * Simplify the following boolean expressions using K-maps: * F(x,y,z) = ∑(0,2,4,5) * F(w,x,y,z) = ∑(0,2,8,9,10,11,14,15) * F(A,B,C,D) = ∑(2,3,4,5,6,7,11,14,15) * Page 157 #22 - Use a Karnaugh map instead of boolean algebra. text/html 2010-03-24T14:31:57+00:00 Anonymous (anonymous@undisclosed.example.com) assignment_6_link https://www.cs.vassar.edu/courses/cs224-201001/assignments/assignment_6_link?rev=1269441117&do=diff Assignment 6 Due Wednesday, March 31, 2010 a) Design a four bit BCD counter using T flip-flops. The counter will count from 0 to 9, and repeat. In your logic table, if the current state is between 10 and 15 set the next state to 0. This way if the circuit starts in an 'illegal state' it will immediate correct itself. text/html 2010-01-20T01:34:04+00:00 Anonymous (anonymous@undisclosed.example.com) sidebar https://www.cs.vassar.edu/courses/cs224-201001/sidebar?rev=1263951244&do=diff <html></center></html> CS224 Course Materials * Syllabus * Lectures, Other Materials * Assignments, Exams <html></center></html>