Bobot sks:

3

Semester:

4

Unit Penanggung Jawab:

Prodi S1 Teknik Elektro

Sifat:

Wajib

1. Focus on teaching you the C programming language while emphasizing problem solving techniques and software engineering skills that are applicable in a wide variety of fields.
2. Provide students with the necessary skills to solve a variety of engineering and programming problems as needed throughout their undergraduate work.

1. Identify some contributors to programming fundamentals and relate their achievements to the knowledge area.
2. Define the meaning of algorithm and data structure.
3. Know the reasons that a way to solve problems is by using algorithms.
4. Distinguish the difference between a stack and a queue.
5. Identify the difference between various programming paradigms.
6. Explain recursion and the way it works.

Variables, types, expressions, and assignment

Simple I/O

1. Analyze and explain the behavior of simple programs involving the fundamental programming constructs covered by this unit.
2. Write a program that uses basic computation and simple I/O.

1. Analyze and explain the behavior of simple programs involving the fundamental programming constructs covered by this unit.
2. Write a program that uses standard conditional.

Iterative control structures, Pointers

1. Analyze and explain the behavior of simple programs involving the fundamental programming constructs covered by this unit.
2. Write a program that uses iterative structures and pointers.

1. Analyze and explain the behavior of simple programs involving the fundamental programming constructs covered by this unit.
2. Write a program that uses procedure, functions, parameter passing, and File I/O.

Problem-solving strategies, Structured decomposition

Debugging strategies

1. Define the basic properties of an algorithm.
2. Develop algorithms for solving simple problems.
3. Use a suitable programming language to implement, test, and debug algorithms for solving simple problems.
4. Apply the techniques of structured decomposition to break a program into smaller pieces.

Arrays and Records

Strings and string processing

1. Identify data structures useful to represent specific types of information and discuss the tradeoffs among the different possibilities.
2. Write programs that use each of the following data structures: arrays, records, strings, linked lists, stacks, queues, and hash tables.

Data representation in memory

Static, stack, and heap allocation

Runtime storage management

Linked structures

1. Identify data structures useful to represent specific types of information and discuss the tradeoffs among the different possibilities.
2. Describe the way a computer allocates and represents these data structures in memory.

Implementation strategies for stacks, queues, and hash tables

Implementation strategies for graphs and trees

1. Identify data structures useful to represent specific types of information and discuss the tradeoffs among the different possibilities.

The concept of recursion

Recursive mathematical functions

Divide-and-conquer strategies

Recursive backtracking

1. Explain the concept of recursion.
2. Explain the structure of the divide-and-conquer approach.
3. Write, test, and debug simple recursive functions and procedures.
4. Describe how recursion can be implemented using a stack

Asymptotic analysis of upper and average complexity bounds

Identifying differences among best, average, and worst case behaviors

1. Determine the time complexity of simple algorithms.
2. Deduce the recurrence relations that describe the time complexity of recursively-defined algorithms, and solve simple recurrence relations.

Big “O,” little “o,” omega, and theta notation

Empirical measurements of performance

Time and space tradeoffs in algorithms

Brute-force/exhaustive search algorithms

Greedy algorithms

Divide-and-conquer

Backtracking

Sequential and binary search algorithms

Sorting algorithms

Hash tables

Binary search trees

1. Solve problems using efficient sorting algorithms, and fundamental graph algorithms, including depth-first and breadth-first search, single-source and all-pairs shortest paths, transitive closure, topological sort, and at least one minimum spanning tree algorithm.
2. Demonstrate the following abilities: to evaluate algorithms, to select from a range of possible options, to provide justification for that selection, and to implement the algorithm in simple programming contexts

1. Discuss the concept of parallel processing beyond the classical von Neumann model.
2. Describe alternative architectures such as SIMD, MIMD, and VLIW.
3. Explain the concept of interconnection networks and characterize different approaches.
4. Discuss the special concerns that multiprocessing systems present with respect to memory management and describe how these are addressed.
5. Explain the distributed paradigm.
6. Explain one simple distributed algorithm
7. Explain the various method of communication method for data movement with a specific topology
8. Understand the types of problem can be parallelize and the limit of performance gain
9. Write a program that uses all programming concept of MPI, OpenMP, and CUDA.