Scribd
Upload
13 views

Jaypee Institute of Informtion Technology University: Noida Computer Science Deprtment

This document contains a problem set for a computer science course. It includes 6 problems covering topics like set theory, functions, binary relations, Fibonacci numbers, formal languages, and group theory. The problems range from short answer questions to proofs requiring half a page or more of explanation. An optional challenge problem asks students to prove a statement about groups of people using the pigeonhole principle.

Uploaded by

sunny
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
13 views

Jaypee Institute of Informtion Technology University: Noida Computer Science Deprtment

This document contains a problem set for a computer science course. It includes 6 problems covering topics like set theory, functions, binary relations, Fibonacci numbers, formal languages, and group theory. The problems range from short answer questions to proofs requiring half a page or more of explanation. An optional challenge problem asks students to prove a statement about groups of people using the pigeonhole principle.

Uploaded by

sunny
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Jaypee Institute of Informtion Technology University

Noida
Computer Science Deprtment

Problem Set 0

PART A

PROBLEM 1 (2+2 points, suggested length of 2 lines)


Let X and Y be sets. Using set notation, give formal descriptions of the following sets:
(A) the set of all nonempty subsets of X
(B) and the difference between two sets X and Y , denoted X \Y , i.e., the set containing all elements
of X that are not elements of Y .

PROBLEM 2 (2+2 points, suggested length of 1/4 of a page)


Let N = {0, 1, 2, . . .} be the set of natural numbers. For each of the following functions f : N N,
state whether f is (i) one-to-one, (ii) onto, and (iii) bijective.
(A) f (x) = 
x!
x + 1 if x is even
(B) f (x) =
x 1 if x is odd

PROBLEM 3 (4 points, suggested length of 1/2 page)


Consider the binary relation . defined by A . B if there exists a one-to-one (injective) function
f : A B. Is . reflexive? symmetric? transitive? Justify your answers. Explain in simpler terms
what it means if A . B, and also if both A . B and B . A.

PART B
PROBLEM 4 (6 points, suggested length of 1/2 page)
Define the Fibonacci numbers as follows:
F0 = 0
F1 = 1
Fn = Fn1 + Fn2 for all n > 1
Prove the following statement by induction:
(A) For n 2, Fn equals the number of strings of length n 2 over alphabet = {a, b} that do
not contain two consecutive as.

PROBLEM 5 (2+2+2 points, suggested length of 6 lines)


Let L1 be the language {an : n 0} and L2 be the language {x : x {a, b} and |x| = 5}. Answer
yes or no to the following questions.
(A) Do the following sets contain the empty string ?
i. L1 L2
ii. L1 L2
(B) Do the following sets have the empty set as a subset?
i. L2
ii. L1 L2
(C) Do the following sets contain as an element?
i. L1
ii. P (L2 )
PROBLEM 6 (Challenge!! 3 points, suggested length of 1/3 of a page)
Note: On every problem set we will provide a challenge problem, generally significantly more difficult than the other problems in the set, but worth only a few points. It is recommended that you
attempt these problems, but only after completing the rest of the assignment.
Show that in any group of at least six people, either three of them are mutual friends (i.e. they
all know each other) or three of them are mutual strangers (i.e., none of them know each other).
You may assume that knowing is symmetric.
(Hint: pigeonhole them.)

You might also like