Search

You can find the results of your search below.

Matching pagenames:

Fulltext results:

top @courses:cs224-201001:assignments
20 Hits, Last modified:
(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,
top
10 Hits, Last modified:
ation ====== <html> <h1>Vassar College, Spring 2010</h1> <h1>Syllabus</h1> </html> ^ Course Wiki: | http://www.cs.vassar.edu/courses/cs224-201001/top | ^ Professor: | [[people:jones:top|Barry Jones]] | ^ Off
assignment_5_link @courses:cs224-201001:assignments
9 Hits, Last modified:
== 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:
assignment_4_link @courses:cs224-201001:assignments
4 Hits, Last modified:
===== 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 1
assignment_6_link @courses:cs224-201001:assignments
4 Hits, Last modified:
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 c
top @courses:cs224-201001:lectures
3 Hits, Last modified:
ml> <h2>Lectures: </h2> </html> {{courses:cs224-201001:lectures:ch01_ecoa2e.ppt|Chapter 1 - Powerpoint}} {{courses:cs224-201001:lectures:ch02_ecoa2e.ppt