Upgrade to Course Hero Premier Membership

Download high quality study documents
Get up to $100 in tutor credits
Learn 93% of our members earn better grades

Browse Documents

Cornell | CS 213
Professors:

Dinapoli

  • 47 Pages
    Register Now
    misc.ppt
    Course: CS 213
    School: Cornell

    Windowing Systems Windowing systems are probably the most non-standard aspect of modern computers, from a developer\'s point of view. There are many different windowing systems: Mac, Windows, X11, OS/2, NeXT, Java, Amiga, GEM, Desqview . All have s

  • 35 Pages
    Register Now
    exceptions.ppt
    Course: CS 213
    School: Cornell

    Exception Handling (or, \"building robust software\") The examples presented in the course so far haven\'t dealt well with errors. However, real-life software must deal with exceptional situations in a reasonable way. Such situations might include: Inv

  • 37 Pages
    Register Now
    stl1.ppt
    Course: CS 213
    School: Cornell

    A gentle introduction to the standard template library (STL) Some references: http:/www-leland.stanford.edu/~iburrell/cpp/stl.html http:/www.cs.rpi.edu/~musser/stl.html http:/www.sgi.com/Technology/STL/ (this is so comprehensive that it documents

  • 22 Pages
    Register Now
    rtti.ppt
    Course: CS 213
    School: Cornell

    Run-time type information (RTTI) and casts Consider classes for components and windows: class Component { . virtual void draw() {} }; class Window: public Component { . virtual void addComponent(Component *c); virtual list<Component*> getAllComponent

  • 32 Pages
    Register Now
    stl2.ppt
    Course: CS 213
    School: Cornell

    Elements are always copied when they are put into a container. So the following is ok: vector<string> v1; { string s1(\"foo\"); v1.push_back(s1); / a copy of s1 goes into v1 } / s1 is deallocated cout < v1.back() < endl; / ok - retrieves copy of s1 El

  • 32 Pages
    Register Now
    virtual.ppt
    Course: CS 213
    School: Cornell

    This lecture is a bit of a departure in that we\'ll cover how C+\'s features are actually implemented. This implementation will look suspiciously similar to pointers to functions in C, so we\'ll take a detour to check this out (for those of you who have

  • 11 Pages
    Register Now
    PRELIM1.pdf
    Course: CS 213
    School: Cornell

    COM S 213 PRELIM EXAMINATION #1 October 12, 2000 Name: Student ID: Please answer all questions in the space(s) provided. Each question is worth 4 points. You may leave when you are finished with the exam. Question 1. float f1 = 13.0; float f2 = 5.0;

  • 3 Pages
    Register Now
    syllabus.pdf
    Course: CS 213
    School: Cornell

    COM S 213, Fall 2002 Ron DiNapoli, Lecturer SYLLABUS (preliminary) Thu, 8/29 Tue, 9/3 Thu, 9/5 Tue, 9/10 Thu, 9/12 Tue, 9/17 Thu, 9/19 Tue, 9/24 Thu, 9/26 Tue, 10/1 Thu, 10/3 Tue, 10/8 Thu, 10/10 Tue, 10/15 Thu, 10/17 Tue, 10/22 Lecture #1: Review of

  • 29 Pages
    Register Now
    Lecture11.ppt
    Course: CS 213
    School: Cornell

    Lecture 11 More Inheritance, More Constructors \"Absolute C+\" Chapter 15 Overriding Let\'s recall the code we were working on from last lecture. We had a base class named Person and two derived classes named Student and Instructor. We defined a

  • 3 Pages
    Register Now
    Assignment6.pdf
    Course: CS 213
    School: Cornell

    COM S 213 Fall 2004 Assignment #5 Operator Overloading Due October 8, 2004 by 8am under the door of 351 Upson This is the last assignment prior to the first prelim. It is the most \"free form\" assignment we will have this semester! Design a class fo

  • 3 Pages
    Register Now
    Assignment5.pdf
    Course: CS 213
    School: Cornell

    COM S 213 Fall 2004 Assignment #5 Get to know MyString Due September 30, 2004 There are two purposes for this assignment. The first is to famliarize yourself with the MyString class a little morewe will use it for a couple of subsequent assignments.

  • 3 Pages
    Register Now
    Assignment8.pdf
    Course: CS 213
    School: Cornell

    COM S 213 Fall 2004 Assignment #8 Template Class Due November 4, 2004 Your assignment this week is to create a template class named Matrix which takes three placeholders: 1. A data type used to represent each individual element of the matrix 2. An i

  • 3 Pages
    Register Now
    Assignment9.pdf
    Course: CS 213
    School: Cornell

    COM S 213 Fall 2004 Assignment #9 Exceptions Due November 11, 2004 Your assignment this week is to add exceptions to Assignment #8. Specifically, create a MatrixException class which stores the following: An error code An error message The x,y co

  • 3 Pages
    Register Now
    CS213Info.pdf
    Course: CS 213
    School: Cornell

    CS213 C+ ProgrammingFall 2007 Course Information as of August 13, 2007 Welcome! Welcome to CS213, C+ Programming! We will be using the book C+ Primer by Lippman, Lajoie and Moo this semester. The goal of the course is to learn the syntax of the C+ l

  • 3 Pages
    Register Now
    Lecture17.pdf
    Course: CS 213
    School: Cornell

    Administrative. CS 213 - Lecture #17 Late Night Guide to C+ Chapter 10 pg 265 - 290 TEMPLATES, Part II Assignment #7 due today! Second prelim on 11/23 From Last Time: What is a Template? template <class a,class b,> fn (formal args) What is a Te

  • 3 Pages
    Register Now
    PRELIM2.pdf
    Course: CS 213
    School: Cornell

    COM S 213 PRELIM EXAMINATION #2 April 25, 2002 Name: Student ID: Please answer all questions in the space(s) provided. Each question is worth 4 points. You may leave when you are finished with the exam. Question 1. In C+, an interface is more of a co

  • 4 Pages
    Register Now
    Lecture18.pdf
    Course: CS 213
    School: Cornell

    From Last Time: What is a Template? template <class a,class b,> fn (formal args) n Lecture 18 n This is the official specification for a template. It says that to define a template you must: n n n Templates, Part II n n n start with the keywo

  • 3 Pages
    Register Now
    Assignment5.pdf
    Course: CS 213
    School: Cornell

    COM S 213 Spring 2003 ASSIGNMENT #5: DATE GIVEN: DATE DUE: Inheritance in the Menu Class 2/28/03 3/7/03 PURPOSE: To apply what weve learned about inheritance to our Menu class. ASSIGNMENT: For this assignment we are going to re-implement our Menu c

  • 3 Pages
    Register Now
    Assignment2.pdf
    Course: CS 213
    School: Cornell

    COM S 213 Spring 2003 ASSIGNMENT #2: DATE GIVEN: DATE DUE: Menu Class 1/30/03 2/6/03 PURPOSE: Classes can be used to encapsulate functionality into a neat package. For assignment #2 we are going to apply this concept to the menu problem solved in a

  • 3 Pages
    Register Now
    Assignment3.pdf
    Course: CS 213
    School: Cornell

    COM S 213 Spring 2003 ASSIGNMENT #3: DATE GIVEN: DATE DUE: Operator Overloads in the Menu Class 2/6/03 2/13/03 PURPOSE: This week we learned about operator overloads and constructors. Well apply these topics to the Menu class weve been working on.

  • 3 Pages
    Register Now
    Assignment9.pdf
    Course: CS 213
    School: Cornell

    COM S 213 Spring 2003 ASSIGNMENT #9: DATE GIVEN: DATE DUE: Simple Shopping System 4/17/03 4/24/03 PURPOSE: To apply what weve learned about the Standard Template Library map container ASSIGNMENT: THIS is the LAST assignment of the semester. As such

  • 3 Pages
    Register Now
    Assignment7.pdf
    Course: CS 213
    School: Cornell

    COM S 213 Fall 2002 ASSIGNMENT #7: DATE GIVEN: DATE DUE: A Better IntArray 10/24/02 10/31/02BOO! PURPOSE: To apply what weve learned about Exceptions to the IntArray class. ASSIGNMENT: Assignment #6 had you build an IntArray class. This week we are

  • 3 Pages
    Register Now
    Assignment3.pdf
    Course: CS 213
    School: Cornell

    COM S 213 Fall 2002 ASSIGNMENT #3: DATE GIVEN: DATE DUE: MenuBar and Menus 9/16/02 9/26/02 PURPOSE: To gain experience with using arrays and pointers. To begin attempts at designing classes from more abstract descriptions. ASSIGNMENT: Consider two

  • 3 Pages
    Register Now
    Assignment1.pdf
    Course: CS 213
    School: Cornell

    COM S 213 Fall 2002 ASSIGNMENT #1: DATE GIVEN: DATE DUE: Calculator 9/5/02 9/12/02 PURPOSE: The purpose of this assignment is to allow you to apply the review concepts weve covered in the first three lectures. While we will have covered additional

  • 3 Pages
    Register Now
    Lecture10.pdf
    Course: CS 213
    School: Cornell

    The Conceptual Side of Classes n n n n Earlier we defined classes as a user defined data type It could have member functions It could have member variables This is a technical, concrete definition Usually a noun n Lecture 10 Inheritance n The con

  • 3 Pages
    Register Now
    Lecture02.pdf
    Course: CS 213
    School: Cornell

    Functions in C+ Lets take a look at an example declaration: long factorial(int n) Lecture 2 Functions The declaration above has the following meaning: n n n The return type is long. That means the function will return a long integer to the calli

  • 3 Pages
    Register Now
    Lecture08.pdf
    Course: CS 213
    School: Cornell

    An Introduction to C-strings n n Lecture 8 C-Strings, C+ Strings And Multidimensional Arrays Absolute C+ Chapter 9, 5.4 n n n n A C string is not a class, it is simply an array of characters. Any given C string of length n will correspond to a c

  • 5 Pages
    Register Now
    Lecture2.pdf
    Course: CS 213
    School: Cornell

    Administrative. CS 213 - Lecture #2 Late Night Guide to C+ Chapter 3 pages 38 - 51 FUNCTIONS ANSI C+ Draft approved November 14, 1997 Functions in C+ This is how Late Night denes a function declaration: Functions in C+ Lets take a look at an ex

  • 3 Pages
    Register Now
    GradePostingWaiver.pdf
    Course: CS 213
    School: Cornell

    CS 213 Fall 2004 Info Form and Waiver NAME: ID NUMBER: LOCAL ADDRESS: LOCAL PHONE: NETID: IMPORTANT: If youd like your grades posted you must either sign the waiver to allow them to be posted by your Student ID, or provide an alternative number to po

  • 3 Pages
    Register Now
    PRELIM2.pdf
    Course: CS 213
    School: Cornell

    COM S 213 PRELIM EXAMINATION #2 April 26, 2001 Name: Student ID: Please answer all questions in the space(s) provided. Each question is worth 4 points. You may leave when you are finished with the exam. Question 1. Define an interface named Printable

  • 3 Pages
    Register Now
    Assignment10.pdf
    Course: CS 213
    School: Cornell

    COM S 213 Fall 2004 Assignment #10 Grade Ledger Due November 30, 2004 This will be your last assignment (I will still drop the two lowest assignments, but your assignment average will now be based on 8 assignments instead of 10). The assignment is l

  • 5 Pages
    Register Now
    Lecture10.pdf
    Course: CS 213
    School: Cornell

    Administrative. CS 213 - Lecture #10 Late Night Guide to C+ Chapter 7 pg 180 - 184 Chapter 8 pg 192 - 207 MORE ABOUT FUNCTIONS MORE ABOUT TYPES Assignment #4 graded Average Score: # There were # assignments turned in Assignment #5 due Thursday

  • 23 Pages
    Register Now
    95-213.pdf
    Course: CS 213
    School: Cornell

    0 C `C C 45\" C \" 4 `\" @ @ 4\" REQR~Q7q6 A8RhY)Cy5)7By)cm)R8%)AWf\")7p7yPR(qPu D 4\" C5 I 4 g @ C 55 `C 6U666)C7y6)ypge6%C 37yc7B7p`t Up(BuU666)23\" (9&635)(Bbkg767B8\'` #R 6A3V 27b

7,000,000 study materials 24/7 tutors Earn better grades