Spark! 9013
Course Catalog
Filter Catalog by Grade:
Jump to Categories | |
---|---|
[Deprecated] SATPrep | Miscellaneous |
[Deprecated] SATPrep
S7201: [Test] Learn You A Haskell: Functional Programming
Difficulty: **
Teachers:
Gurtej Kanwar
FUNCTIONS ARE DATA
LISTS ARE INFINITE
HASKELL IS FUN
Haskell is a purely functional, strongly typed programming language with non-strict evaluation. If none of those words made sense to you, you should take this class to fix that! We'll talk about the basics of programming in Haskell, why it's the best programming language, and how you can fit an infinite list in your computer's memory.
Prerequisites
You should have experience programming in some language, but no knowledge of Haskell is necessary.
LISTS ARE INFINITE
HASKELL IS FUN
Haskell is a purely functional, strongly typed programming language with non-strict evaluation. If none of those words made sense to you, you should take this class to fix that! We'll talk about the basics of programming in Haskell, why it's the best programming language, and how you can fit an infinite list in your computer's memory.
Prerequisites
You should have experience programming in some language, but no knowledge of Haskell is necessary.
S7204: [Test] How Operating Systems Work
Difficulty: ***
Teachers:
Gurtej Kanwar
You deal with operating systems on a day-to-day basis -- Macs, Windows, Linux, etc. An operating system is the software that lies between your computer hardware and the applications you would interact with on a day-to-day basis.
Operating systems have to be carefully designed for security, modularity, and speed. In this clas we'll look at the basics of how operating systems function to meet these goals.
Prerequisites
Knowledge of C programming is highly recommended. Knowledge of x86 architecture would be helpful but is not necessary.
Operating systems have to be carefully designed for security, modularity, and speed. In this clas we'll look at the basics of how operating systems function to meet these goals.
Prerequisites
Knowledge of C programming is highly recommended. Knowledge of x86 architecture would be helpful but is not necessary.
Miscellaneous
X7203: [Test] Introduction to Algorithms
Difficulty: **
Teachers:
Gurtej Kanwar
Algorithms describe a "recipe" for doing something. Having good algorithms that are fast and easy to use is important for every area of life.
In this class we'll talk about computer science algorithms in particular. We'll talk about how to use algorithms to sort a list of things, create tables that make looking up values really easy, and find shortest paths in graphs.
Prerequisites
Knowing a programming language is strongly recommended.
In this class we'll talk about computer science algorithms in particular. We'll talk about how to use algorithms to sort a list of things, create tables that make looking up values really easy, and find shortest paths in graphs.
Prerequisites
Knowing a programming language is strongly recommended.