COURSE SYLLABUS: MT36301 Introduction to Programming with C++

Spring Semester: January 15 – April 30, 2003

Lecturer: Christos (Chris) DabekisEmail: dabekis@bc.edu

Course Objective: Teach students how to program using the C++ Programming Language andprepare students with the necessary programming background to proceed with C++ object-orientedprogramming, Data Structures using C/C++, and Java programming courses.

This is a first course in computer programming using C++. It provides a solid, non-object orientedor procedural approach to C++ programming. Topics covered include algorithm development,data types, control structures, functions, arrays, strings, data structures, bits, pointers,dynamic memory allocation, library functions and the preprocessor. These C componentsof C++ are introduced using procedural programming and C++ input/output. Thefollowing C++ procedural programming enhancements to C are also covered: inlinefunctions, references, default arguments, function overloading and function templates.

Required Text:C++ HOW TO PROGRAM, Third Edition; Deitel & Deitel; Published by Prentice Hall

Attendance Policy:Attendance is required at all class meetings.

Grading:Hour Exams 20%Computer Projects 50%Final Exam 30%

“Hour” Exams will be given during meetings six and eleven on the material covered up to thosemeeting dates. These two exams will comprise 20% of the course grade.

Five computer projects will be assigned during the semester. For each assigned project, the studentwill be required to submit a compiled C++ program listing and execution report(s) for the test inputthat will be provided. Any computer that is available to the student (Boston College, home, work)with a C++ compiler may be used. A list of coding standards will be provided with the first projectassignment. These five projects will comprise 50% of the course grade.

In addition to the homework assignments identified in the syllabus, additional problems will beassigned and reviewed in class.

A Final Exam encompassing all of the material covered throughout the semester will be givenduring the last class meeting. This will be an open book/notes exam and will comprise 30% of thecourse grade.

MT36301: Introduction to Programming with C++Text: C++ HOW TO PROGRAM, Third Edition

by Deitel & Deitel; Published by Prentice HallMeeting # Date

TOPICS Homework

#1 1/15 Chapter 1 – Introduction to Computers and C++ Programming Introduction History of C and C++ Structured Programming Basics of a Typical C++ Environment Simple input and output statements (cin and cout) A Simple Program Variables and Data Types Arithmetic Expressions

Page 53:1.10 – 1.13

Page 54:1.19 – 1.22

Page 55:1.23, 1.24,1.27, 1.29

#2 1/22 Chapter 2 – Control Structures Algorithms and Pseudocode if and if/else Selection Structures The while Repetition Structure Assignment Operators Increment and Decrement Operators

Page 145:2.14 – 2.16

Page 147:2.18 – 2.20

#3 1/29 Chapter 2 – Control Structures (cont’d.) The for Repetition Structure Output formatting - Parameterized Stream Manipulators switch statement break and continue statements

Page 151:2.39 – 2.42

Page 153:2.49 – 2.50

#4 2/5 Chapter 2 – Control Structures (cont’d.) The do/while Repetition Structure Logical OperatorsChapter 3 – Functions Math Library Functions Function Definitions Function Prototypes

Page 229:3.11 – 3.13

#5 2/12 Chapter 3 – Functions (cont’d.) Header Files Introducing enum Storage Classes Scope Rules

Page 231:3.18, 3.21,3.27

#6 2/19 Chapter 3 – Functions (cont’d.) Functions with Empty Parameter Lists Inline FunctionsHour Exam – Material Covered in Meetings 1 – 5

Page 236:3.55

#7 2/26 Chapter 3 – Functions (cont’d.) Reference and Reference Parameters Default Arguments Unary Scope Resolution Operator Function Overloading Function Templates

Page 236:3.56, 3.59

3/5 Spring Break#8 3/12 Chapter 4 – Arrays

Declaring Arrays and Examples Using Arrays Passing Arrays to Functions Sorting Arrays Linear Search and Binary Search

Page 293:4.6 – 4.8

Page 294:4.10, 4.12

#9 3/19 Chapter 5 – Pointers and Strings String Processing Pointer Variable Declarations and Initialization Pointer Operators Calling Functions by Reference sizeof operator

Page 369:5.9 – 5.11

#10 3/26 Chapter 6 – Classes and Data Abstraction(only the section on structures) Introduction and Structure Definitions Accessing Members of Structures Passing Structures to FunctionsSupplementary Notes on Data Structures and Pointers Allocating Memory with new Freeing Memory with delete Using new to Create Dynamic Arrays Pointers, Arrays, and Pointer Arithmetic

To beassignedfrom“instructorhandout”

#11 4/2 Supplementary Notes on Pointers (cont’d.) and Ref. Chapters 15 & 16 Pointers – Introduction to Linked ListsHour Exam – Material Covered in Meetings 1 – 10

To beassigned.

#12 4/9 Supplementary Notes on Pointers (cont’d.) and Ref. Chapter 15 Linked Lists (cont’d.)Overview of Bitwise Operations, Chapter 16 (Pages 856-868) Bitwise Operators Bit FieldsChapter 17 - The Preprocessor #define Directive: Symbolic Constants and Macros Conditional Compilation

To beassigned.

4/16 Easter Break#13 4/23 Chapter 14 – File Processing

Creating a Sequential Access File Reading Data from a Sequential Access FileChapter 18 – C Legacy Code Topics

#14 4/30 FINAL EXAM – Material Covered in Meetings 1 - 13