quiz2 - CS 173: Discrete Structures, Spring 2010 Quiz 2...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the 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 one-to-one 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 one-to-one. (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 one-to-one. Be specific and precise; do not use words like unique.one-to-one....
View Full Document

Page1 / 3

quiz2 - CS 173: Discrete Structures, Spring 2010 Quiz 2...

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

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