Kode Mata KuliahET1203 / 3 SKS
Penyelenggara181 - Teknik Telekomunikasi / STEI
KategoriKuliah
Bahasa IndonesiaEnglish
Nama Mata KuliahPemrogramanProgramming
Bahan Kajian
  1. Algoritma dan pemrograman
  2. Struktur data
  3. Desain Rekayasa
  4. Komunikasi lisan
  1. Algorithms and programming
  2. Data structure
  3. Engineering Design
  4. Verbal communication
Capaian Pembelajaran Mata Kuliah (CPMK)
  1. Kemampuan untuk menerapkan hubungan ilmiah dan matematis (prinsip atau hukum) dan masukan yang diperlukan untuk algoritma dan pemrograman
  2. Kemampuan menganalisis masalah / mengidentifikasi peluang untuk menghasilkan desain berdasarkan simulasi dan pemodelan di dalam batasan-batasan yang realistis.
  3. Kemampuan mengidentifikasi batasan untuk menghasilkan persyaratan desain pada simulasi dan pemodelan
  4. Kemampuan menggunakan alat yang tepat untuk menganalisis data dan memverifikasi data eksperimen berdasarkan simulasi dan pemodelan
  5. Kemampuan mengidentifikasi dan merumuskan permasalahan teknik mengenai struktur data
  6. Kemampuan menggunakan piranti teknik modern untuk menyelesaikan permasalahan teknik mengenai struktur data
  7. Kemampuan mempresentasikan ide secara efektif melalui penulisan teknik berkaitan dengan algoritma dan pemrograman
  1. An ability to apply knowledge of mathematics, natural and/or materials sciences, information technology and engineering to acquire comprehensive understanding of algorithm and programming
  2. An ability to analyze problems / identify opportunities to produce designs based on simulation and modeling within realistic constraints.
  3. An ability to identify constraints to generate design requirements in simulation and modeling
  4. An ability to use appropriate tools to analyze data and verify experimental data based on simulation and modeling
  5. An ability to identify and formulate technical problems regarding data structures
  6. An ability to use modern engineering tools to solve technical problems regarding data structures
  7. An ability to present ideas effectively through technical writing related to algorithms and programming
Metode PembelajaranCeramah Diskusi kelompok Pembelajaran berbasis Masalah/Studi KasusLecture Group discussion Problem/Case Study based learning
Modalitas PembelajaranLuring Sinkron Daring Asinkron BauranSynchronous Offline Asynchronous Online Hybrid
Jenis NilaiABCDE
Metode PenilaianKuis, UTS, UASQuiz, Midtest, Final Test
Catatan Tambahan1. Pendahuluan 2. Variabel, ekspresi, dan pernyataan 3. Fungsi 4. Kondisional dan rekursi 5. Fungsi yang menghasilkan hasil 6. Iterasi 7. String 8. Daftar (List) 9. Kamus (Dictionary) 10. Tuple 11. File 12. Kelas dan objek 13. Kelas dan fungsi 14. Kelas dan metode 15. Pewarisan (Inheritance) 16. Debugging 17. Analisis algoritmaIntroduction: Program definitions, running Python,Arithmetic operators, Values and types, Formal and natural languages, Debugging; Variables, expressions and statements: Assignment statements, Variable names, Expressions and statements, Script mode, Order of operations, String operations, Comments Debugging; Functions: Function calls, Math Functions, Composition, Adding new functions, Definitions and uses, Flow of execution, Parameters and arguments, Variables and parameters are local, Stack diagrams, Fruitful functions and void functions, Why functions? ; Conditionals and recursion: Floor division and modulus, Boolean expressions, Logical operators, Conditional execution, Alternative execution, Chained conditionals, Nested conditionals, Recursion, Stack diagrams for recursive functions, Infinite recursion, Keyboard input; Fruitful functions: Return values, Incremental development, Composition, Boolean functions, More recursion, Leap of faith, One more example, Checking types; Iteration: Reassignment, Updating variables, The while statement break, Square roots, Algorithms; Strings: A string is a sequence, len, Traversal with a for loop, String slices, Strings are immutable, Searching, Looping and counting, String methods, The in operator, String comparison; Lists: A list is a sequence, Lists are mutable, Traversing a list, List operations, List slices, List methods, Map, filter and reduce Deleting elements, Lists and strings, Objects and values, Aliasing, List arguments; Dictionaries: A dictionary is a mapping, Dictionary as a collection of counters, Looping and dictionaries, Reverse lookup, Dictionaries and lists, Memos, Global variables; Tuples: Tuples are immutable, Tuple assignment, Tuples as return values, Variable-length argument tuples, Lists and tuples, Dictionaries and tuples, Sequences of sequences; Files: Persistence, Reading and writing, Format operator, Filenames and paths, Catching exceptions, Databases, Pickling, Pipes, Writing modules; Classes and Objects: Programmer-defined types, Attributes, Rectangles, Instances as return values, Objects are mutable, Copying; Classes and functions: Time, Pure functions, Modifiers, Prototyping versus planning ; Classes and methods: Object-oriented features, Printing objects, The init method, The __str__ method, Operator overloading, Type-based dispatch, Polymorphism, Debugging, Interface and implementation ; Inheritance: Card objects, Class attributes, Comparing cards, Decks, Printing the deck, Add, remove, shuffle and sort, Inheritance, Class diagrams, Debugging, Data encapsulation ; Debugging: Syntax errors, Runtime errors, Semantic errors ; Analysis of Algorithm : Order of growth, Analysis of basic Python operations, Analysis of search algorithms, Hashtables