xevion/contest
1
0
Fork 0
mirror of https://github.com/Xevion/contest.git synced 2025-12-08 22:06:47 -06:00
Code Issues Packages Projects Releases Wiki Activity

added in questions for test 01

Browse Source
This commit is contained in:
Xevion
2019-11-05 20:44:26 -06:00
parent 91dd7ba582
commit 10028ed964
1 changed files with 24 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
uil/uil-practice-armstrong/test-1/EXPLANATIOn.md
View File

@@ -474,7 +474,7 @@ This could error if there was no negative and it tried to take another double wi
I ended with `7.5`. I ended with `7.5`.
# Question 29 ## Question 29
This deals with a new type of object, a Queue, specifically the PriorityQueue (PriorityQueue is akin to ArrayList as Queue is to List), they are specific, more advanced implementations (PriorityQueue & List). This deals with a new type of object, a Queue, specifically the PriorityQueue (PriorityQueue is akin to ArrayList as Queue is to List), they are specific, more advanced implementations (PriorityQueue & List).
@@ -513,4 +513,26 @@ q.peek();
> peek() does not take items from the Queue, it only looks at what would be taken had you poll()'d. > peek() does not take items from the Queue, it only looks at what would be taken had you poll()'d.
``` ```
Be sure to read up on how Queues work, specifically the ordering, this can be very confusing and it will help to learn this, along with Comparators & Collections in general. Be sure to read up on how Queues work, specifically the ordering, this can be very confusing and it will help to learn this, along with Comparators & Collections in general.
## Question 30
## Question 31
## Question 32
## Question 33
## Question 34
## Question 35
## Question 36
## Question 37
## Question 38
## Question 39
## Question 40