SD0573 Algorithm for beginners (design and thinking)

3 ECTS - 2-0 Duration (T+A)- 0. Semester- 2 National Credit

Information

Code SD0573
Name Algorithm for beginners (design and thinking)
Term 2023-2024 Academic Year
Term Fall and Spring
Duration (T+A) 2-0 (T-A) (17 Week)
ECTS 3 ECTS
National Credit 2 National Credit
Teaching Language Türkçe
Level Üniversite Dersi
Label NFE Non-Field Elective Courses (University) UCC University Common Course
Mode of study Yüz Yüze Öğretim
Catalog Information Coordinator Öğr. Gör.Dr. YOLDAŞ ERDOĞAN
Course Instructor Öğr. Gör.Dr. YOLDAŞ ERDOĞAN (A Group) (Ins. in Charge)
Öğr. Gör.Dr. YOLDAŞ ERDOĞAN (A Group) (Ins. in Charge)


Course Goal / Objective

To design and learn algorithm logic and simply computer programming logic with figures.

Course Content

This course; It aims to analyze a problem and design an algorithm for the solution in basic and simple ways using a computer. It is aimed to design the algorithm with shapes without using any programming language. It also teaches the history of computer science, the terms software and hardware, and the relationship between them. The main aim of the course is to understand the problem to be solved, to create the solution steps, to form the basis for writing a computer program and to prepare for the structures that make up this program.

Course Precondition

Resources

Slides from the lecture.

Notes

It will be given in class.


Course Learning Outcomes

Order Course Learning Outcomes
LO01 Students explain the basic concepts of algorithm design for solving engineering problems.
LO02 Students analyze the algorithms designed by themselves.
LO03 Students describe and explain how to create, test and compare different algorithms for a problem.
LO04 Students apply the basic concepts of computer programming with Flow algorithm program.
LO05 Students describe flowcharts and algorithm design techniques.


Week Plan

Week Topic Preparation Methods
1 Programming languages, mathematical operations, comparison operations, logical operations Reading, Applying Öğretim Yöntemleri:
Anlatım
2 Algorithm, terms and operators used in algorithms Reading, Applying Öğretim Yöntemleri:
Anlatım
3 Shapes used in flow diagram Reading, Applying Öğretim Yöntemleri:
Anlatım
4 Data types used in programming languages and general structures of programming languages Reading, Applying Öğretim Yöntemleri:
Anlatım
5 Understand the problem, analyze and create the algorithm Reading, Applying Öğretim Yöntemleri:
Anlatım
6 Algorithm and loop concept Reading, Applying Öğretim Yöntemleri:
Anlatım
7 Understand counters and assignments Reading, Applying Öğretim Yöntemleri:
Anlatım
8 Mid-Term Exam Repeating the topics covered and making applications Ölçme Yöntemleri:
Yazılı Sınav
9 Examples and algorithmic solutions 1 Reading, Applying Öğretim Yöntemleri:
Anlatım
10 How to become a good programmer Reading, Applying Öğretim Yöntemleri:
Anlatım
11 Algorithm and comparison operations Reading, Applying Öğretim Yöntemleri:
Anlatım
12 Arrays and usage areas Reading, Applying Öğretim Yöntemleri:
Anlatım
13 Examples and algorithmic solutions 2 Reading, Applying Öğretim Yöntemleri:
Anlatım
14 About search, sort, and find algorithms Reading, Applying Öğretim Yöntemleri:
Anlatım
15 General applications 2 Reading, Applying Öğretim Yöntemleri:
Anlatım
16 Term Exams Repeating the topics covered and making applications Ölçme Yöntemleri:
Yazılı Sınav
17 Term Exams


Student Workload - ECTS

Works Number Time (Hour) Workload (Hour)
Course Related Works
Class Time (Exam weeks are excluded) 14 2 28
Out of Class Study (Preliminary Work, Practice) 14 2 28
Assesment Related Works
Homeworks, Projects, Others 1 12 12
Mid-term Exams (Written, Oral, etc.) 1 4 4
Final Exam 1 4 4
Total Workload (Hour) 76
Total Workload / 25 (h) 3,04
ECTS 3 ECTS

Update Time: 15.09.2023 03:06