Consider the following algorithms for determining whether anyone in the room has the same marks as yours in DAA subject. Algorithm 1: You say your marks and ask whether anyone in the room has the same marks. If anyone does have the same marks, they answer yes. • Algorithm 2: You tell the first person your marks and ask if they have the same marks; if they say no, you tell the second person your marks and ask whether they have the same marks; etc., for each person in the room. A. For each algorithm, what is the problem size? B. In the worst case, how many questions will be asked for each of the algorithms? Page 1 of 2 C. For each algorithm, say whether it is constant, linear, or quadratic in the problem size in the worst case.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Consider the following algorithms for determining whether anyone in the room has the same marks
as yours in DAA subject.
Algorithm 1: You say your marks and ask whether anyone in the room has the same marks.
If anyone does have the same marks, they answer yes.
Algorithm 2: You tell the first person your marks and ask if they have the same marks; if
they say no, you tell the second person your marks and ask whether they have the same
marks; etc., for each person in the room.
A. For each algorithm, what is the problem size?
B. In the worst case, how many questions will be asked for each of the algorithms?
Page 1 of 2
C. For each algorithm, say whether it is constant, linear, or quadratic in the problem size in the
worst case.
Transcribed Image Text:Consider the following algorithms for determining whether anyone in the room has the same marks as yours in DAA subject. Algorithm 1: You say your marks and ask whether anyone in the room has the same marks. If anyone does have the same marks, they answer yes. Algorithm 2: You tell the first person your marks and ask if they have the same marks; if they say no, you tell the second person your marks and ask whether they have the same marks; etc., for each person in the room. A. For each algorithm, what is the problem size? B. In the worst case, how many questions will be asked for each of the algorithms? Page 1 of 2 C. For each algorithm, say whether it is constant, linear, or quadratic in the problem size in the worst case.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY