There is a regular season of FOUR competitions/contests. The window during which each contest can be accessed on HackerRank is as follows.
- Contest #1: available Nov. 1, 2021; closes Sunday January 16, 2022 @ 11:59pm EST
- Contest #2: available Dec. 27, 2021; closes Sunday March 6, 2022 @ 11:59pm EST
- Contest #3: available Jan. 31, 2022; closes Sunday April 10, 2022 @ 11:59pm EDT
- Contest #4: available March 7, 2022; closes Sunday May 15, 2022 @ 11:59pm EDT
Each class meets two or three times per week. After the first class in the week, a written homework will be assigned. After the second class in the week, a programming homework will be assigned.
Contest 1 – 8 weeks, 8 meetings (one 1.5hrs meeting per week)
- Introduction. Discuss “What does this program do”
- More “What does this program do” problems. If students understand quickly, start with recursive functions
- Introduce recursive functions. Do recursive function problems
- Introduce bases. Specifically, converting between base 2, 8, 10, 16. Problems
- Math in different bases. RGB. Base problems.
- Mixed problem sets.
- Mixed problem sets. Discuss test and programming assignments.
- Full practice test and discuss.
No class over winter break
Contest 2 – 8 weeks, 8 meetings (one 1.5hrs meeting per week)
- Debrief first exam. Discuss prefix/postfix/infix notation. Practice evaluating.
- Translating between prefix/postfix/infix. Practice problems
- Prefix/postfix/infix problems
- Go over bit operations. Practice evaluating
- Bit operations problems
- “What does this program do”
- Sample programming problem
- Mixed problem sets
- Full practice test and discuss
- Full practice test and discuss
Contest 3 – 8 weeks, 8 meetings (one 1.5hrs meeting per week)
- Debrief the second exam. Discuss stacks and queues. Problems
- Trees, Binary search trees. Problems
- Queues. Problems
- Intro boolean algebra. Truth tables.
- DeMorgan’s law. Simplification
- More boolean algebra simplification
- “What does this program do”
- Mixed problem sets
- Full practice test and discuss
- Full practice test and discuss
Contest 4 – 8 weeks, 8 meetings (one 1.5hrs meeting per week)
- Debrief the third exam. Discuss graphs, digraphs, edge sets. Complete graphs, Problem sets
- Discuss the adjacency matrix. Trees, spanning trees, minimal spanning tree. Problems.
- Graph problems
- Graph problems
- Logic gates and problems
- Logic gate problems
- “What does this program do”
- Mixed problem sets
- Full practice test and discuss
- Full practice test and discuss
Reviews
There are no reviews yet.