If we choose Prim's Algorithm for uniquely weighted spanning...

MCQ

If we choose Prim's Algorithm for uniquely weighted spanning tree instead of Kruskal's Algorithm, then

we'll get a different spanning tree.

we'll get the same spanning tree.

spanning will have less edges.

spanning will not cover all vertices.

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

What is the advantage of using a dynamic set in direct addressing?

It saves time

It saves space

It saves both time and space

None of the mentioned

Discussion

MCQ

Can a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed?

yes just traverse through the array and form the tree

No we need one more traversal to form a tree

No in case of sparse trees

None of the mentioned

Discussion

MCQ

What is missing in this logic of finding a path in the tree for a given sum (i.e checking whether there will be a path from roots to leaf nodes with given sum)?

checkSum(struct bin-treenode *root , int sum) :
  if(root==null)
    return sum as 0
  else :
     leftover_sum=sum-root_node-->value
     //missing

code for having recursive calls to either only left tree or right trees or to both subtrees depending on their existence

code for having recursive calls to either only left tree or right trees

code for having recursive calls to either only left tree

code for having recursive calls to either only right trees

Discussion

MCQ

Which one of the following statements is false?

Breadth-first search cannot be used to find connected components of a graph.

Given the prefix and postfix walks of a binary tree, the binary tree cannot be uniquely reconstructed.

Both (a) and (b)

Optimal binary search tree construction can be performed efficiently using dynamic programmmg.

Discussion

MCQ

Which of the following statements is false ?

A tree contains a cycle

A tree is a connected graph

Every tree is a bipartite graph

A tree with n nodes contains n-1 edges

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics