UNISA 2024 COS2611-24-Y Assessment 2
QUIZ
Started on Sunday, 14 July 2024, 8:21 AM
State Finished
Completed on Sunday, 14 July 2024, 5:06 PM
Time taken 8 hours 44 mins
Information
This is a compulsory assessment. You have maximum of three (3) attempts to complete the assessment. The system will
automatically upload your attempts when the due date and time is reached. The due date is 15 July 2024, 23:00.
Remember, the due date is the last date for submission and not the day on which you should start with the assessment.
There are 15 quiz questions and a question (16) which is an open question. The mark for this question will be captured from
a peer-evaluated project that you will complete in the Etutor class.
------------------------------------
This peer-evaluation project must be submitted on the latest by 17 July 2024 23:00. The project will be distributed between
the peers - who will have until the 22th of July to do the peer evaluation and return the mark. This mark will then be copied
and added as the mark to the last question. Only then will the final mark be calculated for Assessment 2.
Question 1
Complete
Marked out of 1.00
Which of the following is a disadvantage of the sequential search algorithm?
a. Requires the array to be sorted
b. Inefficient for large arrays
c. Time complexity of O(log n)
d. More complex to implement
The disadvantage of the sequential search algorithm is that it is inefficient for large arrays. Since it has to iterate through
each element of the array sequentially, the time it takes to find an element grows linearly with the size of the array.
, Question 2
Complete
Marked out of 1.00
What is the key difference between sequential search and binary search?
a. Binary search is much more efficient than sequential search for large lists due to its logarithmic time complexity, but
it requires the list to be sorted
b. Binary search scans through each element sequentially, while sequential search divides the search interval in half.
c. Sequential search works only on sorted arrays, while binary search works on unsorted arrays.
d. Binary search has a time complexity of O , while sequential search has a time complexity of O(log n).
Efficiency:
Binary search is much more efficient than sequential search for large lists due to its logarithmic time complexity, but it
requires the list to be sorted. Sequential search is simpler and works on unsorted lists but is less efficient for large lists due
to its linear time complexity.
List Requirement:
Sequential search works on any list, while binary search requires a sorted list.
Question 3
Complete
Marked out of 1.00
Which of the following best describes the time complexity of binary search compared to sequential search?
a. Binary search has a time complexity of O(log n), while sequential search has a time complexity of O( n ).
b. Binary search has a time complexity of O( n ), while sequential search has a time complexity of O(log n).
c. Both binary search and sequential search have a time complexity of O( n ).
d. Both binary search and sequential search have a time complexity of O(log n).
Binary search has a time complexity of O(log n) because it divides the search interval in half with each iteration, resulting in a
logarithmic time complexity. On the other hand, sequential search has a time complexity of O( n ) because it checks each
element of the array sequentially until it finds the target element or reaches the end of the array, resulting in a linear time
complexity.
QUIZ
Started on Sunday, 14 July 2024, 8:21 AM
State Finished
Completed on Sunday, 14 July 2024, 5:06 PM
Time taken 8 hours 44 mins
Information
This is a compulsory assessment. You have maximum of three (3) attempts to complete the assessment. The system will
automatically upload your attempts when the due date and time is reached. The due date is 15 July 2024, 23:00.
Remember, the due date is the last date for submission and not the day on which you should start with the assessment.
There are 15 quiz questions and a question (16) which is an open question. The mark for this question will be captured from
a peer-evaluated project that you will complete in the Etutor class.
------------------------------------
This peer-evaluation project must be submitted on the latest by 17 July 2024 23:00. The project will be distributed between
the peers - who will have until the 22th of July to do the peer evaluation and return the mark. This mark will then be copied
and added as the mark to the last question. Only then will the final mark be calculated for Assessment 2.
Question 1
Complete
Marked out of 1.00
Which of the following is a disadvantage of the sequential search algorithm?
a. Requires the array to be sorted
b. Inefficient for large arrays
c. Time complexity of O(log n)
d. More complex to implement
The disadvantage of the sequential search algorithm is that it is inefficient for large arrays. Since it has to iterate through
each element of the array sequentially, the time it takes to find an element grows linearly with the size of the array.
, Question 2
Complete
Marked out of 1.00
What is the key difference between sequential search and binary search?
a. Binary search is much more efficient than sequential search for large lists due to its logarithmic time complexity, but
it requires the list to be sorted
b. Binary search scans through each element sequentially, while sequential search divides the search interval in half.
c. Sequential search works only on sorted arrays, while binary search works on unsorted arrays.
d. Binary search has a time complexity of O , while sequential search has a time complexity of O(log n).
Efficiency:
Binary search is much more efficient than sequential search for large lists due to its logarithmic time complexity, but it
requires the list to be sorted. Sequential search is simpler and works on unsorted lists but is less efficient for large lists due
to its linear time complexity.
List Requirement:
Sequential search works on any list, while binary search requires a sorted list.
Question 3
Complete
Marked out of 1.00
Which of the following best describes the time complexity of binary search compared to sequential search?
a. Binary search has a time complexity of O(log n), while sequential search has a time complexity of O( n ).
b. Binary search has a time complexity of O( n ), while sequential search has a time complexity of O(log n).
c. Both binary search and sequential search have a time complexity of O( n ).
d. Both binary search and sequential search have a time complexity of O(log n).
Binary search has a time complexity of O(log n) because it divides the search interval in half with each iteration, resulting in a
logarithmic time complexity. On the other hand, sequential search has a time complexity of O( n ) because it checks each
element of the array sequentially until it finds the target element or reaches the end of the array, resulting in a linear time
complexity.
