MAT2102 – Algorithm and Programing (Practical)

Module designation

Algorithm and Programing (Practical) (MAT102)

Semester(s) in which the module is taught

3^rd

Person responsible for the module

Drs. Edi Winarko, M.Cs.

Language

Indonesian

Relation to curriculum

Compulsory / elective / specialisation

Teaching methods

Lecture and practice.

Workload (incl. contact hours, self-study hours)

1×170 minutes (2×50 minutes lecture and lesson and 1×70 minutes self-study) per week for 16 weeks

Credit points

1 CP (1,6 ECTS)

Required and recommended prerequisites for joining the module

–    

Module objectives/intended learning outcomes

General Competence (Knowledge):

  Capable create a program that suits the problem

using the C++ programming language.

Specific Competence: student are able to

1.      create algorithms in flowchart form

2.      Understand the basic elements of C++ programming in the form of data types, variables and constants

3.      utilize operators, library functions, input output

4.      utilize if, nested if, and switch selection statements

5.      utilize for, do-while, while, break, continue and goto statements

6.      build Functions and recursive Functions.

7.      build and utilize one-dimensional, two-dimensional and multi-dimensional Array Variables

8.      utilize string variables

9.      utilize sorting and searching algorithms (Bubble sort, Quick sort, Selection sort, Insertion sort, Heab sort and sequential search, binary search

10.  Understand and utilize Pointer data tupes

11.  develop and access constructed data structures.

12.  perform file operations, save and read text files.

Content

Algorithms in the form of flowcharts, the basic elements of C++ programming in the form of data types, variables and constants, operators, library functions, input output, If, nested if, and switch selection statements, repetition statements for, do-while, while, break, continue and goto statements, Recursive Functions and Functions, Array Variables One-dimensional, two-dimensional and multi-dimensional arrays, string variables, sorting and searching algorithms, Pointer data types, constructed data structures, file operations.

Examination forms

Essay

Study and examination requirements

Students are considered to pass if they at least have got final score 40 (D).

Final score is calculated as follow: 10% softskill+30% test + 30% midterm + 30% final exam.

Final index is defined as follow:

Reading list

1.       Kadir, Abdul,2003, Pemrograman C++, Edition II, Andi Publisher, Yogyakarta.

1. Hahn, Brian, 1996. Cara Mudah Belajar C++ , Dinastindo Punlisher, Jakarta