N-Queens and Sum of Subsets Problems
Curriculum and historical examination lineage for N-Queens and Sum of Subsets Problems under Unit 4 (Backtracking and Branch and Bound) of Design and Analysis of Algorithms (21CSC204J) at SRMIST.
Historical appearance distribution across SRMIST Formative Tests (CT1, CT2) and University End Semester examinations.
Factual marks weightage of questions asked on this topic in historical examinations.
Representative historical questions extracted directly from SRMIST examination papers.
The problem of finding a subset of positive integers whose sum is equal to a given positive integer is called as (A) n-queen problem (B) Subset sum problem (C) Knapsack problem...
Where is the N-queens problem implemented? (A) Carom (B) Chess (C) Ludo (D) Cards [1]
A fruit seller visited a street in a city. He started selling various fruits to people who live there. A buyer bought 1 kg of apple and 2 kgs of oranges for rupees 90 and 70...
The N-queens problem is a classic example from which board game? (A) Chess (B) Carroms (C) Ludo (D) Cards [1]
What is a subset sum problem? (A) Finding a subset of a set that has sum of elements equal to a given number (B) Finding the sum of elements present in a set (C) Finding the sum...
Examinations where questions for N-Queens and Sum of Subsets Problems have appeared.
Master N-Queens and Sum of Subsets Problems in MintAI
Practice past exam questions, test recurring archetypes, and view predictive probability for this topic before your upcoming exam.