Question Discussion & Solution

MCQ

The Hamiltonian cycles problem uses the following line of code to generate a next vertex, provided x[ ] is a global array and kth vertex is under consideration:

x[k] ? (x[k] + 1) mod n

x[k] ? (x[k]) mod (n)

x[k] ? (x[k] + 1) mod (n+1)

x[k] ? x[k+1] mod n

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Read the following statements carefully and pick the correct option:

I. The worst time complexity of the Floyd

(I) is false but (II) is true

(I) is true but (II) is false

Both (I) and (II) are true

(I) is true and (II) is not true always

Both (I) and (II) are false.

Discussion

MCQ

Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is ___________

O(E)

O(V*V)

O(E+V)

O(V)

Discussion

MCQ

The minimum number of colors needed to color a graph having n (>3) vertices and 2 edges is

Discussion

MCQ

How many of the following statements are correct?i) All cyclic graphs are complete graphs.ii) All complete graphs are cyclic graphs.iii) All paths are bipartite.iv) All cyclic graphs are bipartite.v) There are cyclic graphs which are complete.

Discussion

MCQ

The topological sorting of any DAG can be done in ________ time.

cubic

quadratic

linear

logarithmic

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 Design and Analysis of Algorithms Topics

Design and Analysis of Algorithms Basics

Asymptotic Notation

Divide and Conquer Strategy

Sorting

Linear Time Sorting

Dynamic Programming

Greedy Algorithms

Backtracking Algorithms

Graphs

Complexity Theory

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 Design and Analysis of Algorithms Topics

Design and Analysis of Algorithms Basics

Asymptotic Notation

Divide and Conquer Strategy

Sorting

Linear Time Sorting

Dynamic Programming

Greedy Algorithms

Backtracking Algorithms

Graphs

Complexity Theory

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Design and Analysis of Algorithms Topics