CSE2050 Syllabus
Programming in a Second Language (C++)

Florida Tech, Spring 2002 - Jan. 8 to Apr. 25 - Tues. and Thurs., 12:30-1:45 PM, room 137EC

http://cs.fit.edu/~mmahoney/cse2050/

Syllabus - short version

Course Description

Students will learn to program in C++. Topics include the standard library, object oriented programming (data abstraction, inheritance, polymorphism), implementing data structures, and the UNIX development environment and portability considerations. Prerequisites: CSE2010 (Algorithms and Data Structures) or equivalent, experience in at least one other programming language.

Instructor

How is my teaching? Review this course anonymously at TeacherReviews.com.

Textbook

Code examples from the book
C++ Reference
Guidelines for Object Oriented Programming

Grading Policy

Based on 100 points. 90-100=A, 80-89=B, 70-79=C, 60-69=D, 0-59=F

Tests, 50% of grade

There will be 4 tests during the term including the final exam. Each will count equally. Your grade will be based on the highest 3 tests after dropping the lowest score. There will be no make-up tests for any reason. Fall 2001 exam solutions:

Spring 2002 Exam solutions:

Exam 1 solution.
Exam 2 solution.
Exam 3 solution.
Final Exam solution.

Fall 2001 Exam solutions:

Fall 2001 syllabus and homework
Exam 1 solution.
Exam 2 solution.
Exam 3 solution.
Final Exam solution.

Spring 2001 Exam solutions:

Exam 1 solution.
Exam 2 solution.
Exam 3 solution.
Final Exam solution.

Programming assignments, 50% of grade

Assignments will be graded equally on documentation and readability and on whether it actually works. Programs are due at midnight. Programs turned in late will be penalized 20% per day, including non-class days, weekends, and holidays.

Programs must be turned in by email. I prefer that you send me one source code (.cpp) file as an attachment, or in the body of the mail message if your mailer doesn't supoort attached files. Limit line length to 80 characters. I do not need test cases by email, since I can test it myself. Do not send me executables, zip files, Word files, project files, etc.

You are permitted to receive help from other students or outside sources, however you must cite your sources in your program comments and your work must still demonstrate that you are capable of writing the program yourself. Copying code or allowing your code to be copied by other students is not allowed. See the Florida Tech Computer Science Honor Code for details.

Documentation

• Name
• Email address
• Compiler and version number (for example, g++ 2.7.2) List all that apply. (Use g++ -v to get the version for g++).
• Your operating system (Windows 98, Solaris 2.7, etc.) List all that apply. (In UNIX, use uname -a)
• An analysis or users manual, describing what your program does from the point of view of a novice user who has not read the assignment. It should tell the user what your program is for, what it does, i.e. why he/she should bother to download it from your website. Be specific: I should be able to supply input to your program, without errors, and predict what the output should look like. As a general rule, you should have one line of analysis for every 3-5 lines of code. The analysis must appear before the first line of code.
• Comments describing the major sections of code: classes, functions, loops, and important variables. Use descriptive names instead of comments if possible. Do not comment every line.
• Use white space and indentation to show program structure, as in the examples in the book.
• Give references where appropriate, including help received from other students. Copying code or allowing your code to be copied is not allowed.

Compilers

All programs must be tested with g++ under UNIX (Solaris, Linux, etc.). You may use other systems for development if you wish (Windows or Mac), and then port them. If you do, your C++ compiler should be produced since 1998 so that it supports the standard library. If you prefer to develop under Windoes and port to UNIX, then I recommend DJGPP, available at www.delorie.com. Other free compilers are available at www.cplusplus.com/info/compilers/

Mailing List

All students will be enrolled in a mailing list and will be responsible for announcements posted to this list. You should be enrolled automatically, but I sometimes miss a few people, so if you do not receive an email by the second class letting you know, then you should subscribe by sending a blank email to fit-cse2050-subscribe@yahoogroups.com. You are also encouraged to post questions about C++ or your assignments to this list, and to answer questions posted by other students. To post messages, mail them to fit-cse2050@yahoogroups.com. Archived messages may be found at groups.yahoo.com/group/fit-cse2050/

Assignment 1

Compile and run the "hello world" program on page 1 using g++. Add comments as described above.

