01 Intro+algorithms

Agenda
Introduction
The idea of algorithm
Notation
Examples of algorithms
Theory of computer science

Algorithms
Alina MOMOT
alina.momot@polsl.pl
Alina MOMOT Algorithms

Agenda
Introduction
Notation
Agenda
1 Introduction
The aim of the lecture
The lecture topics
Literature
Structure of the course
2 The idea of algorithm
Introduction
Denition of algorithm
3 Notation
Flowcharts
PseudoC notation conventions
4 Examples of algorithms
Determination the sum of sequence elements
Determination the minimum of sequence elements
Determination of GCD
Agenda The aim of the lecture
Introduction The lecture topics
The idea of algorithm Literature
Notation Structure of the course
The aim of the lecture
Understanding the basic concepts and problems of computer science

Base for other lectures, including:
Algorithms and Data Structures
Operating Systems
Computer Architecture
Assembler Programming Languages
Fundamentals of Database Systems
Computer Network

The lecture topics

The concept of the algorithm
serial and parallel implementation, time and memory complexity
The operating system and its tasks
synchronization and communication between processes, semaphores
Computer design elements
gates, registers, buses, memory, the arithmetic and logic unit
Machine W design and implementation
The interrupt system, Input/Output system, DMA
Programming languages
machine code, assembly language, higher level languages, compilers
Turing machine
Formal grammars, inx notation and reverse Polish notation
Data access methods: B-tree, hashing functions
Statistical model of computer as a service station (M/M/1)
New trends in computer science
Literature
Andrew S. Tanenbaum, Todd Austin: Structured Computer

Organization. Pearson, 2013
John L. Hennessy, David A. Patterson: Computer Architecture, A
Quantitative Approach. Morgan Kaufmann, 2012
Allen B. Downey: The Little Book of Semaphores, 2016
In Polish
Wykªady z Podstaw Informatyki profesora Stefana W¦grzyna. Skrypt

uczelniany Politechniki l¡skiej nr 1812
Zbiór zada« z Podstaw Informatyki. Praca zbiorowa pod redakcj¡

Stanisªawa Kozielskiego. Skrypt uczelniany Politechniki l¡skiej nr 1459

Lecture
Classes
Laboratory
Exam
Semester 1: 2/2/2/E (6)

Semester 2: 1/1/-/- (2)

Lecture
Classes
Laboratory
Exam
Semester 1: 2/2/2/E (6)

Semester 2: 1/1/-/- (2)

Lecture
Classes
Laboratory
Exam
Semester 1: 2/2/2/E (6)

Semester 2: 1/1/-/- (2)

Conditions for passing the course

Final evaluation:
Semester 1: weighted average according to the formula
final _grade = 0.15gradeclasses + 0.15gradelab + 0.7gradeexam
where
4gradeexam_tasks + 3gradeexam_teory
gradeexam =
7
Semester 2: final _grade = gradeclasses
The possibility of obtaining nal grade without writing exam:
5.0, if grcl + grlab = 10
4.5, if grcl + grlab = 9, 5
Conditions for passing the course

Final evaluation:
Semester 1: weighted average according to the formula
final _grade = 0.15gradeclasses + 0.15gradelab + 0.7gradeexam
where
4gradeexam_tasks + 3gradeexam_teory
gradeexam =
7
Semester 2: final _grade = gradeclasses
The possibility of obtaining nal grade without writing exam:
4.5, if grcl + grlab = 9, 5
Agenda
Introduction Introduction
The idea of algorithm Denition of algorithm
Notation
Basic concept in computer science

Specication of actions to achieve a certain goal
First algorithm: GCD (greatest common divisor) by Euclid described
in Elements (c. 300 BC)
The term derives from the 9th century mathematician
Muhammad ibn Musa al'Khwarizmi, latinized 'Algoritmi'
(He gave the rules of algebraic operations on decimal numbers)

Agenda
Notation
Algorithm
A set of rules that precisely denes a sequence of operations
for solving a class of problems.
Features of the algorithm:

1 generality (algorithm solves a class of problems)
2 niteness (number of steps is nite)
3 deniteness (all successive states are well-dened)
4 complexity (measure of eciency)

Agenda
Notation
Algorithm
A set of rules that precisely denes a sequence of operations
for solving a class of problems.
Features of the algorithm:

1 generality (algorithm solves a class of problems)
2 niteness (number of steps is nite)
3 deniteness (all successive states are well-dened)
4 complexity (measure of eciency)

Agenda
Introduction Flowcharts
The idea of algorithm PseudoC notation conventions
Notation
Introducion
Algorithms can be expressed in many kinds of notations, including

