Előfeltétel

nostrilswelderElectronics - Devices

Oct 10, 2013 (3 years and 10 months ago)

97 views

C
OURSE

T
YPE

C
ORE
C
OURSE OR
O
PTIONAL
C
OURSE

W
EEKLY
H
OURS

T
OTAL
H
OURS

I
NDIVIDUAL
W
ORKING
H
OURS

T
OTAL
W
ORKING
H
OURS

C
REDIT

C
ODE

N
AME




1

E
KT
D

38
2
-
2

Introduction to Algorithms

s

c


10

50

60

2


Precondition
:
XT
L

106
-
2 Infome
dia


Course Objectives and Topics:

The aim of this course is to introduce students to the world of algorithms and to enable them to use
a high
-
level
programming language
.

During the course students understand the different applications of modeling and specifying
problems and they use a high
-
level
programming language

for programming.


1.


Tools of
expressing algorithms
.
Thesis of
Böhm
-
Jacipini.
Control structures
.

2.


Different

tools of expressing common, mathematical and library algorithms
.

3.


Development and history of high
-
level programming languages.


4.


Framework of
Free Pascal.
Variable
,
type
,
atomic

statements
.

5.


Forks
.

6.


Loops
.

7.


Program
s for mathematical algorithms.


8.


D
ata structures
.

9.


Programming theorems
1.

Ordering values to sequences
.
Searches
.

10.


Programming theorems
2.
Ordering sequences to sequences
.
Selection
.

11.


Programming theorems
3.
Permutation of elements of sequences



ord敲s
.

ㄲ1


Programming theorems
4.
Perm
utation of elements of sequences



ord敲s
.


Evaluation
:

Classroom test


Course Language:
Hungarian


Tutor
:
Tömösközi Péter,
college assistant lecturer


Required Readings:

Számítástechnika feladatok 2000
-
ig. Szerkesztette: dr. Hetényi Pálné

Számítástechnik
a középfokon: Szerkesztette: dr. Hetényi Pálné