This document summarizes an undergraduate module in Programming II offered by Universitas Gadjah Mada. The module is 3 credit points and focuses on data structures, algorithms, and object-oriented programming. Students will learn to build various linear and non-linear data structures, implement searching and sorting algorithms, and develop object-oriented computer programs. Assessment is based on exams, assignments, and exercises evaluating students' understanding of topics like data structures, algorithms, and OOP. Recommended reading materials cover related programming concepts and examples in Java, C++, and other languages.
This document summarizes an undergraduate module in Programming II offered by Universitas Gadjah Mada. The module is 3 credit points and focuses on data structures, algorithms, and object-oriented programming. Students will learn to build various linear and non-linear data structures, implement searching and sorting algorithms, and develop object-oriented computer programs. Assessment is based on exams, assignments, and exercises evaluating students' understanding of topics like data structures, algorithms, and OOP. Recommended reading materials cover related programming concepts and examples in Java, C++, and other languages.
UNDERGRADUATE PROGRAM IN ELECTRONICS AND INSTRUMENTATION
DEPARTMENT OF COMPUTER SCIENCE AND ELECTRONICS
FACULTY OF MATHEMATICS AND NATURAL SCIENCES UNIVERSITAS GADJAH MADA
Module name Programming II
Module level Undergraduate Code MII-2201 Courses (if Programming II applicable) Semester Even Contact person Yohanes Suyanto, M.Ikom., Dr. Lecturer Yohanes Suyanto, M.Ikom., Dr.
Language Bahasa Indonesia
Relation to Undergraduate degree program; mandatory; 2nd, 4th, 6th, or 8th curriculum semester. Type of teaching, Undergraduate degree program: lectures, < 60 students, 180 contact hours minutes Workload 1. Lectures: 3 x 50 = 150 minutes (2 hours 30 minutes) per week. 2. Exercises and Assignments: 3 x 60 = 180 minutes (3 hours) per week. 3. Private study: 3 x 60 = 180 minutes (3 hours) per week. Credit points 3 credit points (cr). Requirements A student must have attended at least 75% of the lectures to sit in according to the the exams. examination regulations Recommended - prerequisites Learning outcomes After completing this module, a student is expected to: and their CO1 Have knowledge about the theories and concepts of PLO2 corresponding PLOs algorithms and data structures CO2 Be able to analyze, design, and implement linear PLO3 data structures such as linked-list, stack, and quee. CO3 Be able to analyze, design, and implement non- PLO3 linear data structures such as matrix, hash table, multiple linked-list, tree, and graph. CO4 Have knowledge about searching and sorting PLO3 algorithm and can implement it in computer program. CO5 Have knowledge about theory and concept of PLO2 object-oriented programming (OOP). CO6 Be able to build an OOP based computer program . PLO4
Content Programming II provides the knowledge and skills required for
students to be able to: Build data structures Design and implement searching and sorting algorithms Determine suitable data structures such that the computer program generated is structured and efficient.
In this Programming II course, it focuses on the data structure,
which discusses various data structures both linear and non-linear and looks at their strengths and weaknesses and discusses examples of problems, and also discusses the paradigm of object oriented programming (OOP). As new programming paradigm developed from derived data type facilities in structured programming, OOP provides an approach in making program design and development in the orientation of real entities found in the real world. Object oriented today is a choice of programming methods that are often used because the approach tends to be more descriptive and well organized. Therefore, OOP becomes a topic of discussion in the algorithm and data structure courses to provide the development of actual programming technology to students.. Study and Mid-terms examination and final examination. examination requirements and forms of examination Media employed LCD, whiteboard, websites, books (as references), etc. Assessments and CO1: Problem 1 in mid-term exam (5%) and exercise 1 (5%) - 10% Evaluation CO2: Problem 2 in mid-term exam (5%) , assignment 1 (5%), and exercise 2 (5%) - 15% CO3: Problem 3 in mid-term exam (10%); problem 1 in final exam (5%); assignment 2 (5%); and exercise 3 (5%) - 25% CO4: Problem 2 in final exam (5%) and exercise 4 (5%) - 10% CO5: Problem 3 in final exam (10%); assignment 3 (5%); and exercise 5 (5%) - 20% CO6: Problem 4 in final exam (15%) and exercise 6 (5%) - 20% Reading List WA: Data Structures and Algorithms in Java, Robert Lafore, Second Edition, SAMS Publishing, 2003 WB: Sams Teach Yourself Data Structures and Algorithms in 24 Hours, Robert Lafore, Sams Publishing, 1999 AA: Data Structures and Algorithms in C++, 2nd edition, Adam Drozdek, 2001 AB: John R. Hubbard, Schaum’s Outline of Theory and Problems of Programming with C++, Second Edition, Mc AC: Cay Horstmann, C++ for Everyone, John Wiley & Sons, 2008 AD: Tony Gaddis, Starting Out with C++: From Control Structures through Objects (6th Edition), Addison Wesley