MAT205 – Data Structure and Algorithms

Module designation

Data Structure and Algorithms (MAT 205)

Semester(s) in which the module is taught

4^th

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

Algorithms and Programming (MAT101)

Module objectives/intended learning outcomes

General Competence (Knowledge)

Capable of making proper and efficient algorithms with corresponding data structures to solve computational problems.

Specific Competence: Student capable of

1.       Explaining the introduction to algorithms and along with it his supporters

2.       Creating a data type class for the purposes of data processing

3.       Creating a simple data type of type array, list, and queue

4.       Creating a data type tree

5.       Being able to explain the truth and effectiveness of the algorithm

6.      Describing several methods of algorithm design and create / design algorithms various problems.

Content

Introduction to Data Structures and Algorithms, Introduction to Object-Based Programming, Data Structures Simple, tree data structures, Analysis of Algorithms, Design Methods Algorithms

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 + 19% assignment + 22% Quiz + 22.25% midterm + 26.75% final exam.

Final index is defined as follow:

Reading list

1.       Cormen, T., et al, 2001, Introduction to Algorithms, The MIT Press, Massachusetts.

2.       Goddard, S., 2007, Design and Analysis of Algorithms Lecture Note, http://www.cse.unl.edu/ ~goddard/Courses/CSCE310J

3.      Levitin, A., 2007, Introduction to The Design & Analysis of Algorithms, Addison-Wesley, New York