CS502 All current final term paper Fall 2015 at one place from 5th March to 16th March 2015. - Virtual University of Pakistan2019-09-19T09:30:01Zhttps://vustudents.ning.com/forum/topics/cs502-all-current-final-term-paper-fall-2015-at-one-place-from?groupUrl=cs502fundamentalsofalgorithms&commentId=3783342%3AComment%3A4969010&x=1&feed=yes&xn_auth=noJazakallah Khair, umeed hai…tag:vustudents.ning.com,2015-03-14:3783342:Comment:49690102015-03-14T08:18:39.541Z_H MIT 4thhttps://vustudents.ning.com/profile/Merchant
<p>Jazakallah Khair, umeed hai saab pass hojayeen specially is subject mai. Is ki assignments .. exams sai zyada khatarnaak theen.</p>
<p></p>
<p>Jazakallah Khair, umeed hai saab pass hojayeen specially is subject mai. Is ki assignments .. exams sai zyada khatarnaak theen.</p>
<p></p> TO day 13 march 2015 my paper…tag:vustudents.ning.com,2015-03-13:3783342:Comment:49681912015-03-13T15:03:24.513Z+ "ŜÃŇÃ (€X‿VU))+https://vustudents.ning.com/profile/1111
<p>TO day 13 march 2015 my paper of cs502</p>
<p></p>
<p><span>Q: Suppose you could prove that an NP-complete problem cannot be solved in polynomial time. What would be the consequence (5 marks)</span></p>
<p><span>Answer:</span></p>
<p>If we can solve a problem in polynomial time, we can certainly verify the solution in polynomial time. <br></br>More formally, we do not need to see a certificate to solve the problem; we can solve it in polynomial time <br></br>anyway. <br></br>However, it is not known…</p>
<p>TO day 13 march 2015 my paper of cs502</p>
<p></p>
<p><span>Q: Suppose you could prove that an NP-complete problem cannot be solved in polynomial time. What would be the consequence (5 marks)</span></p>
<p><span>Answer:</span></p>
<p>If we can solve a problem in polynomial time, we can certainly verify the solution in polynomial time. <br/>More formally, we do not need to see a certificate to solve the problem; we can solve it in polynomial time <br/>anyway. <br/>However, it is not known whether P = NP. It seems unreasonable to think that this should be so. Being able <br/>to verify that you have a correct solution does not help you in finding the actual solution. The belief is that <br/>P 6= NP but no one has a proof for this.</p>
<p></p>
<p><span><span>Q: What is the cost of the following graph? (marks 5)</span></span></p>
<p></p>
<p>Answer:</p>
<p>the cost off the graph is 33.</p>
<p></p>
<p>Q: How Dijkstra‟s algorithm works? (3 marks)</p>
<p>Answer:</p>
<p>Dijkstra’s algorithm is a simple greedy algorithm for computing the single-source shortest-paths to all <br/>other vertices. Dijkstra’s algorithm works on a weighted directed graph G = (V, E) in which all edge <br/>weights are non-negative, i.e., w(u, v) _ 0 for each edge (u, v) 2 E.<br/>Negative edges weights maybe counter to intuition but this can occur in real life problems. However, we <br/>will not allow negative cycles because then there is no shortest path. If there is a negative cycle between, <br/>say, s and t, then we can always find a shorter path by going around the cycle one more time.</p>
<p></p>
<p>Q: Polynomial time algorithm (2 marks)</p>
<p>Answer:</p>
<p>A polynomial time algorithm is any algorithm that runs in O(n<br/>k<br/>) time.<br/>A problem is solvable in polynomial time if there is a polynomial time algorithm for it.</p>
<p></p>
<p>Q:How to propagate shortest path in Bell men Ford theorem? (3 marks)<br/>Answer: <br/>The shortest path information is propagated sequentially along each shortest path in the graph.</p>
<p>Q: Consider the following (3 marks)<br/>Can an adjacency matrix for a directed graph ever not be square in shape? Why or why not?<br/>0 1 2 3</p>
<p>1 2 4 0</p>
<p>2 0 0 2</p>
<p>3 4 0 2</p>
<p>Answer: <br/>No. since we want to describe the relationship between each node and each other node, we need precisely <br/>n^2 matrix entries.</p>
<p></p>
<p>baki question graphs ka thy wo main bhul gai <img src="http://www.bkserv.net/images/Tongue.gif"/><img src="http://www.bkserv.net/images/Tongue.gif"/></p>
<p>best of luck to all of u ?</p>
<p>pray for me <img src="http://www.bkserv.net/images/Smile.gif"/><img src="http://www.bkserv.net/images/Smile.gif"/></p> shukr hai kisi ne to march 20…tag:vustudents.ning.com,2015-03-13:3783342:Comment:49675852015-03-13T05:05:39.041Z♥♥♥♥ muzna ♥♥♥♥https://vustudents.ning.com/profile/muzna
<p>shukr hai kisi ne to march 2015 wala paper post kia</p>
<p> thank u <a href="http://vustudents.ning.com/group/cs502fundamentalsofalgorithms/forum/topic/listForContributor?user=1j5lvwpe76sgc" class="fn url">Rizwan Tariq BSIT</a></p>
<p>shukr hai kisi ne to march 2015 wala paper post kia</p>
<p> thank u <a href="http://vustudents.ning.com/group/cs502fundamentalsofalgorithms/forum/topic/listForContributor?user=1j5lvwpe76sgc" class="fn url">Rizwan Tariq BSIT</a></p> Today 12 march 2015
cs502 exa…tag:vustudents.ning.com,2015-03-12:3783342:Comment:49666162015-03-12T13:53:22.961ZEx Vu studenthttps://vustudents.ning.com/profile/RizwanTariq629
<p>Today 12 march 2015</p>
<p>cs502 exam</p>
<p>only 5,6 mcqs were from moazz file so please prepare notebook too algorithms topic and complexity topic are important </p>
<p>mostly subjective from moazz file</p>
<p>Suppose you could prove that an NP-complete problem cannot be solved in polynomial time. What would be the consequence (5 marks)</p>
<p> Make adjacency list of given graph (marks 5)</p>
<p>What is the cost of the following graph? (marks 5)</p>
<p>aik line ka jwab tha which is cost…</p>
<p>Today 12 march 2015</p>
<p>cs502 exam</p>
<p>only 5,6 mcqs were from moazz file so please prepare notebook too algorithms topic and complexity topic are important </p>
<p>mostly subjective from moazz file</p>
<p>Suppose you could prove that an NP-complete problem cannot be solved in polynomial time. What would be the consequence (5 marks)</p>
<p> Make adjacency list of given graph (marks 5)</p>
<p>What is the cost of the following graph? (marks 5)</p>
<p>aik line ka jwab tha which is cost =33 :p lol 5 marks easily</p>
<p><span>If you have to lay a train track between n cities. is kisam ka q tha (marks 5)</span></p>
<p></p>
<p>Define back Edge (2 marks)</p>
<p> working of Prim's Algorithm (2 marks)</p>
<p>bits wala q tha sirf bits ki value btani thi (2 marks)</p>
<p>minimizing spanning tree (3 marks)</p>
<p>MST problem in prism algorithm (3 makrs)</p>
<p>money counting k liye psuedo code likhna tha (3marks)</p>
<p></p>
<p>best of luck everyone :) <img src="http://www.bkserv.net/images/Smile.gif"/></p>
<p></p> mine today paper
mcqs are
Whi…tag:vustudents.ning.com,2015-03-08:3783342:Comment:49609802015-03-08T10:00:58.495Zkiranhttps://vustudents.ning.com/profile/kiran475
<p>mine today paper</p>
<p>mcqs are</p>
<p>Which types of algorithm is harder to prove te correctness?<br></br> 1- Dynamic programming<br></br> 2- Brute force <br></br> 3- Greedy<br></br> 4- Divide and conquer<br></br> ……………………………………………..<br></br> If a problem “s” is NP complete it must be ?<br></br> 1- NP and NP hard<br></br> 2- NP not necessarily<br></br> 3- Np hard mean it is NP complete as well <br></br> 4- In P and NP<br></br> …………………………….<br></br> The function having complexity O(nk) belongs to?<br></br> 1- <b>Co-np class</b><br></br> 2-…</p>
<p>mine today paper</p>
<p>mcqs are</p>
<p>Which types of algorithm is harder to prove te correctness?<br/> 1- Dynamic programming<br/> 2- Brute force <br/> 3- Greedy<br/> 4- Divide and conquer<br/> ……………………………………………..<br/> If a problem “s” is NP complete it must be ?<br/> 1- NP and NP hard<br/> 2- NP not necessarily<br/> 3- Np hard mean it is NP complete as well <br/> 4- In P and NP<br/> …………………………….<br/> The function having complexity O(nk) belongs to?<br/> 1- <b>Co-np class</b><br/> 2- NP-prime class<br/> 3- P-class<br/> 4- NP-class</p>
<p>Using Huffman encoding technique the string “a@$a”will be encoded with ?<br/> 1- 5bits<br/> 2- 6bits<br/> 3- 8bits<br/> 4- Huffman encoding fail at this sting</p>
<p></p>
<p>one isThere are Θ(n<br/>2<br/>) entries in the matrix. Each entry E(i, j) takes ,....time to compute</p>
<p>symptotically equivalent<br/>to g(n). Formally: ka formula btana tha</p>
<p>what is ram</p>
<p>2 number marks</p>
<p>shortest path how can solve in single source shortest path</p>
<p>folyd algorithms running time</p>
<p>cost of tree ka formula btana tha</p>
<p>relax posude code</p>
<p>dijikstra pousudo code</p>
<p>Variants of shortest path solution briefl</p>
<p>Prove the following lemma,<br/>Lemma: Given a digraph G = (V, E), consider any DFS forest of G and consider any edge (u, v) ∈ E.<br/>If this edge is a tree, forward or cross edge, then f[u] > f[v]. If this edge is a back edge, then f[u] ≤ f[v]</p>
<p>floyd ka pasudo code</p>
<p>or last is</p>
<p>Suppose you could prove that an NP-complete problem cannot be solved in<br/>exponential set of time . What would be the consequence</p>
<p>Clique Cover when we need</p>
<p></p>
<p>please pray 4 me</p> Thanks for sharing!tag:vustudents.ning.com,2015-03-07:3783342:Comment:49605442015-03-07T20:52:20.917ZѼ Gracious Heart Ѽhttps://vustudents.ning.com/profile/GHNING
<p>Thanks for sharing!</p>
<p>Thanks for sharing!</p> paper mostly from last 10-15…tag:vustudents.ning.com,2015-03-07:3783342:Comment:49601782015-03-07T16:57:11.725Zsaqlainhttps://vustudents.ning.com/profile/saqlain464
<p>paper mostly from last 10-15 lectures</p>
<p>djikstra , kruskal, prim, floyd, long questions</p>
<p>revise running times and storage requirements of as many algo</p>
<p>objectives mostly from moaaz</p>
<p>huffman many mcqs</p>
<p></p>
<p>generally difficult paper (for me<img src="http://www.bkserv.net/images/Grin.gif"/>)</p>
<p> </p>
<p></p>
<p>paper mostly from last 10-15 lectures</p>
<p>djikstra , kruskal, prim, floyd, long questions</p>
<p>revise running times and storage requirements of as many algo</p>
<p>objectives mostly from moaaz</p>
<p>huffman many mcqs</p>
<p></p>
<p>generally difficult paper (for me<img src="http://www.bkserv.net/images/Grin.gif"/>)</p>
<p> </p>
<p></p> Great Job!tag:vustudents.ning.com,2015-03-07:3783342:Comment:49597312015-03-07T14:05:11.996ZKamalpkhttps://vustudents.ning.com/profile/Kamalpk
<p>Great Job!</p>
<p>Great Job!</p> ALL curent papers spring 2014…tag:vustudents.ning.com,2015-03-07:3783342:Comment:49593362015-03-07T12:41:10.263ZHumdahttps://vustudents.ning.com/profile/sadiausman
<p>ALL curent papers spring 2014 finltrm </p>
<p>ALL curent papers spring 2014 finltrm </p> >> Hufman coding. abbcc…tag:vustudents.ning.com,2015-03-06:3783342:Comment:49580552015-03-06T11:04:42.791ZPrincehttps://vustudents.ning.com/profile/Prince956
<p>>> Hufman coding. abbccdeef. how many bits, bytes etc while using ASCII coding = 4MCQs of different angles.</p>
<p>>> How Prim's algorithm works?If a NP-complete problem is reduced to Polynomial time problem. What are the consequences?</p>
<p>>> Apply Dijkstra’s Algorithm on a given graph.</p>
<p>>> Show that greedy algorithm gives a optimized solution for activity scheduling.</p>
<p>>> If you have to lay a train track between n cities. How would you find the…</p>
<p>>> Hufman coding. abbccdeef. how many bits, bytes etc while using ASCII coding = 4MCQs of different angles.</p>
<p>>> How Prim's algorithm works?If a NP-complete problem is reduced to Polynomial time problem. What are the consequences?</p>
<p>>> Apply Dijkstra’s Algorithm on a given graph.</p>
<p>>> Show that greedy algorithm gives a optimized solution for activity scheduling.</p>
<p>>> If you have to lay a train track between n cities. How would you find the minimum track length. Tell what algorithm is best to use for it and why?</p>
<p>>>2 or 3 pure mathematical questions.</p>
<p>>> Write a pseudo-code for coin exchange problem.</p>
<p>>> A relationship table was given, find whether a loop is present or not. If yes between what vertices?</p>
<p>* Most questions were taken from last three algorithms.</p>
<p>* Most paper was from last 10 lectures.</p>
<p>Overall, paper was tough.</p>
<p></p>