Bangladesh University of Business & Technology (BUBT)

Department of Computer Science and Engineering

Mid-Term Examination: Summer 2021
Course Code: CSE 313 │Course Title: Mathematical Analysis for Computer Science
Intake: 41, Program: B.Sc. in CSE

Marks – 30
[Answer all the questions]
Outcome SLN Questions Marks
CO1 1. (a) “We lose only two regions per bent line”- explain the statement using minimum two 5
examples with the reference of Zig in the plane problem.

(b) Summarize Iverson’s convention for the sum of reciprocals of all even 5
numbers less than or equal 60, where,
1, 𝑖𝑓 𝐸 𝑖𝑠 𝑡𝑟𝑢𝑒
𝐸 =
0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒

Express the following statements using the sigma and general form of summation
notation:
i)“The sum of the squares of all even numbers between 4 and 161.”
ii)“The sum of reciprocals of all odd numbers between 3 and 120.”

CO2 2. (a) Suppose for the problem of Tower of Hanoi, the number of disks is 100. If you 5
want to find out the minimum number of moves that will transfer 100 disks from
source peg to destination peg. Analyze which will you choose between recurrence
relation and closed form equation and explain the reasons.

(b) Suppose, you are told to take n intersecting straight lines on a plane sequentially 5
where n is a positive integer. The number of regions increases and follows a
particular pattern as n increases. Give at least three examples describing how will
you find the maximum number of regions L(n) using the concept of recurrence
relation for such context with necessary figures and write down the recurrence
relation. Also derive the ‘closed-form formula’ for the recurrence to find the
maximum number of regions.

CO3 3. (a) Analyze why three dot notation for summation causes ambiguity and what 4
alternative method can be adopted to avoid these ambiguities.

(b) Prove any three properties of the floor and ceiling functions with examples. 3+3
Evaluate the value of the followings using the formula for binary mod operation.
Page | 1
Where A is the last digit of your ID.

i. (-40 mod (A+1))

ii. (25 mod – (A+1))
iii. ((A+8) mod –(A+1))

Page | 2