Quiz Space

Advanced Algorithms · Quiz 2 · 3 Dec 2023 · September 2023 term

Question 10: Tina stumbles upon a lottery chart dropped by a time tra…

Question 10

+3 marksOne correct option

Tina stumbles upon a lottery chart dropped by a time traveler from the future, which lists winning lottery numbers and positive integer cash payouts for the next nn days. Tina wants to use this information to make money, but is worried if she plays winning numbers every day, lottery organizers will get suspicious. As such, she decides to play the lottery infrequently: at most twice in any seven day period.

In this problem, we will build up towards an O(n)O(n)-time algorithm to determine the maximum amount of lottery winnings Tina can win in the next nn days by playing the lottery infrequently.

Based on the above data, answer the given subquestions.

  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • D
See the whole paperTake it as a mock test

Question 10 of 20 in the IIT Madras BS Advanced Algorithms (Advanced Algorithms) Quiz 2 paper sat on 3 Dec 2023, in the September 2023 term (IIT M DEGREE AN2 EXAM QDB2 03 Dec 2023). It carries 3 marks.

More questions from this paper

  1. Q1You are given a sequence of integers a of length 2n. You have to split these 2n integers into n pairs; each pair will r…
  2. Q2You are given a sequence of integers a of length 2n. You have to split these 2n integers into n pairs; each pair will r…
  3. Q3You are given a sequence of integers a of length 2n. You have to split these 2n integers into n pairs; each pair will r…
  4. Q4You are given a sequence of integers a of length 2n. You have to split these 2n integers into n pairs; each pair will r…
  5. Q5You are given a sequence of integers a of length 2n. You have to split these 2n integers into n pairs; each pair will r…
  6. Q6Tina stumbles upon a lottery chart dropped by a time traveler from the future, which lists winning lottery numbers and …
  7. Q7Tina stumbles upon a lottery chart dropped by a time traveler from the future, which lists winning lottery numbers and …
  8. Q8Tina stumbles upon a lottery chart dropped by a time traveler from the future, which lists winning lottery numbers and …
  9. Q9Tina stumbles upon a lottery chart dropped by a time traveler from the future, which lists winning lottery numbers and …
  10. Q11Tina stumbles upon a lottery chart dropped by a time traveler from the future, which lists winning lottery numbers and …
  11. Q12Let G = (V, E) be a graph. A cut in G is a partition of V into two sets. Let S \subseteq V be a subset of vertices. The…
  12. Q13Let G = (V, E) be a graph. A cut in G is a partition of V into two sets. Let S \subseteq V be a subset of vertices. The…
  13. Q14Let G = (V, E) be a graph. A cut in G is a partition of V into two sets. Let S \subseteq V be a subset of vertices. The…
  14. Q15Let G = (V, E) be a graph. A cut in G is a partition of V into two sets. Let S \subseteq V be a subset of vertices. The…
  15. Q16Let G = (V, E) be a graph. A cut in G is a partition of V into two sets. Let S \subseteq V be a subset of vertices. The…
  16. Q17Recall the max-flow problem: for a directed graph G(V, E) with non-negative capacities c_e for every e \in E and two sp…
  17. Q18The EXACT-COVER-BY-3-SETS problem is defined as the following: given a finite set X with |X| = 3q and a collection C of…
  18. Q19Figure question
  19. Q20Say problem X reduces to problem Y. Which of the following can we infer?