LOGISTICS MANAGEMENT | |||||
---|---|---|---|---|---|
Qualification Awarded | Length of Program | Toplam Kredi (AKTS) | Mode of Study | Level of Qualification & Field of Study | |
Bachelor's (First Cycle) Degree | 4 | 240 | FULL TIME |
TQF, TQF-HE, EQF-LLL, ISCED (2011):Level 6 QF-EHEA:First Cycle TQF-HE, ISCED (1997-2013): |
Course Code: | YBS213 | ||||||||
Course Name: | INTRODUCTION TO ALGORITHM AND PROGRAMMING | ||||||||
Course Semester: | Fall | ||||||||
Course Credits: |
|
||||||||
Language of instruction: | English | ||||||||
Condition of Course: | |||||||||
Does the Course Work Experience Require?: | No | ||||||||
Course Type : | Bölüm/Program Seçmeli | ||||||||
Course Level: |
|
||||||||
Mode of Delivery: | E-Learning | ||||||||
Name of Coordinator: | Öğr. Gör. MÜYESSER ERASLAN YALÇIN | ||||||||
Course Lecturer(s): | Ayşegül Aktekin | ||||||||
Course Assistants: |
Course Objectives: | To review the ideas of computer science, programming, and problem-solving. To solve problems using algorithms. To be able to write programs with Java programming language. To review object-oriented programming and important concepts such as design, testing and debugging, programming style, interfaces and inheritance, and exception handling. |
Course Content: | This course provides introductory knowledge on algorithms and programming. Key topics covered include algorithms and flowcharts, control loops, functions, arrays, and pointers. |
The students who have succeeded in this course;
1) Knows the concept of Algorithm 2) Solve given problems using pseudo code and flowcharts 3) Analyzes and find solutions to actual problems and applies 4) Analyzes the problem and write a program with Java. |
Week | Subject | Related Preparation |
1) | Introduction to Computers and Java | |
2) | Basic Computation | |
3) | Basic Computation | |
4) | Flow of Control: Branching | |
5) | Flow of Control: Loops | |
6) | Flow of Control: Loops | |
7) | Classes and Methods | |
8) | Classes and Methods | |
9) | Midterm | |
10) | Arrays | |
11) | Exception Handling | |
12) | Recursion | |
13) | Streams and File Input/Output | |
14) | Final Review |
Course Notes / Textbooks: | Java: An Introduction to Problem Solving & Programming, 8th Edition, Walter Savitch, Pearson P. Deitel, H. Deitel, Java: How to Program, 10th edition, Late Objects Version, Pearson |
References: | Ders notları, dosyalar ve alıştırmalar Lecture notes, files and exercises. |
Course Learning Outcomes | 1 |
2 |
3 |
4 |
---|---|---|---|---|
Program Outcomes |
No Effect | 1 Lowest | 2 Average | 3 Highest |
Program Outcomes | Level of Contribution |
Semester Requirements | Number of Activities | Level of Contribution |
Homework Assignments | 5 | % 40 |
Midterms | 1 | % 20 |
Semester Final Exam | 1 | % 40 |
Total | % 100 | |
PERCENTAGE OF SEMESTER WORK | % 60 | |
PERCENTAGE OF FINAL WORK | % 40 | |
Total | % 100 |
Aktiviteler | Number of Activities | Duration (Hours) | Workload |
Course | 13 | 3 | 39 |
Homework Assignments | 5 | 8 | 40 |
Midterms | 1 | 18 | 18 |
Semester Final Exam | 1 | 28 | 28 |
Total Workload | 125 |