Algorithms and Complexity Quiz Form
Please complete the Algorithms and Complexity Quiz Form below. All questions are required for quiz evaluation.
Participant Name or Alias
*
First Name
Last Name
Contact Email (for results)
*
example@example.com
Select Quiz Category
*
Please Select
Sorting & Searching
Graph Algorithms
Dynamic Programming
Complexity Theory
Data Structures
Other
Choose Difficulty Level
*
Beginner
Intermediate
Advanced
Acknowledge Time Limit (30 minutes)
*
I understand and will complete the quiz within 30 minutes
Which of the following sorting algorithms has the best average-case time complexity?
*
Merge Sort
Bubble Sort
Insertion Sort
Selection Sort
Select all problems that are NP-complete:
*
Traveling Salesman Problem (decision version)
Integer Factorization
Subset Sum Problem
Hamiltonian Cycle Problem
Sorting
Match each algorithm to its time complexity:
*
Rows
O(n log n)
O(n^2)
O(n)
Merge Sort
Yes
No
Yes
No
Yes
No
Bubble Sort
Yes
No
Yes
No
Yes
No
Linear Search
Yes
No
Yes
No
Yes
No
Briefly explain the difference between P and NP.
*
How confident are you in your answers?
*
Not confident
1
2
3
4
Very confident
5
1 is Not confident, 5 is Very confident
Submit Quiz
Should be Empty: