Module Handbook

 

Module Name:

Data Structure and Algorithms

Module Level:

Bachelor

Abbreviation, if applicable:

MAT205

Sub-heading, if applicable:

-

Courses included in the

module, if applicable:

-

Semester/term:

4th/ SecondYear

Module coordinator(s):

Auli Damayanti,S.Si.,M.Si.

Lecturer(s):

Auli Damayanti,S.Si.,M.Si.

Language:

BahasaIndonesia

Classification within the

Curriculum

Compulsory Course / Elective Studies

Teaching format / classhours per week during semester:

3 hours lectures (50 min / hour)

Workload:

3 hours lectures, 3 hour structural activities, 3 hours individual study,13 week per semester, and total 117 hours per semester 3.9 ECTS

Credit Points:

3

Requirements:

-

Learning goals/competencies:

General Competence (Knowledge)

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

 

Specific Competence:

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.         Describes 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

Soft skill Attribute

Activity, disciplinary, honesty, creativity and cooperation

 

Study/exam achievements:

The assessmentinclude essay test (quiz, middle exam ) and grup presentations (final exam)

Final score (NA) is calculated as follow:

10% softskill + 20% Assignment+20%quiz + 25% UTS(middle exam)+ 25% UAS(final exam).

 

Final index is defined as follow:

A : 75 100

AB : 70 74.99

B : 65 69.99

BC : 60 64.99

C : 55 59.99

D : 40 54.99

E : 0 39.99

Forms of Media:

Slides and LCD projectors, whiteboards

Learning Methods

Lecture, assessments and group discussion

Literature:

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

Notes: