This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS 173: Discrete Structures, Spring 2010 Quiz 2 (Wednesday 17 March) NAME: NETID: DISCUSSION DAY/TIME: This quiz has 2 pages containing 4 questions, totalling 20 points. You have 20 minutes to finish. Showing your work may increase partial credit in case of mistakes. 1. (4 points) Mark the following claims as “true” or “false”: (a) There is a onetoone function f : { , 1 , 2 } → { a, b } ALTERNATE: There is an onto function f : { a, b } → { , 1 , 2 } (b) If f : Z + → [0 , 1] is defined as f ( n ) = 1 n , then f is onto. ALTERNATE: If f : Z + → [0 , 1] is defined as f ( n ) = 1 n , then f is onetoone. (c) For functions f , g and h , if f is O ( g ) and g is O ( h ) then f is O ( h ). ALTERNATE: For functions f , g and h , if f is Ω( g ) and g is Ω( h ) then f is Ω( h ). (d) For any A ⊆ Z , there is a y ∈ Z such that for all x ∈ A , x ≥ y . 2. (3 points) Suppose that f : A → B is a function. Define what it means for f to be onetoone. Be specific and precise; do not use words like “unique.”onetoone....
View
Full
Document
 Spring '08
 Erickson

Click to edit the document details