EEN218 (Programming 2) Spring 2009
Tue Thur 3:30-4:45 in MM102

• Official Syllabus.
• Downloads: Software to make things work
• The Book: "C++ programming: Program design including Data Structures", D. S. Malik, ISBN 1418836400.
• For Reference or Review:
  • Review of Recursion, An animation of some recursive functions.
  • Introductory Guide to Using Unix
  • Guide to using stdio for input and output
  • Unix, C, and C++ Functions Quick Reference.
  • Graphics Library downloads and documentation
  • Introduction to Web-based programming with CGI.
  • How to Time a Running Program (Improved, accurate version, 18th Sept 2003).
  • CGI programs can be Sampled Here; you can't see the C++ code, but you can get sample runs, and use "view source" to see how the HTML formatting was done.
• Examinations:
  • Mid-Term Examination: Thursday 12th March.
  • End-Term Examination: Thursday 21st April.
  • Final Examination: Wednesday 13th May, 2.00 p.m.
• Assignments:
  1. Due Tuesday 10th February (Saint Scholastica's day)
     Pick a real-life kind of object that you or somebody else might have a collection of, such as books, CDs, pirate treasure, etc. (do not pick chemical elements). The objects should have at least three independent useful attributes (such as title or name, author, value, publisher, year made, etc.). Design a C++ object to represent them, and create a program that reads a reasonable number of these objects from a text file, keeps the objects in a suitable array, and provides the user with some useful search operations (such as list all books with a given author, find the author for a particular title, etc).
  2. Due Tuesday 3rd March
     The almost-super calculator. A program that accepts lines of input from the user interactively and processes them as calculator commands. If a line begins with the symbol "set", then it will have this form set variable=formula. The formula should be evaluated and recorded as the value of the variable. Any other input should be treated as a formula which should be evaluated immediately, and the result displayed. Formulas must be able to include numeric constants, variables, at least the five standard operators (+, -, *, /, ^) with the normal evaluation order, and any number of (properly matched) parentheses. It should not be possible for any user input, no matter how incorrect, to crash your program.
  3. Due Tuesday 12th April
     Implement Merge-sort, make sure it is correct. The one user-supplied input to your program should be a single number N. Your program should generate N random numbers, and automatically time how long it takes to sort them (timing functions here). Remember that merge-sort is O(NlogN), which means that the time it takes to sort N things is approximately k×N×log₂(N). Find out what the value of k is for your program.
  4. Due Wednesday 29th April
     The Super calculator. Adapt your solution to the second assignment to make it work correctly and accurately on really big numbers. It should support integers that are hundreds of digits long. You should define a struct/class to represent a BigInteger, which would contain an array or linked-list of normal ints to store the BigInteger's individual digits. You should define methods that implement the standard arithmetical operators. Division and to-the-power-of will be treated as extra credit.
  5. Due Monday 11th May
     Game Thing (sample demo, sample map).
• Class History, etc.:

  	Class 1	(Tu 20-1-2009)	Make sure you remember enough from 118, Reminders about objects and everything, Today's beginning example. Your accounts on rabbit have now been set up. Test them when you can.
  	Class 2	(Th 22-1-2009)	(approx. chapter 10).Today's example, The data set.
  	Class 3	(Tu 27-1-2009)	Developing a flexible reliable input system. Today's defective example, make sure you can spot the mistake, it is fairly obvious.
  	Class 4	(Th 29-1-2009)	Our case study is almost complete, or is it? special objects to implement variables of unknown type (item in the example), etc.
  	Class 5	(Tu 3-2-2009)	Useful comments, Separate compilation: .cpp, .h, and .o files. Towards complete object orientation - today's developments.
  		(We 4-2-2009)	Last day to drop without a 'W'
  	Class 6	(Th 5-2-2009)	Complete object orientation - methods, members, and constructors, Today's edition, The stack object.
  	Class 7	(Tu 10-2-2009)	Beginning the supercalculator; introduction to the ideas of parsing expressions.
  	Class 8	(Th 12-2-2009)	Parsing and evaluating expressions with the correct order of evaluation, the top-down approach.
  	Class 9	(Tu 17-2-2009)	A big recursive system of functions, "little boxes", dealing with nested parentheses.
  	Class 10	(Th 19-2-2009)	Pointers, linked lists, and new. Designing a flexible memory object.
  	Class 11	(Tu 24-2-2009)	The basic linked list operations.
  	Class 12	(Th 26-2-2009)	Link and List are different objects. A proper object oriented approach.
  		(Mo 2-3-2009)	Academic alerts due
  	Class 13	(Tu 3-3-2009)	The complete set of operations: add to front and end, remove from front and end. The two-line sort function.
  	Class 14	(Th 5-3-2009)	Comparing insertion and selection sort, determining O(N2) time, discovering merge-sort.
  		(Fr 6-3-2009)	Last day to apply for graduation
  	Class 15	(Tu 10-3-2009)	Working out the details of merge-sort.
  	Class 16	(Th 12-3-2009)	Test.
  	14th to 22nd March		Spring Break
  	Class 17	(Tu 24-3-2009)	Test review.
  	Class 18	(Th 26-3-2009)	Old computers and their speed. Comparison of sorting methods, introducing quicksort.
  	Class 19	(Tu 31-3-2009)	Quicksort.
  	Class 20	(Th 2-4-2009)	the interactive non-recursive quicksort demo
  		(Mo 6-4-2009)	Last day to drop
  	Class 21	(Tu 7-4-2009)	Recursion makes quicksort simpler. Reminder of Binary Chop Search. Introducing Binary Search Trees.
  	Class 22	(Th 9-4-2009)	Methods for binary trees.
  	Class 23	(Tu 14-4-2009)	Recursion and a reference parameter maes tree insertion simple. The operator[] method. A tree-to-array method.
  	Class 24	(Th 16-4-2009)	Deletion from a tree and other interesting things.
  	Class 25	(Tu 21-4-2009)	Test.
  	Class 26	(Th 23-4-2009)	Differences between C++ and C: C strings, malloc, free, printf.
  	Class 27	(Tu 28-4-2009)	more C: printf, getchar, gets; the internet worm.
  	Class 28	(Th 30-4-2009)	Unix systems and internet programming: the server and the client.
  	Final Exam	(We 13-5-2009)	Final Exam at 2:00pm.