Scribd
Upload
58 views1 page

ct1 PDF

This document is a class test for the course CS30053 Foundations of Computing from Spring 2004. The test has 3 questions worth a total of 25 points and is to be completed in 1 hour plus additional time. Question 1 has 7 statements to identify as true or false with justification. Question 2 asks about relations on a finite set of cardinality n. Question 3 defines monotonic and strictly monotonic increasing functions, and asks to show properties of such functions and give examples.

Uploaded by

ParantapDansana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
58 views1 page

ct1 PDF

This document is a class test for the course CS30053 Foundations of Computing from Spring 2004. The test has 3 questions worth a total of 25 points and is to be completed in 1 hour plus additional time. Question 1 has 7 statements to identify as true or false with justification. Question 2 asks about relations on a finite set of cardinality n. Question 3 defines monotonic and strictly monotonic increasing functions, and asks to show properties of such functions and give examples.

Uploaded by

ParantapDansana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

CS30053 Foundations of Computing, Spring 2004

Class test 1
Total points: 25

August 26, 2004

Total time: 1 +  hour

1. Which of the following statements is/are true? (No credits will be given without proper justifications.)

(2 7)

(a) ((p q) p) q is a tautology.


(b) ((p q) q) is equivalent to (p q).
h

(c) x R m Z n Z m < x < n .


h

(d) x R m N n N m < x < n .


h

(e) x R dbx/2c /3e = bdx/2e /3c .


(f)

The function f : N N defined by f (n) := n2 + 2n + 3 for all n N is injective.

(g) The function g : Z Z defined by g(n) := n2 + 2n + 3 for all n Z is injective.


2. Let A be a finite set of cardinality n. Deduce that:
(a) The total number of anti-symmetric relations on A is 2n 3n(n1)/2 .

(3)

(b) The total number of relations on A, that are both symmetric and anti-symmetric, is 2 n .

(3)

3. Let A be one of the sets N, Z, Q, R. A function : A A is called m o n o t o n i c i n c r e a s i n g if m 6 n


implies (m) 6 (n). It is called s t r i c t l y m o n o t o n i c i n c r e a s i n g if m < n implies (m) < (n).
(a) Show that a strictly monotonic increasing function is injective.

(2)

(b) Give an example of a function N N that is injective but not strictly monotonic increasing.

(3)

(c) [Bonus] Let f : N N be an injective function with the property that |f (n + 1) f (n)| 6 1 for all
n N. Show that f is strictly monotonic increasing.
(5)

Dr. Abhijit Das, Dept. of Computer Science & Engineering, IIT Kharagpur, India

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy