buku pedoman institut teknologi telkom tahun ... - Poltekkes Medan

data dan Kontrol, Memori, Bus dan Perangkat Masukan/Keluaran, Unjuk kerja komputer, Pengantar
pemrosesan parallel
Pustaka :
1. “Computer Organization and Design: The Hardware/Software Interface,” Revised Printing
Third Edition, by David A. Patterson and John L. Hennessy.
2. “Computer Architecture and Organization: An Integrated Approach”, by Miles J. Murdocca
and Vincent P. Heuring, John Wiley & Sons, (2007)
3. William Stalling, Computer Organization and Architecture, Seventh Edition
CS1911/ PRAKTIKUM PEMROGRAMAN KOMPUTER
Pengenalan C, mesin karakter, tabel dan pemrosesan, file, implementasi list, studi kasus list, studi
kasus stack dan queue, graf, rekursif, tugas besar.
CS2921/ PRAKTIKUM BASISDATA
Mata kuliah ini mempelajari dasar-dasar basis data relasional dan implementasinya dalam DBMS.
Materi mata kuliah ini mencakup: BASIS DATA RELASIONAL DAN DATA DEFINITION LANGUAGE,
DATA MANIPULATION LANGUAGE (Pengertian, Perintah-Perintah DML), QUERY (Operator query,
fungsi query, Aggregate Function, Join, Nested Query), PL / SQL, CURSOR, STORED PROGRAM,
PACKAGE, TRIGGER, dan CONNECTIVITY.
Pustaka:
1. Oracle 10G Documentation.
SE2423/ REKAYASA PERANGKAT LUNAK
Pengertian dan sejarah rekayasa perangkat lunak, paradigma dan metodologi yang terdapat dalam
rekayasa perangkat lunak, analisis dan desain terstruktur beserta alat bantu pemodelannya (Data
Flow Diagram, State Transition Diagram, Structure Chart, Kamus Data. Spesification Proccess, dan
sebagainya.), Teknik pengujian perangkat lunak, pemeliharaan serta dokumentasi.
Pustaka:
1. Pressman, Roger,. Software Engineering: A Practitioner's Approach, Fourth Edition,
McGraw-Hill, 1997.
2. Yourdon, E. Modern Structure Analysis, Prentice Hall Inc. 1989.
3. Sommerville, Ian., Software Engineering: (Update) (8th Edition) (International Computer
Science), Pearson, 2006.
CS2083/ DESAIN DAN ANALISIS ALGORITMA
Introduction to software engineering concepts: Top-down dan bottom-up programming,
Correctness proofs by induction, Transforming dan optimizing programs. Basic algorithmic analysis:
Asymptotic analysis of upper and average complexity bounds, Identifying differences among best,
average, and worst case behaviors, Big "O," little "o," omega, and theta notation, Using recurrence
relations, characteristic equation, and master theorem to analyze recursive algorithms. Algorithmic
strategies: Brute-force algorithms, Greedy algorithms, Divide-and-conquer, Backtracking, Branchand-bound,
Pattern matching. Fundamental computing algorithms: Sequential and binary search
algorithms, Quadratic sorting algorithm, O(N log N) sorting algorithms. Advanced algorithmic
analysis: Dynamic Programming.
Pustaka:
1. Levitin, Anany. Introduction to the design and analysis of algorithm. Addison Wesley. 2003
2. Neapolitan, Richard., Kumarss Naimipour. Foundations of algorithms. D.C Heath and
Company. 1996.
3. Cormen, T. H., C. E. Leiserson, R. L. Rivest, and Clifford Stein. Introduction to Algorithms,
2 nd edition .McGraw-Hill
CS3113/ TEORI KOMPUTASI
Teori himpunan, kardinalitas dan bahasa, ekspresi reguler, Finite Automata (NFA dan DFA):
perubahan, ekivalensi, dan minimalisasinya, Bahasa dan Grammar Context-Free dengan sifat dan
pembuktiannya, Parser, Pushdown Automata, Hirarki Chomsky, Mesin Turing Universal serta
Komputasi.
CS3243/ KECERDASAN MESIN DAN ARTIFISIAL
Pengantar AI, Uninformed search, informed search, constraint satisfaction problem, adversarial
search, logika proposisi, kalkulus predikat orde 1, sistem berbasis pengetahuan, logika fuzzy,
Bab III Silabi Mata Kuliah
147