Computer Science 1

2.1 Computer Science – Lecture Basics (a) – Repetition: Binary System

2.2 Computer Science – Lecture Basics (b) – Code Pages and Memory Structures

2.3 Computer Science – Lecture Basics (c) – Calculating with p-adic number representation

2.4 Computer Science – Lecture Basics (d) – Boolean Algebra and Propositional Logic Introduction

2.5 Computer Science – Lecture Basics (e) – Boolean Algebra – Laws

3.1 Computer Science Lecture Computer Organization (a) – Introduction to Computer Organization According to Von-Neumann and Turing

3.2 Computer Science Lecture Computer Organization (b) – Advanced Fundamentals of Computer Organization According to Von-Neumann, Components, Instruction Processing, etc.

4.5 (e) Computer Science Lecture RE Use Case Diagrams – Use Case Diagrams from UML Notation

6.1 Computer Science Lecture Programming Prologue – Introduction to general programming

6.2 Computer Science Lecture Programming Variables – Introduction to Variables in C

6.3 Programming C Syntax: P1 – C Syntax: Introduction, Statements, Expressions, and Data Types

6.4 Programming C Syntax: P2 – Introduction and overview of control structures in the C dialect

6.5 Programming C Syntax: P3 – Operators, Expressions, and the Preprocessor

6.6 Programming C Syntax: P4 – Arrays and Pointers

6.7 Programming C Syntax: P5 – Structures, Dynamic Variables, and Type Definitions

Prologue (I): Imperative statements

Prologue (II): Syntax in C: Syntax Check

Prologue (III): Simple Operations

Task 3: ASCII Table

Task 5: Divide & Conquer, Functions

Task 7: Vector calculations on structures

Special assignment: Area calculations