Question 2 (15 points) Circle all that are true T(n) = 3n is a) O(logn) O(n) O(n$^2$) b) ?(logn) ?(n) ?(n$^2$) c) ?(logn) ?(n) ?(n$^2$)
Added by Juan H.
Close
Step 1
- T(n) = O(n) means that the time complexity of the algorithm is linear in n. - T(n) = O(n^2) means that the time complexity of the algorithm is quadratic in n. - T(n) = O(e) means that the time complexity of the algorithm is constant. - T(n) = O(e*logn) means Show more…
Show all steps
Your feedback will help us improve your experience
Danielle Ashley and 91 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
14. Quantifiers (30 points). For each statement, determine if true or false (circle answer) and negate the statement. (a) True/False: ∃x ∈ ℤ ∀y ∈ ℤ xy − 7x = 0 (b) True/False: ∀x ∈ ℤ ∃y ∈ ℤ xy − 7x = 0 (c) True/False: ∀x ∈ ℤ ∀y ∈ ℤ xy − 7x = 0
Madhur L.
Construct a truth table for each of these compound propositions. a) $p \rightarrow \neg p$ b) $(p \oplus q) \rightarrow(p \wedge q)$ c) $p \oplus(p \vee q)$ d) $(p \leftrightarrow q) \oplus(\neg p \leftrightarrow q)$ e) $(p \leftrightarrow q) \oplus(\neg p \leftrightarrow \neg r)$ f) $(p \oplus q) \rightarrow(p \oplus \neg q)$
The Foundations: Logic and Proofs
Propositional Logic
Consider the following two statements: 1. C(n, k) is always equal to C(n, n - k). 2. P(n, k) is always equal to P(n, n - k). Which of the following is correct? Statement 1 is false and Statement 2 is false. Statement 1 is true and Statement 2 is false. Statement 1 is true and Statement 2 is true. Statement 1 is false and Statement 2 is true.
Audrey F.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD