Skip to content

Commit

Permalink
Prettified Code!
Browse files Browse the repository at this point in the history
  • Loading branch information
Ebazhanov authored and actions-user committed Oct 10, 2023
1 parent 5bc82bb commit 3a5c52d
Show file tree
Hide file tree
Showing 2 changed files with 6 additions and 6 deletions.
2 changes: 1 addition & 1 deletion aws/aws-quiz.md
Original file line number Diff line number Diff line change
Expand Up @@ -988,7 +988,7 @@ aws ecs create-service \

[Reference](http://docs.aws.amazon.com/general/latest/gr/aws-sec-cred-types.html#access-keys-and-secret-access-keys)

#### Q116. ****\_\_\_**** are predefined, out-of-the-box policies that grant permissions for common use cases to eliminate the need to determine what permissions are needed.
#### Q116. \***\*\_\_\_\*\*** are predefined, out-of-the-box policies that grant permissions for common use cases to eliminate the need to determine what permissions are needed.

- [ ] Resource policies
- [x] AWS managed policies
Expand Down
10 changes: 5 additions & 5 deletions java/java-quiz.md
Original file line number Diff line number Diff line change
Expand Up @@ -2434,17 +2434,17 @@ public interface Square {

#### Q166. Which of the following represents the time complexity of an algorithm?

- [ ] O(N*N)
- [ ] O(N\*N)
- [ ] O(1)
- [ ] O(A+B)
- [x] O(A*B)
- [x] O(A\*B)

**Reasoning:** The answer option 'O(AB)' should be corrected to 'O(A*B)' to accurately represent the time complexity.
**Reasoning:** The answer option 'O(AB)' should be corrected to 'O(A\*B)' to accurately represent the time complexity.

- O(N*N): This represents a quadratic time complexity, where the running time grows with the square of the input size.
- O(N\*N): This represents a quadratic time complexity, where the running time grows with the square of the input size.
- O(1): This represents constant time complexity, indicating that the algorithm's running time doesn't depend on the input size.
- O(A+B): This represents linear time complexity, indicating that the running time scales linearly with the sum of values A and B.
- O(A*B): This represents quadratic time complexity, indicating that the running time scales quadratically with the product of values A and B.
- O(A\*B): This represents quadratic time complexity, indicating that the running time scales quadratically with the product of values A and B.

`The original answer option 'O(AB)' is incorrect as it does not properly represent a known time complexity notation. The correct notation should be 'O(A*B)' to indicate quadratic time complexity.`

Expand Down

0 comments on commit 3a5c52d

Please sign in to comment.