`                                                                COURSE OUTLINE

 

CS 234-01       Algorithms and Problem Solving – Fall 2018                       Paul L.  Schumacher

TR 8:00am - 9:50 am                                                                                                   103 G Watkiins

105 Watkins                                                                                                        Ext 5656

 

pschumacher@winona.edu                          Website   http://cs.winona.edu/schumacher/

 

Lab is usually onThursday.  All labs are required to pass the course.

 

Text: Java, Java, Java: Object-Oriented Problem Solving, 3/E, Ralph Morelli, Ralph Walde,

The book is currently distributed through the Open Textbook Library ,

https://open.umn.edu/opentextbooks/BookDetail.aspx?bookId=218.

 

Prerequisite: Math 120 or 150, or qualifying score on math placement test.

 

You will need a university approved laptop and internet access on campus

 

 Course Objectives and Expectations:

 

Upon entering CS 234, students should have

knowledge of mathematics (ready to take Calculus)

basic skills in time management, and good study habits.

curiosity and desire to meet challenges and solve problems

 

Upon completing CS 234, student should accomplish the following learning outcomes.

knowledge of control structures (if-then, switch), iteration (while, for), objects,

       object-oriented design and arrays;

knowledge of objects, methods, and object-oriented design;

basic skills in the design and implementation of computer programs using an

      object-oriented language, packages, and modules;

be able to verify and test a java program.

 

Topics we will attempt to cover include, but are not limited to, the following:

 

I.                         Introduction to computers and Programming Languages

II.                     Object-Oriented Design and Program Development

III.                   Programming Basics, Program Components, Edit-Compile-Run cycle.

IV.                   Variables, Arithmetic Expressions, Constants.

V.                     Classes, Constructors, Parameters, Visibility Modifiers

VI.                   Input Processing

VII.                  Selection Control: if Statements, Boolean expressions and

                       Variables, swith statements

VIII.                 Repetition Control: while, do-while, and for statements.  Nested for statements. 

IX.                   Handling characters and strings

X.                     Arrays

 

 


                          COURSE OUTLINE

 

CS 234-01       Algorithms and Problem Solving – Fall 2018               Paul L.  Schumacher

TR 8:00am - 9:50 am                                                                                         103 G Watkiins

105 Watkins                                                                                                                Ext 5656

 

Lab is usually onThursday.  All labs are required to pass the course

 

 CLASS POLICIES

 

1.      Attendance ‑‑ Attendance is not used for grading purposes, however it is to your best interest

         to attend and actively participate in each session.  The more actively you become involved in

        the course, the more benefit you will gain from the course, because you learn most by doing,

        experimenting, and trying things in computer science.

 

2.      Grading ‑‑ Grading is rather simple.  Calculate your percentage of the possible points by dividing

        points earned by total points possible and  multiplying by 100.  The assignments are 34 percent

        of the grade.  However, you must earn at least 65% of the points possible for the assignments to

        pass the course.  Test scores make up the other 66% of your grade.  There will be two major 

        tests and a final exam.  Pop quizes are possible at any time and will be counted.  Grades are

       curved over the class. Tests may not be made up, except by prior arrangement.  If you do not

       meet the prerequisite for the course, you will not pass.

 

Lab is usually on Thursday.  All labs are required to be completed sucessfully to pass the

course.

                                                                                                       

3.      Assignments ‑  These will consist of homework exercises and programming problems. 

        They are due at the beginning of the class period on the due date.  Late assignments are

        not accepted, except in very unusual circumstances, and then with prior approval only.

 

4.      Plagiarism & Cheating‑‑ Passing off as your own, work done by someone else, or using

         notes etc during a test.  Cheating eliminates you from taking the practicum.

 

 

cheating results in failing the course and other possible severe penalties. 

 

In this course, I encourage you to help each other ‑‑ BUT IN NO CIRCUMSTANCES

SHOULD YOU DO THE EXERCISES TOGETHER.  WRITE YOUR OWN ANSWERS FOR

THE EXERCISE ‑‑ IT  WILL BE UNIQUELY YOURS.  LIKEWISE FOR PROGRAMMING

PROJECTS ‑‑ WRITE YOUR OWN PROGRAM BY YOURSELF. The first instance of

 plagerism results in failure for the course.

 

Recently there have been several cases of plagerism.  Warning, this will be enforced carefully.

 

See Department policies.  The policy which is stricter is enforced.

 

      This statement is important, observe this policy carefully, as it is a basic academic rule. 

 

       Failure to so so will be very detrimental to your academic career.

 

 

 


COURSE OUTLINE

 

CS 234-01       Algorithms and Problem Solving – Fall 2018                       Paul L.  Schumacher

TR 8:00am - 9:50 am                                                                                                   103 G Watkiins

105 Watkins                                                                                                                        Ext 5656

 

 

Lab is usually onThursday.  All labs are required to pass the course.

 

                    

DATE   TOPIC                                         READING       ASSIGNMENT                            TEST

 

8-28      Intro to the Course                  Chap 0

8-30     Computers, Objects,JAVA                                                                                                     

 

9-4         Program Design and    Chap1                   HW0               

9-6             development                       

 

9-11                                                                                       HW1                                       

9-13        Object, Defining,                    Chap 2

 

9-18          Creating, Using                                     HW2                                       

9-20        Methods, Communicating     Chap 3

 

9-25          with Objects                                                       HW3                                                             

9-27           Exam on Topics up till now ..................................................                            Test 1 

                                                                                                          

10-2           Input and                              Chap 4           

10-4            Output                                                              HW4

                                  

10-11         Java Data and                      Chap 5

                        Operators

10-16                 

10-18         Control Structues           Chap 6              

                                                         

10-23         If and Switch                                            HW5

10-25      Repetition                                                   

 

10-30         while,

11-1     do while,     for                                                     HW6

 

11-6        Exam on Topics since T1        ..................................................                   Test 2            

11-8       Stings and                              Chap 7                HW7               

 

11-13        String Processing                                                                                                                                     

11-15      Inheritance                             Chap 8

11-20    Arrays                                 Chap 9                      HW8

 

11-27           One Dimensional

11-18                                    

 

12-4              Arrays                                                         HW9   

12-6           Two Dimensional                                               

 

12-12    3:30 – 5:30 pm     Final Exam  on all topics covered ........................          Final Exam