# Difference between revisions of "Main Page"

Jump to navigation
Jump to search

Marc Brown (talk | contribs) m |
Marc Brown (talk | contribs) |
||

Line 17: | Line 17: | ||

* [[Recursive Functions]] | * [[Recursive Functions]] | ||

* [[What Does This Program Do?]] | * [[What Does This Program Do?]] | ||

* [ | * [//www.acsl.org/categories/C1Elem-ComputerNumberSystems.pdf Elementary Division: Computer Number Systems (Contest 1)] | ||

* [ | * [//www.acsl.org/categories/C2Elem-Prefix-Postfix-InfixNotation.pdf Elementary Division: Prefix-Postfix-Infix Notation (Contest 2)]] | ||

* [ | * [//www.acsl.org/categories/C3Elem-BooleanAlgebra.pdf Elementary Division: Boolean Algebra (Contest 3)] | ||

* [ | * [//www.acsl.org/categories/C4Elem-GraphTheory.pdf Elementary Division: Graph Theory (Contest 4)] | ||

== Getting started == | == Getting started == |

## Revision as of 01:07, 21 October 2018

Welcome to the wiki describing the topics covered in the short programs section of the ACSL contests.

If you'd like to contribute to this wiki - and we'd love to improve it - please shoot us an email requesting an account. Conversely, if we've linked to your material (especially YouTube videos) that you'd prefer that we do not reference, let us know and we will promptly remove those links.

Categories covered:

- Assembly Language Programming
- Bit-String Flicking
- Boolean Algebra
- Computer Number Systems
- Data Structures
- Digital Electronics
- FSAs and Regular Expressions
- Graph Theory
- LISP
- Prefix/Infix/Postfix Notation
- Recursive Functions
- What Does This Program Do?
- Elementary Division: Computer Number Systems (Contest 1)
- Elementary Division: Prefix-Postfix-Infix Notation (Contest 2)]
- Elementary Division: Boolean Algebra (Contest 3)
- Elementary Division: Graph Theory (Contest 4)

## Getting started

- User's Guide for information on using the wiki software
- Configuration settings list
- MediaWiki FAQ