Table of contents
TABLE OF CONTENTS
Unique number: 2672
Course number: Engineering 102
Description: 0-2-2. Functional characteristics of calculators
and computers; overview of programming languages and systems; C++; analysis
and solution of engineering problems.
Prerequisite: Eligible for registration in Mathematics 230.
Special Note: Students enrolled in Engineering 102 will attend
the same classes and submit the same assignments as those enrolled in CS
120, but will not be required to attend class nor submit any assignments
after October 22 (the quiz given at the beginning of the class on October
24 is optional for Engineering 102 students).
Table of contents
Table of contents
Table of contents
|
|
|
|
|
| F 09/05 | Introduction, course policies, coding standards, number systems, computer operations, data objects, identifiers, expressions, & statements. | pp. 1-60 | NONE |
| M 09/08 | C++ streams, programming style, debugging | pp. 60-85 | Homework: Exercises 1 & 4 on p. 28
|
| W 09/10 | Functions, scopes & lifetimes | pp. 87-120 | Homework: Exercises 9, 10, & 11 on p. 79 |
| F 09/12 | Refining object-oriented designs, class libraries | pp. 120-158 | Computer Problem 1: Enter and run the program shown on pp. 21-23 [Posted on 09/05/97] |
| M 09/15 | Decision behavior, Boolean expressions, typedefs, switch statements | pp. 159-180 | |
| W 09/17 | Conditional operator, recursion | pp. 180-209 | Homework: Exercises 3 & 7 on pp. 146-148 |
| F 09/19 | Iteration behavior: loops | pp. 211-268 | Computer Problem 2: Work Programming Project 30 on page 85. Use the following customer prices as sample test data: 896.42, 73.15, 2354.87 [Posted on 09/12/97] |
| M 09/22 | List objects, arrays | pp. 269-306 | |
| W 09/24 | Sorting and searching | ||
| F 09/26 | Strings, multidimensional arrays | pp. 307-340 | Computer Problem 3: Write a program that implements function changeId as described in Exercise 15 on page 207. Use the following personal identification numbers as sample data: 3459, 3458, 3453, 86430, 86431, 86432, 86433, 86434, 86435, 86436, 86437, 86438, 86439. Your program should be constructed so as to continue reading data and performing the necessary calculations. Upon reaching the end of the data, your program should terminate gracefully. [Posted on 09/19/97] |
M 09/29 |
Structs, classes | pp. 341-379 | |
| W 10/01 | Constructors and destructors. Here is the program we did in class. | ||
| F 10/03 | Classes with class type member data | pp. 379-428 | Computer Problem 4: Refer to Exercise 23 on page 338. Write a program that implements the selection sort algorithm as a procedure. Your driver program should read in a list of integers (100 maximum elements), print out the original list, call the selection sort procedure, and print out the sorted list. Use the following sample data for your list items: 3, 5, 1, 32, 56, 14, 31. BONUS: Pass an extra bool argument to the procedure to indicate whether the list is to be sorted in ascending or descending order. [Posted on 09/26/97] |
| M 10/06 | Composition. Here is the clock class example problem we did in class. | ||
| W 10/08 | First class objects | pp. 429-470 | |
| F 10/10 | Inlining | ||
| M 10/13 | Storage management for objects, references | pp. 471-498 | Computer Problem 5: Refer to Exercise 12a on page 419. Implement the dice class as specified in the exercise. Include a default constructor and three public member functions--roll, getDie1 and getDie2. Store the current dice values in two private integers. Write a main driver program that instantiates a pair of dice and then "rolls" them 1,000 times, keeping a count of the number of times each of the possible values appears. In your report be sure to analyze these results to determine if your dice are "fair." [Posted on 10/05/97] |
| W 10/15 | Dynamic array creation | ||
| F 10/17 | First class strings | pp. 499-542 | |
| M 10/20 | Classes with pointer data | ||
| W 10/22 | Inheritance and reuse (LAST CLASS DAY FOR ENGR 102) | pp. 543-576 | Computer Problem 6: Click here to see the description of this problem assignment. [Posted on 10/13/97, ] |
| F 10/24 | Single & multiple inheritance | ||
| M 10/27 | Applications of class hierarchies | pp. 577-614 | |
| W 10/29 | Composition vs. Inheritance | ||
| F 10/31 | Polymorphism through inheritance | pp. 615-647 | |
| M 11/03 | Virtual functions | Computer Problem 7: Work Programming Project 20 on page 690. Note that the reference to exercise 10 should be to exercise 11. Your main program should be interactive, i.e., it should create accounts in response to user input from a menu of account types. Once all accounts are created and stored in a container, apply a common set of transactions to all acounts similar to what you did in Computer Problem 6. [Posted on 10/23/97] | |
| W 11/05 | Abstract base classes | pp. 648-690 | |
| F 11/07 | Principles of class design | ||
| M 11/10 | Container classes & linked lists | pp. 691-782 | Handouts for Machine Simulation in-class problem: repair.h - the header file containing all class declarations. active.cpp - an abstract base class. geometrc.cpp - a random number class. manager.cpp - the service manager class. schedule.cpp - the scheduler class. simulate.cpp - the main program. |
| W 11/12 | Case study: Machine simulation | ||
| F 11/14 | Case study: Typesetter class | pp. 783-823 | Computer Problem 8: Click here to see the description of this problem assignment. [Posted on 11/03/97] |
Table of contents
Final exam: NONE
Table of contents
Academic MisconductThe academic misconduct policy for COMP SCI 120/ENGR 102 can be found in the course policies.
Academic misconduct at the University is determined by the faculty member under whom such misconduct occurs. The penalty for cheating and other forms of misconduct is also determined by the faculty member. This penalty may be an "F" in the course, but lesser penalties may be given at the discretion of the faculty member. The student has the right to appeal the charge of academic misconduct in accordance with the Final Grade and Appeals Procedure.
Each programming assignment for Computer Science 120/Engineering 102 should be treated as a laboratory report. The following items should be turned in for each assignment:
Table of contents