This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS 70 Discrete Mathematics for CS Spring 2005 Clancy/Wagner Final P RINT your name: , (last) (first) S IGN your name: P RINT your class account name: cs70- Name of the person sitting to your left: Name of the person sitting to your right: You may consult any books, notes, or other paper-based inanimate objects available to you. Calculators and computers are not permitted. Please write your answers in the spaces provided in the test; in particular, we will not grade anything on the back of an exam page unless we are clearly told on the front of the page to look there. If you use a result from the lecture notes, the homework solutions, or the Rosen textbook, please indicate clearly where in the course material your result appears. You have 180 minutes. There are 8 questions, of varying credit (60 points total). We believe that the harder questions appear at the end of the exam. The questions are of varying difficulty, so avoid spending too long on any one question. Do not turn this page until your instructor tells you to do so. Then, print your login name on the subsequent pages of the exam. Problem 1 Problem 2 Problem 3 Problem 4 Problem 5 Problem 6 Problem 7 Problem 8 Total CS 70, Spring 2005, Final 1 Your class account: cs70- Problem 1. (8 points) Let a ( n ) denote the number of ternary strings of length n with no pair of adjacent 2’s. Example: “2011” is a ternary string with no pair of adjacent 2’s....
View Full Document
This note was uploaded on 09/03/2011 for the course CS 70 taught by Professor Papadimitrou during the Fall '08 term at Berkeley.
- Fall '08