Design and Analysis Algorithm AD/BE/BS Computer Science UOS — University of Sargodha 2015
Discussion
Ask a question about this paper, or help someone else with theirs. Answers are emailed to whoever asked.
No questions yet — be the first to ask.
Need a paper or stuck on a question? Ask here — students reply and you get an email.
Ask about a paper-
BS ZOOLOGY first semester Animal diversity ZOOL 101 - university of Punjab 2025
0 replies Reply → -
Literary criticism
1 reply Reply → -
this paper consists of 60 marks but now we have 35 marks paper.
1 reply Reply → -
Can you please tell me more past papers please because my exams are starting from next week
1 reply Reply → -
Did you provide the past papers of the science of society uos?
1 reply Reply →
More Design and Analysis Algorithm papers
See all
Design and Analysis Algorithm BS 4 Semester/Term University Of Sargodha (UOS) 2023
Uploaded 3 years ago
Download ↓
Design and Analysis Algorithm BS/MPhil Computer Science/MS Computer Science 4 Semester/Term University Of Sargodha (UOS) 2018
Uploaded 3 years ago
Download ↓
Design and Analysis Algorithm BSCS/MS Information Technology/MSc Information Technology UOS — University of Sargodha 2015
Uploaded 3 years ago
Download ↓
Design and Analysis of Algorithm BSCS 2015 Paper#2 UOS
Uploaded 3 years ago
Download ↓
Design and Analysis of Algorithm BSCS 2015 Paper#3 UOS
Uploaded 3 years ago
Download ↓
Design and Analysis Algorithm BSCS 2017 UOS
Uploaded 3 years ago
Download ↓
Paper text
UNIVERSITY OF SARGODHA, SARGODHA
DEPARTMENT OF COMPUTER SCIENCE
TOTAL TIME: 2 HOUR
M.L.T
MAX. MARKS: 60
Analysis of Algorithm
NOTE:- ATTEMPT ALL QUESTIONS.
©. No1. Briefly explain the following parts. Give examples where needed.
5*4-20
Ustat Why is it not possible to find out the shelest path from a source vertex to any other vertex if
graph is having a cycle?
What will happen if the code of a character will become the prefix of the code glanother
character?
3.
Discuss the case when Huffman code wile ad to minimum or no carp.
Write down the components of dynamic programming.
Q.No.2 Given an adjacency list representation of a directed graph, write an algorithm that computes
the out degree of every vertex. [10]
Q.no.3 Modify the Floyd warshal algorithm such that it also calculates the predecessor matrix. [10]
Q. no.4 What stations should be chosen from line 1 and which from line 2 in order to minimize the total
time through the factory for one car?[10]
Q.No. 5 Obtain the MST for the following graph using kruskul algorithm. How many optimal trees are
Ustare for the given graph. Write down the algorithm too.
ustani.pk
visit website: ustani.pk
