Program Studi Informatika - Fakultas Ilmu Komputer Universitas Bina Darma

SYLLABUS FORM
ISO 9001 : 2008

Created by

Doc. No

:

FRM/KUL/01/02

Revision No

:

4

Date of Issue

:


October 01st , 2011

ISO

:

7.5.1 & 7

Checked by

Approved by

Valid Date
1 Sept 2010

M.Akbar, S.T, M.IT

Syahril Rizal, S.T., M.M., M.Kom.

M. Izman Herdiansyah, PhD


Unit Detail
Faculty
Study Program
Unit Title
Unit Code
Credit
Prerequiste(s)
Teaching Staf
Unit Coordinator

: Computer Science
: Information Technology
: Algorithm and Programming
: 142-1205
: 4 sks
:: Muhamad Akbar, ST., M.IT
:

S 1 degree


Unit Description
Programming Algorithm subjects procedural part is a debriefing for the students in identifying
procedural programming methodologies, with the notation algorithmic structured and
implemented in high level programming procedural language.
Unit Objectives :
1. Students understand the notation algorithm
2. Students can solve a case in a structured and algorithm notation

Weekly Learning Process Implementation :
No Subject / Material
Subject description

References

Note

1

Understanding the basic algorithm


How to distinguish between programs and
algorithms
Basic algorithmic

Liem ,2007

Discussion topic (DT*) :
Algorithm definition

2

Algorithmic Notation

Boolean, real, integer , char types

Liem, 2007

3


Variable and Constanta

Liem, 2007

DT : when we use variable

4

String

Liem, 2007

DT : String is non primitive
type ?

5

Value, Expression

Liem, 2007


6

Sequential

7

Try using input in sequential algorithmic
notation

Liem, 2007

Mid Semester Test

8

Function

Liem, 2007


9

Procedure

Liem, 2007

10

LOOP

Using While-do, Repeat-until, Iterate for
looping statement

Liem, 2007

11

Condition

Understanding depend on, if , case


Liem, 2007

12

Array

1 – multi dimention

Liem, 2007

13

Sequential Files

Searching, updating, sorting

Liem, 2007, Alfred,2000

DT : function example

DT: loop syntax

14

Final Examination
DT = Discussion topic on e-learning forum (elearning.binadarma.ac.id)

10. Class Regulation

Students are expected to : 1. attend and enter the classroom at least five minutes before lecture
starts. 2. Turn mobile phones are prohibited in the classroom. 3. Fill out the attendance at each
meeting.
11. Evaluation
Elearning contribution (forum)
Quiz

15%
15%

Mid Test

Final Exam

30%
40%

12. Texts, References and Learning Resources :
1. Liem, I, (2007), Diktat kuliah Dasar Pemrograman, STEI-ITB, Bandung.
2. Alfred, Strohmeier (2000), Algorithms and Data
Structures, Swiss Federal Institute of Technology,Lausanne
3. NIIT module PLT, 2008