Monday, 7 February 2011

CS subjects Final term Solved papers

Aslam o Likum Please the link given below for Solved CS final term papers, Also upload your papers for othershttp://vujungle.com/forum/viewforum.php?f=11&sid=f9cbbe67fe7de2f36ca3df0ac8b1f...

Tuesday, 1 February 2011

Quick-PDF PDF To Word Converter v2.2 Portable | 5.4 MB

Many people seem to feel puzzled about how they can edit their numerous PDF's or at least convert them to Word documents. Indeed, converting a PDF to Word or an RTF file isn't that obvious. These document formats have in-depth differences after all.Easy and AccurateAll the more do astonish the great capabilities of PDF to MS Word product! With this neat piece of software you would never imagine the task had some complexity beneath! It really...

CS502 Latest Quiz

Question # 1 of 10 ( Start time: 11:09:54 AM )Total Marks: 1What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm?Select correct option:log (V)V.VE.Elog (E)Question # 2 of 10 ( Start time: 11:11:24 AM )Total Marks: 1A digraph is strongly connected under what condition?Select correct option:A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v .pair of vertices u, v e V, u can reach v and vice versa.A digraph is strongly connected if for at least one pair of vertex u, v e V,  u can reach v and vice versa.pair  of vertices u, v e V, u can reach...

Page 1 of 812345Next
Twitter Delicious Facebook Digg Stumbleupon Favorites More