Jan 5, 2014 ... CS150.001. CS150.001 – Introduction to Computing II – Spring 14 .... 3/11 Spring
Break. 10 3/18 c19, c21 hw6. 11. 3/25 c21, c22 hw7. 12. 4/1.
CS150.001 – Introduction to Computing II – Summer 17 ▟ MWF :: 8:00 – 9:25a :: EB 1160 ▙ | Socratis Tornaritis | EB 3040 | 1:00-2:00 MW | 650.2396 |
[email protected] | www.cs.siue.edu/~stornar | Objective: Algorithmic problem solving with a modern programming language. Language syntax; basic design methods; algorithms; abstraction. Prerequisite: CS140 - Introduction to Computing I Textbook: "Introduction to Java Programming, 10/e" by Y. Daniel Liang Course website: The course website is the instructor's web site at www.cs.siue.edu/~stornar. The site contains pertinent course information, including syllabus, notes, code, schedule and assigned TAs. Moodle: The course management site, used for this course, accessed at classes.cs.siue.edu. IDE: BlueJ is our choice of development environment, and a free copy of the IDE and JDK bundle can be downloaded from www.bluej.org/. Topics covered: The following topics will be covered. [o] OO: c10-Objects, c11-Inheritance, c12-Exceptions, c13-Abstract classes [g] GUI: c14-JavaFX, c15-Events [s] Sorting: c17-Binary IO, c19-Generics, c23-Sorting [j] JCF: c20-Lists, Stacks, Queues, c21-Sets, Maps, c24-Implementing ADTs Assessment: The following assessment measures will be used.
Home: Program [p]: Class: Final exam [f]:
400 pts [0-100] pts
Class: Coding exam [e]: Class: Quiz: [q]:
400 pts 200 pts
p - Individual coding efforts that demonstrate understanding of material and skills. Each program will be posted/submitted using Moodle. The programs are due on assigned Fridays by 5 pm. No late assignments will be accepted. Assignments submitted by Wed. 5 pm will be weighted at 105%. q - In class quizzes over reading/lectured material. e: Coding exams. These are computer-based coding exams. Use of compiler and online help allowed. Note: If you fail to submit your work for any reason during the exam, you will not be allowed to resubmit, thus you will not receive credit for your work. f: The optional final exam. This is a paper-based concepts exam. It may be taken if you have 0 absences. It averages with the lowest coding exam. A straight scale will be used for final grade: A [>= 900], B [>= 800], C [>= 700], D [>=600], F [< 600]. Note: You must pass (>= C) both the Home and Class portions in order to pass the course. The final course grade is determined as follows: If both portions are passed or failed, the course grade is their sum, else the course grade is the failing portion's grade. Grade disputes must be handled within a week after an assessment has been returned to students. No grade change will be made after a week.
Submission policy: Please note that no program will be accepted late, for any reason. It is the student's responsibility to deliver the entire program to the TA or instructor no later than the penalized date, by any means possible. Be aware of Network and/or Moodle issues especially close to due dates. Double check each submitted program, since wrong or incomplete submissions will be penalized and/or receive no credit. Make-up policy: In order to be considered for a make-up, a student must be proactive and not reactive. Students should inform the instructor of any scheduled absence or difficulty in meeting the deadline, in advance (proactive) not after the fact (reactive). On special unforeseen occasions such as a medical emergency, family hardship, natural disaster or anything that is out of a student's control, the instructor should be notified as soon as possible and proper documentation should substantiate the absence. The instructor will have the final say in all such decisions regarding make-ups and assessed penalties if applicable.
June 25, 2017 at 5:52 AM
1/2
Support services: If you are a student with a disability that requires curricular or co-curricular accommodations, please go to Disability Support Services for coordination of these accommodations. All accommodations are individualized and require documentation of the functional impacts of the disability and severity. DSS is located in the Student Success Center, Room 1270; you may contact them to make an appointment by calling (618) 650-3726 or sending an email to
[email protected]. Please visit the DSS website located online at www.siue.edu/dss for more information. Student attendance: Student attendance is expected and students should come to class prepared by reading all assigned chapters/notes. In case of an absence, students are responsible for all material covered and/or all announcements made during their absence. An attendance sheet will be passed around each time, to be used by the instructor for administrative purposes. Class decorum: Class time is valuable and as such each student must behave appropriately with out causing a distraction to their peers or the instructor. Students should honor this rule, else they may be asked to leave and waive all rights to any assessment make-ups. Academic misconduct: Academic honesty is a serious issue at SIUE, in the School of Engineering, in the Department of Computer Science, and with this instructor. Penalties for dishonest behavior will be severe. Even a single occurrence of plagiarism of English text, or program code, within a graded activity (e.g., homework, project, or exam) is grounds for academic discipline and a possible letter grade of 'F' in the course. Expectations: Learning is an active process not a passive one, so as an Instructor I expect students to come to class prepared, having read all relevant material (book, notes, code) before as well as after class meetings. Don't be afraid to ask questions or seek answers. Have an open mind and a willingness to learn and adopt alternative methodologies and practices. It takes two parties to transfer knowledge, the instructor and the learner. If one is absent the other suffers.
Wk
Starts
Weekly Concepts
1
5/29
OO
2
6/5
OO
q2
p1
3
6/12
OO
q3
p2
4
6/19
GUI
5
6/26
GUI
6
7/3
Sorting
7
7/10
Sorting
8
7/17
JCF
9
7/24
JCF
10
7/31
JCF
June 25, 2017 at 5:52 AM
M
W
F
mdh
ce1.o
q1
q4 q5
ce2.g
p3
q6 q7
ce3.s
ce4.j
p4
q8 q9
p5
q10
[f]
2/2