HackWithInfy Backtracking Quiz-2

Question 1

Time: 00:00:00
Who developed the term 'backtracking’?

 Bill

 Bill

Ford

Ford

Donald

Donald

Lehmer

Lehmer

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 2

Time: 00:00:00
Can backtracking be used to solve this in terms of ideas?  

Combinatorial problems

Combinatorial problems

Graph coloring problems

Graph coloring problems

Knapsack problem

Knapsack problem

 Numerical problems  

 Numerical problems  

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 3

Time: 00:00:00
Who developed the depth-first backtracking algorithm?

Lehmer

Lehmer

Frank Nauck

Frank Nauck

 Dijkstra

 Dijkstra

Friedrich

Friedrich

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 4

Time: 00:00:00
Crosswords problem is an application of ?

 

 Dynamic Programming

 Dynamic Programming

Greedy Algorithm

Greedy Algorithm

Hashing and mapping

Hashing and mapping

Backtracking algorithm  

Backtracking algorithm  

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 5

Time: 00:00:00
 Backtracking is not a feature in 

Fortran

Fortran

 Icon

 Icon

Prolog

Prolog

Planner

Planner

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 6

Time: 00:00:00
So where's the problem with n-queens enforced?

carom

carom

crosswords

crosswords

chess

chess

ludo

ludo

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 7

Time: 00:00:00
Two principal measures for an algorithm 's performance?

Time and Space

Time and Space

 Data and Space

 Data and Space

Time and Capacity

Time and Capacity

Complexity and Capacity

Complexity and Capacity

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 8

Time: 00:00:00
If any of the following complexities are not available?

worst case

worst case

best case

best case

null case

null case

average case

average case

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

["0","40","60","80","100"]
["Need more practice!","Keep trying!","Not bad!","Good work!","Perfect!"]

Personalized Analytics only Availble for Logged in users

Analytics below shows your performance in various Mocks on PrepInsta

Your average Analytics for this Quiz

Rank

-

Percentile

0%

Get over 200+ Courses under One Subscription

mute

Don’t settle Learn from the Best with PrepInsta Prime Subscription

Learn from Top 1%

One Subscription, For Everything

The new cool way of learning and upskilling -

Limitless Learning

One Subscription access everything

Job Assistance

Get Access to PrepInsta Prime

Top Faculty

from FAANG/IITs/TOP MNC's

Get over 200+ course One Subscription

Courses like AI/ML, Cloud Computing, Ethical Hacking, C, C++, Java, Python, DSA (All Languages), Competitive Coding (All Languages), TCS, Infosys, Wipro, Amazon, DBMS, SQL and others.