800+ Algorithms Questions - Set 77 [With Solutions]

Algorithms Questions Set 77:

Quiz Mode

Algorithms Questions

Set 77/87

What is the time complexity of exponential search?

O(n)

O(n log n)

O(log n)

O(2^n)

Consider a complete graph G with 4 vertices. The graph G has how many spanning trees?

Which of the following is a distribution sort?

LSD Radix Sort

MSD Radix Sort

Quick Sort

Insertion Sort

How many solutions are available for a graph with a negative weight cycle?

No solution

One solution

Two solutions

Infinite solutions

Which of the following sorting algorithms is considered an adaptive algorithm?

Radix Sort

Binary Tree Sort

Binary Insertion Sort

Insertion Sort

Which of the following statements about a spanning tree of a graph T is false?

It can be either cyclic or acyclic

It is a tree that spans T

It is a subgraph of T

It includes every vertex of T

For which of the following types of graphs can the Bellman-Ford algorithm be applied?

Undirected and weighted graphs

Undirected and unweighted graphs

Directed and weighted graphs

Directed graphs

Why prefer red-black trees over AVL trees?

Red-black trees are more rigidly balanced

AVL trees store balance factor in every node, which costs space

AVL trees fail at scale

Red-black trees are more efficient

Consider an undirected graph G with vertices {A, B, C, D, E}. In graph G, every edge has a distinct weight. Edge CD has the minimum weight, and edge AB has the maximum weight. Which of the following statements is false?

Every minimum spanning tree of G must contain CD

If AB is in a minimum spanning tree, then its removal must disconnect G

No minimum spanning tree contains AB

G has a unique minimum spanning tree

Which of these is the correct Bellman-Ford Algorithm?

for i=1 to V[g]-1 do for each edge (u,v) in E[g] do Relax(u,v,w) for each edge (u,v) in E[g] do if d[v]>d[u]+w(u,v) then return False return True

for i=1 to V[g]-1 for each edge (u,v) in E[g] do if d[v]>d[u]+w(u,v) then return False return True

for i=1 to V[g]-1 do for each edge (u,v) in E[g] do Relax(u,v,w) for each edge (u,v) in E[g] do if d[v]<d[u]+w(u,v) then return true return True

for i=1 to V[g]-1 do for each edge (u,v) in E[g] do Relax(u,v,w) return True

Quiz Mode

Qn. Sets

Algorithms Questions Set 77:

Algorithms Questions

What is the time complexity of exponential search?

Reveal Answer

Reveal Answer

Consider a complete graph G with 4 vertices. The graph G has how many spanning trees?

Reveal Answer

Reveal Answer

Which of the following is a distribution sort?

Reveal Answer

Reveal Answer

How many solutions are available for a graph with a negative weight cycle?

Reveal Answer

Reveal Answer

Which of the following sorting algorithms is considered an adaptive algorithm?

Reveal Answer

Reveal Answer

Which of the following statements about a spanning tree of a graph T is false?

Reveal Answer

Reveal Answer

For which of the following types of graphs can the Bellman-Ford algorithm be applied?

Reveal Answer

Reveal Answer

Why prefer red-black trees over AVL trees?

Reveal Answer

Reveal Answer

Consider an undirected graph G with vertices {A, B, C, D, E}. In graph G, every edge has a distinct weight. Edge CD has the minimum weight, and edge AB has the maximum weight. Which of the following statements is false?

Reveal Answer

Reveal Answer

Which of these is the correct Bellman-Ford Algorithm?

Reveal Answer

Reveal Answer

Trending Jobs

Data Engineer

Adwork Solutions

Senior Software Engineer

Miko.ai

WAS Admin + DevOps Engineer

Xperteez Technology

Senior Frontend Developer - Next Js, React Js

Ultimez Technology

AI/ML Engineer

HR4U Consulting

Sales Development Representative (SDR)

Twixor

AI Architect

Codemind Staffing Solutions

Chief of Staff/ Founder's office

Divum Corporate Services

Technical Manager

Divum Corporate Services

Digital Marketing Manager

Munim ERP Private Limited

Build skills. Get hired.

Level up fast with personalized skill training that gets you job-ready! Learn what top employers want — anytime, anywhere.

Related Topics: