1. Prof. Alfred J Bird, Ph.D., NBCT abird@cs.umb.edu http://it441-f11-campbell.wikispaces.umb.edu/ Door Code for IT441 Students – 142864* Office – Wheatly 2nd floor 096-03 Office Hours – MW 3:00PM to 4:00PM

2.  Perl normally treats lines beginning with a # as a comment.  Get in the habit of including comments with your code.  Put a comment block at the beginning of your code which includes your name, the name of the module, date written and the purpose of the code.

3.  q// single quoted string  qq// double quoted string  In qq// the // can be replaced with any other non-alphanumeric character provided you use the same character on both ends of the string

4.  $a = “123”  $b = “456”  What do we get if we write this line of code,  print $a + $b;  How about this line of code,  print $a. $b;

5.  ** Exponentiation  -Unitary Negation  * Multiplication  /Division  %Modulo (Remainder)  +Addition  -Subtraction

6.  In mathematics and computer science, an algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function. Algorithms are used for calculation, data processing, and automated reasoning. In simple words an algorithm is a step-by-step procedure for calculations.

7.  To use a file we need to attach a filehandle to it.  We do this using the open statement.  A simple example:  open (OUT1, “>testoutout.txt”);  If we open it we want to close it after we are done:  Close (OUT1);  By convention a filehandle is codded in all capital letters

8.  We want to know for sure that we were successful opening the file so we include a test:  Open (OUT1, “>>test.txt”) or die $!;

9.  To use a filehandle you wrap it in angle brackets.  Print “Hello World!\n”;  chomp ($in = );

10.  Remember what the redirectors do:  >  >>  <

11. 1. Calculate the first 50 prime numbers and write them to an output file. 2. Calculate the first 40 members of the Fibonacci Series and write them to an output file. 3. Letter guessing game 4. Number guessing game using

12.  Complete the four programming exercises.