1 natural languages
2 mathematical functions, including recursion
e.g. let a b
(
a if b = 0
GCD(a, b) =
GCD(b, a mod b) if b 1
3 owcharts
4 pseudocode or programming languages (Pascal, C, Java, etc.)

Agenda
Notation
Building blocks
1 Terminal, i.e. Start, Stop

2 Input/Output, i.e. read, write
3 Process, e.g. z ← z + 1
4 Decision
5 Subprogram call, e.g. MAX(a,b)
6 On-page Connector (replace
long or confusing lines on a
owchart page)
7 O-page Connector (used when
the target is on another page)

Agenda
Notation
Declarations of variables and constants
1 type_of_data name_of_variable
2 const type_of_data name_of_constant = value
Data types:
basic: bool, char, int, oat
static one-dimensional array:
type_of_data name_of_array [number_of_elements]

Agenda
Notation
Declarations of variables and constants
1 type_of_data name_of_variable
2 const type_of_data name_of_constant = value
Data types:
basic: bool, char, int, oat
static one-dimensional array:
type_of_data name_of_array [number_of_elements]

Agenda
Notation
Basic statements
Assignment:
name_of_variable = expression;
(see also x+ = 1 or i + +)
Decision (branching ow control statement):
if (condition)
{sequence_of_statements}
else
(examples of conditions: a == 1 or a! = b )

Agenda
Notation
Iteration statements
Loop DO . . . WHILE
Loop WHILE
do
while (condition)
while (condition)
Loop FOR
for(variable_initialization; condition; modication)

Agenda
Notation
Loop DO . . . WHILE
Loop WHILE
do
while (condition)
while (condition)
Loop FOR

Agenda
Notation
Loop DO . . . WHILE
Loop WHILE
do
while (condition)
while (condition)
Loop FOR

Agenda
Notation
Break and continue statements
Within loops it is possible to use break or continue statements:
break allows to exit a loop from any point within its body, bypassing its
normal termination expression
continue forces the next iteration of the loop to take place, skipping any
code in between itself and the test condition of the loop

Agenda
Notation
Functions
The fundamental modular units, designed to perform specic tasks.
FUNCTION
type_of_result name_of_function (parameter_list)
{
sequence_of_variable_declarations
sequence_of_statements
return expression; }
type_of_result: void or type_of_data
Return is optional statement which ends function's execution from any

point of its body.
Agenda
Introduction Determination the sum of sequence elements
The idea of algorithm Determination the minimum of sequence elements
Notation Determination of GCD
Formulation of the problem
Provide an algorithm for calculating the sum of the values of numbers in

a given sequence {xi } of known length N , i.e.
N
X
y= xi
i=1

Agenda
The algorithm written in natural language
1 Substitute y ← 0 and i ← 1, go to 2.
2 Substitute y ← y + xi , go to 3.
3 Check whether i = N . If TRUE, then END, else go to 4.
4 Substitute i ← i + 1, go to 2.
The given sequence {xi }: {4, 2, 5}, the known length N = 3

The current value of y:
The index of the current element i:
The current value of xi :

Agenda

The current value of y: 0
The index of the current element i: 1
The current value of xi : 4

Agenda


Agenda

i =1<3=N

Agenda


Agenda


Agenda

i =2<3=N

Agenda


Agenda


Agenda

i =3=3=N

Agenda
The algorithm written using owchart

Agenda
The algorithm written using pseudocode
Loop WHILE Loop DO. . . WHILE

y = 0; y = 0;
i = 1; i = 1; Loop FOR
while (i ¬ N ) do y = 0;
{ { for (i=1; i ¬ N ; i++)
y = y + xi ; y + = xi ; y + = xi ;
i = i + 1; i+ = 1;
} } while (i ¬ N )

Agenda

y = 0; y = 0;
{ { for (i=1; i ¬ N ; i++)
y = y + xi ; y + = xi ; y + = xi ;
i = i + 1; i+ = 1;
} } while (i ¬ N )

Agenda

y = 0; y = 0;
{ { for (i=1; i ¬ N ; i++)
y = y + xi ; y + = xi ; y + = xi ;
i = i + 1; i+ = 1;
} } while (i ¬ N )

Agenda
Provide an algorithm for calculating the minimum of the values of

numbers in a given sequence {xi } of known length N , i.e.
y = min{xi : i ∈ {1, 2, . . . , N}}

Agenda
1 Substitute i ← 1, go to 2.
2 Substitute y ← xi , go to 3.
5 Check whether xi < y . If TRUE, go to 2, else go to 3.

The current value of y:
The index of the current element i:
The current value of xi :

Agenda

The current value of y: ?

Agenda


Agenda

i =1<3=N
Agenda


Agenda

xi = 2 < 4 = y
Agenda


Agenda

i =2<3=N
Agenda


Agenda

xi = 5 > 2 = y
Agenda

i =3=3=N
Agenda

Agenda
Loop DO. . . WHILE

Loop WHILE
y = x1 ;
y = x1 ;
i = 2;
i = 2; Loop FOR
do
while (i ¬ N ) y = x1 ;
{
{ for (i=2; i ¬ N ; i++)
if (xi < y )
if (xi < y ) if (xi < y )
y = xi ;
y = xi ; y = xi ;
i+ = 1;
i = i + 1;
}
}
while (i ¬ N )

Agenda
Loop DO. . . WHILE

Loop WHILE
y = x1 ;
y = x1 ;
i = 2;
i = 2; Loop FOR
do
while (i ¬ N ) y = x1 ;
{
{ for (i=2; i ¬ N ; i++)
if (xi < y )
y = xi ;
y = xi ; y = xi ;
i+ = 1;
i = i + 1;
}
}
while (i ¬ N )

Agenda
Loop DO. . . WHILE

Loop WHILE
y = x1 ;
y = x1 ;
i = 2;
i = 2; Loop FOR
do
while (i ¬ N ) y = x1 ;
{
{ for (i=2; i ¬ N ; i++)
if (xi < y )
y = xi ;
y = xi ; y = xi ;
i+ = 1;
i = i + 1;
}
}
while (i ¬ N )

Agenda
Provide an algorithm for calculating the greatest common divisor of given

two positive numbers a and b, i.e.
y = GCD(a, b)

Agenda

Agenda
Loop WHILE
int GCD( int a, int b)
{
while (a != b)
{
if (a > b)
a -= b;
else
b -= a;
}
return a;
}

01 Intro+algorithms

Încărcat de

Informații document

Titlu original

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

01 Intro+algorithms

Încărcat de

Drepturi de autor:

Formate disponibile

Agenda

Theory of computer science

Alina MOMOT Algorithms

The aim of the lecture

Understanding the basic concepts and problems of computer science

Alina MOMOT Algorithms

The lecture topics

Andrew S. Tanenbaum, Todd Austin: Structured Computer

Wykªady z Podstaw Informatyki profesora Stefana W¦grzyna. Skrypt

Zbiór zada« z Podstaw Informatyki. Praca zbiorowa pod redakcj¡

Alina MOMOT Algorithms

Structure of the course

Semester 1: 2/2/2/E (6)

Alina MOMOT Algorithms

Structure of the course

Semester 1: 2/2/2/E (6)

Alina MOMOT Algorithms

Structure of the course

Semester 1: 2/2/2/E (6)

Alina MOMOT Algorithms

Conditions for passing the course

final _grade = 0.15gradeclasses + 0.15gradelab + 0.7gradeexam

Conditions for passing the course

final _grade = 0.15gradeclasses + 0.15gradelab + 0.7gradeexam

The idea of algorithm

Basic concept in computer science

Alina MOMOT Algorithms

Features of the algorithm:

Alina MOMOT Algorithms

Features of the algorithm:

Alina MOMOT Algorithms

Algorithms can be expressed in many kinds of notations, including

Alina MOMOT Algorithms

1 Terminal, i.e. Start, Stop

Alina MOMOT Algorithms

Declarations of variables and constants

Alina MOMOT Algorithms

Declarations of variables and constants

Alina MOMOT Algorithms

Alina MOMOT Algorithms

Alina MOMOT Algorithms

Alina MOMOT Algorithms

Alina MOMOT Algorithms

Break and continue statements

Within loops it is possible to use break or continue statements:

Alina MOMOT Algorithms

type_of_result: void or type_of_data

Return is optional statement which ends function's execution from any

Formulation of the problem

Provide an algorithm for calculating the sum of the values of numbers in

Alina MOMOT Algorithms

The algorithm written in natural language

The given sequence {xi }: {4, 2, 5}, the known length N = 3

Alina MOMOT Algorithms

The algorithm written in natural language

The given sequence {xi }: {4, 2, 5}, the known length N = 3

Alina MOMOT Algorithms

The algorithm written in natural language

The given sequence {xi }: {4, 2, 5}, the known length N = 3

Alina MOMOT Algorithms

The algorithm written in natural language

The given sequence {xi }: {4, 2, 5}, the known length N = 3

Alina MOMOT Algorithms

The algorithm written using owchart

The algorithm written using owchart