You are on page 1of 2

Independent University Bangladesh

CSE 201 Final Autumn 2020


Time: 105 minutes (including submission time)
Instructors: Dr. Habib Bin Muzaffar, Mr. Bijoy Rahman Arif,
Ms. Sadita Ahmed

Answer all questions. Each question is worth 5 marks. There are six
questions.

1. Let 𝑠 = sum of all the digits of your student ID,


𝑙 = sum of last four digits of your student ID.
Users of a web app you built must use a password that is at least 𝑙
characters but no more than 𝑠 characters long. Each character in a
password is a lowercase English letter, an uppercase English letter, a
digit , or one of the six special characters *, >, <, !, +, and =.
How many different passwords are available for this computer
system? How many of these passwords contain at least one special
character?

2. Answer any one of the following:


(a) In how many different ways can we arrange the letters of the word
TERRAJAMINPERR so that no R is in the middle two positions
(i. e. 7th and 8th positions)?
(b) Dadu has two grandsons (A and B) and three granddaughters (X,
Y, and Z). Dadu bought 4 identical footballs for his grandsons and
5 identical teddy bears for his granddaughters. In how many ways
can he distribute the 4 footballs (among his grandsons) and the 5
teddy bears (among his granddaughters) so that each
granddaughter gets at least one teddy bear?

3. Prove by induction (ordinary or strong) that any amount of change


greater than or equal to 24 can be obtained with a combination of five
and seven cent coins.

4. Let 𝑆(𝑛) = −12 + 22 − 32 + 42 − ⋯ − (2𝑛 − 1)2 + (2𝑛)2 .


Note that 𝑆(1) = −12 + 22 , 𝑆(2) = −12 + 22 − 32 + 42 etc.
Prove that 𝑆(𝑛) = 𝑛(2𝑛 + 1) for all positive integers 𝑛.

1
5. Answer any one of the following:
(a) Prove that if 𝑝 𝑚𝑜𝑑 𝑛 = 𝑞 𝑚𝑜𝑑 𝑛, then 𝑝 ≡ 𝑞 (𝑚𝑜𝑑 𝑛) for all
integers 𝑝, 𝑞 and all positive integers 𝑛.
Recall that 𝑝 𝑚𝑜𝑑 𝑛 stands for the remainder when 𝑝 is divided by
𝑛. The statement 𝑝 ≡ 𝑞 (𝑚𝑜𝑑 𝑛) means 𝑛|(𝑝 − 𝑞).
(b) Find the remainder when 250 is divided by 7.

6. Solve the recurrence relation 𝑎𝑛 = 5𝑎𝑛−1 − 6𝑎𝑛−2 subject to the


initial conditions 𝑎0 = 1, 𝑎1 = 4.

You might also like