Algorithms CS305 - Quiz 2

A student sitting at a desk, studying algorithms with books and a laptop, surrounded by mathematical equations, warm lighting, focused atmosphere

Mastering Algorithms: CS305 Quiz 2

Test your knowledge of algorithms with our engaging quiz designed for CS305 students! This quiz covers key concepts such as binary search, recurrence relations, and more.

Prepare for your exams and improve your understanding through:

  • Challenging multiple choice questions
  • Practical problem-solving scenarios
  • Instant feedback on your performance
6 Questions2 MinutesCreated by CodingEagle42
Name:
Student ID
What is the worst case running time of Binary Search?
O((lg n)2)
O(lg (lg n))
O(n)
O(lg n)
What are the three possible solutions of the recurrence tn - 5tn-1 + 6tn-2 = 0 ?
tn = 0, tn = 2n, tn = 3n
tn = 0, tn = 2n, tn = 4n
tn = 0, tn = 4n, tn = 3n
tn = 0, tn = 2n, tn = 5n
What is the recurrence equation of the following algorithm?
exp
T(n) = T(n-1) + O(1)
T(n) = 2T(n/2) + n
T(n) = T(n/2) + n
T(n) = T(n/2) + O(1)
Write
{"name":"Algorithms CS305 - Quiz 2", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"Test your knowledge of algorithms with our engaging quiz designed for CS305 students! This quiz covers key concepts such as binary search, recurrence relations, and more.Prepare for your exams and improve your understanding through:Challenging multiple choice questionsPractical problem-solving scenariosInstant feedback on your performance","img":"https:/images/course1.png"}
Powered by: Quiz Maker