Question

(Final Term, Marks = 10, Lesson No. 41)

Prove that if p is prime, a is positive integer not divisible by p,
a^p-1 = 1 mod p OR a^p = a mod p

Answer:

Question

(Final Term, Marks = 5, Lesson No. 41)

Decrypt 0981 0461 if encrypted using RSA
public key = (e, n) = (13, 43.59 = 2537)

Answer:

Question

(Final Term, Marks = 5, Lesson No. 40)

Prove taht if gcd(a, m) = 1 and m > 1, then a has a unique inverse a' (modulo m).

Answer:

Question

(Final Term, Marks = 5, Lesson No. 39)

Prove that x and y are relatively prime iff gcd(x, y) = 1

Answer:

Question

(Final Term, Marks = 10, Lesson No. 39)

If a and b are integers, not both zero then gcd(a,b) is the smallest positive element of the set {ax + by : x, y ε Z} of linear combination of a nad b.

Answer:

Question

(Final Term, Marks = 5, Lesson No. 38)

Prove that if a|b, a|c then a|(b + c) ∀ a, b, c ε Z

Answer:

Question

(Final Term, Marks = 5, Lesson No. 36)

Write pseudo code of EXTEND-SHORTEST-PATH.

Answer:

Question

(Final Term, Marks = 5, Lesson No. 29)

Write pseudo code of DFS-Visit.

Answer:

Question

(Final Term, Marks = 10, Lesson No. 28)

Write BFS (Breadth First Search) pseudo code algorithm.

Answer:

Question

(Final Term, Marks = 5, Lesson No. 26)

Write pseudo code of Huffman algorithm.

Answer:

Question

(Final Term, Marks = 10, Lesson No. 24)

Write pseudo code of optimal binary search tree.

Answer:

Question

(Final Term, Marks = 5, Lesson No. 24)

Explain situation and example in which greedy algorithm does not work.

Answer:

Question

(Final Term, Marks = 10, Lesson No. 23)

Write pseudo code of LCS (Longest Common Subsequence) problem.

Answer:

Question

(Mid Term, Marks = 10, Lesson No. 19)

Write the Pseudo code of complete knapsack dynamic programming algorithm for 0-1 knapsack problem.

Answer:

Question

(Mid Term, Marks = 5, Lesson No. 19)

Write the pseudo code of 0-1 knapsack brute force algorithm.

Answer:

Question

(Mid Term, Marks = 5, Lesson No. 18)

Write the pseudo code of n-line assembly: dynamic programming for print stations.

Answer:

Question

(Mid Term, Marks = 10, Lesson No. 16)

Given a sequence [A₁, A₂, A₃, A₄]

• Order of A₁ = 10 x 100
• Order of A₂ = 100 x 5
• Order of A₃ = 5 x 50
• Order of A₄ = 20 x 50

Using the Brute force method compute the order of the product A₁, A₂, A₃, A₄ in such a way that minimizes the total number of scalar multiplications.

Answer:

Question

(Mid Term, Marks = 10, Lesson No. )

algorithm of shortest distance between n points

Answer:

Question

(Mid Term, Marks = 10, Lesson No. )

Prove tautology by logical equivalence.

Answer:

Question

(Mid Term, Marks = 10, Lesson No. )

assembly line problem 6 stations

Answer:

Question

( Term, Marks = , Lesson No. )

write down the brute force chain matrix multiplication algorithm and complexity.

Answer:

Question

( Term, Marks = , Lesson No. )

write pseudo code algorithm of merge sort.

Answer:

Select a course code for Subjective Questions:

ACC311 CS001 CS101 CS201 CS301 CS607 CS701 CS702 CS703 CS704 CS707 CS708 CS710 CS711 CS718 CS721 CS724 ECO401 ECO403 ENG101 ENG301 MGT703 MTH501 STA301

Select a course code for Objective Questions:

ACC311 ACC501 BIF101 BIF401 BIF501 BIO101 BIO201 BIO202 BIO203 BIO204 BIO301 BIO302 BIO303 BIO401 BIO503 BNK603 BT101 BT201 BT301 BT302 BT401 BT402 BT403 BT404 BT405 BT406 BT501 BT504 BT505 BT604 CHE201 CHE301 CS001 CS101 CS201 CS202 CS204 CS301 CS302 CS304 CS311 CS401 CS402 CS403 CS408 CS501 CS502 CS504 CS506 CS508 CS601 CS602 CS604 CS605 CS607 CS609 CS610 CS614 CS707 CS710 ECO401 ECO402 ECO403 ECO404 EDU302 EDU401 EDU402 EDU501 EDU601 ENG101 ENG201 ENG301 ENG501 FIN611 FIN624 FIN625 ISL201 IT430 MCM101 MCM301 MGMT623 MGT101 MGT211 MGT301 MGT401 MGT402 MGT501 MGT502 MGT503 MGT510 MGT601 MGT603 MKT501 MKT610 MKT630 MTH101 MTH202 MTH302 MTH501 MTH601 MTH634 PAK301 PHY101 PHY301 PSY101 PSY403 PSY502 PSY512 SOC101 SOC301 SOC401 STA301 STA630 STA641 ZOO102 ZOO401 ZOO501 ZOO502 ZOO503 ZOO504 ZOO505 ZOO506 ZOO510 ZOO630