Latest Activity In Study Groups

Join Your Study Groups

VU Past Papers, MCQs and More

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.

dear all..!

                 please find the attached copy of finals of cs502 

  just remember me in ur rayers...

thansks... 

                     umair sid 

Views: 1102

Attachments:

Replies to This Discussion

Discussion featured Now 

thanks alot

its amazingggggggggggg thanx

pleasure Rose 

thanx umair  but some  subjective question are unsolved.plz solved it and share plz

dear jaffar bro dont worry INSHALLAH if i solve then must be share ok . 

thanks . 

           umair sid 

if any person having more mcq for the FINAL TERM paper plz share.

Attachments:

dear 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)+n, T(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

 

THANK YOUUUU

RSS

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

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