CS 1302 A: Principles of Programming II

Course Objective:

Students will be introduced to the principles of software development, 
most notably the concepts of encapsulation and information hiding. The 
course includes an introduction to running time analysis, recursion, 
basic sorting algorithms, and elementary data structures.

Course Description:

A continuation of CS 1301 with emphasis on advanced programming structures 
and techniques. Theory and applications of stacks, queues, and lists; 
recursion; file processing; introduction to binary trees. This course 
involves extensive programming activities. 


Prerequisite: CS 1301. A grade of C or better in CS 1301 is required 
		to enroll in this course. 

Topical Outline:

OOP, Primitive types, Operators, Control structures, methods		Chapter 1
Objects and references, Strings, Arrays, Input/Output, and Exceptions	Chapter 2
Objects & classes, basic methods, and packages				Chapter 3
Inheritance, subclasses, Polymorphism, abstract members, interfaces	Chapter 4
Algorithm analysis and Big-O notation					Chapter 5
Intro. to Data Abstraction, Stacks, Queues, Lists, and Trees		Chapter 6
Recursions								Chapter 7
Sorting Algorithms							Chapter 8
Stacks, Postfix, Infix, and implementation				Chapter 9
Stacks and Queues implementation					Chapter 16
Linked Lists								Chapter 17
Trees									Chapter 18
Introduction to Binary Search Trees					Chapter 19 

Software and Tools Used to Support Class:

         JDK
	 PC -Grasp
         E-mail
         Netscape and/or Microsoft Explorer
         Word Processor

Required Materials:

         
 Text:	Data Structures & Problem Solving Using JAVA, by Mark Allen Weiss.
         Addison -Wesley Publishing 
         
 3 to 5 3.5" disks

            

Grading Policy:

             The grade for the course will be assigned based on the following 
             percentages:
 
 2 - 3  Tests:      60 - 70%
	If you miss a test, the score you make on the final will be assigned
	for that test.
        
 4 - 8 Assignments:                  20 - 30%
	Assignments are expected at the beginning of the class of the day they are
        due. Assignment that is not turned on time, could be turned on the due
        date of the following assignment with a note describing the reason 
        for not turning it on time, and it will be graded with a penalty of
        50%. Assignments that are not turned in with the following 
        assignments will have a penalty of 75%. All late assignments will be 
        graded at the end of the term.
        
        
Attendance, class participation, and Quizzes:	10%
        
        
To pass the course with a "C" grade students should 
        have at least an overall overage of 70% AND 60% average on 
        assignments.
        
        
Grading Scale
        90 - 100		A
        80 - 89			B
        70 - 79			C
        60 - 69			D
         0 - 59			F	
 

Instructor:

             Said C. Fares
             Office:                         2132  Nevins Hall 
             Traditional Office Hours:       10:00 AM - 11:00 AM MTWR
 					     or by appointment
             Electronic Office Hours:        Any day, any time
             E-mail:                         sfares@valdosta.edu
             Phone:                          (912) 333-5780

Semester Calendar:

	     June        6:	First Class Day
	     June       28:	Mid-Term
	     July       25:	Last Class Day
	     July       29:	Final (Monday, 8:00 am - 10:00 am)

Last update June 5, 2002.