W5A1
Q1Asymptotic notation has been used for years without there being any need
to change its purpose. However, sometimes, when we do not want to look
around for a potential substitute, we ignore a potential improvement because
of laziness. This may be th
RUNNING HEADER: ASYMPTOTIC NOTATIONS
1
Stacey Sell
Theory of Computation | ITS1105 S01
11/18/2011
Instructor Mousa Ayyash
Asymptotic notations are have been used from a long time as this is a fundamental
concept of Computer Science. These notations are us
Computational Complexity for Tic-Tac-Toe Game
Tic-tac-toe is a pencil-and-paper game for two players, X and O, who take turns marking the
spaces in a 33 grid. The X player usually goes first. The player who succeeds in placing three
respective marks in a
Stacey Sell
Theory of Computation | ITS1105 S01
11/13/2011
Instructor Mousa Ayyash
Even though we may not know it, we create algorithms almost daily. What I mean is when we
play poker or other card games that you must put in suits or any other kind of ord
Think of a process you are often exposed to that would be simple to translate into an
algorithm. Briefly describe the process and explain why translating it into an algorithm
would be simple. What makes it so easy? What are some aspects of processes in ge
TIC-TAC-TOE
Tic-tac-toe is a paper and pencil game for two players. There is a grid of (usually) 3x3 tiles
(although a different number of tiles are possible too) and there are two players. One player
plays with crosses (X) and the other with circles (O).
Stacey Sell
Theory of Computation | ITS1105 S01
11/05/2011
Instructor Mousa Ayyash
Alan Turning is known as one of the best mathematicians in the world. He made what
today we call the Turning Machine and Turning Test.
The Turing Machine is a simple kind o
W3A1
Markov Models grant a particular kind of strength in solving computation problems that would
otherwise be intractable or unapproachable. Typically, one of the key challenges for computing
as a whole is pattern recognition; this process, which human b
GAME of LIFE
Block (still life)
Blinker (period 2
oscillator)
Glider (spaceship)
Rules to the Game of Life
Life is a cellular automata invented by professor John Horton Conway in the early 1970's.
The universe is an infinitely large array of square cells.
When we think of automata, most of us will think of Conways Game of Life. A cellular
automaton (CA) is a discrete, dynamical system that performs computations in a finely
distributed fashion on a spatial grid. The simplest type of cellular automaton is a
W2A1
Think of a moderately difficult process. Write down the steps and translate it into an
algorithm. What are some of the difficulties you faced in the process? Do you think this
series of steps is ready to be translated into a code?
How one might devel
Hangman Game
Hangman is a word guessing game. This game can be played between 2 or more players. One
player selects a word and other players guess that word by guessing letters. The word to be
guessed is represented by the row of dashes, equal to the numb
Rock-paper-scissors
Rock-paper-scissors is a hand game played by two or more people.
Rock-Paper Scissors is an ancient game that follows a relatively simple set of rules easily
depicted using a truth table. The game models a seemingly random game of pure
The binary language system is a concept used in the computing field. The system uses strings of
ones and zeros to represent more complex numbers. The system can also be used to represent a
group of decisions or logic states. The term binary simply means b
W6A1
Q2 When working on a problem that has neither been analyzed nor planned too carefully,
someone may code a solution too quickly and create unnecessary complexity, which can be quite
significant in case the person who makes the mistake is either your c
Nim Game
Introduction
Nim is a 2 player game. A game state consists of a multi - set S of nonnegative integers together
with whose turn it is. If S does not contain any positive integers, then whose turn it is loses (we
will call this the normal play rule