Loyola College in Maryland

CS 630 - Computing Fundementals I
Spring 2005


Loyola College > Department of Computer Science > CS 630
News


Homework Assignments | Programming Projects | Examples | Lectures

Instructor: Dr. Dawn Lawrie
Office: Donnelly Science Center 125b
Work Phone: (410)617-2140
Office Hours: M 2-4, W 12-2, before and after class at the graduate campus as needed, or by appointment
e-mail: lawrie<at>cs<dot>loyola<dot>edu

Course Home Page: http://www.cs.loyola.edu/~lawrie/CS630/S05/index.html

Class Meeting: Lecture W 5:00-7:10PM

Prerequisite: none

Required Text: C++ How to Program (4th ed.) by Deitel and Deitel

Course Description:
An introduction to the basic concepts of computer organization and programming. Algorithms are defined and used. Numberic character manipulation is carried out. File handling, recursive functions, and elementary data structures are studied. Computer use is required.

Specific Educational Objectives of the Course:

Conduct of the Course:
Lectures will be used to introduce, explain, and practice using new features of C++. Reading from the textbook will enhance your understanding of those lectures. Weekly homework assignments (not necessarily done at a computer) will reinforce the concepts discussed in lecture. The computer portions of the assignment will be submitted to me via email and used to provide feedback on programming technique and style. Homework assignments, programming projects, and exams will be used to assertain your performance in the course. Unless prior arrangements are made, the homeworks and the programming projects must be submitted by their announced due-dates, or be subject to a grading penalty. All programming will be submitted using email. Two exams and a final exam will also be used to evaluate students' progress.

Academic Integrity:
Loyola College Honor Code Statement:

"The Honor Code states that all students of the Loyola Community have been equally entrusted by their peers to conduct themselves honestly on all academic assignments.

The students of this College understand that having collective and individual responsibility for the ethical welfare of their peers exemplifies a commitment to the community. Students who submit materials that are the products of their own minds demonstrate respect for themselves and the community in which they study.

All outside resources or information should be clearly acknowledged. If there is any doubt or question regarding the use and documentation of outside sources for academic assignments, your instructor should be consulted. Any violations of the Honor Code will be handled by the [Graduate Program Director]."

The Honor Code as is pertains to this class:
In general, any copying of an assignment, whether electronically or by hand is considered plagiarism. Students submitting non-trivial projects with identical structure will be considered to have acted dishonestly. Such students may be reported to the Graduate Program Director. At the very least, two or more students presenting assignments identical in all important aspects will share the points from a single grade.

Grading:

Final Grade Distribution:
Final letter grades will be no worse that those in the following table.

A

A-

B+

B

B-

C+

C

90%

87%

83%

80%

77%

73%

70%

Course Outline of Class Lectures:

Week Number
Date
Topics Text Reference Material Due
1 1/19 Introduction Chap 1
2 1/26 Programming Lanuages
Structure of a C++ Program
Microsoft C++ demo
Chap 1
3 2/2 Control Structures
  • if, if/else
Structured Programming Summary
Chap2 Hwk 1
4 2/9 Control Structures
  • while, for, switch, do/while
  • break, continue
Structured Programming Summary
Chap2 Hwk 2
5 2/16 Functions
  • definition/prototype
  • math library functions
  • header files
  • random number generation
Chap 3 Hwk 3
6 2/23 Functions
  • storage classes & scope rules
  • recursion
Chap 3 Hwk 4
7 3/2 Arrays
  • declaration and use
  • array parameters
  • sorting
  • searching
  • multiple-dimension arrays
Chap 4 Exam 1
8 3/16 Arrays
  • declaration and use
  • array parameters
  • sorting
  • searching
  • multiple-dimension arrays
Chap 4 Hwk 5
9 3/23 Classes and Data Abstraction
  • structures
  • accessing members of structures
  • user-defined types
  • abstract data types and classes
  • class scope and member access
  • interface vs. implementation
  • constructors
  • deconstructors
  • class object assignments, using =
Chap 6 Hwk 6
10 3/30 Classes and Data Abstraction
  • structures
  • accessing members of structures
  • user-defined types
  • abstract data types and classes
  • class scope and member access
  • interface vs. implementation
  • constructors
  • deconstructors
  • class object assignments, using =

Chap 6
Hwk 7
11 4/6 Pointers
  • variable declaration
  • operators
  • pointer expressions & arithmetic
  • pointers and arrays
  • arrays of pointers
  • characters and string processing
Chap 5 Exam 2
12 4/13 Pointers and Allocating Memory
  • variable declaration
  • operators
  • pointer expressions & arithmetic
  • pointers and arrays
  • arrays of pointers
  • characters and string processing
Chap5 Hwk 8
13 4/20 File Processing
  • sequential & random access of files
Chap 14
14 4/27 Functions
  • unary scope resolution operator
  • function overloading
  • function templates
Review
Chap 3 Project
15 5/4 Final Exam Final