Share Your Final Term Papers Here in Reply of this Discussion
May Allah Solve Our Problems and Give Us Success
You Can download papers by a simple click on file. All the uploaded filed are in Zip file or PDF format So Install Adobe Reader and Winrar Software’s to open these Files
Note: If you download files with Internet Download Manager (IDM), you would face problem of damage files. All files are correct and no damage file, If you face this problem, Open IDM > Click on Options > Click on File Types > Remove PDF and ZIP from files types and save. After it download again files, files will work properly.
You Can Download Solved Final Term Papers, Short Notes, Lecture Wise Questions Answers Files, Solved MCQs, Solved Quizzes , Solved Final Term Subjective Papers , Solved Final Term Objective Papers From This Discussion For Preparation Final Term Paper of Spring 2014
Or
For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.
For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.
click on this link
https://vustudents.ning.com/forum/topics/how-you-can-view-all-the
Tags:
Subjective:
1) Define topological Sort. (2 marks)
2) What is overall time of Kruskal's Algorithm if graph is sparse. (2 marks)
3) how Dijkstra's Algorithm works? (2 marks)
4) If we implement the bag data structure by using a stack, then which type of traversal it will be? (2 marks)
5) Let the adjacency list representation of an undirected graph is given below. Explain what general property of the list indicates that the graph has an isolated vertex. (3 marks)
a -> b -> c -> e
b -> a -> d
c -> a -> d -> e -> f
d -> b -> c -> f
e -> a -> c -> f
f -> c -> d -> e
g
6) Explain the following two basic cases according to Floyd-Warshall Algorithm. (3 marks)
1. Dont go through vertex k at all
2. Dont go through vertex k.
7) Given a diagraph G=(V,E), consider any DFS forest og G and consider any edge (u,v) in E. Prove that if this edge is a tree, forward or cross edge, then f [u] > f [v] and if this edge is a back edge, then f [u] <= f [v]. (3 marks) 8) According to Dijkstra's Algorithm, write the pseudo code to relax a vertex. (5 marks)
9) Graph was given, by applying Kruskal's algorithm, make the MST. (5 marks)
10) by applying DFS, find the strong components the graph (graph was given) 5 marks
(11) Adjacency matrix was given. We have make the adjacency list from the matrix. (5 marks)
Best of luck
NOT MY PAPER
CS502 FUNDAMENTALS OF ALGORITHEMS
5 MCQ`s from past papers:P
How Gready algorithem works?
Wright brief intro about dynamic programing
Draw th knapsack tree for the given graph
What is BFS and how it works?
2 questions digraph se thy ku6 bhool gye:P
Diffrance between DSF and BSF.
Prime algorithem
Write the paseudo code of prime algorithem
Dijkstra`s algorithem & how it works?
Aik claim aya tha proof krna tha usy
PG#147 se Create_Set(u), Find_set(u) , Union(u,v)
Best of luck for your exams
my ppr was OK nt so tough nt so easy...
objctve easy tha bt subjctve was a bit dffclt...
my 2days ppr...
How the Dijkstra’s algorithm works?
hw short path problem is converted in single source problem?
Apply Kruskal's algorithm on a given graph? graph was given
1 matrix given thi usmain hmain kha va tha k btao loops bn ri ain k nai? if yes 2 mention kro khn khn ain? n ye b btain k ksae pta chl ra k loops bnri ae...
Adjacency matrix was given. We have make the adjacency list from the matrix. ye 5 mrks ka tha...
Adjacency matrix was given. We have make the adjacency list from the matrix. ye 5 mrks ka tha...
how many bits/bytes in this "aabaaccaadb" in ASCII ye mcq kafi rpt hua tha
write psuedo code of somthing wo yad nai kis cheez ka tha :P
"how Dijkstra's Algorithm works? ye sbkoooooo ara ae zaroor kr k jain sb"
is se zada yad nai sorry btw BST OV LCK EVRY1! :)
past papers say mcqs aur subjective aa rahay hain ya nahi?
Given a diagraph G=(V,E), consider any DFS forest og G and consider any edge (u,v) in E. Prove that if this edge is a tree, forward or cross edge, then f [u] > f [v] and if this edge is a back edge, then f [u] <= f [v]. es question ka answer bta dy koi plz
For the non-tree forward and back edges the proof follows directly from the parenthesis lemma.For example, for a forward edge (u, v), v is a descendent of u and so v’s start-finish interval is contained within u’s implying that v has an earlier finish time. For a cross edge (u, v) we know that the two time intervals are disjoint. When we were processing u, v was not white (otherwise (u, v) would be a tree edge), implying that v was started before u. Because the intervals are
disjoint, v must have also finished before u.
Smart Kuri thnaks for sharing
Solved current papers,
kai q k ans nai mily mjhy. sorry
© 2021 Created by + M.Tariq Malik. Powered by
Promote Us | Report an Issue | Privacy Policy | Terms of Service
We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.
We are user-generated contents & non-commercial site. All product, videos, pictures & others contents on site don't seem to be beneath our Copyrights & belong to their respected owners & freely available on public domains. All Contents on site are for personal & non-commercial use.We believe in Our Policy & do according to them. If Any content is offensive in your Copyrights then please email at m.tariqmalik@gmail.com with copyright detail & We will happy to remove it immediately.
Management: Admins ::: Moderators
Awards Badges List | Moderators Group
All Members | Featured Members | Top Reputation Members | Angels Members | Intellectual Members | Criteria for Selection
Become a Team Member | Safety Guidelines for New | Site FAQ & Rules | Safety Matters | Online Safety | Rules For Blog Post