Comp Sci 2S03, Term 1 2016/17
Monday, Wednesday, 11:30-12:20, Friday 13:30-14:20, T13/125/
Tutorials will start the week of Monday, September 12th.
Dr. J. Carette, ITB-168 , ext 26869, email: carette at mcmaster dot ca.
Office hours: 14:30-16:20 Fridays.
Steven Palmer (palmes4), Mikhail Andrenkov (andrem5), Mustafa Haddara (haddarma).
The calendar description says: Fundamental concepts of imperative programming (procedures, statements, control structures, iteration, recursion, exceptions); basic data structures (references, records, arrays, dynamic structures); basic concepts of operating systems.
The course provides a comprehensive coverage of the fundamental imperative programming concepts. It provides students with a foundation that can be used to learn many other languages (imperative and object-oriented alike). By the end of this course students will be able to understand:
The latest version of this outline, some of the hands out, and details of the assignments can be found on the course web page http://www.cas.mcmaster.ca/~cs2s03 (Or go to my home page and then to the course page).
Announcements, assignment drop-boxes, discussion forums and other items will all be posted on Avenue to learn. It is your responsibility to check Avenue frequently for course-related information.
Now and then, there will be in-class exercises. These will be worth 5% of the final grade.
There will be five assignments. The assignments will be worth 40% of the final grade.
Assignments are due at 8:30 of the morning of the weekday following the due date (so an assignment due on Friday will be picked up by the TAs at 8:30 Monday morning). You may consult outside sources, such as textbooks, web sites, as well as discussions with other students for general aspects your assignment, however all such sources must be documented. Failure to do so will result in academic dishonesty charges. The details of your assignment must be done individually.
Late assignments will be marked with a late penalty of 20% of the full grade per day (unless you provide the instructor with a Course of Action for Missed Work form delivered by the Associate Dean Office). Graded assignments and tests will be returned during tutorial sessions.
The assignments will be marked partly automatically, partly by the TAs. Any request for remarking must be first directed to the TA that has marked your assignment. After you have talked to your TA and still believe that you deserve a higher mark, then you can contact the instructor. When the instructor remarks an assignment or an exam, all the assignment/exam questions will be remarked.
If you find bugs in the automated marker (i.e. something which is marked incorrect but the prof agrees should be marked correct), you will get bonus marks.
Most assignments will contain bonus material, which you are not required to do, but can be worth significant bonus marks.
Furthermore, the total marks available on the assignments will be somewhat more than 45.
The midterm will be held during regular class time (i.e. 1:30pm) on Friday October 21. It will be in T13/105, 107 and 125. More specifically,
practice questions are available, as are (short) answers.
The final examination will be scheduled by the Registrar's office in the usual way. It will be a three hours in duration and will cover the material of the lectures, tutorials, assignments, and of the required textbook. It consists of a multiple-choice part and a written part. The final exam counts for 40% of your final grade.
You are expected to exhibit honesty and use ethical behaviour in all aspects of the learning process. Academic credentials you earn are rooted in principles of honesty and academic integrity.
Academic dishonesty is to knowingly act or fail to act in a way that results or could result in unearned academic credit or advantage. This behaviour can result in serious consequences, e.g. the grade of zero on an assignment, loss of credit with a notation on the transcript (notation reads: Grade of F assigned for academic dishonesty), and/or suspension or expulsion from the university.
It is your responsibility to understand what constitutes academic dishonesty. For information on the various types of academic dishonesty please refer to the Academic Integrity Policy [http://www.mcmaster.ca/academicintegrity].
The following illustrates only three forms of academic dishonesty:
Individual assignments have to be solved by one person only, any outside source, this includes asking other people, or using any books or information found on the web has to be documented. In complience with the senate regulations on academic integrity I remind you that: People who let other people copy are as guilty as the ones who copy. You are allowed to consult outside sources, meaning textbooks or the web, but any use of an outside source must be documented. Similarly, group assignments must be solved by members of that group only, and the above policies apply as well.
In the case the instructor or a TA has the impression that an assignment is copied, the instructor can ask the corresponding students to explain exactly how the assignment was prepared and take appropriate actions.
In this course we will be using some online components. Students should be aware that, when they access the electronic components of this course, private information such as first and last names, user names for McMaster e-mail accounts, and program affiliation may become apparent to all other students in the same course. The available information is dependent on the technology used. Continuation in this course will be deemed consent to this disclosure. If you have any questions or concerns about such disclosure please discuss this with the course instructor.
The instructor wants to continuously improve this course. Please provide feedback (via email, via the discussion forum, the TAs, etc) at any time.
Furthermore, the feedback received from the course evaluation is very valuable to the me, and so I am providing a course evaluation bonus to each student based on the level of class participation in the course evaluation according to the following table: