C++ Programming 2

CISP 232 C++ Programming II

2012-01-06T12:06:00.000-08:00

Welcome to the CISP 232 C++ Programming II Course Weblog. This site will serve as a repository for course information, including course slides, assignments and resources.

Please send me an email (nicole.ryan@davenport.edu) if you have any suggestions regarding the weblog.

Linked Lists

2009-04-14T13:56:00.000-07:00

This week we will explore the exciting world of linked lists.

We will learn:

The basic properties of nodes
How to build a linked list
How to add items [nodes] to a linked list
How to delete items from a linked list
And how to copy a linked list

Recursion

2009-04-07T14:22:00.000-07:00

This week we will learn about recursion. Recursion is a method of solving a problem by reducing it into smaller versions of itself.

And there are people who find this stuff funny. Remember those annoying riddles from childhood like Pete and Repeat... well there's even more recursive humor out there, check out confused.

Handling Exceptions and Life's Other Disappointments

2009-03-31T13:28:00.000-07:00

An exception is an occurrence of an undesirable situation that can be detected during program execution. Wouldn't it be great if we could build a program to handle undesirable situations automatically? Well now we can! In Chapter 15 we will:

Learn what an exception is
Learn how to handle exceptions within a program
See how a try/catch block is used to handle exceptions
Become familiar with C++ exception classes
Learn how to create your own exception classes
Discover how to throw and rethrow an exception
Explore stack unwinding

Overloading and Templates continued, oh My

2009-03-24T13:55:00.000-07:00

This week we will finish up chapter 14 on overloading and templates and work on exercises 1 - 5 on pages 871 - 872 in the book.

I am hoping that the exercises should help to solidify some of the guidelines for overloading operators for member and non-member (friend) functions. (This will also be a help when we get to the exam!)

Next week we will look at exception handling and possibly begin to explore recursion.

Chapter 14: Overloading and Templates

2009-03-17T14:19:00.000-07:00

This week we will finish up our discussion on Pointers and begin talking about Overloading and Templates in Chapter 14. Specifically, we will begin to look at:

Overloading and restrictions on operator overloading
The pointer this
Friend functions and members and nonmembers of a class
How to overload various operators
How to construct function templates and class templates

There is no assignment for tonight, continue to work on your programs from Chapter 13 if you need to, or get outside and enjoy the beautiful weather!

I hope you're happy now Selia : )

2009-03-10T17:28:00.000-07:00

There, I changed the template of the blog again so it is not such an eye sore. I don't know why but Selia was not a big fan of the fushia template from last week. So to keep everyone happy, we now have this lovely new style.

Last week I said that I hated the template, this was just a guise to get you guys to check out my drupal site, which, of course, you are under no obligation to do.

However, if you want to, you can still visit Drupal on my KFC (kungfuchickenz) site and request an account if you feel like checking it out.

Comments welcomed!

Chapter 13: Pointers, Classes, Virtual Functions and Abstract Classes

2009-03-10T14:14:00.000-07:00

In chapter 13 we will learn about:

The pointer data type and pointer variables
The address of operator and the dereferencing operator
The new and delete operators
Pointer arithmetic and dynamic arrays
Shallow and deep copies of data
The peculiarities of classes with pointer member variables
Virtual functions

To get some experience with pointers I would like you to complete programming exercise 2 on page 793 which asks you to redo programming exercise number 6 from chapter 9 using dynamic arrays. This assignment is due in class two weeks from today, Tuesday, March 24, 2009.

Here is the data file for this assignment.

Inheritance and Composition: Disambiguation

2009-03-03T12:43:00.000-08:00

In chapter 12, we learned about Inheritance and Composition. To further clarify the differences between Inheritance and Composition, I would like you to read the following articles: Object Composition vs. Inheritance by Paul John Rajlich, Research Programmer at The National Center for Supercomputing Applications; Inheritance versus Composition by Eric Florenzano, and The Inheritance versus Composition Duel by Abhijit Nadgouda.

After reading the above articles, please research the following questions on Inheritance versus Composition in class today and submit your answers by Tuesday, March 10, 2009.

Next week we will move forward with two new programming assignments: One related to Inheritance and Composition, and one related to Pointers.

Chapter 12: Inheritance and Composition

2009-03-03T12:31:00.000-08:00

"Is - A" relationships and "Has - A" relationships... we all know relationships are complicated, so it should come as no surprise that Inheritance and Composition can seem a bit ambiguous at times.

Chapter 12 sheds some light on Inheritance and Composition, but quite frankly does a much better job at explaining Inheritance than it does Composition. This appears to be a common problem according to some further explanation by fellow programmers, Eric Florenzano, Abhijit Nadgouda, and Paul Rajlich.

This week we will explore the differences further by examining the above articles and completing a worksheet focusing on composition (See the Chapter 13 post for more information and a link to the worksheet).

Chapter 11: Classes and Data Abstraction

2009-01-27T12:44:00.000-08:00

Chapter eleven deals with creating and implementing classes. Today in class we will learn about private, protected, and public members of a class; explore how classes are implemented; examine constructors and destructors; and learn how classes are used to implement abstract data types and about information hiding.

In Programming Assignment number 2 you will design and implement a class that gives the day of the week. The program requirements are listed on page 655 and 656. Follow the instructions given in the book to create the dayType class described in the exercise. This assignment is due in class next Tuesday, February 3rd.

Chapter 10: Records (structs)

2009-01-20T16:33:00.000-08:00

In chapter 10 we examine structs, including performing operations on members of a struct, manipulating data using a struct, the relationship between a struct and functions, using arrays in a struct, and how to create an array of struct items.

Exercise 3 of chapter 10 reinforces our discussion and will give you an opportunity to use what we have just learned. I have modified the completed source code for Exercise 3 of Chapter 10 to allow you complete the assignment by completing the code snippet for the showMenu() function.

Open the modified source code for Exercise 3 (here's the data file, oops, sorry about that) and complete the showMenu() function as described in the comments within the showMenu() function. This is due in class next Tuesday, January 27.

Chapter 9 C-Strings and Two Dimensional Arrays

2009-01-20T13:52:00.000-08:00

As requested here are a couple of programs dealing with C-strings and Two Dimensional Arrays.

Exercise 6 and excercise 9 from chapter 9 are mostly complete. Your assignment is to complete each of the programs and understand how the c-string (in exercise 6) and the two dimensional array (in exercise 9) are accessed and processed in each of the programs.

Chapter 9 exercises 6 & 9 are due in class next Tuesday, January 27.

Chapter 9: Arrays and Strings

2009-01-13T14:15:00.000-08:00

Tonight we will be reviewing Chapter 9 which covers Arrays and Strings.

Your assignments include End of Chapter exercises 2, 4, 5 & 8 (pages 535 - 536), and Programming Exercise 4 (page 539).

Programming Exercise 4 asks you to write a program that reads a file consisting of students' test scores in the range 0 - 200. It should then determine the number of students having scores in each of the following ranges: 0-24, 25-49, 50-74, 75-99,100-124, 125-149,150-174, and 175-200.

Output the score ranges and the number of students. (Run your program with the following input data: 76 89 150 135 200 76 12 100 150 28 178 189 167 200 175 150 87 99 129 149 176 200 87 35 157 189)

For your convenience, here is a link to the input file for Programming Exercise 4.