Syllabus Entrance
Printer Friendly
Email Syllabus
Education Major Version

CS 151 Introduction to Programming
Stokely, Scott W.


Mission Statement: Park University provides access to a quality higher education experience that prepares a diverse community of learners to think critically, communicate effectively, demonstrate a global perspective and engage in lifelong learning and service to others.

Vision Statement: Park University, a pioneering institution of higher learning since 1875, will provide leadership in quality, innovative education for a diversity of learners who will excel in their professional and personal service to the global community.

Course

CS 151 Introduction to Programming

Semester

F2W 2012 TI

Faculty

Stokely, Scott W.

Title

Adjunct Instructor

Degrees/Certificates

Masters in Management
Bachelors in Network Engineering

Office Location

United States

Daytime Phone

4057781568

Other Phone

4057781568

E-Mail

scott.stokely@park.edu

swstokely@cox.net

swstokely@cox.net

Class Days

----R--

Class Time

4:30 - 9:20 PM

Credit Hours

3


Textbook:
Introduction to Programming with JAVA - A Problem Solving Approach by John & Raymond Dean - 1st Edition - McGraw Hill Higher Education ISBN: 978-0-07-304702-7

Textbooks can be purchased through the MBS bookstore

Textbooks can be purchased through the Parkville Bookstore

Additional Resources:

McAfee Memorial Library - Online information, links, electronic databases and the Online catalog. Contact the library for further assistance via email or at 800-270-4347.
Career Counseling - The Career Development Center (CDC) provides services for all stages of career development.  The mission of the CDC is to provide the career planning tools to ensure a lifetime of career success.
Park Helpdesk - If you have forgotten your OPEN ID or Password, or need assistance with your PirateMail account, please email helpdesk@park.edu or call 800-927-3024
Resources for Current Students - A great place to look for all kinds of information http://www.park.edu/Current/.


Course Description:
CS151 Introduction to Programming: This course introduces students to algorithmic design and structured/modular programming. Programming concepts will be put into practice by using Java for programming projects. These basic programming concepts and constructs will be covered: variables, data types, strings, arithmetic and logical operators, branching statements, loops, and debugging. Additionally, these object-oriented concepts will be covered: classes, instance variables, methods and constructors. Prerequisite: A grade of C or better in any math course >= MA125, or a grade of C or better in CS144, or an ACT math score >= 23, or an SAT math score >= 510, or a COMPASS score >= 66 in the Algebra placement domain, or a COMPASS score 0-45 in the College Algebra placement domain. 3:0:3 @

Educational Philosophy:

Learning Outcomes:
  Core Learning Outcomes

  1. Explain basic programming concepts – program compilation, program execution, history of Java.
  2. Demonstrate creativity and problem-solving skills.
  3. Use the TextPad integrated development environment to enter, run, and debug Java programs.
  4. Analyze Java programs in order to test, debug, and improve them.
  5. Appraise Java programs to ensure that they use proper coding conventions and documentation.
  6. Demonstrate proper use of the object-oriented principle of encapsulation. *Given a problem description, the student should be able to decide on appropriate classes, private instance variables, public instance methods.
  7. Demonstrate proper use of top-down design. *Given a description for a non-trivial method, the student should be able to implement it by deciding on appropriate helper methods and parameter passing.
  8. Formulate Java programs that use: *primitive types and expressions – int, double, char (including escape characters), operator precedence, etc. *strings – concatenation, equals, length, charAt *Boolean variables and boolean expressions *control structures – if, switch, while, do, for, nested loops, conditional operator *Math class *wrapper classes *object-oriented programming concepts – classes, instance variables, instance methods, constructors


Core Assessment:

All Park University courses must include a core assessment tool that measures the degree to which students learn the course's learning outcomes. School policy dictates that a student's performance on the core assessment tool must count for at least 20% of the student's total course grade. School policy also dictates that the core assessment tool must cover at least 75% of a course's learning outcomes.

For this course, the core assessment tool is a final exam. Teachers must create their own final exam and pattern it after the CS151 example exam found in the password-protected my.park faculty area,  https://my.park.edu/ICS/Offices/Information_and_Computer_Science/ To avoid collaboration between students in different sections, teachers should not use the example exam's questions verbatim. But teachers are required to cover its same content, and they are strongly encouraged to follow its format closely.

In the final exam, there are two broad categories of questions that we evaluate separately – concepts and problem solving:

Concepts (terminology and concepts that should be memorized): relevant learning outcomes – 1, 6

Multiple-choice and true/false questions that ask the student about CS 151 concepts.

Short answer questions that ask the student to explain various concepts and trace and debug code fragments and/or programs.
 
For example questions, teachers should refer to the CS151 example exam, questions 1-20.

Problem solving (technical skills, critical thinking, and communication):

relevant learning outcomes – 2, 4, 5, 7, 8

Given a problem description, produce a solution in the form of a short program or a method(s).
 
For example questions, teachers should refer to the CS151 example exam, questions 21-22.

Recommended guideline for evaluating the core assessment final exam:

Exceeds expectations

Meets expectations

Does not meet expectations

No evidence

Concepts

≥ 85%

65% to 84%

< 65%

no exam graded

Problem solving

≥ 75%

50% to 74%

< 50%

no exam graded

Class Assessment:

Item Each Total
Chapter Lab Assignments 8 @ 25 pts 200
Chapter Tests 3 @ 50 pts 150
MidTerm Exam 1 @ 200 pts 200
Portfolio 1 @ 150 pts 150
Final Exam 1 @ 300 pts 300
Total Points 1000

Grading:

Late Submission of Course Materials:
No late work will be accepted.

Classroom Rules of Conduct:

Course Topic/Dates/Assignments:

Week Date Activities Assignments
1 10/18/2012 Introduction, Chapter 1 and 2 Lecture Chapter 1 and 2 Labs
2 10/25/2012 Chapter 3 Lecture Chapter 3 Labs, Chapter 1-3 Test
3 11/1/2012 Chapter 4 Lecture Chapter 4 Labs
4 11/8/2012 Chapter 5 Lecture Chapter 5 Labs
5 11/15/2012 MIDTERM EXAM Finish up Chapter 1-5 Labs, Chapter 4 and 5 Test
6 11/22/2012 THANKSGIVING NO CLASS
7 11/29/2012 Chapter 6 and 7 Lecture Chapter 6 and 7 Labs
8 12/6/2012 Chapter 8 Lecture Chapter 8 Labs, Finish Chapter 6 and 7 Labs, Ch. 6/7/8 Test
9 12/13/2012 FINAL EXAM Portfolio Due

Academic Honesty:
Academic integrity is the foundation of the academic community. Because each student has the primary responsibility for being academically honest, students are advised to read and understand all sections of this policy relating to standards of conduct and academic life. Park University students and faculty members are encouraged to take advantage of the University resources available for learning about academic honesty (www.park.edu/current or http://www.park.edu/faculty/).from Park University 2011-2012 Undergraduate Catalog Page 95-96

Plagiarism:
Plagiarism involves the use of quotations without quotation marks, the use of quotations without indication of the source, the use of another's idea without acknowledging the source, the submission of a paper, laboratory report, project, or class assignment (any portion of such) prepared by another person, or incorrect paraphrasing. from Park University 2011-2012 Undergraduate Catalog Page 95

Attendance Policy:
Instructors are required to maintain attendance records and to report absences via the online attendance reporting system.

  1. The instructor may excuse absences for valid reasons, but missed work must be made up within the semester/term of enrollment.
  2. Work missed through unexcused absences must also be made up within the semester/term of enrollment, but unexcused absences may carry further penalties.
  3. In the event of two consecutive weeks of unexcused absences in a semester/term of enrollment, the student will be administratively withdrawn, resulting in a grade of "F".
  4. A "Contract for Incomplete" will not be issued to a student who has unexcused or excessive absences recorded for a course.
  5. Students receiving Military Tuition Assistance or Veterans Administration educational benefits must not exceed three unexcused absences in the semester/term of enrollment. Excessive absences will be reported to the appropriate agency and may result in a monetary penalty to the student.
  6. Report of a "F" grade (attendance or academic) resulting from excessive absence for those students who are receiving financial assistance from agencies not mentioned in item 5 above will be reported to the appropriate agency.

Park University 2011-2012 Undergraduate Catalog Page 98

Disability Guidelines:
Park University is committed to meeting the needs of all students that meet the criteria for special assistance. These guidelines are designed to supply directions to students concerning the information necessary to accomplish this goal. It is Park University's policy to comply fully with federal and state law, including Section 504 of the Rehabilitation Act of 1973 and the Americans with Disabilities Act of 1990, regarding students with disabilities. In the case of any inconsistency between these guidelines and federal and/or state law, the provisions of the law will apply. Additional information concerning Park University's policies and procedures related to disability can be found on the Park University web page: http://www.park.edu/disability .

Additional Information:



Bibliography:

Copyright:

This material is protected by copyright
                               and can not be reused without author permission.

Last Updated:9/23/2012 7:20:13 PM