Q:A sequence of a value in a column of the dynamic programming table for an instance of the knapsack problem is always non-decreasing order (true or false) (5)
Q: Describe Dijkstra’s algorithm working?
Q: Explain the following two basic cases according to Floyd-Warshall Algorithm,
Q: Differentiate between back edge and forward edge suppose you could prove
that an NP-complete problem cannot be solved in polynomial time. What would
be the consequence?
Q: 58.How Kruskal's algorithm works?
Q: DFS graph dya huwa tha .. jis ko traverse krna tha (5mrks)
Q: Dijkastra’s algorithm ka graph tha jis mn us ki just final graph show krna tha.. (5mrks)
Q:what is path? (2)
Q: define free tree (2)
Q:comment wether the computational powers RAM sequential machine are less than that the parallel machine (3)
Q: dosry dynamic algorithm ki trh, what is genius of warshell algorithm. (3)
Q: given a graph G(V,E) any DFS forest of G and consider edge (u,v)E E. prove that if this edge is tree, forward or back edge then f[u]>f[v] and if this edge is backedge then f[u] ≤ [v]. (3)
Q: 5 mrks ka code tha jis ki output btani thi k sahi hy ya nai…
Baki 3 Qsn yaad nai … now paper gya muk… ty killa gya thuk.. :P
And frnds must see the previous pprz cz my all subjective waz frm there and mcqz mostly wz frm there.. ALLAH HAFIZ
0 comments
Post a Comment