UTI 503 Data Structures and Algorithms

Fall 2025

Instructor: Prof. Dr. Geylani KARDAŞ (geylani.kardas@ege.edu.tr)

Assistant: Cemil Aybars URAL (cemil.aybars.ural@ege.edu.tr)

Time: Tuesday 18:00 – 20:45 (started at 16.09.2025)

Office Hour: Tuesday 13:00 – 14:00

All important information about the course is available from this Web page.

Announcements:

• (09.09.25) First week’s slides have been uploaded.

Course Description:

Introduction of data structures and algorithms by using C programming language. Topics include: Operators, fundamental data types, program control structures, loops, functions, arrays, pointers, user defined data types, structures, unions, bitwise operations, linked lists, stacks, queues, trees, algorithm complexity, sorting algorithms and graph fundamentals.

Prerequisites:

There are no course prerequisites.

Course Material:

• Required: Lecture slides (available on the course’s web page)
• Textbook: C How to Program (7th Edition), Paul Deitel and Harvey Deitel, Prentice Hall, 2013
• Development Environments:
• Dev-C++ (http://www.bloodshed.net/devcpp.html)
• Eclipse IDE for C/C++ Developers (https://www.eclipse.org/downloads/packages/release/2022-06/r/eclipse-ide-cc-developers)
• Microsoft’s Visual Studio Express (https://www.visualstudio.com/vs/visual-studio-express/)

Tentative Course Syllabus:

Date	Topics	Assignments
16.09	Introduction to Computers, the Internet and the Web
23.09	Introduction to C Programming
30.09	Structured Program Development in C
07.10	Program Control
14.10	Functions
21.10	Arrays
28.10	Public Holiday
04.11	Pointers
11.11	Structures, Unions, Bit Manipulations and Enumerations File Processing
18.11	Midterm Exam
25.11	No Class
02.12	Data Structures (Part I: Linked Lists and Stacks)
09.12	Data Structures (Part II: Queues and Trees)
16.12	Complexity and Sorting (Part I)
23.12	Complexity and Sorting (Part II)
30.12	Graph Fundamentals

Grading (Tentative):

• Homework 10%
• Midterm Exam 40%
• Final Exam 50%