Information Package / Course Catalogue
Algorithm and Programming
Course Code: CSE102
Course Type: Required
Couse Group: First Cycle (Bachelor's Degree)
Education Language: English
Work Placement: N/A
Theory: 2
Prt.: 2
Credit: 3
Lab: 0
ECTS: 6
Objectives of the Course

The main objective of this course is to help students develop basic programming skills in writing efficient computer programs. In this course, data structures which are two of the most important basic blocks of most computer programs and the algorithms defined on them are explained. In addition to the very widely used data structures and their associated algorithms, they are taught in concrete in common programming languages ??such as C and Java. Data structures and algorithms, working time, memory requirements and ease of programming in the examination of productivity is given great importance. In addition, Java Data Framework (Java Collections Framework), which is available in pre-execution, is also mentioned in summary.

Course Content

Topics covered in this course include pointer logic, asymptotic analysis of algorithms (Big O notation and its equivalent); iterative and iterative implementations of algorithms; data structures such as array, list, queue, heap, heap, dictionary, search tree and graph, and Java Collection Framework. Code writing is done in C and / or J programming languages.

Name of Lecturer(s)
Lec. Gözde ALP
Lec. Gülben AVŞAR
Learning Outcomes
1.Ability to define the basic concepts of Algorithm and Programming
2.Ability to create an algorithm solution to a given problem
3.Ability to transform the algorithmically expressed solution into a program
4.Ability to apply structural and functional rules in the programming process
5.Understand the applicability of the developed programs in real life
Recommended or Required Reading
1.Herbert Schildt, C# 4.0: The Complete Reference, McGraw-Hill, 2010.
Weekly Detailed Course Contents
Week 1 - Theoretical
Introduction to C Programming language
Week 2 - Theoretical
Conditional statements, if else, switch-case statements
Week 3 - Theoretical
Loop usage
Week 4 - Theoretical
Loop usage II
Week 5 - Theoretical
Functions in programming
Week 6 - Theoretical
The usage of Array structures
Week 7 - Theoretical
Multi-dimensional arrays and exercises
Week 8 - Theoretical
MidTerm Exam
Week 9 - Theoretical
String and file operations in C
Week 10 - Theoretical
Pointers and and sorting algorithms
Week 11 - Theoretical
The definition and usage of structs
Week 12 - Theoretical
Memory allocation in c
Week 13 - Theoretical
Introduction to linked lists
Week 14 - Theoretical
Interactive lecture
Assessment Methods and Criteria
Type of AssessmentCountPercent
Midterm Examination1%30
Final Examination1%30
Project2%40
Workload Calculation
ActivitiesCountPreparationTimeTotal Work Load (hours)
Lecture - Theory141242
Lecture - Practice142256
Project212024
Midterm Examination110212
Final Examination114216
TOTAL WORKLOAD (hours)150
Contribution of Learning Outcomes to Programme Outcomes
PÇ-1
PÇ-2
PÇ-3
PÇ-4
PÇ-5
PÇ-6
PÇ-7
PÇ-8
PÇ-9
PÇ-10
PÇ-11
OÇ-1
4
5
4
3
2
3
3
2
2
2
2
OÇ-2
5
5
5
4
3
3
3
3
2
2
2
OÇ-3
5
5
5
5
3
3
3
3
2
2
2
OÇ-4
4
5
5
5
2
3
4
3
2
2
2
OÇ-5
3
5
4
4
2
3
3
4
2
3
3
Adnan Menderes University - Information Package / Course Catalogue
2026