? Updated:
Page 2026/2027//
1 of 7 Q&A || Complete Questions& Correct Answers || (100% Verified) ||| Latest Update||Guaranteed Pass A+| Fully
1 Start
Verified
your|| exams
? //full exam
prepared!
coverage!
RegularQuiz3: CMPT125 D100 Introduction to Computing Science and Programming II 2024-04-22, 2:14 PM
RegularQuiz3
Due Mar 7 at 6pm Points 15 Questions 6
Available until Apr 20 at 6pm Time Limit 20 Minutes
Instructions
This quiz is open book and open web.
You may not collaborate with other students in the class.
You may not use online services, bots, or AI
You should reference any material copied
You will have 20 minutes to complete your quiz. The quiz will be available from 5 PM Mar 6 to 6 PM
Mar 7. You must complete (not start) your quiz by 6PM Mar 1.
This quiz was locked Apr 20 at 6pm.
Attempt History
Attempt Time Score
LATEST Attempt 1 16 minutes 4 out of 15 *
* Some questions not yet graded
Correct answers are hidden.
Score for this quiz: 4 out of 15 *
Submitted Mar 13 at 10:35pm
This attempt took 16 minutes.
Question 1 Not yet graded / 3 pts
https://canvas.sfu.ca/courses/81421/quizzes/262140?module_item_id=3136011 Page 1 of 7
This study source was downloaded by 1827175 from cliffsnotes.com on 01-08-2026 19:56:20 GMT -06:00
2026-01-09
https://www.cliffsnotes.com//study-notes/23658231 Start your exams prepared! Page 1
, ? Updated:
Page 2026/2027//
2 of 7 Q&A || Complete Questions& Correct Answers || (100% Verified) ||| Latest Update||Guaranteed Pass A+| Fully
2 Start
Verified
your|| exams
? //full exam
prepared!
coverage!
RegularQuiz3: CMPT125 D100 Introduction to Computing Science and Programming II 2024-04-22, 2:14 PM
Write an expression for T(N) and for T(1) for the following code. DO
NOT solve for the Big 0.
int binarySearch(int arr[], int left, int right, int target) {
if (right >= left) {
int mid = left + (right - left) / 2;
if (arr[mid] == target)
return mid;
if (arr[mid] > target)
return binarySearch(arr, left, mid - 1, target);
return binarySearch(arr, mid + 1, right, target);
}
return -1;
}
Your Answer:
T(N) = T(N/2) + c
T(1) = c
Incorrect Question 2 pts
https://canvas.sfu.ca/courses/81421/quizzes/262140?module_item_id=3136011 Page 2 of 7
This study source was downloaded by 1827175 from cliffsnotes.com on 01-08-2026 19:56:20 GMT -06:00
2026-01-09
https://www.cliffsnotes.com//study-notes/23658231 Start your exams prepared! Page 2
Page 2026/2027//
1 of 7 Q&A || Complete Questions& Correct Answers || (100% Verified) ||| Latest Update||Guaranteed Pass A+| Fully
1 Start
Verified
your|| exams
? //full exam
prepared!
coverage!
RegularQuiz3: CMPT125 D100 Introduction to Computing Science and Programming II 2024-04-22, 2:14 PM
RegularQuiz3
Due Mar 7 at 6pm Points 15 Questions 6
Available until Apr 20 at 6pm Time Limit 20 Minutes
Instructions
This quiz is open book and open web.
You may not collaborate with other students in the class.
You may not use online services, bots, or AI
You should reference any material copied
You will have 20 minutes to complete your quiz. The quiz will be available from 5 PM Mar 6 to 6 PM
Mar 7. You must complete (not start) your quiz by 6PM Mar 1.
This quiz was locked Apr 20 at 6pm.
Attempt History
Attempt Time Score
LATEST Attempt 1 16 minutes 4 out of 15 *
* Some questions not yet graded
Correct answers are hidden.
Score for this quiz: 4 out of 15 *
Submitted Mar 13 at 10:35pm
This attempt took 16 minutes.
Question 1 Not yet graded / 3 pts
https://canvas.sfu.ca/courses/81421/quizzes/262140?module_item_id=3136011 Page 1 of 7
This study source was downloaded by 1827175 from cliffsnotes.com on 01-08-2026 19:56:20 GMT -06:00
2026-01-09
https://www.cliffsnotes.com//study-notes/23658231 Start your exams prepared! Page 1
, ? Updated:
Page 2026/2027//
2 of 7 Q&A || Complete Questions& Correct Answers || (100% Verified) ||| Latest Update||Guaranteed Pass A+| Fully
2 Start
Verified
your|| exams
? //full exam
prepared!
coverage!
RegularQuiz3: CMPT125 D100 Introduction to Computing Science and Programming II 2024-04-22, 2:14 PM
Write an expression for T(N) and for T(1) for the following code. DO
NOT solve for the Big 0.
int binarySearch(int arr[], int left, int right, int target) {
if (right >= left) {
int mid = left + (right - left) / 2;
if (arr[mid] == target)
return mid;
if (arr[mid] > target)
return binarySearch(arr, left, mid - 1, target);
return binarySearch(arr, mid + 1, right, target);
}
return -1;
}
Your Answer:
T(N) = T(N/2) + c
T(1) = c
Incorrect Question 2 pts
https://canvas.sfu.ca/courses/81421/quizzes/262140?module_item_id=3136011 Page 2 of 7
This study source was downloaded by 1827175 from cliffsnotes.com on 01-08-2026 19:56:20 GMT -06:00
2026-01-09
https://www.cliffsnotes.com//study-notes/23658231 Start your exams prepared! Page 2
