Practice Input Size And Running Time (6.1) - Input Size and Running Time

Practise this section

9 questions

Flashcard drill
3 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is the input size in an algorithm?
Show hintHide hint
Think about how inputs affect running time.
Question 2.
Define worst-case analysis.
Show hintHide hint
What happens during the hardest situation?
3Question 3.
How does input size affect an algorithm?
- It doesn't affect it
- It determines the running time
- It's only relevant in sorting
Show hintHide hint
Consider what happens when you increase the data size.
4Question 4.
True or False: Worst-case scenario is always realistic.
- True
- False
Show hintHide hint
Think about how algorithm performance varies in real scenarios.
Question 5.
Design an algorithm that checks for duplicates in an array and analyze its worst-case input size complexity.
Show hintHide hint
Consider how many checks each element will require.
Question 6.
Implement an arithmetic algorithm that processes numbers based on their digit lengths and explain how logarithmic input size affects its complexity.
Show hintHide hint
Think of how digit counting connects to processing speed.

5 more questions in this section. Enroll free to practise them all.