FAKULTAS : EKONOMI - BISNIS & MANAJEMEN - TEKNIK - BAHASA – DKV

Jl. Cikutra No. 204 A Bandung 40125 Telp. (022) 7275855

COURSE DETAIL SUMMARY

WIDYATAMA UNIVERSITY
FACULTY OF ENGINEERING
INFORMATION SYSTEM - S1
Subject Code Core Subject Credit Semester Date of
Arrangement
Algorithm 11130002 Programming 3 I 1 Juni 2016
Organizer of Course Core Subject Coordinator Head of Department
Detail Summary

Authority

Ucu Nugraha, S.T., M.Kom. Dani Hamdani, S.Kom., M.T. Sri Lestari, Ir., M.T.
1. General Target of Learning Outcome
1. Able to design Information System Development Stages
2. Able to design stages of software development
3. Able to analyze the topology of a computer network
4. Able to apply Basic Computer Programming Concepts and Theories to help solve problems
5. Able to explain the Basic Architecture of a computer system
Learning Outcome
6. Able to explain the concept of marketing management
7. Able to explain the concept of risk management
8. Able to understand the basic concepts of entrepreneurship
9. Able to describe business planning based on feasibility studies
10. Able to implement IS / IT as an organizational competitive advantage

1
 11. Able to explore, identify, reconfirm and carry out requests for customer service needs
12. Able to identify the basic principles and concepts of managing an organization's business
13. Able to use ICT to support business processes.
14. Able to manage information system integration projects according to project management standards
15. Able to design databases according to the needs of the organization.
16. Able to mix and implement database designs on a DBMS.
17. Able to explain the basic principles of integrity, security, and the level of confidentiality of data in a database.
18. Able to design Enterprise Information System Architecture in integrating functional areas of business.
19. Able to plan, compile, summarize and formulate the implementation of Technology Governance
20. Information on a small to medium organization.
21. Able to identify, describe and evaluate enterprise system software.

2. Learning Outcome of related subject

1. Level of understanding of the concepts and techniques of solving basic programming problems in this case the
algorithm;
2. Application level about making programming problems resolved, executing programs without depending on any
programming language.
This course discusses the definition of algorithms, names and data types, operators and expressions, the basic
structure of algorithms, one and two-dimensional arrays, searching, sorting, abstract machine functions and
procedures and the basics of sequential file management.
Course Description

2
 1. Rules of Lecture, Assessment, and references used
2. Understanding Algorithms & how to write algorithms and names & data types
3. Basic Structure of Algorithms.
4. Basic Structure of Algorithms (Runtunan & Selection)
5. Structure of selection and repetition algorithms
6. Array
Material Course 7. Sequential Searching
8. Binary Searching
9. Sorting
10. Function and Procedure
11. Record and character machine
12. Sequential File
13. Sequential File Merging and Separation and Updating
14. Sequential File Consolidation
1. Aho, A.V., J.E. Hopcroft & J.D. Ullman, Data structures and Algorithms, Addison Wesley, 1983.
2. Brassard, Bratley; Algorithmics : Theory & Practice; ; Prentice-Hall, 1988
3. Deitel, H.M. & P.J. Deitel, C: How to program, 2nd Ed. Prentice Hall, 1994
4. Horowitz, Sahni; Fundamental of Data Structure; Pitman, 1981
5. Kerninghan, B.W. & M.D. Ritchie, The C Programming Language, 2nd Ed. Prentice Hall, 1988
6. Koffman, E.B., Pascal, 5th Ed., Addison Wesley, 1995
7. Liem, Inggriani; Diktat Kuliah : Algoritma & Pemrograman Prosedural, Bagian II; Teknik Informatika ITB,
Reference 1996
8. Munir, Rinaldi; Algoritma & Pemrograman : Jilid II ; Informatika Bandung, 2003
9. Rilgivia, Hevi; Diktat Algoritma I; Jurusan Teknik Informatika; Bandung; 2005
10. Sahni; Data Structures, Algorithms, and Applications in Java; McGraw-Hill, International Editions, 2000
11. Santoso, Insap; Struktur Data Menggunakan Turbo Pascal; Andi Offset, Yogyakarta
12. Weiss, M.A., Data Structures and Algorithm Analysis, 2nd Ed., The Benjamin/Cummings, 1995.
13. Wirth; Algorithm + Data Structure = Program; Computer Science, 1991
14. Yatini, Indra; Nasution, Erliansyah; Algoritma & Struktur Data dengan C++; Graha Ilmu;2005
1. Laptop
2. Projector
Learning Media 3. Whiteboard
4. Whiteboard marker

Team Teaching Dani Hamdani, S.Kom., M.T.

Required Subject Mathematic

3
 OUTCOME CRITERIA AND LEARNING PERCEN
