We have been working very hard since 2009 to facilitate in your learning Read More. We can't keep up without your support. Donate Now.


+ Link For Assignments, GDBs & Online Quizzes Solution


+ Link For Past Papers, Solved MCQs, Short Notes & More

Current Final Term Papers Spring 2012 Date: 16-July-2012 to 27-July-2012

Current Final Term Papers Spring 2012 Papers, July 2012, Solved Final Term Papers, Solved Papers, Solved Past Papers, Solved MCQs

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here To Join (Our facebook study Group)

Views: 3189

Replies to This Discussion

Rizwan plz word ki file upload kro ye tu docx file hy open hi nai ho rhi 

Thanks aneela! Pleasure is mine. Here is the word file attached via.....


Rizwana Zahoor Thank You So Much 

Aoa to all....

pls upload solved more mcqz of cs502 ...tomorw iz my papr pls help me 

solved are already uploaded plz see previous posts!

i see that posts. but i need more..

Which sorting algorithm is faster:
1. O (n log n)
2. O n^2
3. O (n+k)
4. O n^3

which option is best???

i think O (n log n) is the best, plz some one varify it.

Assalam o Alaikum..As per my research required answer is O(n+k).Check file in attachment.


Another file..Please remember me in your duas.



Kindly upload old / current papers of "DIFFERENTIAL EQUATIONS" in Differential Equations Thread.

Thanks in advance.

Dear ALL !

               here is some of mcq which was not complete in the past so i make complete it . 

thanks . 

umair sid 

__________ is a graphical representation of an algorithm


  • Notation       Flowchart        Asymptotic notation       notation


Which of the following is calculated with bigo notation?

  • Lower bounds                                Upper bounds
  • Both upper and lower bound         Medium bounds

Who invented Quick sort procedure?


Hoare        Sedgewick       Mellroy       Coreman


What is the solution to the recurrence T(n) = T(n/2)+nT(1) = 1


O(logn)       O(n)         O(nlogn)       O(2n)


Consider the following Huffman Tree

The binary code for the string TEA is


10 00 010       011 00 010       10 00 110        11 10 110

                    Binary of SEA     binary of TEN



If a graph has v vertices and e edges then to obtain a spanning tree we have to delete v edges.

V        e + 5 edges       v + e edges.      None of these


Looking For Something? Search Here


This is a member-supported website. Your contribution is greatly appreciated!

© 2020   Created by +M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service