UTI 503 Data Structures and Algorithms

Fall 2024

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 01.10.2024)

Office Hour: Tuesday 13:00 – 14:00

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

Announcements:

• (24.12.24) No class on December 31, 2024!
• (19.12.24) Twelfth week’s slides have been uploaded.
• (10.12.24) Seventh homework has been announced!

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
01.10	Introduction to Computers, the Internet and the Web
08.10	Introduction to C Programming
15.10	Structured Program Development in C	Homework 1
22.10	Program Control	Homework 2
29.10	Public Holiday
05.11	Functions	Homework 3
12.11	Arrays	Homework 4
19.11	Pointers	Homework 5
26.11	Structures, Unions, Bit Manipulations and Enumerations File Processing	Homework 6
03.12	Midterm Exam
10.12	Data Structures (Part I: Linked Lists and Stacks)	Homework 7
17.12	Data Structures (Part II: Queues and Trees)
24.12	Complexity and Sorting (Part I)
31.12	No Class
07.01	Complexity and Sorting (Part II)
14.01	Graph Fundamentals

Grading (Tentative):

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