Module designation | Algorithms and Programming (MAT 101) | ||||||||||||||
Semester(s) in which the module is taught | 3rd | ||||||||||||||
Person responsible for the module | Auli Damayanti, M.Si. | ||||||||||||||
Language | Indonesian | ||||||||||||||
Relation to curriculum | Compulsory / elective / specialisation | ||||||||||||||
Teaching methods | Lecture and lesson. | ||||||||||||||
Workload (incl. contact hours, self-study hours) | 3×170 minutes (3×50 minutes lecture and lesson, 3×60 minutes structural activities, 3×60 minutes self-study) per week for 16 weeks | ||||||||||||||
Credit points | 3 CP (4,8 ECTS) | ||||||||||||||
Required and recommended prerequisites for joining the module | – | ||||||||||||||
Module objectives/intended learning outcomes | General Competence (Knowledge) Capable of making algorithm to solve problems and then creating computer programs from algorithms that had made. Specific Competence: Student able to 1. Explain algorithms and programming, and compile algorithms 2. Compiling the structure of source program using variables, data types, operators and I/O statements in C++ 3. Compose source program using selection statements in C++. 4. Compose source programs using repetition/looping statements in C++ 5. Make function declarations in compiling C++ programs 6. Create source programs for the Array data type 7. Create source programs with string data types 8. Create algorithms for sorting and searching data and are able to create C++ programs 9. Create C++ programs with pointer data types 10. Create C++ programs with data structure types 11. Create C++ programs about using files as input or output for a program in C++
| ||||||||||||||
Content | The fundamental concept of algorithm and programming, the introduction of c++, variable and data type, the operators and statements i / o, selection, looping, function, array, data sorting, data searching, string, structure, pointer, and operation file. | ||||||||||||||
Examination forms | Essay | ||||||||||||||
Study and examination requirements | Students are considered to pass if they at least have got a final score 40 (D). Final score is calculated as follows : 10%soffskill + 20% assignment + 22.25% Quiz + 23% midterm + 24.75% final exam .
Final index is defined as follow:
| ||||||||||||||
Reading list | 1. Peter Prinz, Ulla Kirch-Prinz, 2002, A complete guide to programming in C++, Jones and Bartlett Publishers, London 2. D.S. Malik, 2007, C++ Programming, Thomson Course Technology Publisher, USA |