800+ Algorithms Questions - Set 74 [With Solutions]

Algorithms Questions Set 74:

Quiz Mode

Algorithms Questions

Set 74/84

What is the clique size of the line graph of a bipartite graph?

What is the worst-case time complexity of Cycle Sort?

O(n^2)

O(n*2)

O(nlogn)

O(logn)

What is the time complexity of the heapify algorithm?

O(log N)

O(N)

Both of the above

None of the above

What is the time complexity of the selection sort algorithm in the worst case?

θ(n)

θ(n log n)

θ(n^2 log n)

θ(n^2)

What is the average case time complexity for finding the height of a binary tree?

O(n)

O(log log n)

O(n log n)

O(log n)

Examples of backtracking algorithms

N-Queens problem

Stable Marriage problem

Travelling Salesman problem

Both (1) and (2)

When pushing an element into a stack that already has six elements, and the stack size is 6, what happens?

User flow

Under flow

Over flow

Crash

Consider the following three functions.
f1 = 10ⁿ
f2 = n^logn
f2 = n^root(n)
Which one of the following options arranges the functions in the increasing order of asymptotic growth rate?

f3,f2,f1

f2,f1,f3

f1,f2,f3

f2,f3,f1

By arranging the letters in a zig-zag fashion in a table, encryption in the Rail Fence cipher is done.

encryption in mono-alphabetic cipher is done

encryption in Rail Fence cipher is done

encryption in Rail Fence cipher is not done

Which of the following is true for an abstract class?

Attempting to instantiate an abstract class results in an error.

A class is declared abstract by prefacing the definition with the word 'abstract'.

A class is declared abstract by using the keyword 'implements'.

It is a class that really isn't supposed to ever be instantiated but instead serves as a base class.

Quiz Mode

Qn. Sets

Algorithms Questions Set 74:

Algorithms Questions

What is the clique size of the line graph of a bipartite graph?

Reveal Answer

Reveal Answer

What is the worst-case time complexity of Cycle Sort?

Reveal Answer

Reveal Answer

What is the time complexity of the heapify algorithm?

Reveal Answer

Reveal Answer

What is the time complexity of the selection sort algorithm in the worst case?

Reveal Answer

Reveal Answer

What is the average case time complexity for finding the height of a binary tree?

Reveal Answer

Reveal Answer

Examples of backtracking algorithms

Reveal Answer

Reveal Answer

When pushing an element into a stack that already has six elements, and the stack size is 6, what happens?

Reveal Answer

Reveal Answer

Consider the following three functions.f1 = 10nf2 = nlognf2 = nroot(n)﻿Which one of the following options arranges the functions in the increasing order of asymptotic growth rate?

Reveal Answer

Reveal Answer

By arranging the letters in a zig-zag fashion in a table, encryption in the Rail Fence cipher is done.

Reveal Answer

Reveal Answer

Which of the following is true for an abstract class?

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:

Consider the following three functions.
f1 = 10ⁿ
f2 = n^logn
f2 = n^root(n)
Which one of the following options arranges the functions in the increasing order of asymptotic growth rate?