Principles Of Algorithm Design II
CSCI 1321 -  Spring 2006 - Tentative Schedule
 

 Class 

Topic's)

 Reading Assignments 
& Handouts

 Homework & Laboratory 
Assignments 

1/12

[R] - 1

  Introduction To Class
 Discuss Course Outline

Intro To Eclipse
Intro To Java Classes & Programming		  
 Course Outline

From C To Java

Read Chapter 1  &
Part Of Chapter 2

Read E-Mail From Me!

JOptionPane1.pdf
 JOptionPane2.pdf
 JOptionPane3.pdf
 JOptionPan4.pdf
 JOptionPane5.pdf
 JOptionPane6.pdf
 JOptionPane7.pdf
 JOptionPane8.pdf
 
Questionnaire Lab

Install Eclipse
 

1/17

[T] - 2

 Software Engineering
Goals of Software Engineering Software Engineering Life Cycle Software Correctness
Software Reliability
Software Usability
Software Maintainability
Software Reusability
Software Portability
Software Efficiency
Waterfall Model
Spiral Model
UML
UML Class Diagram
OOP Is An Acronym For
What Is OOP
What Is An Object
What Is Abstraction
How Do You Create A String Object
API Is An Acronym For
What Is An API/Class Library
What Is A Package
Give An Example Of An Import Declaration

Intro To Java Classes

Student Class
Student() Constructor
Student(newName, newId, newMajor)
Set(newName, newId, newMajor)
Display()
Display message)

 Lecture-2

Finish Reading Chapter 2

Read Pages 1-14 of
From C To Java

 Try to do an Employee Class
First, Last, SSN, Age


 

1/19

[R] - 3

 How Do You Create A String Object
API Is An Acronym For
What Is An API/Class Library
What Is A Package
Give An Example Of An Import Declaration

Array Programming
 

 logfile.txt
 Scanner2.java
 ScannerTest.java		 Athlete Lab

Work on Stack Lab

1/24

[T] - 4

 Quiz 1

More On Classes
Constructor, Destructor
Polymorphism
Inheritance

Function Overloading
Multiple Constructors
Display() vs Display message)

Stack Class
Push
Pop
Empty
Full

    

1/26

[R] - 5

 Stack Class
Push
Pop
Empty
Full

Java Passing By Reference vs Passing By Value		   Stack Lab

Work On Grid Lab

1/31

[T] - 6

 Quiz 2 

Memory Management
Stack Resize(changeAmount)

 		 Read Before Class
Hiding The Implementation		 Stack2 Lab

2/2

[R] - 7

 Work On IntArray1 lab   IntArray1 Lab

2/7

[T] - 8

 Queues
Insert-Enqueue
Remove-DeQueue
Empty
First		    

2/9

[R] - 9

 Order N
Order N*N
Order N Log N
Sorting Algorithms		    

2/14

[T] - 10

 String Processing   String Processing.Lab

2/16

[R] - 11

 DLNode
Generics

Double Linked List
Dynamic Memory Management

   DLList-BigNos1 Lab
Due 3/21

2/21

[T] - 12

 Design Considerations/Options

Push, Pop, Empty
Display
Using List As A Stack

   Code & Test Constructor
Add Display
Code & Test Push
Code & Test Pop
Code & Test Empty

2/23

[R] - 13

 Insert, Remove, Empty
Display
Using List As A Queue
Enqueue/DeQueue

InsertAfter
Inplace		   Code & Test Insert
Code & Test Remove
Code & Test InsertAfter

2/28

[T] - 14

 Review For Exam
Order N
Order N Log N
Order N2
Order 1

 Structure = Un-ordered List
Order For Search - Avr - Worst
Order For Insert To  - Avr - Worst
Order For Delete From  - Avr - Worst
Calculate Reads/Writes For Files

 Structure = Ordered List
Order For Search - Avr - Worst
Order For Insert InTo  - Avr - Worst
Order For Delete From  - Avr - Worst
Calculate Reads/Writes For Files

 Structure = Linked List
Order For Search - Avr - Worst
Order For Insert To  - Avr - Worst
Order For Delete From  - Avr - Worst
Calculate Reads/Writes For Files
 		  
Start Working On Big Nos

3/2

[R] - 15

 Exam I   Continue Working On Big Nos

3/7

[T] - 16

 Go Over Exam

Review Dynamic Memory
Verification - Trap

Review InsertAfter
Review Inplace On Generic Lists

   Continue Working On Big Nos
3/9

[R] -17

 Work On Graphical Displays   Finish  Big Nos For Next Time

3/14

[T] -

Spring    
3/16

[R] -

 Break    

3/21

[T] -18

 Introduction To Trees
Skew, Balanced, Complete
Search Efficiency
Balance of Random Trees
Inplace		   Athlete2-Swing Lab
Due 3/23

3/23

[R] -19

 Introduction To Trees
SetLeft,
SetRight,
Complete Insplace
InorderTraversal		   BinTree 1 Lab
Due 3/28

3/28

[T] - 20

 Recursion In-Depth
Factorial
Fibonacci
Memory & Compiler
Recursive Processing		   BinTree-AvrSearch Lab
Due 4/11

3/30

[R] - 21

 Structure = Un-ordered List
Order For Search - Avr - Worst
Order For Insert To  - Avr - Worst
Order For Delete From  - Avr - Worst
Calculate Reads/Writes For Files

 Structure = Ordered List
Order For Search - Avr - Worst
Order For Insert InTo  - Avr - Worst
Order For Delete From  - Avr - Worst
Calculate Reads/Writes For Files

 Structure = Linked List
Order For Search - Avr - Worst
Order For Insert To  - Avr - Worst
Order For Delete From  - Avr - Worst
Calculate Reads/Writes For Files

 Structure = Binary Tree
Order For Search - Avr - Worst
Order For Insert To  - Avr - Worst
Order For Delete From  - Avr - Worst
Calculate Reads/Writes For Files

Compare Efficiency of Linked List,
Ordered List, Unordered List,
& Binary Trees

    

4/4

[T] - 22

 What Is Cryptography
Cryptography Components
Encryption and Decryption
Symmetric-Key Cryptography
Traditional Ciphers
Substitution Ciphers
Monoalphabetic - Caesar
Polyalphabetic - Vigenere
Transposition		 Cryptography Cryptography-HW

4/6

[R] - 23

 No Class

Work On Advanced
Binary Tree Lab

   DCN-29-Cryptography-HW.pdf
Work On Homework  - Quiz

4/11

[T] - 24

 Quiz - Cryptography
Quiz - Questions From 3/30 Lecture		    

4/13

[R] - 25

 Cryptography    

4/18

[T] - 26

 Cryptography    

4/20

[R] - 27

 Review For Exam Optional Help Session
Mon 7:30-11:30
3rd Floor Majors Lab		  

4/25

[T] - 28

 Exam II    

4/27

[R] -29

 Java Threads    

5/1- [M]

 Reading Day    

5/2- [T]

 Reading Day    

All Labs & Homework Due Next Class Period Unless Specified Otherwise!
No assignments will not be accepted after 5/1/2006 Noon