## Forum Posts

Davey Yu

Mar 18, 2022

In ACSL Contest Prep

1718 JR 1718 SN

0

0

23

Davey Yu

Mar 11, 2022

In ACSL Contest Prep

1718 AS J 1516 AS

0

2

13

Davey Yu

Mar 03, 2022

In ACSL Contest Prep

Today, we review our first 3 units.
HW(All of this is from 1617 All-Star Junior.)

0

4

27

Davey Yu

Feb 17, 2022

In ACSL Contest Prep

Today, we learn how to identify and solve questions in Assembly Language. 17-18 S4 1920 I4

0

2

14

Davey Yu

Feb 03, 2022

In ACSL Contest Prep

Today, we talk about the graphs and the paths and cycles between them. From 2017-2018 Junior Contest 4 2. What are the different number of unique cycles in this graph?
3. Draw the following graph using the matrix below

0

4

37

Davey Yu

Jan 13, 2022

In ACSL Contest Prep

Homework: From Senior Contest 3 2019-2020 2. From Senior Contest 3 2017-2018 3. From AS Senior Level 2017-2018

0

4

36

Davey Yu

Jan 06, 2022

In ACSL Contest Prep

Since Tyler couldn't make it today, I will be explaining our new topic, Data Structures.
There are 4 types of Data Structures: Stacks Queues
Binary Search Trees Priority Queues Let's take this example: In Stacks and Queues, You'll see the methods PUSH and POP. PUSH inserts an item into the stack/queue. POP has different effects based on whether it's a Stack or a Queue. When using POP, Stacks uses the rule "First in, Last out." This signifies that POP would take out the most recent item inserted. For example, the first POP in this stack would remove R from the stack. On the other hand, Queues use the rule "First in, First out." This signifies that POP would take out the thing in the first "slot." In this case, the first POP in the above queue would remove F, unlike the R it would remove if it was a Stack. ------------------------------------------------------------------------------------------------------------------------- i was never good at this part of this it might suck A tree has these features. The "root" is the first node, its "children" is the following few nodes. Take the Example, ACSL A is the top and Z is the bottom when it comes to higher and lower A is our first letter, so it starts as the root of our tree.
C is "less" or "lower" than A alphabetically, so it goes to the right of the parent. S is "lower" than C and A on the alphabet, so it goes to the right of C. L is "higher" than S on the alphabet, but "lower" than A and C, so it goes to the left of S. And that is our Binary Search Tree of ACSL. I'm going to make a funny joke, so we are going to make a Binary Search tree of "Amogus" Our first step is to set A as our parent node. Then we continue with the same logic as always. M is "lower" on the alphabet than A, so it goes to the right of A. O is "lower" than both A and M, so it goes to the right of M. G is "lower" than A, but "higher" than M, so it goes to the left of M. The Binary Search tree should look like this when you're done: I didn't mention everything, so if you're confused about something, let me know in the comments. -------------------------------------------------------------------------------------------------------------------- Priority Queues I'm actually not too good with this, so, I suggest you look it up or make the slides that I hope Tyler made. Now for the actual HW part:
1. 2 & 3.

0

3

21

Davey Yu

Dec 16, 2021

In ACSL Contest Prep

We learned about Boolean Algebra and the functions of AND, OR, NOT, XOR, XNOR, and NAND. From Intermediate Contest 3 2017-2018 From Senior Contest 3 2019-2020 is XOR 5. Make a Truth Table to the best of your ability of the following (It's ok if you don't understand/finish this question, this question is time consuming and hard too)

0

5

35

Davey Yu

Dec 02, 2021

In ACSL Contest Prep

Today, we learned the functions of LISP and how to make our own functions using DEF or DEFUN. Make your own function. From Intermediate Contest 2 2017 - 2018 3. From Intermediate Contest 2 2015 - 2016 4. From Senior Contest 2013-2014

0

5

28

Davey Yu

Nov 18, 2021

In ACSL Contest Prep

The operations such as OR, AND, NOR, and XOR are not the only type of Bitstring Flicking. Stuff like LShift and RCirc also exist too.
1.
RSHIFT-1(LSHIFT-1(RSHIFT-1(LSHIFT-1(RSHIFT-1(LSHIFT-1(11011))))) 2. LCIRC-3(10010 OR NOT(01101)) AND RSHIFT-2(NOT(RCIRC-1(00111 OR NOT(10111))) 3 & 4:

0

4

29

Davey Yu

Nov 12, 2021

In ACSL Contest Prep

1 & 2. From 2017-2018 Junior Contest 2 3 & 4.
From 2016-2017 Junior Contest 2

0

5

27

Davey Yu

Oct 28, 2021

In ACSL Contest Prep

1. All Numbers are single digits
From Intermediate Contest 2 2016-2017 2. From Intermediate Contest 2 2017-2018
3. From Intermediate Contest 2 2015-2016 4. From Intermediate Contest 2 2015-2016

1

5

30

Davey Yu

Oct 14, 2021

In ACSL Contest Prep

1. What is outputted when this program is run? a = 1: b = 2: c = 3: d = 4: e = 4: f = 6 if (d / b) < (f / a) then d = d / b a = f ↑ b / c ↑ (d / b) if (a <= f) && (b > e) then a = f else b = e if abs(c - f) != int(f / c) then c = f / c else f = f / c if (a = = b) | | (c = = d) then a = a + b c = c + d output (b * c) * (f + d) / a / 2 * d - c + e ↑ (b - 2 * d) From Intermediate Contest 1 2017-2018 2. From Junior Contest 2 2016-2017

0

5

34

Davey Yu

Oct 07, 2021

In ACSL Contest Prep

How would you be able to use a 2D array in a real-world situation? What does len(string) do? How would you be able to print an array to make a string, assuming the array was a char array? Beginning with an initially empty array A, what is the positive difference between the maximum and minimum non-zero values in the array after the program is run? for n = 1 to 4 for p = 1 to 4 a(n,p) = n + p + n*p next p next n for n = 1 to 4 for p = 1 to 4 if (a(n,p) / 2 = int(a(n,p) / 2)) || (a(n,p) / 3 = int(a(n,p) / 3)) || (a(n,p) / 5 = int(a(n,p) / 5)) then a(n,p) = 0 next p next n end From Junior Contest 3 2017-2018 5. From Junior Contest 1 2015-2016

0

2

62

Davey Yu

Sep 30, 2021

In ACSL Contest Prep

1. From Senior Contest 2017-2018
2. From All Star Senior Contest 2016-2017
3. From All Star Contest 2014-2015

0

6

29

Davey Yu

Sep 23, 2021

In ACSL Contest Prep

Today, we learned about Recursive Functions and how to solve them.
1. From Question 2 Junior Contest 1 of 2017-2018 2. Select the correct answer
This is kinda hard so I understand if you get this wrong Junior All Star Short Question 3 of 2016-2017
3.
Senior Question 2 Contest 1 of 2019-2020 4. Junior All-Star Question 2 of 2017-2018 5. Define a recursive function in your own words

0

8

52

Davey Yu

Sep 16, 2021

In ACSL Contest Prep

Today, we continued from last class and learned how to convert bases Homework: 1. Turn 1111010(binary) into octal 2. Turn 846(octal) to decimal 3. Set X to a number in binary which satisfies the following equation: 62(octal) + X - 83(decimal) = E4(hex)

0

8

71

Davey Yu

Followers

Following

Follow