Five C++ Programming University Courses
Here are five C++ Programming University Courses
that offer their lecture, lab, and other course content on the web. This C++ learning material will help you get up to speed with coding C++, or you can use these to learn more effective ways to program using C++.
CS3101
- Programming Languages: C++ at Columbia Univeristy
This course is an introduction
to the C++ programming language. Students should leave this class with
knowledge of fundamental C++ programming constructs and the tools
necessary to quickly master more advanced techniques. Moreover,
students will be expected to demonstrate ability to program effectively
in C++ - producing code that (1) compiles, (2) produces correct output,
(3) utilizes proper C++ constructs, (4) is coherent and clearly
commented.
| TOPICS | LECTURE | READINGS & HANDOUTS | CODE | HOMEWORK |
|
Administrative Details CUNIX Commandline Environment Jumping Into C++ | lecture1 | emacs reference card | session1 | |
|
Variables Datatypes Operators Containers Control Flow Random Numbers | lecture2 | C++ Reference sample .emacs sample .profile |
session2 | hw1 |
|
Functions Error Handling OOP: structs & classes | lecture3 | template
metaprogramming |
session3 | hw2 |
|
Template Functions and Classes Separate Compilation & the make utiltiy Debugging: (preprocessor & GDB) | lecture4 | makefiles
templates macros assert |
session4 |
hw3 |
|
Inheritance Pointers & Arrays C-strings & File I/O Arguments to main Memory Allocation | lecture5 | pointers
lists maps |
session5 | hw4 |
| Final |
hw5 |
CSCI 123 Introduction to Programming Concepts in C++ at Fullerton College
This course is an introduction to the basic principles of programming using a structured programming language, C/C++. Students will design algorithms, write external documentation, design and write source code in C/C++, and write internal documentation for programming problems.
Lectures:
- Introduction to the Course; Hardware & Software
- Basic Control Structures
- Basic Types and Structures
- Lecture 4 Notes
- Top Down Design, Black Box Analogy, Function Stack, Overloading
- Pass By Reference, Testing
- File Streams, Inheritance
- Arrays
- cStrings, Strings, and Vectors
- Structures and Classes
- Operator Overloading, and Friends
- Pointers and Dynamic Arrays
- Destructors and Constructors
- Linked Lists, Stacks, and Queues
- Recursion
- Inheritance & Polymorphism
CSE 459.22: Programming in C++ at Ohio State University
Lecture Slides:
- Lecture
1 [ppt]
[pdf]
– A Tour of C++
- Lecture
2 [ppt]
[pdf]
– Pointers and References
- Lecture
3 [ppt]
[pdf]
– Classes
- Lecture
4 [ppt]
[pdf]
– Object Initialization
- Lecture
5 [ppt]
[pdf]
– Inheritance
- Lecture
6 [ppt]
[pdf]
– Operator Overloading
- Lecture
7 [ppt]
[pdf]
– Polymorphism
- Lecture
8 [ppt]
[pdf]
– Templates and Standard Template Library
- Lecture 9 [ppt] [pdf] – Exception Handling
CS117: Introduction to Programming Languages C++ at the Univeristy of Chicago
This course covers definition, use, algorithm design and algorithm analysis of the fundamental abstract data types, including linked lists, stacks, queues, trees and graphs. Also, analysis of each algorithm is done.
Lectures:
- March 26 (Problem Solving)
- March 28 (Introduction to Abstract Data Types)
- March 30 (Recursive Solutions) example1 example2
- April 02 & 04 (Lists - 1)
- April 06 (Lists - 2)
- April 09 & 11 (Stacks)
- April 13 (Queues)
- April 16 (Introduction to Sorting)
- April 18 (Sorting: Insert Sort. Shell Sort) Shell Sort Example
- April 20 (Sorting: Quick Sort, merge Sort) Sorting Algorithms Comparison
- April 23: Review, Others
- April 25: Midterm, Pb7 Solutions
- April 27 (Next HW explanation, Exceptions)
- April 30 (Exceptions, Introduction to Trees)
- May 02 (Trees) Examples- Expression Trees
- May 02- tutorial
- May 04 (Binary Search Trees) Binary Search Trees
- May 07 (AVL Trees, Splay Trees)
- May 09 (2-3,2-3-4 Trees, B-Trees)
- May 11 (Tables, Priority Queues) Examples
- May 14 (Hashing) Hash Example
- May 16 (Disjoint Set)
- May 18 (Introduction to Graphs. DFS) Graph Implementation using Binary Search Trees
- May 21 (DFS, BFS, Topological Sorting)
- May 23 (Minimal Spanning Tree, Shortest Path)
- May 25 (External Methods)
- May 30 (Exam Review, Optional reading)
CpE 391D - Fundamentals Of Object Oriented Programming In C++ at West Virginia University
This is a 3-credit hour project-based laboratory-oriented course aimed at learning the fundamentals of object-oriented design and implementation in C++. The objectives of the course are to have students identify and practice the object-oriented programming concepts and techniques, practice the use of C++ classes and class libraries, modify existing C++ classes, develop C++ classes for simple applications, and practice the concepts of Object-Oriented Analysis and Design (OOA/OOD) and design patterns and frameworks by developing a C++ based project.
Course Topics - Slides:
- Introduction to the Object-Oriented Programming Concepts
- C++ Program structure
- C++ Data Types
- Functions, Scope and the Free Store
- The C++ Class
- Static
Class members and the this pointer
- Operator Overloading
- Class Derivation and Inheritance
- Virtual Functions and Polymorphism
- Templates
- Object-Oriented
Analysis and Design (OOAD)
Lab
Assignments:
- Introduction to OOP, and The C++ Program Structure.
- Data Types I, Pointers, references, and arrays (2 weeks)
- Data Types II, Structs and Classes.
- The C++ class, Sparse Matrix Application.
- Nested Classes, and discrete event simulation of a client server model (2 weeks).
- The this pointer, Static data members, and operator overloading.
- Class derivation, and inheritance.
- Multiple inheritance, and Polymorphism.
- Project: Object-Oriented Analysis and Design (2 weeks)
- Project: Implementation and testing (2 weeks)
