Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fix some mistakes in ComplexityMCQ1 #17

Open
wants to merge 4 commits into
base: master
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 6 additions & 8 deletions ComplexityMCQ1/task.yaml
Original file line number Diff line number Diff line change
Expand Up @@ -104,14 +104,13 @@ problems:
multiple: true
mcq4:
choices:
- valid: true
text: :math:`\mathcal{O}(n)`
- text: :math:`\mathcal{O}(n)`
- text: :math:`\mathcal{O}(n^2)`
- text: :math:`\Theta(n)`
- text: :math:`\Theta(log(n))`
- valid: true
text: :math:`\Omega(1)`
- text: :math:`\Omega(log(n))`
valid: true
- text: :math:`\Theta(\log(n))`
- text: :math:`\Omega(1)`
- text: :math:`\Omega(\log(n))`
header: You write a function to verify if a list of length :math:`n` is ordered
or not, this function returns true if it is and false if it is'nt. What
is (are) the most precise time complexity(ies)?
Expand Down Expand Up @@ -147,9 +146,8 @@ problems:
- text: :math:`0.00001 \in \Theta(1)`
valid: true
- text: :math:`2^{2n} \in \mathcal{O}(2^n)`
valid: true
- text: :math:`3^n \in \mathcal{O}(2^n)`
- text: :math:`n log(n) \in \mathcal{O}(n)`
- text: :math:`n \log(n) \in \mathcal{O}(n)`
type: multiple_choice
name: Mathematical Functions and Time Complexity
header: 'Select the right proposition(s) :'
Expand Down