Print

COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
BTO 201PROGRAMMING LANGUAGES - I3 + 23rd Semester7

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.
2Solution 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 01PO 02PO 03PO 04PO 05PO 06PO 07PO 08PO 09PO 10PO 11PO 12PO 13PO 14PO 15PO 16PO 17
LO 001135  341 1 3 4435
LO 002135  341 1 3 4435
LO 003 35  35  2 5 1435
LO 004 35  35  2 5 1435
LO 005 35  35  2 5 1435
LO 006 25  25  2 5 1433
LO 007 35  35  2 5 1435
LO 008 35  55  2 5 1435
LO 009 35  35  2 5 1435
LO 010 35  35  2 5 1435
LO 011 35  35  2 5 1435
LO 012 35  35  2 5 1435
LO 013 25  35  2 5 1435
LO 014 35  35  2 5 1435
LO 015 35  35  2 5 1435
Sub Total24375  46732 28 71 21604573
Contribution03500350020501435

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION
ActivitiesQuantityDuration (Hour)Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)14570
Hours for off-the-classroom study (Pre-study, practice)14228
Assignments31030
Mid-terms188
Laboratory5210
Final examination12020
Presentation / Seminar Preparation144
Report / Project2612
Total Work Load

ECTS Credit of the Course






182

7
COURSE DETAILS
 Select Year   


 Course TermNoInstructors
Details 2013-2014 Fall1FARUK ŞENTÜRK


Print

Course Details
Course Code Course Title L+P Hour Course Code Language Of Instruction Course Semester
BTO 201 PROGRAMMING LANGUAGES - I 3 + 2 1 Turkish 2013-2014 Fall
Course Coordinator  E-Mail  Phone Number  Course Location Attendance
Lecturer FARUK ŞENTÜRK fsenturk@pau.edu.tr EGT A0431-03 %
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
WeeksTopics
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
ResourcesResources Language
c programmingEnglish
algroritma ve programlamaya girisTürkçe
turbo cTürkçe
Course Assessment
Assesment MethodsPercentage (%)Assesment Methods Title
Final Exam50Final Exam
Midterm Exam20Midterm Exam
Project30Project
L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes