midterm2_sample3

midterm2_sample3 - NAME First Last Student ID# UNIVERSITY...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
NAME First Last Student ID# UNIVERSITY OF CALIFORNIA LOS ANGELES COMPUTER SCIENCE DEPARTMENT MIDTERM EXAMINATION #1 CSM51A/EEM16 Fall Quarter 2005 November 23, 2005 This is a closed-book exam. (100 minutes) Use this form for your work and return it. The exam has 6 problems. All problems will be graded. It is crucial to show all work done on the provided paper. #1 (20 max) #2 (20 max) #3 (20 max) #4 (20 max) #5 (20 max) #6 (20 max) TOTAL (100 max)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
MIDTERM #2 CSM51A/EEM16 November 23, 2005 1 Design a pattern recognizer with 3 input streams (A,B,C). It outputs 1 if it recognizes one of the following: (a) the last three bits of A are 101 four times (b) the last three bits of B are 001 three times (c) the last three bits of C are 111 twice Use the minimum number of T flip-flops and NAND gates. Page 2 of 8
Background image of page 2
MIDTERM #2 CSM51A/EEM16 November 23, 2005 2 Design a system which outputs palindrome sequence with lengths 2, 3, or 4 that corresponds to a lexicographical order. A palindrome sequence is a sequence which is identical to its reverse order
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/07/2011 for the course CS m51 taught by Professor Staff during the Spring '11 term at UCLA.

Page1 / 8

midterm2_sample3 - NAME First Last Student ID# UNIVERSITY...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online