We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>
+ Link For Assignments, GDBs & Online Quizzes Solution |
+ Link For Past Papers, Solved MCQs, Short Notes & More |
Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion
How to Add New Discussion in Study Group ? Step By Step Guide Click Here.
Question No: 1 ( Marks: 1 ) – Please choose one
An optimization problem is one in which you want to find,
► Not a solution
► An algorithm
► Good solution
► The best solution
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: 3 ( Marks: 1 ) – Please choose one
If a problem is in NP, it must also be in P.
► True
► False
► unknown
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
Collected and Composed by Bilal Farooq (bilal.zaheem@gmail.com)
► 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^{2}|
► True
► False
Question No: 7 ( Marks: 1 ) – Please choose one
The Huffman algorithm finds a (n) _____________ solution.
► Optimal
► Non9optimal
► Exponential
► Polynomial
Question No: 8 ( Marks: 1 ) – Please choose one
The Huffman algorithm finds an exponential solution
► True
► False
Question No: 9 ( Marks: 1 ) – Please choose one
The Huffman algorithm finds a polynomial solution
► True
► False
Question No: 10 ( Marks: 1 ) – Please choose one
The greedy part of the Huffman encoding algorithm
with larger frequency.
► True
► False
Question No: 11 ( Marks: 1 ) – Please choose one
is to first find two nodes
The codeword assigned to characters by the Huffman algorithm have the property that no codeword is the postfix of any other.
► True
► False
Question No: 12 ( Marks: 1 ) – Please choose one
Huffman algorithm uses a greedy approach to generate a postfix code T that minimizes the expected length B (T) of the encoded string.
► True
► False
Collected and Composed by Bilal Farooq (bilal.zaheem@gmail.com)
Question No: 13 ( Marks: 1 ) – Please choose one
Shortest path problems can be solved efficiently by modeling the road map as a graph.
► True
► False
Question No: 14 ( Marks: 1 ) – Please choose one
Dijkestra’s single source shortest path algorithm works if all edges weights are non9negative and there are negative cost cycles.
► True
► False
Question No: 15 ( Marks: 1 ) – Please choose one
Bellman9Ford allows negative weights edges and negative cost cycles.
► True
► False
Question No: 16 ( Marks: 1 ) – Please choose one
The term “coloring” came form the original application which was in
architectural design.
► True
► False
Question No: 17 ( Marks: 1 ) – Please choose one
In the clique cover problem, for two vertices to be in the same group, they must be adjacent to each other.
► True
► False
Question No: 18 ( Marks: 1 ) – Please choose one
Dijkstra’s algorithm is operates by maintaining a subset of vertices
► True
► False
Question No: 19 ( Marks: 1 ) – Please choose one
The difference between Prim’s algorithm and Dijkstra’s algorithm is that Dijkstra’s algorithm uses a different key.
► True
► False
Question No: 20 ( Marks: 1 ) – Please choose one
Consider the following adjacency list:
Tags:
+ How to Follow the New Added Discussions at Your Mail Address?
+ How to Join Subject Study Groups & Get Helping Material? + How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators? + VU Students Reserves The Right to Delete Your Profile, If?.
+ 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)See Moaaz File ..
© 2020 Created by +M.Tariq Malik. Powered by
Promote Us | Report an Issue | Privacy Policy | Terms of Service
VU Students reserves the right to delete profile, which does not show any Activity at site nor has not activity more than 01 month.
We are user-generated contents site. All product, videos, pictures & others contents on vustudents.ning.com don't seem to be beneath our Copyrights & belong to their respected owners & freely available on public domains. We believe in Our Policy & do according to them. If Any content is offensive in your Copyrights then please email at m.tariqmalik@gmail.com or Contact us at contact Page with copyright detail & We will happy to remove it immediately.
Management: Admins ::: Moderators
Awards Badges List | Moderators Group
All Members | Featured Members | Top Reputation Members | Angels Members | Intellectual Members | Criteria for Selection
Become a Team Member | Safety Guidelines for New | Site FAQ & Rules | Safety Matters | Online Safety | Rules For Blog Post