Final Exam Fall 23

National University of Computer and Emerging Sciences, Lahore Campus
Course: Design & Analysis of Algorithms Course Code: CS-2009

Program: BS (Computer/Data Science) Semester: Fall 2023
Duration: 180 Minutes Total Marks: 50
Paper Date: 3-Jan-24 Section: ALL
Exam: Final Page(s): 10
Name Roll Number
Instruction/Notes: Solve it on this question paper. Work in the provided space and do not attach any sheets
with the question paper.
Question Q1 Q2 Q3 Q4 Q5 Q6 Q7 Total Marks
Marks 6 9 6 12 5 6 6 50
Obtained
Marks
Q1) Solve the following recurrences and find out asymptotic time complexity. Use recursion tree method.
Show complete working.
[3+3 = 6]
a) T(n) = 4T(n-1) +1
b) T(n) = 5T(n/6) + cn2
FAST School of Computing Page 1

Q2)
a) Devise the recurrence relation (recursive equation) for the following recursive function for computing its
time complexity. You do not need to solve it. [2]
Mystery(n){
if(n==0)
return n;
else
int x=0;
for(i=1; i<n-1;i++)
x=x+i;
return x+Mystery(n-1);
}
b) You are given an array of n elements, and you notice that some of the elements are duplicates; that is, they
appear more than once in the array. How to remove all duplicates from the array in time O(nlgn). Give the
idea of your algorithm in 3-4 lines. [3]
c) Suppose you are given letter grades of students for the course Design and Analysis of Algorithms in the
form of an array and you are required to answer the following query. How many students have earned
grades from grade X to grade Y? Where X and Y can be any of the letter grades (A+, A, A-, B+, B, B-,
C+, C, C-, D+, D, F). We need an algorithm that can answer such queries in O (1). You can preprocess
the data to answer such queries. Give the idea of your algorithm in 3-4 lines. [4]

Q3) Job Sequencing Problem – Loss Minimization
We are given N jobs numbered 1 to N. For each activity, let Ti denotes the number of days required to complete
the job. For each day of delay before starting to work for job i, a loss of Li is incurred. We are required to find
a sequence to complete the jobs so that overall loss is minimized. We can only work on one job at a time.
(Hint: Use Greedy algorithm). [6]
Examples
Input: L = {3, 1, 2, 4} and
T = {4, 1000, 2, 5}
Output: 3, 4, 1, 2
Explanation: We should first complete job 3, then jobs 4, 1, 2 respectively.
Input: L = {1, 2, 3, 5, 6}
T = {2, 4, 1, 3, 2}
Output: 3, 5, 4, 1, 2
Explanation: We should complete jobs 3, 5, 4, 1 and then 2 in this order.

Q4) When a spell checker encounters a possible misspelling, it looks in its dictionary for other words that are
close by. A natural measure of the distance between two strings is the extent to which they can be aligned. An
alignment is simply a way of writing the strings one above the other. For instance, here are two possible
alignments of SNOWY and SUNNY where the “−” indicates a “gap”; any number of these can be placed in
either string.
The cost of an alignment is the number of columns in which the letters differ. And the edit distance between
two strings is the cost of their best possible alignment. Do you see that there is no better alignment of SNOWY
and SUNNY than the one shown here with a cost of 3? Edit distance is so named because it can also be
thought of as the minimum number of edits—insertions, deletions, and replacements of characters—needed
to transform the first string into the second. For instance, the alignment shown on the left corresponds to three
edits: insert U, replace O → N, and remove W.
The goal is to find the minimum edit distance ED (m, n) between two strings Xn = (x1, x2,...,xn) and Ym =
(y1,y2,..,ym).
 Operation 1 (INSERT): Insert any character before or after any index of X
 Operation 2 (REMOVE): Remove a character of X
 Operation 3 (REPLACE): Replace a character at any index of X with some other character.
Note: All of the above operations are of equal cost of 1 unit.

