In this course you will apply much of your CS knowledge
to breathe life into a robot that needs to
survive in an artificial world of algorithmic problems.
The robots need to make decisions about how to
engage with other robots and win or lose.
In order to create effective and fair teams, we want to make sure
that no team is loaded with one skill while other teams
lack that skill.
Your skills:
Please estimate your skills in the following topics on a scale
from 0-10: 0: no skill, 10: excellent skills.
Programming (indicate your preferred language)
Java programming
Object-oriented design
Theory of computation
Grammars and ambiguous grammars (context-free)
Developing grammars for languages defined by examples
P (problems solvable in polynomial time)
NP-completeness
Satisfiability problem, propositional calculus
Calculus:
Maximizing and minimizing functions
Taking derivatives of polynomials
Discrete Structures (Discrete Mathematics)
Number representations
Combinations and permutations
Binomial coefficients and binomial theorem
Pascal's triangle
Probabilities of events (involving dice)
Inclusion-exclusion principle
Growth of functions
Recurrence relations
This material is not a prerequisite but some of you might know it:
Algorithm design
Greedy Algorithms
Divide and Conquer
Dynamic Programming
Local Search
Algorithm analysis
Linear algebra
Also indicate which of those courses you have taken:
MTH U371 Linear Algebra
MTH U481 Probability and Statistics
MTH U241 Calculus 1
MTH U242 Calculus 2
CS U690 Algorithms & Data
Also indicate which of those courses you are currently taking:
MTH U371 Linear Algebra
MTH U481 Probability and Statistics
MTH U241 Calculus 1
MTH U242 Calculus 2
CS U690 Algorithms & Data
Please send your response to this questionnaire to
csu670-grader@ccs.neu.edu.