Subjects

Your browser does not support JavaScript, or its support is disabled. Some features may not be available.

Introduction to Programming - N445078

Title:	Úvod do programování a algoritmů
Guaranteed by:	Department of Computing and Control Engineering (445)
Faculty:	Faculty of Chemical Engineering
Actual:	from 2019
Semester:	winter
Points:	winter s.:5
E-Credits:	winter s.:5
Examination process:	winter s.:
Hours per week, examination:	winter s.:1/3, C+Ex [HT]
Capacity:	unknown / unknown (unknown)
Min. number of students:	unlimited
State of the course:	cancelled
Language:	Czech
Teaching methods:	full-time
Level:

Guarantor:	Finkeová Jana Ing. CSc. Soušková Hana Ing. Ph.D.
Is interchangeable with:	B445014

Examination dates Schedule

Annotation -

The course focuses on programming in C# programming language. The course consists of standard programming techniques and algorithms that are often used in computer science with an emphasis on good knowledge, their evaluation in terms of time and memory consumption and the possibility of acceleration. The course includes techniques of error handling with exceptions.

Last update: TAJ445 (14.12.2013)

Literature -

R:Knuth D. E.,Art of Computer Programming,Volume 1: Fundamental Algorithms,Addison-Wesley Professional,1997,0201896834

R:Sharp J.,Microsoft Visual C# 2012 Step by Step,Microsoft Press,2012,0-7356-6801-9

Last update: TAJ445 (30.09.2013)

Requirements to the exam - Czech

A. Vypracování, prezentace a obhájení dvou projektů.

B. Úspěšné složení závěrečného testu.

C. Zkouška.

Last update: Finkeová Jana (08.11.2012)

Syllabus -

1. Programming, programming languages, history.

2. Data types, representation of numbers in a computer, an integer data type, floating-point numbers.

3. Variables, declaration of variables, operators, expressions, assignment statement.

4. Conditions, loops, arrays, how the program flow is controlled.

5. Static methods, declaration, overloading, recursion.

6. Error handling, runtime errors, exceptions.

7. Algorithms: Euclidean algorithm, sorting algorithms, binary search.

8. The complexity of algorithms.

9. Options acceleration algorithms.

10. Data structures.

11. Classes and objects.

12. Properties, methods, events.

13. Heredity.

14. Projects.

Last update: Finkeová Jana (11.07.2013)

Learning resources -

http://en.wikibooks.org/wiki/C_Sharp_Programming

Last update: Finkeová Jana (11.07.2013)

Learning outcomes -

Students will be able to:

Create their own programs

Program basic algorithms

Treat runtime errors

Communicate with the user

Evaluate the algorithm in terms of time and memory consumption

Last update: Finkeová Jana (11.07.2013)

Registration requirements -

none

Last update: Finkeová Jana (11.07.2013)

Teaching methods
	Activity	Credits	Hours
	Obhajoba individuálního projektu	0.5	14
	Účast na přednáškách	0.5	14
	Příprava na přednášky, semináře, laboratoře, exkurzi nebo praxi	0.5	14
	Práce na individuálním projektu	1	28
	Příprava na zkoušku a její absolvování	1	28
	Účast na seminářích	1.5	42
		5 / 5	140 / 140

Coursework assessment
Form	Significance
Regular attendance	20
Defense of an individual project	20
Report from individual projects	10
Examination test	25
Oral examination	25