PAÜ .:. Eğitim Öğretim Bilgi Sistemi

COURSE INFORMATION

Course Code	Course Title	L+P Hour	Semester	ECTS
BTO 2003	BASIC PROGRAMMING	2 + 2	3rd Semester	4

COURSE DESCRIPTION

Course Level	Bachelor's Degree
Course Type	Compulsory
Course Objective	To learn and apply basic programming structures, algorithm development capabilities to give, problems encountered in a computer environment to provide the solution.
Course Content	Introduction to algorithms, flow charts and problem-solving, working time and complexity, sorting algorithms, recursion and binary tree display, reduction, data structures, binary search techniques, matrices and operations on matrices. The basic concepts of programming languages: Atomic, object, phrase, phrase, statement, description, fixed concepts and applications. Number systems, functions, use of header files. Supplier and life. Global and local (local) variables. Operators: arithmetic, logical, comparison, pointer (pointer), and bitwise operators. Control statements (if, if / else), and nested. The loop statements (while, do / while, for); infinite loops, and uses; nested loops. Programming language, readability and efficiency. The standard functions of a programming language and the creation of these functions. Typecast. Random number generation and usage. Algorithms on arrays, and arrays. File operations.
Prerequisites	No the prerequisite of lesson.
Corequisite	No the corequisite of lesson.
Mode of Delivery	Face to Face

COURSE LEARNING OUTCOMES

1	How to solve a problem in mind can grasp the logic of the computer work.
2	Solution to improve the algorithm and flow charts.
3	Programming language environment (writing code, compiling) use.
4	During the software that can detect and correct syntax errors.
5	Learn the basic features of a programming language.
6	Know and use the standard libraries are required for programming.
7	A program to define the variables needed to be encoded.
8	Where necessary, control statements, operators, and use cycles.
9	Basic input/output functions are learned.
10	Use of single and multi-dimensional arrays and strings.
11	To understand the benefits and necessity of using the Sub-Programme.
12	To generate the random number can encode.
13	Pointer to learn the concept and use of code writing.
14	To have high performance of the program, learn the rules of writing code.
15	Learn about the functions and types of file.

COURSE'S CONTRIBUTION TO PROGRAM

	PO 01	PO 02	PO 03	PO 04	PO 05	PO 06	PO 07	PO 08	PO 09	PO 10	PO 11	PO 12	PO 13	PO 14	PO 15	PO 16	PO 17
LO 001	1	3	5			3	4	2		1		5		5	5	2	5
LO 002	1	3	5			3	4	2		1		5		5	5	2	5
LO 003		3	5			3	5			2		5		5	5	2	3
LO 004		3	5			3	5			2		5		5	5	2
LO 005		3	5			3	5			2		5		5	5	2
LO 006		3	5			3	5			2		5		5	5	2
LO 007			3			3	5			2		5		5	5	2	3
LO 008		3	5			3	5			2		5		5	5	2	5
LO 009		3	5			3	5			2		5		5	5	2
LO 010		3	5			3	5			2		5		5	5	2
LO 011		3	5			3	5			2		5		5	5	2
LO 012		3	5			3	5			2		5		5	5	2	3
LO 013		3	5			3	5			2		5		5	5	2
LO 014		3	5			3	5			2		5		5	5	2
LO 015		3	5			3	5			2		5		5	5	2
Sub Total	2	42	73			45	73	4		28		75		75	75	30	24
Contribution	0	3	5	0	0	3	5	0	0	2	0	5	0	5	5	2	2

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION

Activities	Quantity	Duration (Hour)	Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)	14	4	56
Hours for off-the-classroom study (Pre-study, practice)	14	1	14
Assignments	1	8	8
Mid-terms	1	10	10
Final examination	1	8	8
Presentation / Seminar Preparation	1	8	8
Total Work Load ECTS Credit of the Course			104 4

COURSE DETAILS

Select Year

	Course Term	No	Instructors
Details	2023-2024 Fall	1	HÜSEYİN ÖZÇINAR

Course Details

Course Code	Course Title	L+P Hour	Course Code	Language Of Instruction	Course Semester
BTO 2003	BASIC PROGRAMMING	2 + 2	1	Turkish	2023-2024 Fall

Course Coordinator	E-Mail	Phone Number	Course Location	Attendance
Assoc. Prof. Dr. HÜSEYİN ÖZÇINAR	hozcinar@pau.edu.tr		EGT A0431-09	%

Goals		To learn and apply basic programming structures, algorithm development capabilities to give, problems encountered in a computer environment to provide the solution.
Content		Introduction to algorithms, flow charts and problem-solving, working time and complexity, sorting algorithms, recursion and binary tree display, reduction, data structures, binary search techniques, matrices and operations on matrices. The basic concepts of programming languages: Atomic, object, phrase, phrase, statement, description, fixed concepts and applications. Number systems, functions, use of header files. Supplier and life. Global and local (local) variables. Operators: arithmetic, logical, comparison, pointer (pointer), and bitwise operators. Control statements (if, if / else), and nested. The loop statements (while, do / while, for); infinite loops, and uses; nested loops. Programming language, readability and efficiency. The standard functions of a programming language and the creation of these functions. Typecast. Random number generation and usage. Algorithms on arrays, and arrays. File operations.

Topics

Weeks	Topics
1	Introduction to algorithms, flow charts and problem-solving, working time and complexity
2	sorting algorithms, recursion and binary tree display, reduction, data structures, binary search techniques
3	matrices and operations on matrices
4	The basic concepts of programming languages
5	Object, expression, phrase, statement, definition, concepts and practices hard
6	Number systems, functions, use of header files. Supplier and life. Global and local (local) variables
7	Operators: arithmetic, logical, comparison, bitwise, and other operators
8	Control statements (if, if / else), and nested
9	Exam
10	The loop statements (while, do / while, for); infinite loops, and uses; nested loops. Programming language, readability and efficiency
11	The standard functions of a programming language and the creation of these functions. Typecast
12	Random number generation and usage. Pointer (pointer), the concept and applications
13	Arrays and list algorithms
14	File operations

Materials

Materials are not specified.

Resources

Course Assessment

Assesment Methods	Percentage (%)	Assesment Methods Title
Final Exam	60	Final Exam
Midterm Exam	40	Midterm Exam

L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes

Prospective Student