CMPE223 Spring25 Syllabus-V1
CMPE223 Spring25 Syllabus-V1
¨ Observation
þ Test/Exam
¨ Self-evaluation
Assessment þ Quiz/Homework
¨ Peer Evaluation
Methods ¨ Oral Questioning
¨ Portfolio
(Formal & ¨ Performance Project
¨ Presentation (Oral, Poster)
Informal) ¨ Written
þ Other(s): ……...Programming
¨ Oral
Assignments ………
COURSE POLICIES
Attendance:
At least 70% of class attendance is mandatory. Course attendance will be recorded at each lecture.
Your attendance level will be assessed by the percentage of the attendance handouts that you have
signed.
Hands-On Activities
You will be assigned a hands-on activity each week. You are expected to submit your answers to
hands-on activities (you are expected to upload your answers to Moodle for online sessions, or submit
your work for face-to-face lectures). The hands-on activities are ungraded but they will be used to
assess your active participation in the lectures.
Class Readings
Class readings are necessary but not mandatory. The material covered in class by your instructors will
only provide a fundamental understanding of the general context. If you are willing to effectively learn
a topic, you must actively work on it yourself. Reading is one of the most successful ways of learning
about a topic.
Missed Work
Make ups for midterm and final exams will be provided if the student can provide a legal document
confirming a significant health issue at the time of the examination or with the approval of the
instructor.
Assignment Rules
All assignment works must be done individually, unless explicitly stated in the homework assignment.
A student can submit only one work. In case of multiple submissions, only the latest submission will
be considered. Students cannot submit work on other students’ behalf.
Assignments are expected to be completed by due date. For every day (24 hrs.) that the assignment
is late after due date, 20% of the maximum will be deducted from the assignment score. No
assignments will be accepted once they are four or more days late.
Extra Credits
Plagiarism
• changing words but copying the sentence structure of a source without giving credit
• copying so many words or ideas from a source that it makes up the majority of your work,
whether you give credit or not” (www.plagiarism.org)
Plagiarism is a very serious offense and will be penalized accordingly by the university disciplinary
committee. The best way to avoid accidentally plagiarizing is to work on your own before you ask for
the help of other resources.
Cheating
Cheating has a very broad description which can be summarized as “acting dishonestly”. Some of the
things that can be considered as cheating are the following:
• Plagiarizing
Zoom meetings will be held to provide detailed information about the project requirements.
Attendance to these online meetings is not mandatory, but valuable information will be provided
to help you in your assignments.
C. Final Exam [35%]
Closed book exam
Important Notes:
Note 1: A weighted midterm and final exam average of 30 points (out of 100) is required
to pass this course. Students, who cannot satisfy this condition, will get an automatic F
grade.
For example, a student who gets:
28 points (out of 100) from midterm 1;
32 points (out of 100) from midterm 2;
30 points (out of 100) from final exam
will satisfy this condition and will not get an automatic F : (28 x 20 + 32 x 25 + 30 x 35 )/(20 +
25 + 35) = 30,125 > 30. However, the student may still get an F grade depending on the overall
course performance.
Note 2: To pass the course, a minimum 40/100 weighted grade is required for
programming assignments. Students, who cannot satisfy this condition, will get an
automatic F grade.
The weighted average of programming assignments is calculated in a similar way to the exam
grades, as explained above.
TENTATIVE COURSE OUTLINE
Introduction
1 10.02 – 16.02 Chapter 1
Review of Basic Algorithms
Elementary Data Structures
2 17.02 - 23.02 Chapter 1
Linked Lists, Arrays
Programming
3 24.02 - 02.03 Stacks and Queues Chapter 1 Assignment 1 out
(Lists/Stacks/Queues)
Stacks and Queues
4 03.03 - 09.03 Chapter 1
Analysis of Algorithms
5 10.03 - 16.03 Analysis of Algorithms Chapter 1