CSCI 1301 – Computer Science I Fall 2013 (CRN 88818)

Instructor: Junfeng Qu, Ph.D.

Office: University Center #339 (UC 339)

Email: jqu[at]clayton[dot]edu | Phone: (678) 466-4406 Office Hours: Tue/Thu: 11:30AM - 2:00PM

AND by Appointments

Catalog description: The courses includes an overview of computers and programming: problem-solving and algorithm development; simple data types; arithmetic and logical operators; selection structures; repetition structures; text files; arrays (one-and two-dimensional); procedural abstraction and software design; modular programming (including subprograms or the equivalent). A high level programming language will be used. (3 lecture – 0 lab – 3 semester credit hours)

Meeting Date and Time: Tue/Thu 8:25PM - 9:40AM Location: UC425 Prerequisites MATH 1101 with a minimum grade of D OR MATH 115 with a minimum grade of D OR MATH 1111 with a minimum grade of D OR MATH 1113 with a minimum grade of D OR MATH 130 with a minimum grade of D OR MATH 1501 with a minimum grade of D OR MATH 151 with a minimum grade of D OR CPT - Elem Algebra with a minimum score of 095 AND CPT - College Level Math with a minimum score of 050

CS Program Outcomes: The CS curriculum is built on six core program outcomes. Successful completion of this course will contribute to the following subset of these nine outcomes. Graduates will demonstrate a Developing level of mastery for the following outcomes:

1) Solve complex and significant problems with professional skill by formulating efficient and effective algorithmic solutions (outcome #1).

2) Express algorithms clearly and correctly in a variety of programming languages (outcome #2). 3) Demonstrate sufficient foundational knowledge of computer science: Operating

Systems, Databases, Networking, Graphics, Software Engineering, Gaming and Web (outcome #3).

5) Demonstrate mastery of the theoretical underpinnings of computer science (outcome #5). Course Learning Objectives: Students are expected to obtain a developing level of mastery in computer science. Students will demonstrate an emerging level of knowledge of a broad range of fundamental computer science concepts and topics. Students should show potential to perform independently and should exhibit a high level of reasoning, critical thinking and problem solving skills. Course objectives are listed for each CS program outcome:

1) Solve complex and significant problems with professional skill by formulating efficient and effective algorithmic solutions

- convert real-world problems into computer programs - Work with current Integrated Development Environments - trace and implement recursive functions and iterative structures - understand how data abstraction (e.g. structures) and procedural abstraction

are used in developing solutions 2) Express algorithms clearly and correctly in a variety of programming languages.

- Work with the fundamentals of modern programming languages - Declare and use variables. - Work with conditionals to change program path execution. - Declare and implement arrays. - Develop and use functions. - Understand pointers and their use.

3) Demonstrate sufficient foundational knowledge of computer science: Operating Systems, Databases, Networking, Graphics, Software Engineering, Gaming and Web.

- Demonstrate understanding of software engineering principles. - Show knowledge of how information is encoded/digitized and stored in

a computing system. 5) Demonstrate mastery of the theoretical underpinnings of computer science.

- Understand the Fetch-Decode-Execute cycle. - Work with binary, signed and unsigned data, including addition. - Demonstrate high-level understanding of computer architecture, including

gates, circuits, and logic. Course Outline: CSCI 1301 consists primarily of topics from data, algorithms, with an introduction to programming. Tentatively, the topics to be included from the required textbook(s) are:

Introduction to Computers and Java (Chapter 1) Java Fundamentals (Chapters 2) Decision Structures (Chapter 3) Iterations and Loops (Chapter 4) Classes (Chapter 6, 8) Functions/Methods (Chapter 5)

Arrays (Chapter 7) Algorithms and GUI Applications (Chapters 12, 13, and 15)

Course Materials: The course syllabus, important information, and electronic files for download are available on the D2L. Students should refer to this course website frequently for information pertaining to this class. Students are expected to bring their computers and textbooks to each class meeting.

Textbook: Starting Out with Java: From Control Structures through Objects, 5th Edition, Tony Gaddis ISBN-13: 978-0-13-285583-9, ISBN-10: 0-13-285583-6

The textbook is available at the bookstore OR online at http://www.coursesmart.com