Below is the recurrence relation for edit distance of strings Xn and Ym where Xn =(x1,x2,...,xn) is a string of n
characters and Ym = (y1,y2,..,ym) is a string of m character:
𝑚 𝑖𝑓 𝑛 = 0
𝑛 𝑖𝑓 𝑚 = 0
𝐸𝐷 (𝑋𝑛 , 𝑌𝑚 ) = 𝐸𝐷 (𝑋 − 1, 𝑌 − 1) 𝑖𝑓 𝑥𝑛 = 𝑦𝑚
𝑛 𝑚
{𝑀𝑖𝑛(𝐸𝐷(𝑋𝑛−1 , 𝑌𝑚−1 ), 𝐸𝐷(𝑋𝑛−1 , 𝑌𝑚 ), 𝐸𝐷(𝑋𝑛 , 𝑌𝑚−1 )) + 1 𝑖𝑓 𝑥𝑛 ≠ 𝑦𝑚
a) Compute the edit distance between two strings X = POLYN and Y = EXPON, by using the above DP
solution. Fill the following table for finding minimum edit distance. [3]
X P O L Y N
Y 0 1 2 3 4 5
E 1
X 2
P 3
O 4
N 5

b) Typists often make transposition errors exchanging neighboring characters, such as typing “setve” when
you mean “steve.” This requires two replace operations (edit distance=2) to convert setve to steve. If we
incorporate a swap (swaps two adjacent characters) operation into our edit distance functions along with
insert, remove and replace, then such neighboring transposition errors can be fixed at the cost of one
operation. What would be the recurrence relation for this modified edit distance (that includes swap
operation)? [4]
c) Write down the pseudo code of a function that computed the edit distance of Xn and Ym . Also write its
time complexity[5]

Q5) Consider the graph given below and run Floyd Warshal algorithm to find all pairs shortest paths. Show
the results at each step. For your ease matrices are provided. [5]
D0 1 2 3 4 D3 1 2 3 4
1 1
2 2
3 3
4 4
D1 1 2 3 4 D4 1 2 3 4
1 1
2 2
3 3
4 4
D2 1 2 3 4
1

Q6)
a) In what scenario any MST algorithm will leave an edge with smaller weight edge and will pick a heavy
weight edge. Explain the scenario with an example. [3]
b) Let T be a minimum spanning tree of a graph G. Then for any two vertices u,v the path from u to v in T is a
shortest path from u to v in G. Is this statement True or False? Justify your answer with an example. [3]

Q7) Nasa has captured an image of a distinct area of plant earth where either land or water is visible. They want
to count the number of islands in the captured image. An IT expert in team NASA has converted that image into
a N*N binary matrix such that 0 represents land and 1 represents water. Your task is to find the total number of
islands in the given N*N matrix. For example, given the following matrix, your answer must be four as there are
four isolated land regions. The shaded regions are water in this example.
0 1 0 0 1
1 1 0 1 1
0 0 0 1 0
1 1 0 1 0
1 1 0 1 1
Consider this problem as a graph problem where each cell represents vertex and adjacent cells represent adjacent
vertices. An attribute “key” is associated with each vertex where 1 represents that vertex is land and 0 represents
the vertex as water. [6 Marks]
a) Your task is to design an efficient algorithm to count the number of islands. (Hint: Connected Components).
Write pseudo code of algorithm.
b) Write down the time complexity of your algorithm.


Final Exam Fall 23

Uploaded by

Copyright:

Available Formats

Final Exam Fall 23

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Final Exam Fall 23

Uploaded by

Copyright:

Available Formats

National University of Computer and Emerging Sciences, Lahore Campus

Course: Design & Analysis of Algorithms Course Code: CS-2009

b) T(n) = 5T(n/6) + cn2

FAST School of Computing Page 1

FAST School of Computing Page 2

FAST School of Computing Page 3

Note: All of the above operations are of equal cost of 1 unit.

FAST School of Computing Page 4

FAST School of Computing Page 5

FAST School of Computing Page 6

FAST School of Computing Page 7

b) Write down the time complexity of your algorithm.

FAST School of Computing Page 8

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.