WEEK INDICATOR LEARNING MATERIAL
SUBJECT SCORING FORM METHOD TAGE
Understand the • Can explain the definition of Descriptive rubric Guided a. Rules of Lecture, 6%
rules of lecturing an algorithm (essay) Inquiry Assessment, and
algorithms. Then • Can mention the usefulness of Learning
the algorithm
references used
students can: b. Understanding
• Can explain the kinds of
a. Defines the Algorithms & how to
algorithms
meaning of an • Can explain the application of write algorithms and
1 algorithm the algorithm
b. Identifying names & data types
• Can explain the basic structure
algorithm of building an algorithm
c. Basic Structure of
functions Can give an example of the Algorithms.
c. Identifying structure of an algorithm.
various algorithms
(C1)
Able to explain Can explain the concept: Descriptive rubric Guided Basic Structure of 7%
a. Basic Structure • Name, data type and usage (essay) Inquiry Algorithms (Runtunan &
Algorithm of name and data type Learning Selection)
b. Data names & • Basic assembly algorithm
2 types as well as Build a selection algorithm
operators & data
expressions in the
application
(C2)
Able to explain • Can explain the basic Descriptive rubric Guided Structure of selection 7%
a. Basic Structure structure concept of selection (essay) Inquiry and repetition algorithms
of the Selection and repetition algorithms Learning
Algorithm in the • Can explain the application
application of the structure of selection
3 b. Basic Structure and repetition algorithms
of Repetition /
Loop Algorithms
c. Basic Structure
of Repetition /
Loop Algorithms

4
 in applications
(C2)
Able to explain • Can explain one and two Descriptive rubric Guided Array 7%
kinds of Array dimensional arrays (essay) Inquiry
(One Dimension, • Can explain one and two Learning
Two Dimensions dimensional array
4 applications
and One & Two
Dimensions alloys)
and their use
(C2)
Able to explain • Can explain about Descriptive rubric  Guided Sequential Searching 6%
a. Kinds of sequential searching (essay) Inquiry
Sequential Search • Can explain sequential learning
methods in the state
of non-ordered or
searching cases  Cooperative
sequential data and learning
5 their usage
b. Sequential Search
method in the state
of unsorted or
sequential data in the
application
(C2)
a. Able to describe • Can explain the binary Descriptive rubric  Guided Binary Searching 7%
the various Finding searching method (essay) Inquiry
methods in ordered • Can explain and give learning
examples of how to use binary
data states and
searching  Cooperative
their use learning
(especially Binary
Search /
6
Dichotomy)
b. Be able to
explain the user's
Search (Binary
Search) method in
the order of
ordered data in the

5
 app
(C2)
a. Able to explain • Can explain the related Descriptive rubric  Guided Sorting 10%
kinds of Sorting sorting and bubble (essay) Inquiry
methods along sorting options learning
with the use of • Can explain and give  Cooperative
Sorting methods examples of how to use learning
(Bubble Sort & selection and bubble
Selection Sort) sorting
7
b. Able to explain
the use of the
Bubble Sort &
Selection Sort
method in the
application
(C2)
8. MID TERM EXAMINATION
a. Able to explain • Can explain the related sort Descriptive rubric • Guided Sorting 6%
various types of sorting, bubble sorting and (essay) Inquiry
Sorting along with insertion sort learning
the use of Sorting Can explain and give • Cooperative
methods (Bubble examples of how to use learning
Sort, Selection selection, bubble sorting and • Case Study
Search & Insertion insertion sort
9 Sort)
b. Able to explain
the use of the Bubble
Sort, Selection Sort
& Insertion Sort
method in the
application
(C2)
a. Able to explain • Can explain functions and Descriptive rubric Guided Function and Procudeur 7%
understanding, procedures (essay) Inquiry
10
declaration and call • Can explain the application learning
function & of functions and procedures
procedure along with Can explain the different
its use

6
 b. Able to explain functions and procedures
and use functions • Can explain functions and
and procedures in the procedures
application • Can explain the application
(C2) of functions and procedures
Can explain the different
functions and procedures
a. Able to explain • Can explain functions and Descriptive rubric  Cooperative Function and Procedure 7%
understanding, procedures (essay) learning
declaration and call • Can explain the application  Case Study
function & of functions and procedures
procedure along with Can explain the different
11 its use functions and procedures
b. Able to explain
and use functions
and procedures in the
application
(C2)
a. Able to explain the Descriptive rubric • Guided Record and character machine 7%
use of recording • Can explain abstract (essay) Inquiry
machines and machines, recording learning
character machines machines and character • Cooperative
b. Able to explain machines learning
12
the use of recording • Can use the record engine
machines and and character engine in the
character machines
application
in the application
(C2)
a. Able to explain • Can explain sequential files Descriptive rubric • Guided Sequential File 7%
understanding, Can explain sequential file (essay) Inquiry
instructions, merging learning
declaration of • Cooperative
sequential files and learning
their use
13
Able to explain the
method of
combining
Sequential files and
their use
(C2)

7
 a. Able to explain the • Can explain sequential files Descriptive rubric • Guided Sequential File Merging and 6%
method of separation • Can explain file merging (essay) Inquiry Separation and Updating
in Sequential files • Can explain sequential file learning
and their use updating • Cooperative
b. Able to explain learning
the method of
separation and its use
14
in the application
Able to explain the
method of updating
the Sequential file
and its use in the
application
(C2)
a. Able to explain • Can explain sequential file Descriptive rubric • Guided Sequential File Consolidation 10%
Sequential file consolidation (essay) Inquiry
consolidation • Can explain the use of learning
methods and their sequential file consolidation • Cooperative
use with or without learning
separator
15 b. Able to explain
the Consolidation
method with or
without separator
and its use in the
application
(C4)
16. FINAL TEST