0% found this document useful (0 votes)
23 views7 pages

CMPE223 Spring25 Syllabus-V1

The document is a course syllabus for CMPE 223 (Data Structures and Algorithms I) at TED University, detailing course objectives, content, assessment methods, and policies for the 2024-2025 academic year. It covers fundamental data structures, algorithm analysis, and includes programming assignments and exams as assessment methods. Attendance, academic integrity, and late submission policies are also outlined.

Uploaded by

alicabbar9870
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
23 views7 pages

CMPE223 Spring25 Syllabus-V1

The document is a course syllabus for CMPE 223 (Data Structures and Algorithms I) at TED University, detailing course objectives, content, assessment methods, and policies for the 2024-2025 academic year. It covers fundamental data structures, algorithm analysis, and includes programming assignments and exams as assessment methods. Attendance, academic integrity, and late submission policies are also outlined.

Uploaded by

alicabbar9870
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

TED UNIVERSITY, COURSE SYLLABUS

Faculty Engineering Department CMPE

Course Data Structures and


CMPE 223 (242) Course Title
Code & Number Algorithms I
þ Compulsory 2024-2025
Type of Course Semester
¨ Elective ¨Fall þSpring ¨Summer
Course Credit Number of
(3+0+0) 3 6
Hours ECTS Credits

Pre-requisite N/A Co-requisite N/A

Mode of ¨Face-to-face Language of þ English


Delivery þDistance learning Instruction ¨ Turkish
Course Course Asst. Prof. Venera Adanova
Prof. Tolga Çapın
Coordinator Lecturer(s) Prof. Tolga Çapın
Robert Sedgewick and Kevin M. A. Weiss, Data Structures and
Required Recommended
Wayne, Algorithms, 4th Edition, Algorithm Analysis in Java, 3rd
Reading 2011. Reading edition, Pearson, 2012.

Analysis of algorithms. Stacks and queues. Elementary sorts. Mergesort.


Course Catalog Quicksort. Priority queues. Elementary symbol tables. Binary search trees.
Description Balanced search trees. Geometric applications of BSTs. Hash tables. Searching
applications.
This course aims to help students to understand the basic data types in
Course computer science. The course allows students to use these data types to
Objectives create compound data types and mathematically model problems. The course
also enables students to identify tree structures and set operations.
Upon successful completion of this course, students will be able to
1. Identify fundamental abstract data structures,
2. Use basic data types such as linked list, stack, queue and tree
structures to model problems,
Course
3. Apply different algorithm design methodologies such as divide and
Learning
conquer,
Outcomes
4. Construct efficient operations on basic ADT,
5. Analyze different data structures and algorithms in terms of time and
space complexity.

Design and Analysis of algorithms. Stacks and queues. Elementary sorts.


Course
Mergesort. Quicksort. Priority queues. Heaps. Symbol tables. Binary search
Contents
trees. Balanced search trees. Hash tables.
☐ Oral Presentations / Reports
☐ Brainstorming ☐ Peer Teaching
☐ Case Study/Scenario Analysis ☐ Predict-Observe-Explain
☐ Collaborating ☒ Problem Solving
☐ Concept Mapping ☒ Questioning
☐ Demonstrating ☒ Reading
Teaching
☐ Discussions / Debates ☐ Scaffolding / Coaching
Methods &
☐ Drama / Role Playing ☐ Seminars
Learning
☒ Experiments ☐ Service Learning
Activities
☐ Field Trips ☐ Simulations & Games
☐ Guest Speakers ☐ Telling / Explaining
☒ Hands-on Activities ☐ Think-Pair-Share
☐ Inquiry ☒ Video Presentations
☐ Microteaching ☐ Web Searching
☒ Other(s):…Programming Assignments

¨ 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 ………

þ Lectures .....................................42.. hrs


þ Course Readings ....................10.. hrs
¨ Workshop ......................................... hrs ¨ Resource Review ........................... hrs
¨ Online Discussion .......................... hrs ¨ Research Review ........................... hrs
¨ Debate ................................................. hrs ¨ Report on a Topic .......................... hrs
¨ Work Placement ............................. hrs ¨ Case Study Analysis ...................... hrs
Student ¨ Field Trips/Visits ........................... hrs ¨ Oral Presentation .......................... hrs
Workload ¨ Observation ...................................... hrs ¨ Poster Presentation ...................... hrs
(Total 182 Hrs) ¨ Lab Applications ............................ hrs ¨ Demonstration ................................ hrs
¨ Hands-on Work .............................. hrs ¨ Web Designs .................................... hrs
þ Quizzes and Homeworks.....70.. hrs ¨ Mock Designs ................................... hrs
þ Midterm I……….........................20.. hrs ¨ Team Meetings................................. hrs
þ Midterm II…..….........................20.. hrs ¨ Other ................................................... hrs
þ Final…..….....................................20.. hrs

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.

Late Assignment Submission

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

Extra credits will not be provided.

Plagiarism

All of the following are considered plagiarism:

• turning in someone else's work as your own

• copying words or ideas from someone else without giving credit

• failing to put a quotation in quotation marks

• giving incorrect information about the source of a quotation

• 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:

• Copying answers on examinations, homework and laboratory works

• Using prohibited material on examinations

• Lying to gain any type of advantage in class

• Providing false, modified or forged data in a report

• Plagiarizing

• Modifying graded material to be regraded

• Causing harm to colleagues by distributing false information about an examination, homework


or laboratory
COURSE ASSIGNMENTS

A. Two Midterm Exams [20 + 25%]


Two closed-book written exams. The exams will be held in the weekend when possible. The
exam hours and classrooms will be announced over Moodle.
B. Programming Assignments [20%]
5 programming assignments. The weight of each assignment will be announced in the handouts.
The assignments will require implementation of a project in Java and writing a report on your
work.

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

W Day Topics Readings Assignments

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

Elementary Sorts Programming


6 17.03 - 23.03 Chapter 2 Assignment 2 out
Mergesort and Quicksort (Alg. Analysis / Sorting)

7 24.03 – 30.03 Mergesort and Quicksort Chapter 2


Midterm Exam 1
Mergesort and Quicksort
8 31.03 - 06.04 Chapter 2
Monday-Tuesday: Holidays, No classes
Programming
9 07.04 - 13.04 Trees Chapter 2 Assignment 3 out
(Trees)

10 14.04 – 20.04 Binary Search Trees Chapter 3

Balanced Search Trees Programming


11 21.04 - 27.04 Chapter 3 Assignment 4 out
Wednesday: National Holiday, no classes (Balanced Trees / Heaps)
2-3 Trees, Red-Black Trees
12 28.04 - 04.05 Chapter 3
Thursday: National Holiday, no classes
Priority Queues
13 05.05 - 11.05 Chapter 3 Midterm Exam 2
Heaps, Heapsort
Programming
14 12.05 - 18.05 Hashing Chapter 3 Assignment 5 out
(Hashing)
Applications
15 19.05 – 25.05 Chapter 3
Monday: National Holiday, no classes
16 26.05 – 01.06 Applications Chapter 3
Final Exams Week

COURSE ASSESSMENTS & LEARNING OUTCOMES MATRIX

Assessment Methods Course Learning Outcomes


Midterm 1, Midterm 2, Final LO1
HW1-5, Midterm 1, Midterm 2, Final LO2
HW1-5, Midterm 2, Final LO3
HW1-5, Midterm 1, Midterm 2, Final LO4
HW1-5, Midterm 1, Final LO5
Prepared By & Prof. Tolga Çapın
Revision Date 02.02.2024
Date 02.02.2025

You might also like