adplus-dvertising
frame-decoration

Question

Weighted graph:

a.

Is a bi-directional graph

b.

Is directed graph

c.

Is graph in which number associated with arc

d.

Eliminates table method

Answer: (c).Is graph in which number associated with arc

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Weighted graph:

Similar Questions

Discover Related MCQs

Q. What operation is supported in constant time by the doubly linked list, but not by the singly linked list?

Q. How much extra space is used by heap sort?

Q. Binary search algorithm employs the strategy of

Q. Dangling-else ambiguity can be eliminated by

Q. If n represents the dimension of cube and K, the radix (no. of nodes along each dimensions) then the number of nodes N of a k-ary n-cube network is:

Q. The postfix form of the expression (A+B)*C-D/E is:

Q. The number of nodes in a complete binary tree of height n:

Q. Data abstraction means:

Q. The solution of recurrence relation:

T(n) = 2T(sqrt(n)) + lg (n)

is

Q. The elements 42,25,30,40,22,35,26 are inserted one by one in the given order into a max-heap. The resultant max-heap is sorted in an array implementation as

Q. Consider the following postfix expression with single digit operands:

623∗/42∗+68∗−

The top two elements of the stack after the second ∗ is evaluated, are:

Q. A binary search tree is constructed by inserting the following numbers in order:

60, 25, 72, 15, 30, 68, 101, 13, 18, 47, 70, 34

The number of nodes in the left subtree is

Q. In a ternary tree, the number of internal nodes of degree 1, 2, and 3 is 4, 3, and 3 respectively. The number of leaf nodes in the ternary tree is

Q. Match List-I with List-II and choose the correct answer from the code given below:

List I (Graph Algorithm) List II (Time Complexity)
(a) Dijkstra’s algorithm (i) O(E lg E)
(b) Kruskal’s algorithm (ii) Θ(V3)
(c) Floyd-Warshall algorithm (iii) O(V2)
(d) Topological sorting (iv) Θ(V+E)

where V and E are the number of vertices and edges in graph respectively.

Q. In K-coloring of an undirected graph G=(V,E) is a function. c:V→{0,1,…,K−1} such that c(u)≠c(v) for every edge (u,v)∈E.

Which of the following is not correct?

Q. Consider a singly linked list. What is the worst case time complexity of the best-known algorithm to delete the node a, pointer to this node is q, from the list?

Q. The second smallest of n elements can be found with ............... comparisons in the worst case.

Q. Consider the following statements related to AND-OR Search algorithm.

S1: A solution is a subtree that has a goal node at every leaf.
S2: OR nodes are analogous to the branching in a deterministic environment.
S3: AND nodes are analogous to the branching in a non-deterministic environment.

Which of the following is true referencing the above statements?

Q. The solution of the recurrence relation
T(m) = T(3m/4) + 1 is:

Q. Consider the array A=<4, 1, 3, 2, 16, 9, 10, 14, 8, 7>. After building heap from the array A, the depth of the heap and the right child of max-heap are .............. and .................. respectively. (Root is at level 0).