Software: • Eclipse Classic IDE (Free at http://www.eclipse.org/downloads/ ) or any

compatible, e.g. Netbean: https://netbeans.org/ IntelliJ: http://www.jetbrains.com/idea/download/

• Compiler Java JDK: http://www.oracle.com/technetwork/java/javase/downloads/index.html Useful Sources:

http://javaprogrammingforums.com/java-jdk-ide-tutorials/253-beginners-eclipse-tutorial-how-run-your-first-eclipse-java-application.html

http://www.vogella.com/articles/Eclipse/article.html http://docs.oracle.com/javase/7/docs/api/index.html?java/lang/ref/Reference.html

Important Date:

Aug. 7 Classes Begin Oct. 4 Last day to withdraw without academic accountability

Aug. 12-15 Drop/Add Oct. 14 -15 Fall Break – No classes Aug. 22 Last date for No Show

students Nov. 27 – 30 Thanksgiving (No Classes)

Aug. 31-Sept.2 Labor Day – No classes Dec. 3 -9 Final Exams Week

Assessment and Evaluation: You will have numerous opportunities to practice and demonstrate mastery of the materials covered in this course. It is up to you to keep current on all readings and assignments (including in-class announcements). Your instructor will provide you with the course assessment details.

Course Assessment

Component Portion of Grade 3 Tests 45% (15% each)

6-7 Labs/Assignments 30% 3 Quizzes

25% Grading will be based upon your assessment scores using the following scale (tests, quizzes, homework assignments):

Grade Range A >= 90% B 80% - 89% C 70% - 79% D 60% - 69% F < 60%

Tentative Schedule: The instructor reserves the right to change and update the schedule. It depends on our whole class to progress along with the schedule. Changes of schedule will be discussed in class and notified via email. Week Time Lecture/Tests Assignment Reading

1 13-Aug-

13 Computers and Java, IDE Ch. 01

15-Aug-

13 Class and Object Ch. 02

2 20-Aug-

13 Java Fundamentals

22-Aug-

13

3 27-Aug-

13 Quiz 1

29-Aug-

13 4 3-Sep-13 Decision Structures Ch. 03

5-Sep-13

5 10-Sep-

13

12-Sep-

13 Test1 Ch. 04

6 17-Sep-

13 Loops and Files

19-Sep-

13

7 24-Sep-

13

26-Sep-

13 Arrays and ArrayList Class Ch. 7 8 1-Oct-13 Quiz 2

3-Oct-13 9 8-Oct-13 Classes Ch. 06

10-Oct-

13

10 15-Oct-

13 Fall Break - No Class

17-Oct-

13 Ch. 08

11 22-Oct-

13 Test 2

24-Oct-

13

12 29-Oct-

13 Functions/Methods Ch. 05

31-Oct-

13

13 5-Nov-

13

7-Nov-

13

14 12-Nov-

13 Quiz 3

14-Nov-

13 Algorithms and GUI Applications) Ch. 12

15 19-Nov-

13

21-Nov-

13

16 26-Nov-

13

28-Nov-

13 Thanksgiving - NO CLASSES 17 3-Dec-13 Test 3 Week

Tests and Exams: No student will be excused from taking tests. Failure to take three tests will result in the

grade of “F” for the course. Because of the concentrated nature of the tests, and the logistical difficulties of make-up exams, students will NOT be allowed to make-up tests unless they have contacted the instructor PRIOR to the exam in question with a legitimate, verifiable reason. In such a case, the student will be allowed to make up the exam before the next meeting of the class after the test. The student is responsible for contacting the instructor to make arrangements for the make-up exam, and must bring documentation of the reason for the missed test. An unexcused absence will result in a zero for that test. Please note that it is in your best interest to take tests as they are scheduled, as students almost invariably score more poorly on make-up exams and the final if they have missed the prior unit tests. Homework and Assignments: There will be regular graded homework assignments administered electronically from your professor. Due dates for each of these assignments will be posted in assignment and on D2L. All homework is due on the assigned date. No late assignments can be accepted. Homework may always be turned in early. In order to succeed in this course, a student must do each homework assignment. On average, homework might require about three hours of work outside of class each week.

Collaboration: Collaboration is prohibited on assignments, exams, tests, and quizzes in this course, unless explicitly specified by the course instructor.

Makeup Policy: If you are forced to miss one of the quizzes, exams, or tests because of illness or other catastrophic incidents, you must notify the instructor in advance. Before a makeup is given, you must supply written evidence (e.g., a note from a physician or hospital) that you were unable to take the quiz/exam/test at the original time. Without such evidence, you may receive a score of zero for the quiz/exam/test. Seating charts may be used for the quizzes/exams/tests, and may change from one event to the next. No makeup is allowed for labs, assignments, projects, and bonuses. EXCUSED ABSCENCES: The student is responsible for providing satisfactory evidence to the instructor to substantiate the reason for absence. Among the reasons absences are considered excused by the university are the following:

