COURSE SYLLABUS

Faculty Engineering Department SENG

Course Code SENG 201 Course Title Data and Game Structures

Course Credit 3,2,4 Language English

Course Lecturer Dr. Bora Çelikkale - L117 Course Assistant(s) Naz Dündar - L120
boracelikkale@cankaya.edu.tr naz.dundar@cankaya.edu.tr
Sec1: Tue 09:20-11:20 @H315
Course Schedule Mon 13:20-16:20 @NA02 Laboratory Schedule
Sec2: Tue 15:20-17:20 @H315
Course Type Must Course Office Hours Wed 13:00-14:30 @L117

Required Reading(s) Robert Sedgewick and Kevin Wayne, Algorithms, 4th Edition, 2011.

The course covers the organization of the data and the algorithms used to sort,
search, and solve problems. Students will learn the functioning and
Course Description implementation of fundamental data structures and algorithms. Topics
covered in this course include complexity, arrays, linked structures,
abstraction, analysis, lists, stacks, queues, trees, heaps, and graphs.
• Learn the data structures which are the foundation of many techniques
performed in modern software development.
• How to store data efficiently in the computer’s memory.
• How to process data efficiently.
Course Objectives
• What algorithms work best under what situations and why.
• How various popular algorithms compare to one another in specific
situations.
• What data structures can help the processing of data in certain situations.

• Formulate and apply object‐oriented programming as a modern tool to

solve engineering problems.
• Demonstrate an understanding and design of basic data structures (such
as an array‐based list, linked list, stack, queue, binary search tree) and
algorithms.
Learning Outcomes • Demonstrate the ability to analyze, design, apply and use data structures
and algorithms to solve software engineering problems and evaluate their
solutions.
• Demonstrate an understanding of analysis of algorithms. Study an
algorithm or program code segment that contains iterative constructs and
analyze the asymptotic time complexity of the algorithm or code
segment.
 COURSE POLICIES

Attendance Attendance to the course is necessary but not mandatory.

Class readings are necessary but not mandatory. The material covered in class
by the instructor will only provide a fundamental understanding of the general
Class Readings
context. If you are willing to effectively learn a topic, you must actively work
on it yourself. Reading is the most successful ways of learning about a topic.
Make ups for exams will be provided if the student can provide a legal
Missed Work document confirming a significant health issue at the time of the examination
or with the approval of the instructor.
All assignment work must be done individually, unless explicitly stated in the
assignment. A student can submit only one work. In case of multiple
Assignment Rules
submissions, only the latest submission will be considered. Students cannot
submit work on other students’ behalf.
Assignments are expected to be completed by the due date. For every day that
Late Assignment the assignment is late after the due date, 25% of the maximum will be
Submission deducted from the assignment score. No assignments will be accepted once
they are 4 or more days late.
Extra Credits Extra credits will not be provided.
All the followings 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.
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).
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 exams
Cheating • 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
exam, homework or laboratory work
 GRADING AND TENTATIVE OUTLINE

Programming
There will be 3 Programming Assignments (PA). 7% each, 21% total
Assignments
Laboratory Works There will be 10 laboratory assignments. 2.5% each, 25% total

Midterm 24%

Final 30%

Weeks Topics Readings Labs Assignments

1: 02 Oct - 08 Oct Introduction, Arrays and Linked Lists Chapter 1
2: 09 Oct - 15 Oct Stack and Queues Chapter 1 Lab 1
3: 16 Oct - 22 Oct Analysis of Algorithms Chapter 1 Lab 2 PA1
4: 23 Oct - 29 Oct Elementary Sorts Chapter 2 Lab 3
5: 30 Oct - 05 Nov Merge Sort and Quick Sort Chapter 2 Lab 4 PA1 deadline
6: 06 Nov - 12 Nov Quick Sort (cont.), Trees Chapter 2 Lab 5
7: 13 Nov - 19 Nov Trees (cont.), Binary Search Trees Chapter 3 PA2
8: 20 Nov - 26 Nov MIDTERM
9: 27 Nov - 03 Dec Balanced Search Trees, Quad Trees Chapter 3 Lab 6 PA2 deadline
10: 04 Dec - 10 Dec Priority Queues Chapter 3 Lab 7
11: 11 Dec - 17 Dec Heaps and Heap Sort Chapter 3 Lab 8 PA3
12: 18 Dec - 24 Dec Hashing Chapter 3 Lab 9
13: 25 Dec - 31 Dec Graphs Chapter 4 Lab 10 PA3 deadline
14: 01 Jan - 07 Jan Directed and Weighted Graphs Chapter 4
15: 08 Jan - 21 Jan FINAL

Last Update Dr. Bora Çelikkale – 10/10/2023