Mata Kuliah Computer Science (Tingkat 1)

Deskripsi

Kalkulus I

Subject:

1. Set: definition, algebraic operation, properties.
2. The system of real numbers: properties, inequality, absolute value.
3. Functions (one variable): understanding, algebraic operations, composition functions, inverse functions. Coordinate system and function graph.
4. Limit: understanding and properties, unidirectional limits, unlimited limits, natural numbers.
5. Continuity: understanding and the nature of continuity.
6. Derivatives: definition, traits, derivatives of compositional functions, inverse function derivatives, derivative function parameters, trigonometric function derivatives, cyclometric functions, hyperbolic functions, exponential functions, logarithmic functions, implicit function derivatives, logarithmic decreases, high-level derivatives . Geometrical / physical definition of the derivative.
7. Differential
8. Application of derivatives: maximum / minimum, up / down, convex / concave, stationary point, extreme function and extreme problems in everyday life.
9. Taylor / Mac Laurin series and its app.

Fisika Dasar I

1. Measurement and Magnitude of Physics
2. Kinematics
3. Dynamics I: The Concept of Style
4. Dynamics II: Business and Energy, Many Particle Systems
   
5. Dynamics of Stringent I: Torka and Moments of Inertia
6. Dynamic Strength II: Equilibrium of Rotation and Translations, Gravity, Fluid, Vibration, Waves
   
7. Temperature, Heat and Law of Thermodynamics I,
8. Entropy and the Law of Thermodynamics II

Kimia Dasar I

1. Introduction, Molecules, Ions and Chemical Formulas, Chemical Reactions;
2. Reactions in solution, Energy changes in chemical reactions;
3. Atomic Structure, Periodic Table;
4. Ionic Bond vs. Covalent bonding, Molecular Geometry and Covalent Bonding Model

Programming I

1. Understanding and components of computer programs, algorithms, data structures and programming languages ​​(1 week).
   
2. Stages of problem solving, structured programming concepts and presentation techniques algorithm (1 week).
   
3. Simple algorithm on single data, case study of prime checking, determining FPB & KPK and conversion of number system (2 weeks).
   
4. Introduction Data Structure and Language Programming C ++, Input / Output Statement Identifier / Identifier, Data Types, Operators (1 week).
   
5. Algorithm Structure / Computer Program, Runtunan, control statements Branching (repetition), nestednya (1 week,).
   
6. Data type array, Introduction and array declaration, Accessing data on array, Working with many arrays, 2D Matrices / arrays. Data type array (2 weeks).
   
7. Data record / struct type, Declaration struct, Access data record / struct (1 week).
   
8. Modular Programming / Subprogramming, Definition of subprogram / function, global and local variables, Formal and actual parameters, Recursive Definition, Recursive Subprogram (2 weeks).
   
9. Sorting and Searching, Methods of sorting data (isertion sort, selection sort, bubble sort, merge sort, quick sort), data search algorithm (linear search, binary search) (2 weeks).
10. Data type Pointer, dynamic data structure, pointer declaration, Use of pointer on linked list (1 week).

Kalkulus II

1. Indefinite integral: understanding, properties, integrating techniques.
   
2. Specific Integral: understanding, properties, Fundamental Theory of Calculus, changing variables. Integral is not fair.
   
3. Some examples of specific integral applications: flat area, rotary volume, arc length, swirl area, center of mass / center, Pappus-Guldin Theorem, moment of inertia, Parallel Axis Theorem.

Aljabar Linear Elementer

Systems of linear equations and solutions, Gauss-Jordan Elimination (Elementary Line Operations), matrix and matrix operations, matrix ratios, matrix operation properties; Inverse matrix, elementary matrix and inverse search method matrix; Types of matrices, Determinants: counting determinants using line reduction, Determinant Properties, Cofactor Expansion, Cramer Rules. Vectors in the Euclid Chamber, vector operation, norm, distance of two vectors, point product, projection, cross product in R3; The linear transformation of the Euclid Space, the properties of linear transformations; Subspaces, linear combinations, linearly independent, linearly independent, vector builders, bases, dimensions, eigenvalues, eigenvectors, characteristic spaces, diagonalizations.

Programming II

1. Introduction: Review Static and dynamic data structure, Abstract data type, linear linked list, Doubly linked list (1 week).
   
2. Data Structure Stack: Understanding, implentasi and examples of its use (1 week).
   
3. Data structure Queue: Understanding, implentasi and examples of its use (1 week).
   
4. Non-linear data structure: Matrix, sparse matrix, multiple linked list (2 weeks)
   
5. Data Tree structure: Understanding and terminology, binary search tree, AVL tree and Multiway Trees (2 weeks)
   
6. Introduction OOP: Needs development, Java History, OOP case example and OOP basic principle (1 week).
   
7. Understanding and implementation of instances in Java: Definition of class, Definition of attribute and method, Definition of instance / object (1 week).
   
8. Huffman coding: understanding, text data compression and implementation (1 week).
   
9. Graphs: understanding, graph representation, DFS and BFS (2 weeks).
   
10. Hashing: Hash table, hash function, Collision resolution and deletion (2 weeks).

Matematika Diskret

1. Technique of proof (proposition, verification with axiom, counterexample, evidence with contradiction, evidence with case analysis, principle of well-ordering) (1 week).
   
2. Set, line, and function (Venn diagram, set operations, cartesian product, power set, cardinality, line, formation of sequences, types of functions, inverse functions, composition, sequence, sum) (1 week) .
   
3. Math induction (simple induction, induction steps, strong induction) (1 week).
   
4. Introduction to number theory (partition, major alliance factor, fundamental theorem of number theory, modular arithmetic, arithmetic in any modulus, eg number theory application on RSA cryptographic algorithm) (2 weeks).
   
5. Graph (introduction to graph theory, non-directional graph, isomorphism, connectedness to graph, staining on graph, planar graph, Hall’s Marriage Theorem, tree, tracing tree, spanning tree, directed graph and its properties, acyclic directed graph, topological sorting, Lemma Dilworth) (2 weeks).
   
6. Relation and partial order (binary relation, relationship between binary and function relation, equivalence relation, partition, binary relation and directed graph) (1 week).
   
7. Summation, multiplication and asymptotics (sum and its solution forms, geometric sequences, geometric sums, infinite geometric sums, integral methods, use of integral methods to find closed-form shapes, double sums, Stirling approaches, and asymptotics notation and its use) (2 weeks).
   
8. Recurrence (common form, Towers of Hanoi, formation and completion of recurrence (merge sort), linear recurrence form, divide-and-conquer recurrence form) (2 weeks).
   
9. Algebraic system (associative, semi-group, monoid, inverse, group, abelian, subgroup, cyclic group, koset, permutation group, burnside, ring, integral domain, field, finite field) (2 weeks) .