• Participation in an activity appearing on the university authorized activity list. • Death or major illness in a student’s immediate family. Immediate family may

include: mother, father, sister, brother, grandparents, spouse, child, spouse’s child, spouse’s parents, spouse’s grandparents, stepmother, step- father, step-sister, step-brother, step-grandparents, grandchild, step-grandchild, legal guardian, and others as deemed appropriate by faculty member or student’s academic dean.

• Illness of a dependent family member. • Participation in legal proceedings or administrative procedures that require a

student’s presence. • Injury or Illness that is too severe or contagious for the student to attend class.

The student should obtain a medical confirmation note from his or her medical

provider. The medical confirmation note must contain the date and time of the illness and medical professional’s confirmation of needed absence. An absence for a non acute medical service does not constitute an excused absence. Required participation in military duties.

Attendance Policy Daily attendance is strongly encouraged. Any student missing a lesson is responsible for any material assigned or covered in class during his/her absence

Late Work Policy Each assignment/homework/project is due at the beginning of the class on the assigned date. Assignments turned in after the beginning of the class will be considered late. Late submission penalty is 20% and the assignment must be turned in by the start of the first class after the due date. No assignments will be accepted after that class. It takes about 7-10 days before your work is returned. If more time is needed, you will be notified.

Classroom Etiquette: Cellular phones must be turned off during class. Please do not arrive late, leave early, or go in and out of class, since this behavior is very distracting

Words of Wisdom (TAKE THIS PART SEROUSLY):

• You should bring your computer and your textbooks to each class meeting. • If a class is to be canceled or delayed, you will be notified either by e-mail, posted

message on the class web-site, or in-class announcement, as soon as possible. Any missed class topics will be covered during the following class.

• Start assignments early. This way, you can ask questions and clarify things that are confusing. Be sure to take a look at the homework when you receive it and not an hour before it is to be turned in!

• Your grade in this course is determined completely on performance, not on effort. If you cannot keep up with the pace of this class, please talk with your professor as soon as possible.

Academic Misconduct Students are expected to uphold the school's standard of conduct relating to academic honesty. Students assume full responsibility for the content and integrity of the academic work they submit. The guiding principle of academic integrity shall be that a student's submitted homework, examinations, reports, and projects must be that of the student's own work. Students shall be guilty of violating the honor code if they:

1. Represent the work of others as his/her own. 2. Use or obtain unauthorized assistance in any academic work. 3. Give unauthorized assistance to other students. 4. Modify, without instructor approval, an examination, paper, record, or report

for the purpose of obtaining additional credit. 5. Misrepresent the content of submitted work.

Suggestions to avoid Plagiarism

• You are responsible for all your work, including group assignments if you put your name on an assignment, or team project.

• Give yourself enough time to complete an assignment or team project, start as

early as possible and do not wait until the last minute • Don’t be afraid to ask your instructor when you don’t understand clearly about the

assignment or project. • See your instructor if you have any specific questions

If a student is found plagiarism in this course on any work (tests, quiz, exam, homework, etc.), he/she will receive an F in the course. The offense will go on permanent record with the university. If this is not the student’s first academic misconduct offense at CSU, he will be recommended for expulsion from the university. This is in full accord with CSU’s policy, and we encourage you to read and review the university’s policy in your student handbook (can be accessed via http://www.clayton.edu/Portals/47/docs/student-code-of-conduct.pdf ) Operation Study: At Clayton State University, we expect and support high motivation and academic achievement. Look for Operation Study activities and programs this semester that are designed to enhance your academic success such as study sessions, study breaks, workshops, and opportunities to earn Study Bucks (for use in the Loch Shop) and other items.

ITP Choice Information Beginning Fall Semester 2001, all students at CSU are required to state that they have on demand access to a notebook computer that meets the recommended hardware/software specifications that have been established by Clayton State faculty. Academic penalties may be incurred for not meeting this requirement. See http://itpchoice.clayton.edu for more information.

Disability Services Students with disabilities who require reasonable accommodations need to register with Disability Services (DS) in order to obtain their accommodations. You can contact them at 678- 466-5445 or E-mail at disabilityservices@clayton.edu . If you are already registered with DS and are seeking accommodations for this course, please make an appointment with me to discuss your specific accommodation needs for this course and give me your accommodations letter.

Available Resources:

1. Most of your technology and software issues/concerns can be resolved by the HUB, http://thehub.clayton.edu

2. Your instructor holds regular office hours and is willing to assist you with any questions you may have during the semester.

3. The Center for Academic Success (CAS) is located on the lower level of the Library. Go to http://adminservices.clayton.edu/cas/ for information on tutoring programs and other assistance.