Nevşehir Hacı Bektaş Veli University Course Catalogue

Information Of Programmes

VOCATIONAL SCHOOL OF NEVŞEHİR / BMD104 - BIOMEDICAL DEVICE TECHNOLOGY

Code: BMD104 Course Title: ALGORITHM AND PROGRAMMING Theoretical+Practice: 3+1 ECTS: 4
Year/Semester of Study 1 / Spring Semester
Level of Course Short Cycle Degree Programme
Type of Course Compulsory
Department BIOMEDICAL DEVICE TECHNOLOGY
Pre-requisities and Co-requisites None
Mode of Delivery Face to Face
Teaching Period 14 Weeks
Name of Lecturer İSMAİL ÇALIKUŞU (ismailcalikusu@nevsehir.edu.tr)
Name of Lecturer(s)
Language of Instruction Turkish
Work Placement(s) None
Objectives of the Course
To teach the logic of the algorithm, to teach user-defined types, files, pointers, sorting, searching, libraries, interrupts and using port in the C programming language.

Learning Outcomes PO MME
The students who succeeded in this course:
LO-1 Can explain the problem solutions, principles and terms and form algorithms and current scheme. PO-13 Gain the ability to write computer programs by using algorithms to solve problems that may be encountered in the field.
Examination
LO-2 Can design algorithms. PO-13 Gain the ability to write computer programs by using algorithms to solve problems that may be encountered in the field.
Examination
LO-3 Can write program by using the structure of the C programming language, the data types and the variables PO-13 Gain the ability to write computer programs by using algorithms to solve problems that may be encountered in the field.
Examination
LO-4 Can use basic input-output commands of C programming language. PO-13 Gain the ability to write computer programs by using algorithms to solve problems that may be encountered in the field.
Examination
LO-5 Can use the control commands(conditional expression) in the C programming language. PO-13 Gain the ability to write computer programs by using algorithms to solve problems that may be encountered in the field.
Examination
LO-6 Can knows the loop instructions in the C programming language. PO-13 Gain the ability to write computer programs by using algorithms to solve problems that may be encountered in the field.
Examination
LO-7 Can knows the creating sequence variablesin the C programming language. PO-13 Gain the ability to write computer programs by using algorithms to solve problems that may be encountered in the field.
Examination
LO-8 Can making string expressions in C programming language. PO-13 Gain the ability to write computer programs by using algorithms to solve problems that may be encountered in the field.
Examination
LO-9 Can do file operations in C programming language. PO-13 Gain the ability to write computer programs by using algorithms to solve problems that may be encountered in the field.
Examination
LO-10 Can create pointers in C programming language. PO-13 Gain the ability to write computer programs by using algorithms to solve problems that may be encountered in the field.
Examination
LO-11 Can perform sorting,searching process in the C programming language. PO-13 Gain the ability to write computer programs by using algorithms to solve problems that may be encountered in the field.
Examination
LO-12 Can know the libraries and its functions. PO-13 Gain the ability to write computer programs by using algorithms to solve problems that may be encountered in the field.
Examination
LO-13 Can create interrupting program in the C programming language. PO-13 Gain the ability to write computer programs by using algorithms to solve problems that may be encountered in the field.
Examination
LO-14 Can knows the how usage of ports. PO-13 Gain the ability to write computer programs by using algorithms to solve problems that may be encountered in the field.
Examination
PO: Programme Outcomes
MME:Method of measurement & Evaluation

Course Contents
Algorithms designing, introduction to the C programming language and the general structure of C language, basic types of data and input and output commands, decision-making structures and loops, series and pointers, string operations, file operations, libraries, interrupts, using port.
Weekly Course Content
Week Subject Learning Activities and Teaching Methods
1 Principles and stages of problem solving, algorithm and flow charts. Lecture, demonstration, creative thinking, learning with computers
2 Algorithm design Lecture, demonstration, creative thinking, learning with computers
3 Structure of the C programming language. Data types. Variables. Lecture, demonstration, creative thinking, learning with computers
4 Basic input-output instructions. Lecture, demonstration, creative thinking, learning with computers
5 Control statements Lecture, demonstration, creative thinking, learning with computers
6 Loops Lecture, demonstration, creative thinking, learning with computers
7 Sequences Lecture, demonstration, creative thinking, learning with computers
8 mid-term exam
9 String expression operations. Lecture, demonstration, creative thinking, learning with computers
10 File operations. Lecture, demonstration, creative thinking, learning with computers
11 Pointers Lecture, demonstration, creative thinking, learning with computers
12 Sorting, searching Lecture, demonstration, creative thinking, learning with computers
13 Libraries Lecture, demonstration, creative thinking, learning with computers
14 Interrupts Lecture, demonstration, creative thinking, learning with computers
15 Port usage Lecture, demonstration, creative thinking, learning with computers
16 final exam
Recommend Course Book / Supplementary Book/Reading
1 Alp S., KilitciA., "Algoritmalar ve Programlamaya Giriş", Umuttepe Yayınevi,2015.
2 Vatansever, F. (2020). Algoritma geliştirme ve programlamaya giriş.
3 SEBETCİ, Ö. (2019). Nesne temelli programlamaya giriş ve algoritmalar. Hiperlink eğit. ilet. yay. san. tic. ve ltd. sti..
Required Course instruments and materials
Course book, notebook, projector

Assessment Methods
Type of Assessment Week Hours Weight(%)
mid-term exam 8 1 40
Other assessment methods
1.Oral Examination
2.Quiz
3.Laboratory exam
4.Presentation
5.Report
6.Workshop
7.Performance Project
8.Term Paper
9.Project
final exam 16 1 60

Student Work Load
Type of Work Weekly Hours Number of Weeks Work Load
Weekly Course Hours (Theoretical+Practice) 3 14 42
Outside Class
       a) Reading 2 12 24
       b) Search in internet/Library 2 12 24
       c) Performance Project 0
       d) Prepare a workshop/Presentation/Report 0
       e) Term paper/Project 0
Oral Examination 0
Quiz 0
Laboratory exam 0
Own study for mid-term exam 2 7 14
mid-term exam 1 1 1
Own study for final exam 2 7 14
final exam 1 1 1
0
0
Total work load; 120