This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS 40: Examination Department of Computer Science University of California, Santa Barbara Closed-Book, 75 minutes Winter 2008 Instructions Before you answer any questions, print your name and perm number. Read each question carefully. Make sure that you clearly understand each question before answering it. Put your answer to each question on its own page. You may wish to work out an answer on scratch paper before writing it on your answer page; answers that are difficult to read may lose points for that reason. You may not leave the room during the examination, even to go to the bathroom. You may not use any personal devices, such as calculators, PDAs, or cell phones. 1 1. (25 points) Define the following terms: DeMorgans Laws for quantifiers: P ( x ) x P ( x ) P ( x ) x P ( x ) onto function: f s range is its codomain: b B a A,f ( a ) = b 1-to-1 function: a 6 = b f ( a ) 6 = f ( b ) binary relation from A to B : A subset of A B ....
View Full Document
- Spring '04
- Computer Science