Assignment No.

01
SEMESTER Fall - 2022
CS702 –Advance Algorithm Analysis and Design

Due Date: 5/12/2022 Total Marks 50

Instructions to Solve Assignments

The purpose of assignments is to provide you with hands on practice on Advance Algorithm Analysis
and Design course. It is expected that students will solve the assignments themselves. Following rules
will apply during the evaluation of assignment.

 Cheating from any source will result in zero marks in the assignment.

 Any student found cheating in any two of the assignments submitted will be awarded "F" grade in
the course.

 In case of question No. 03 direct copy and paste from the research paper will be awarded zero
marks.

 No assignment after due date will be accepted.

Problem No. 1 (20 Marks)

Show/Proof following Propositional Logic by truth Tables.

 (q → ¬ p) ↔ (p ↔ q)
 (p ↔ q) ⊕ (¬p ↔ ¬ r)
 (p ⊕ q) → (p ⊕ ¬q)

Problem No. 2 (10 Marks)

i. State the value of x after the statement if P (x)then x := 1 is executed, where P (x) is the
statement “x > 1,” if the value of x when this statement is reached is

a) = 0.
b) x = 1.
c) x = 2.

ii. Suppose P (x, y) denotes the equation y=x +2, what will the truth values of the Propositions
P (2,5), P (0,1).

Problem No. 3 (20 Marks)

Read the paper entitled as “A Review Report on Divide and Conquer Sorting Algorithm ” available in
the zip folder.

a) Give critical analysis of the above paper in your own words.

b) Suggest any algorithm for sorting large scale data in real time scenario along with its time
complexity.