Computer Techniques I

Opublikowano: 04.04.2014 18:26

Subject name Computer Techniques I
Type of subject               Basic
Summary ECTS 5
Form of course 30h lecture, 30h laboratory
Lecturer                           Prof. Jerzy Pokojski, Ph.D., D.Sc.
A brief outline:
Lecture
  • Fundamental features of algorithms. Forms of  algorithms. Elementary examples. Variables. Data types and their representations. Arithmetic operators. Relational and logical operators. Functions. If statement. Basic algorithms.
  • Loop instructions. Function and structure of program. Basic algorithms.
  • Arrays and pointers.
  • Algorithms of simulation, algorithms of generation.
  • Files. Operations input/output. Algorithms based on geometric operations.
  • Structures. Data structures. Lists. Algorithms for selection problems.
  • Introduction to computer engineering. Characteristics of CAD systems. Geometric modeling.
  • Characteristics of CAE systems. Engineering problems’ modeling. Test I.
  • History of computer techniques. Elements of information theory, computer systems, operating systems. 
  • Mathematical algorithms. Numerical algorithms.
  • Algorithms for sorting. Algorithms based on iterations.
  • Data bases, fundamental concepts.
  • Data bases, process of development.
  • Object oriented programming, fundamentals. Declarative languages, basic concepts. Test II.
  • Resit.
Laboratory
  • Overview of the environment, the construction of the elementary program. Function main. Input and output statements.
  • Creating numerical algorithms.
  • Creating Algorithms of  conditional statements. Logical operators, sizeof operator
  • Creating Algorithms of  instructions cycle while ,   instructions cycle for, ,   instructions cycle do … while, Generate algorithms, Iterative algorithms.
  • Arithmetic calculations. Constants const, typdef statement, priorities and communications operators and type conversions (casting), mathematical functions, mathematical constants cmath library. Generate random numbers. The switch statement, nested loops, break and continue statements, goto information (not recommended!). Generating algorithms. Selection algorithms. 
  • Declarations and definitions of functions, function parameters, the arguments alleged. Global variables, variable automatic (local ), local variables static , namespaces , global static names (range between files ), Recursion. Iterative algorithms. hashing algorithms.
  • Dimensional arrays and multidimensional arrays, arrays as functions parameter. Sorting Algorithms . Algorithms for task selection. Iterative algorithms.
  • Pointers. Pointers as function parameter. Dynamic memory allocation: operators new, delete. Iterative algorithms.
  • The structures, unions and bit fields. Selection Algorithms.
  • Data Structures list, stack, queue, tree. Sorting Algorithms. Iterative algorithms.
  • Reading and writing files. Numerical algorithms.
  • Understanding the Windows Form, the concept of object properties, methods. Building form applications TextBox, Button. Software event handler.
  • Vector graphics. Simulation Algorithms. Geometric algorithms.