::::IIVU ASKARII:::: Re: [vuZs] CS502 some quiz solved it .... as soon as possible next day i hav dat paper:'(

According to my knowledge.

On Sat, Feb 12, 2011 at 6:32 PM, eagle_eye <mc090404410@vu.edu.pk> wrote:

AOA to dear  bro and sis... 

please solved some of these quiz or cs502  final term  as soon as possible bcz the next day i hav dat paper...:(:(   those people who's give their that paper... do it fast 

so please hurry up and do it...  

me waiting for u people +tive response.!!

CS502 final term paperz ..

 

Please sovled these quiz urgent…

 

 

Question No: 2    ( Marks: 1 )    - Please choose one

 Although it requires more complicated data structures, Prim's algorithm for a minimum spanning tree is better than Kruskal's when the graph has a large number of vertices.

       ► True

       ► False

 

 

Question No: 4    ( Marks: 1 )    - Please choose one

 What is generally true of Adjacency List and Adjacency Matrix representations of graphs?

       ► Lists require less space than matrices but take longer to find the weight of an edge (v1,v2)

       ► Lists require less space than matrices and they are faster to find the weight of an edge (v1,v2)

       ► Lists require more space than matrices and they take longer to find the weight of an edge (v1,v2)

       ► Lists require more space than matrices but are faster to find the weight of an edge (v1,v2)

 

 

Question No: 5    ( Marks: 1 )    - Please choose one

 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

 

 

Question No: 6    ( Marks: 1 )    - Please choose one

 Maximum number of vertices in a Directed Graph may be |V²|

       ► True

       ► False

Question No: 21    ( Marks: 1 )    - Please choose one

 We do sorting to,

       ► keep elements in random positions

       ► keep the algorithm run in linear order

       ► keep the algorithm run in (log n) order

       ► keep elements in increasing or decreasing order

Question No: 22    ( Marks: 1 )    - Please choose one

 After partitioning array in Quick sort, pivot is placed in a position such that

       ► Values smaller than pivot are on left and larger than pivot are on right

       ► Values larger than pivot are on left and smaller than pivot are on right

       ► Pivot is the first element of array

       ► Pivot is the last element of array

 

Question No: 1 ( Marks: 1 ) - Please choose one

_______________ is a graphical representation of an algorithm

• notation
• Flowchart
• Asymptotic notation
• notation

Question No: 2 ( Marks: 1 ) - Please choose one

Which of the following is calculated with bigo notation?

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

Question No: 3 ( Marks: 1 ) - Please choose one

Merge sort makes two recursive calls. Which statement is true after these recursive calls

finish, but before the merge step?

• The array elements form a heap
• Elements in each half of the array are sorted amongst themselves
• Elements in the first half of the array are less than or equal to elements in the second half of the array
• None of the above

Question No: 4 ( Marks: 1 ) - Please choose one

Who invented Quick sort procedure?

• Hoare
• Sedgewick
• Mellroy
• Coreman

Question No: 5 ( Marks: 1 ) - Please choose one

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

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

Question No: 6 ( Marks: 1 ) - Please choose one

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

Question No: 7 ( Marks: 1 ) - Please choose one

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

Question No: 8 ( Marks: 1 ) - Please choose one

Can an adjacency matrix for a directed graph ever not be square in shape?

• Yes
• No

-

                                                

                                               eagle_eye 

"Each of us May not Know that Much but together V become Master's"

 

--
--
Please visit www.vuzs.net For Current & Old Papers, Quizzes, Assignments and study material.
--
You received this message because you are subscribed to the Google
Groups "vuZs" group.
--
To post a new message on this group, send email to vuZs@googlegroups.com
--
Message Posting Rules: http://groups.google.com/group/vuZs/web/vuzs-basic-rules-for-posting-messages
--
To unsubscribe from this group, send email to vuZs+unsubscribe@googlegroups.com
--
For more info, visit the main page of vuZs group at http://groups.google.com/group/vuZs
--
To join this group Send blank email from your virtual university email address to
vuZs+subscribe@googlegroups.com
or visit
http://groups.google.com/group/vuZs/subscribe?hl=en

--
RiDem

--
We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish you all the best.
 
Please visit www.vuaskari.com, get registered for old papers, quiz, assignments and GDBs...
You received this message because you are subscribed to the Google
Groups "VU ASKARI" group.
To post to this group, send email to askarivu@googlegroups.com
For more options, visit this group at
 
http://groups.google.com/group/askarivu?hl=en?hl=en