Sidia is a education Platform website.
Course Description
This course uses the PJBL (Project Based Learning) method. Discusses theory, concepts and practice of basic programming. The material studied includes an introduction to algorithms, algorithmic notation, programming logic structures in the form of sequential, selection, repetition, getting to know searching and sorting methods and solving problems using programming algorithms. This course uses the PJBL (Project Based Learning) method. This course discusses the theory, concepts, and practice of basic programming. The material studied includes an introduction to algorithms, algorithmic notation, programming logic structures in the form of sequential, selection, iterative, familiar with searching and sorting methods and solving problems using programming algorithms.
Program Objectives (PO)
- C2. Mahasiswa mampu memahami konsep algoritma dan pemrograman. C2. Students are able to understand the concept of algorithms and programming.
- C3. Mahasiswa mampu merancang algoritma yang tepat untuk menyelesaikan masalah dengan menggunakan notasi algoritmik. C3. Students are able to design the right algorithm to solve problems using algorithmic notation.
- C3 Mahasiswa mampu mengaplikasikan algoritma dalam pemrograman. C3. Students are able to apply an algorithm to a program
Aktifitas Pembelajaran
-
Pertemuan 1 Dasar-dasar algoritma dan pemrograman. Student understand the basics of algorithms and programming -
Pertemuan 2 Mempelajari dan memahami penulisan notasi algoritmik Learn and understand writing algorithmic notation -
Pertemuan 3 Jenis-jenis tipe data dan operator, mengenal Variabel dan Fungsi, Input/Output dan File. Able to understand the types of data types and operators, Variables and Functions, Input/Output and Files. -
Pertemuan 4 Jenis-jenis tipe data dan operator, mengenal Variabel dan Fungsi, Input/Output dan File. Able to understand the types of data types and operators, Variables and Functions, Input/Output and Files. -
Pertemuan 5 Struktur logika dalam pemrograman sekuensial, seleksi dan pengulangan serta menerapkan dalam pseudicode atau bahasa pemrograman. Able to understand logical structures in sequential programming, selection, and looping -
Pertemuan 6 Struktur logika dalam pemrograman sekuensial, seleksi dan pengulangan serta menerapkan dalam pseudicode atau bahasa pemrograman. Able to understand logical structures in sequential programming, selection, and looping -
Pertemuan 7 Struktur logika dalam pemrograman sekuensial, seleksi dan pengulangan serta menerapkan dalam pseudicode atau bahasa pemrograman. Able to understand logical structures in sequential programming, selection, and looping -
Pertemuan 8 Ujian Tengah Semester Mid Term Exam -
Pertemuan 9 List, Dictionary, Turple dan Set. Mampu membuat Kelas dan Objek. Mampu membuat Fungsi Abke to understand List, Dictionary, Turple and Set. Able to develop Classes and Objects.Able to develop Function. -
Pertemuan 10 List, Dictionary, Turple dan Set. Mampu membuat Kelas dan Objek. Mampu membuat Fungsi Abke to understand List, Dictionary, Turple and Set. Able to develop Classes and Objects.Able to develop Function. -
Pertemuan 11 List, Dictionary, Turple dan Set. Mampu membuat Kelas dan Objek. Mampu membuat Fungsi Abke to understand List, Dictionary, Turple and Set. Able to develop Classes and Objects.Able to develop Function. -
Pertemuan 12 Dan mengaplikasikan pemrograman GUI. Mampu memahami dan mengaplikasikan konsep algoritma searching dan sorting, yaitu Linear dan Biner Searching, Bubble Sorting, Selection Sorting, dan Insertion Sorting. Able to understand and applied the concept of searching and sorting algorithms, namely Linear and Binary Searching, Bubble Sorting, Selection Sorting, and Insertion Sorting. -
Pertemuan 13 Dan mengaplikasikan pemrograman GUI. Mampu memahami dan mengaplikasikan konsep algoritma searching dan sorting, yaitu Linear dan Biner Searching, Bubble Sorting, Selection Sorting, dan Insertion Sorting. Able to understand and applied the concept of searching and sorting algorithms, namely Linear and Binary Searching, Bubble Sorting, Selection Sorting, and Insertion Sorting. -
Pertemuan 14 Dan mengaplikasikan pemrograman GUI. Mampu memahami dan mengaplikasikan konsep algoritma searching dan sorting, yaitu Linear dan Biner Searching, Bubble Sorting, Selection Sorting, dan Insertion Sorting. Able to understand and applied the concept of searching and sorting algorithms, namely Linear and Binary Searching, Bubble Sorting, Selection Sorting, and Insertion Sorting. -
Pertemuan 15 Dan mengaplikasikan pemrograman GUI. Mampu memahami dan mengaplikasikan konsep algoritma searching dan sorting, yaitu Linear dan Biner Searching, Bubble Sorting, Selection Sorting, dan Insertion Sorting. Able to understand and applied the concept of searching and sorting algorithms, namely Linear and Binary Searching, Bubble Sorting, Selection Sorting, and Insertion Sorting. -
Pertemuan 16 Ujian Akhir SemesterFinal Exam Semester
Lecturer
Difficult Things About Education.
$75$10
More Similar Courses
Related Courses
Ekonomi Koperasi
This course discusses the concept of cooperatives; history of Indonesian cooperatives; history of cooperatives in the world; cooperative organizations; type of cooperative; Cooperative capital and
Teori Belajar
Examining the nature of learning and learning in accordance with behaviorist, cognitivist, constructivist, humanistic/social theories, gestalt theory, quantum theory, brain base theory, multiple intelligence, and
Philosophy of Management
The Philosophy of Science course is a compulsory course with a weight of 2 credits, containing the study of ontology, epistemology and axiology of science
Copyright © 2024 Sinau Digital UNESA All Rights Reserved