Industry-relevant training in Business, Technology, and Design to help professionals and graduates upskill for real-world careers.
Fun, engaging games to boost memory, math fluency, typing speed, and English skills—perfect for learners of all ages.
Enroll to start learning
You’ve not yet enrolled in this course. Please enroll for free to listen to audio lessons, classroom podcasts and take practice test.
Test your understanding with targeted questions related to the topic.
Question 1
Easy
Define a celebrity in the context of the party problem.
💡 Hint: Recall the definition given in class.
Question 2
Easy
Can there be more than one celebrity in a party? Explain.
💡 Hint: Think about the implications of mutual recognition.
Practice 4 more questions and get performance evaluation
Engage in quick quizzes to reinforce what you've learned and check your comprehension.
Question 1
What is the definition of a celebrity?
💡 Hint: Recall the characteristics discussed in class.
Question 2
How many unique questions are required to verify a celebrity among n guests?
💡 Hint: Consider how each guest's relationship affects the total queries needed.
Solve 1 more question and get performance evaluation
Push your limits with challenges.
Question 1
Design an algorithm that takes a list of n guests and identifies any potential celebrities among them, ensuring it operates within the 3n-1 limit for questions.
💡 Hint: Consider narrowing down your potential candidates significantly with each query.
Question 2
If three guests know each other, explain why no one among them can be identified as the celebrity following the proof's logic.
💡 Hint: Evaluate their relationships critically against the definition provided.
Challenge and get performance evaluation