| Class | Topic(s) |
Reading Assignments
& Handouts |
Laboratory
Assignments |
| 1/15 |
Introduction To Class
Distribute Course Outline
ClassRoom System Log Out Of UNIX - To Win 2000 Create UNIX Accounts Check E-Mail & Record Password Log Out of Win 2000 - To UNIX Log Into UNIX With UserName & Password Log Out UNIX All But One User Restart Win 2000 Add Printer For HAS-LabPrinterA
Instruct To Print A Copy
Hardware Power Supply
Input Device
Floppy Drive
|
Read
Course Outline
Fill Out Questionnaire (Lab I-5 points)
Print - Introduction To
UNIX -
Print - Introduction To VI
-
Read Chapter 1 Of Text
Note For Those Missing Class Telnet Requires That You Set Up A UNIX Account [This New Account Will Have The Same UserName, but a Different Password!] This New UNIX Account Must Be
Created From A University Lab On Upper Campus!
Start Internet Explorer &
Check Your Mail
Have One of the CS Majors Help
If Needed
Telnet From Off Campus is Disabled! |
Complete
-
Questionnaire 5 Pts Will Turn In Questionnaire At Beginning Of Lecture. Do Not Put Questionnaire In Wire-Band Binder! |
| 1/17 |
CPU Binary Numeration System Machine Language Assembly Language High Level Language Compiler Interpreter Source Code Binary Code Object Code System Software Operating System
Abstraction
Bit ls, ls -l, ls -a,
ls -al
|
Hardware
Tutorial
|
Hardware
Lab
Work On UNIX Lab |
|
1/22 |
Binary Count To 8
ls -l d rwx rwx rwx First Program Compile Program Execute Program mkdir 1320 Review UNIX ls, ls -l, ls -a,
ls -al
|
UNIX Lab | |
|
1/24 |
Putty Install &
Configuration
Information Representation
Numerical Information Representation
|
Read pp 49-60
|
Numeration
Systems Lab
|
| 1/29 |
Putty Install &
Configuration
Information Representation
Numerical Information Representation
|
||
| 1/31 |
Comments //
/*.. */
Minimal Range
unsigned int x [0 <==> 65,535]
char (1 Byte)
float x [7 digits accuracy]
Statements End ;
Identifiers = Variable Names
Constants
Output <iostream.h>
Input <iostream.h>
int Division
Modulus %
x++ => x + 1
char Option = 'N'; Save A File To IBM Floppy
Decisions
Order Of Operations
# include <math.h>
Floating Point Nos
real division vs integer division
cout << int(3.3)
Clear Console Screen
|
Read pp 61 - 82
Read pp 103-120 Read pp 164-171 |
Payroll #0 Lab |
| 2/5 |
Display Stream Decimals
Format Text
Syntax Errors
Decisions
if ( condition)
if ( condition)
if ( condition)
if ( condition)
|
Decision Lab | |
| 2/7 | User Defined Functions UCase Diagram AreaTriangle Calculation System void ClearScreen (void); void Commercial (void); void GetInfo (int & Height, int & Width, int & TriangleNo); Scope of Variables Reference Variables |
Read Chapter 6 | PayRoll
2 Lab Due 2/19/02 Study For Exam |
| 2/12 |
void Calculate (int Height, int Width, float & Area); void Display (int Height, int Width, int TriangleNo float Area); Phase In Modules While Loop Flowchart Logic Review For Exam |
Study For Exam | Study For Exam |
| 2/14 | Exam I | ||
| 2/19 |
Fixed Repetition Loop
for (init; condition; Process At End) {......}; Review PostTest Loop
Pretest Loop
When To Use What Loops |
San Chapter 4 | Loop Practice Lab |
| 2/21 |
User Defined Explicit Functions |
Read Chapter 4 Carefully | |
| 2/26 |
Nassi-Schneiderman Flowcharts
Program Design Review Explicit Functions |
Explicit Function Lab | |
| 2/28 |
Array Functions
Passing Arguments To Arrays Define & Fill |
Static Array Lab | |
| 3/5 | Explicit Function
SumIntArray Review Arrays Introduction To Classes private:
Constructor |
||
| 3/7 |
char Name[25];
string.h strlen(String) strcpy(OriginalString, NewString) strcmp(OriginalString, NewString) strcmp(FirstString, SecondString) Introduction To Classes
public:
Function Overloading
|
Book Class Lab | |
| 3/12 | Spring Break | ||
| 3/14 | Spring Break | ||
| 3/19 |
Classes Continued
Constructor |
Computer Class Lab | |
| 3/21 |
Dynamic Memory new delete long int * Nos; Dynamic Class |
Put Together class IntArray with Constructor and Destructor. Print & Bring To Lecture! Study For Exam |
|
| 3/26 | Dynamic vs Static Arrays | Study For Exam | |
| 3/28 | Exam II | ||
| 4/2 |
Review Exam Dynamic Memory |
Dynamic Array I Lab | |
| 4/4 | Introduction To Sequential Files | ||
| 4/9 | Reading & Writing Files | ||
| 4/11 |
Binary Search Sequential Search |
Dynamic Array II Lab
Due By Thursday 4:00 Noon 4/18 |
|
| 4/16 |
Introduction To Recursion 1 - Call Itself 2- General Case That Can Be Expressed In Terms Of A Simpler Case 3 - Trivial Case (Kick Out) Stack - LIFO Array Using Stack To Explain Recursion |
||
| 4/18 |
Recursion Continued
Fibonacci |
Recursive Strings Lab | |
| 4/23 |
Break Program Into
.hpp and .cpp files Makefile make |
Dell Makefile Lab |
|
| 4/25 | |||
| 4/30 | |||
| 5/1 & 5/2 | Reading Days | ||
| 5/6 | 8:30 Exam III | ||
| There Will Be A Final Project! There Will Not Be A Comprehensive Final Exam During Exam Week! | |||