Assignment 2

Due Tues. Jan 22, 2002 (10 pts). Write a C++ program like the one in chapters 1 and 2, except that it prints a triangle around the greeting instead of a rectangle. For instance:

Please enter your first name: Matt

          *
         * *
        *   *
       *     *
      *       *
     *         *
    *           *
   *             *
  * Hello, Matt!  *
 *                 *
*********************

Be sure your documentation describes the program completely, including how you handle the case where the greeting can't be centered exactly.

Solution

Assignment 3

Due Tues. Jan. 29, 2002 (10 pts). Write a program to sort files. This assignment is deliberately vague (like real world programming assignments), so you will need to write an analysis (program description) describing what it means for a file to be sorted and how the user specifies the file names. Give an example showing how your program would be run (what does the user type?), and a sample file before and after sorting. Put all of this in your documentation before the first line of code. I suggest you try man sort in UNIX for some ideas, but you don't have to do it this way.

You do not need to write a sorting algorithm. You can use the standard library function sort() on a vector of strings to do most of the work.

Solution

Assignment 4

Due Feb. 12, 2002 (10 pts). Write a program to index a text file by line number. The program should take a file name as an argument, then print an alphabetical listing of all the words in the file, in lower case. Each word should be followed by a list of line numbers (separated by spaces on the same line of output) where the word appears. A word is any sequence of letters from a to z with no other characters in between. Upper and lower case are considered equivalent, i.e. "The", "the", and "THE" are all the same word and are listed as "the". If a word appears on more than 10 lines, list only the first 10 line numbers followed by "...". If a word appears more than once on a line, list the line number only once. The first line is line 1. If the program is run without a file name argument, read from standard input (cin). If the file does not exist, print an appropiate error message to cerr (so that the message will appear on the screen even when the output is redirected).

For example, suppose the file test.txt contains the following:

  This is
  a test.  THIS and this is
    another test.

  index test.txt     (or index <test.txt)
  a 2
  and 2
  another 3
  is 1 2
  test 2 3
  this 1 2

Solution

Assignment 5

Due Tues. Feb. 26, 2002 (15 pts). Write a program to print calendars for any given month, for example:

  cal Feb 2002

  February 2002
  Su Mo Tu We Th Fr Sa
                  1  2
   3  4  5  6  7  8  9
  10 11 12 13 14 15 16
  17 18 19 20 21 22 23
  24 25 26 27 28

Your program should take as arguments:

• Month (January-December) and 4 digit year. The name of the month is not case sensitive, and may be any prefix long enough not to be ambiguous. For example, f for February, or JUN for June, but not ju or j, which could be confused with July or January. Your program should print an error message if the argument can't be matched to exactly one of the 12 months.
• Month only, in which case it uses the current year (local time).
• No arguments, in which case it uses the current month and year.
• A number with a leading + or -, which is added to the current month. For example, cal +3 for 3 months from now, or cal -12 for this month last year.

Your program should define a class Month to represent a month and year using your choice of private representation. It must have the following public members:

• A constructor taking a month (as a string) and a year (as an int).
• A constructor taking a month only (defaults to current year). If the month is an empty string, "", default to the current month as well.
• A constructor taking no arguments (defaults to current month and year). These might all be the same constructor by using default arguments.
• A public type Month::Ambiguous which is thrown by a constructor when passed a string that might be interpreted as more than one month, such as "ju" or "J" (but not "").
• A public type Month::Invalid thrown for an invalid month such as "X".
• A method Month::add(x) which adds x months (an int) to the represented value. x may be negative.
• A method Month::print(out) which prints a calendar for the represented month and year to the ostream out as shown above.

Hints:

• See <ctime> to get the current local time.
• Leap years are divisible by 4, but not by 100, unless divisible by 400. Thus, 2000 is a leap year, but 1900 and 2100 are not.
• Use the UNIX cal command to test your program. See man cal.

Solution

Assignment 6

Due Mar. 26, 2002 (15 points). Modify assignment 4 (the file index program) to use a binary tree instead of a map. The output of the program should be the same. However, instead of a map<string, vector<int> >, you will use a Tree<string, vector<int> >. The templated class Tree<K, V> should have the following public members:

• V& Tree::operator[](const K& k) - looks up the unique key k (type K) and returns a reference to the associated value of type V. When k is referenced for the first time, a default initialized object of type V is created and a reference to it is returned. In other words, it works just like the index operator for a map.
• void Tree::transform(void f(const K& k, V& v)) - calls the function f(k, v) on each key-value pair in the tree in order of ascending keys. The function may modify the values, but not the keys.
• Copy constructor, assignment operator, and destructor as appropriate. You may choose to disallow copying and assignment by making them private if you wish. However, if you do so, you will need to modify xref() from chapter 7, because it returns by value, which requires copying.

Since a Tree does not support iterators, you need to use the transform() function to print the index. For example, the word count program on p. 124 could be implemented as follows. (This would also be a good way to test your program).

  // Print s and i on one line
  void print(const string& s, int& i) {
    cout << s << "\t" << i << "\n";
  }

  // Prints an alphabetical list of words from input and number of times they each appear
  int main() {
    string s;
    Tree<string, int> counters;  // Maps words to counts
    while (cin >> s)  // Build the tree
      ++counters[s];
    counters.transform(print);  // Print the tree
    return 0;
  }

Solution

Assignment 7

Due Apr. 23, 2002 (30 pts). Write a program for displaying ASCII graphics. The input should be a series of graphics commands from a file or standard input to draw lines, rectangles, text labels, etc. The output should be a drawing suitable for display on a text terminal of unknown dimensions. A drawing command is one line containing a keyword (not case sensitive) followed by a list of numbers separated by white space.

HLINE x y w

Draws a horizontal line of width w, from (x, y) to (x+w, y) consisting of w+1 "-" characters. For example, HLINE 1 2 3 draws ---- with the first character at (1, 2) and the last at (4, 2).

VLINE x y h

Draws a vertical line of height h from (x, y) upward to (x, y+h) consisting of h+1 "|" characters.

LINE x y w1 h1 w2 h2 w3 h3 ...

Draws a series of lines connected by "+" at their endpoints, starting at (x, y), then alternating right and up by w1, h1, w2, h2, etc. (or left and down if negative). There may be any number of widths and heights. Each segment consists of |w|+1 "-" characters horizontally or |h|+1 "|" characters vertically, except that the first character is replaced by "+" when it overlaps the last character of the previous line segment, unless the previous segment has length 0. Note that LINE x y w1 is equivalent to HLINE x y w1, and LINE x y 0 h1 is equivalent to VLINE x y h1.

BOX x y w h

Draws a filled rectangle with width w and height h and with lower left corner at (x, y). Equivalent to LINE x y w h -w -h w (drawing the bottom twice so there is a + at every corner) except that the interior is also filled with spaces.

LABEL x y text...

Draws a text label with the first character at (x, y). The text label starts with the first printable character but may contain spaces.

hline 0 2 9
line 0 0 0 4 3 -4 3 4 3 -4

+--+  +--+
|  |  |  |
----------
|  |  |  |
|  +--+  |

label 4 4 Hello World!
box 2 2 15 4
vline 9 0 9
box 4 4 15 4
vline 10 0 9

         ||
    +----|---------+
    |    |         |
  +--------------+ |
  |              | |
  | Hello World! |-+
  |              |
  +--------------+
         ||
         ||

Your program should make appropriate use of object oriented programming techniques (data abstraction, inheritance, and polymorphism). For example, you might have classes Hline, Vline, Line, Box, and Label (some may be derived from others or contain others) with a common abstract base class Shape with a pure virtual method draw(). You should read the input into a polymorphic data structure such as a linked list of Shape or vector<Shape*> so that the objects can be drawn in reverse order of the input so that the first object appears on top. Objects could be drawn into a Buffer (another class), whose dimensions might be found by scanning the list of Shapes to find the maximum x and y, or be determined dynamically for each row during drawing. Then the Buffer would be printed to the screen using the << operator.

Be sure your analysis is clear, especially with regard to your extra graphical element, and any other details not specified in the assignment. For example, how is the input file specified? What happens if you draw at negative coordinates? What happens for invalid commands, the wrong number of parameters, or the parameters are not integers? In the code, be sure to comment classes, data structures, functions, methods, etc. so that I can understand how you applied object-oriented principles.

Solution