Your Name: _________________________________
CS 150 - Sp. 90 Page 1 of 10 Quiz1
UNIVERSITY OF CALIFORNIA AT BERKELEY
BERKELEY • DAVIS • IRVINE • LOS ANGELES • RIVERSIDE • SAN DIEGO • SAN FRANCISCO SANTA BARBARA • SANTA CRUZ
Department of Electrical Engineering
and Computer Sciences CS 150 - Spring 1990
Prof. A. R. Newton
Quiz 2
Room 100 Lewis, Thursday 4/6
(Open Wakerly, Calculators OK, 1hr 20min)
Include all final answers in locations indicated on these pages. Use reverse side of sheets for all working. If
necessary, attach additional sheets by staple at the end. BE SURE TO WRITE YOUR NAME ON EVERY
SHEET.
(1) A sequential network has one input and one output. The output becomes 1 and remains 1
thereafter when at least two zeros and at least two ones have occurred as inputs, regardless
of the order of occurrence. Draw a state graph (Moore type) for the network (9 states are
sufficient). Your final state graph should be neatly drawn with no crossed lines.
