Institute of Southern Punjab

Multan
Department of Computer Science
& IT
Final Term Examination
Subject: Design & Analysis of Algorithm
Class: BSCS 6th A, BSCS 6th B, BSCS Semester: 1th
6th C
Instructor: Waqas Sharif Date: 30-09-2019
Paper Type: Subjective Time 3 hours
Allowed:

Instructions: (Read Carefully)

1-Read Question Paper carefully.
2-Don’t write anything on Question paper except your Registration No. and
name.
3-Make sure your mobile phone is switched off.
4-Any unauthorized material found after the start of examination will be
considered as possible evidence of cheating or attempting to do so.
5- Avoid Cutting / Overwriting.

NOTE: ATTEMPT ALL QUESTIONS.

Part A (Short Questions) 4 x 6 Marks

Question No 1: Attempt following short questions. All question Carrying equal marks

1) Solve the following the recurrence relation (04)

c n= 0
T(n)= { }
T(n − 1) + 2 n> 0
2) Define optimize problem? Named few algorithms use to solve optimize
problem
(04)
3) Differentiate between P and NP class problem with example (04)

4) Define Graph Data Structure? Demonstrate Breath First Search (BFS) by taking an
undirected graph. (04)

5) Represent a matrix representation of following graph with space complexity (04)

6) Differentiate between Big O and Big Omega asymptotic

notation(04)

1|Pag
Composed by Mubeena Ali
Part B (Long Questions)

Question No 2: Explain Max Network-Flow Problem? Compute the maximum flow

from following graph using Ford-Fulkerson method. What is worst cost of Ford-
Fulkerson method? (10)

Question No 3: Write procedure of dynamic programming to solve problem. How can

we reduce the time of Fibonacci series algorithm using dynamic programming? (10)

Question No 4: what is job sequencing problem? Solve following Job Sequencing

problem using Greedy method. (06)

Job J1 J2 J3 J4 J5
Profit 20 15 10 5 1
Deadline 2 2 1 3 3