Skip to main content

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

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: 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: 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


On 12 February 2011 18:32, 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 |V2|

       ► 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"
 

--
---------------------------
Complete QURAN
http://www.quranflash.com/en/quranflash.html
http://tanzil.info
=+=+=+=+=+=+=+=+=+=+=+=+=+=+=
thanks for joing "vustudy&masti" group.
For group Rules view the link
http://groups.google.com.pk/group/vustudymasti/web/group-rules
To post to this group, send email to vustudymasti@googlegroups.com
Current web address: http://groups.google.com.pk/group/vustudymasti
------------------------------------------------------------------------------------------------



--





*****stylowinkie*******


--
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

Comments

Post a Comment

Popular posts from this blog

Updating our Google Account inactivity policy

Every day Google works hard to keep you and your private information safe and secure by preventing unauthorized access to your Google Account with our built-in security protections. And keeping you safe means having strong privacy practices across our products that minimize how long we store your personal files and any data associated with them. We want to protect your private information and prevent any unauthorized access to your account even if you're no longer using our services. Therefore, we are updating the inactivity period for a Google Account to two years across all our products and services. This change starts rolling out today and will apply to any Google Account that's been inactive, meaning it has not been signed into or used within a two-year period. An inactive account and any content in it will be eligible for deletion from December 1, 2023. What this means for you: These changes do not impact you unless you h...
Post a Comment
Read more

Re: ::: vuaskari.com ::: CS408 - FINAL TERM SUBJECTIVE WITH REFERENCE SOLVED BY UMAIR SAULAT

GREAT WORK On Wed, Feb 20, 2013 at 11:30 PM, Umair Saulat < saulat.umair@gmail.com > wrote: CS408- Human Computer Interaction Solved Subjective Fall Semester 2012   QNo.1    it has been observed that most computer users use menu option for input instead of keyboard accelerator. What is the reason behind it? (2 Marks) Answer:- 1.        Menu options are easier to find. 2.        You don't have to memories the keys for menu option but for key board accelerators you have to memories them REF:: Handouts Page No. 127   QNo.2    Define active intervention.  (2 Marks) Answer:- Active intervention with the participant and actively probes the participant understands of whatever is being tested. REF:: Handouts Page No. 276 QNo.3    what is Ubiquitous Computing? (2 Marks) Answer:- The most profound technologies are those that disappear. They weave themselves into the fabric of everyday life until they are indi...
Post a Comment
Read more

Re: ::: vuaskari.com ::: : CS604 final term sovled subjective part (eagle_eye)

tnkx bhana :) On Thu, Jul 21, 2011 at 8:02 PM, █▓Binish_Awais█▓ < greyferry@gmail.com > wrote: thanks and wonderfull work done by Tabishh ---------- Forwarded message ---------- From: eagle_eye < fantasy.fear@gmail.com > Date: Thu, Jul 21, 2011 at 12:50 AM Subject: CS604 final term sovled subjective part (eagle_eye) To: "Binish(ferry ID}MBA" < Greyferry@gmail.com > --             eagle_eye Live to  EXPRESS  not to  IMPRESS. .!!        ( eagle_eye )                        GMAIL: fantasy.fear@gmail.com   skype ID: fantasy.fear Facebook:  tereass_pass2917@yahoo.com --   ●●Gяєу_Fєяяy ●● --   ●●Gяєу_Fєяяy ●● -- We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish you all the best. Join www.vuaskari.com , To post to this group, send email to vuaskari_com@googlegroups.com Visit these groups: This (Main) Group: http://groups.google.com/group/vuaskari...
Post a Comment
Read more