Scribd
Upload
982 views

COURSE SYLLABUS Introduction To C++ Programming

MT36301: Introduction to Programming with C++ is a 14-week course that teaches students how to program using the C++ programming language. The course provides a procedural approach to C++ programming by covering topics like algorithms, data types, control structures, functions, arrays, strings, pointers, and files. Students learn C++ enhancements like inline functions, references, and function overloading. The course uses the textbook C++ HOW TO PROGRAM by Deitel & Deitel. Students complete computer projects, take two midterm exams, and a final exam that encompasses all material covered in the course.

Uploaded by

Percival A Fernandez
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
982 views

COURSE SYLLABUS Introduction To C++ Programming

MT36301: Introduction to Programming with C++ is a 14-week course that teaches students how to program using the C++ programming language. The course provides a procedural approach to C++ programming by covering topics like algorithms, data types, control structures, functions, arrays, strings, pointers, and files. Students learn C++ enhancements like inline functions, references, and function overloading. The course uses the textbook C++ HOW TO PROGRAM by Deitel & Deitel. Students complete computer projects, take two midterm exams, and a final exam that encompasses all material covered in the course.

Uploaded by

Percival A Fernandez
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

COURSE SYLLABUS: MT36301 Introduction to Programming with C++

Spring Semester: January 15 April 30, 2003 Lecturer: Christos (Chris) Dabekis Email: [email protected] Course Objective: Teach students how to program using the C++ Programming Language and prepare students with the necessary programming background to proceed with C++ object-oriented programming, 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 oriented or 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 components of C++ are introduced using procedural programming and C++ input/output. The following C++ procedural programming enhancements to C are also covered: inline functions, 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 Computer Projects Final Exam

20% 50% 30%

Hour Exams will be given during meetings six and eleven on the material covered up to those meeting 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 student will be required to submit a compiled C++ program listing and execution report(s) for the test input that 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 project assignment. These five projects will comprise 50% of the course grade. In addition to the homework assignments identified in the syllabus, additional problems will be assigned and reviewed in class. A Final Exam encompassing all of the material covered throughout the semester will be given during the last class meeting. This will be an open book/notes exam and will comprise 30% of the course grade.

MT36301: Introduction to Programming with C++


Meeting # Date #1 1/15 Text: C++ HOW TO PROGRAM, Third Edition by Deitel & Deitel; Published by Prentice Hall TOPICS 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 Chapter 2 Control Structures Algorithms and Pseudocode if and if/else Selection Structures The while Repetition Structure Assignment Operators Increment and Decrement Operators Chapter 2 Control Structures (contd.) The for Repetition Structure Output formatting - Parameterized Stream Manipulators switch statement break and continue statements Chapter 2 Control Structures (contd.) The do/while Repetition Structure Logical Operators Chapter 3 Functions Math Library Functions Function Definitions Function Prototypes Chapter 3 Functions (contd.) Header Files Introducing enum Storage Classes Scope Rules Chapter 3 Functions (contd.) Functions with Empty Parameter Lists Inline Functions Hour Exam Material Covered in Meetings 1 5 Chapter 3 Functions (contd.) Reference and Reference Parameters Default Arguments Unary Scope Resolution Operator Function Overloading Function Templates Spring Break Chapter 4 Arrays Declaring Arrays and Examples Using Arrays Passing Arrays to Functions Sorting Arrays Linear Search and Binary Search Homework Page 53: 1.10 1.13 Page 54: 1.19 1.22 Page 55: 1.23, 1.24, 1.27, 1.29 Page 145: 2.14 2.16 Page 147: 2.18 2.20 Page 151: 2.39 2.42 Page 153: 2.49 2.50 Page 229: 3.11 3.13

#2

1/22

#3

1/29

#4

2/5

#5

2/12

Page 231: 3.18, 3.21, 3.27

#6

2/19

Page 236: 3.55

#7

2/26

Page 236: 3.56, 3.59

#8

3/5 3/12

Page 293: 4.6 4.8 Page 294: 4.10, 4.12

#9

3/19

#10

3/26

#11

4/2

#12

4/9

#13

4/16 4/23

#14

4/30

Chapter 5 Pointers and Strings String Processing Pointer Variable Declarations and Initialization Pointer Operators Calling Functions by Reference sizeof operator Chapter 6 Classes and Data Abstraction(only the section on structures) Introduction and Structure Definitions Accessing Members of Structures Passing Structures to Functions Supplementary 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 Supplementary Notes on Pointers (contd.) and Ref. Chapters 15 & 16 Pointers Introduction to Linked Lists Hour Exam Material Covered in Meetings 1 10 Supplementary Notes on Pointers (contd.) and Ref. Chapter 15 Linked Lists (contd.) Overview of Bitwise Operations, Chapter 16 (Pages 856-868) Bitwise Operators Bit Fields Chapter 17 - The Preprocessor #define Directive: Symbolic Constants and Macros Conditional Compilation Easter Break Chapter 14 File Processing Creating a Sequential Access File Reading Data from a Sequential Access File Chapter 18 C Legacy Code Topics FINAL EXAM Material Covered in Meetings 1 - 13

Page 369: 5.9 5.11

To be assigned from instructor handout

To be assigned. To be assigned.

You might also like