At the end of this course, the students; 1) Explain the basic concepts of Algorithm design and Programming 2) Creates the appropriate solution algorithm for Input-Output Problems and codes it with the C programming language. 3) Creates the solution algorithm suitable for decision making problems and codes it with the C programming language. 4) Creates the solution algorithm suitable for cyclical problems and codes it with the C programming language. 5) Traces a written program and finds errors.
MODE OF DELIVERY
Face to face
PRE-REQUISITES OF THE COURSE
No
RECOMMENDED OPTIONAL PROGRAMME COMPONENT
yok
COURSE DEFINITION
The aim of this course is to understand the principles and phases necessary for the solution of any problem and to create an algorithm (flow diagrams and pseudo code). To be able to implement the algorithm developed using basic programming structures with C programming language.
COURSE CONTENTS
WEEK
TOPICS
1st Week
Use of Computer-Hardware and Software Features: Hardware: Computer structure and functional parts tasks: MIB-AMB, DB, Memory, I / O Units. Side Memory. Data definition, Bit, Byte scales.
2nd Week
Software: Introduction to Programming-I: Program, Programming Steps, Definition of Algorithm, Flow Drawing, Algorithm Structures.
Programming Language, C Language basic elements, Program structure. Use compiler-DevC ++, printf-Instance. C Compiler-Editing / Compilation / Business C Language Writing Program:
5th Week
C language: Program environment and structure: main (), return, "system pause". Basics: Expressions, Description Line. Variable, fixed, data type, simple arithmetic operation and assignment process. Lean printf (): First C program
6th Week
Input / Output and basic arithmetic operations: printf / scanf.
7th Week
Decision processing: Conditional deviation / selection-I: Relationship and logical processors. Optional-if statement structures: if, if / else
8th Week
Midterm
9th Week
nested and multiple deviations: swich / case structures Conditional deviation / selection-II: if / else- Unified-set and nested if. ASCI Code-getchar ().
10th Week
Loop Algorithms-I: Loop Structures and Algorithm Control: Iteration: Quite Recurring / While, Repeat until / Until / Do-While Loop. Do / Do While loop difference.
11th Week
Input-Validity test using loop structures
12th Week
Loop-Control Structures: Counting, counter and for looping and loop structures
13th Week
Nested Loop Control Structure. Custom counter operations: Single increment and decrement operations.
14th Week
Nested loop structures, while, for, do cycles, Break and Continue output options and examples
RECOMENDED OR REQUIRED READING
1- Programalmayı C ile Öğreniyorum , Muhammet & SeherYorulmaz, 2015, ISBN: 975-8982-51-6,Palme yayın dağıtım
2-C: How to Program, H. M. Deitel and P. J. Deitel, Prentice Hall, International Edition, ISBN: 0-13-089572-5
PLANNED LEARNING ACTIVITIES AND TEACHING METHODS
Lecture,Practice
ASSESSMENT METHODS AND CRITERIA
Quantity
Percentage(%)
Mid-term
1
30
Assignment
2
10
Quiz
3
10
Practice
1
10
Total(%)
60
Contribution of In-term Studies to Overall Grade(%)
60
Contribution of Final Examination to Overall Grade(%)
40
Total(%)
100
ECTS WORKLOAD
Activities
Number
Hours
Workload
Midterm exam
1
1
1
Preparation for Quiz
3
4
12
Individual or group work
14
2
28
Preparation for Final exam
1
20
20
Course hours
14
2
28
Preparation for Midterm exam
1
16
16
Laboratory (including preparation)
14
2
28
Final exam
1
1
1
Homework
2
6
12
Total Workload
146
Total Workload / 30
4,86
ECTS Credits of the Course
5
LANGUAGE OF INSTRUCTION
Turkish
WORK PLACEMENT(S)
No
KEY LEARNING OUTCOMES (KLO) / MATRIX OF LEARNING OUTCOMES (LO)