Logo ČVUT
Loading...
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2011/2012

Programming and Algorithmics 1

Login to KOS for course enrollment Display time-table
Code Completion Credits Range Language
BI-PA1 Z,ZK 6 2+2+2 Czech
Lecturer:
Miroslav Balík (gar.), Josef Vogel
Tutor:
Miroslav Balík (gar.), Jiří Dostál, Filip Havlíček, Jiří Hunka, Vojtěch Jirkovský, Mikuláš Krupička, Michal Máca, Radek Malinský, Radomír Polách, Radek Richtr, Miroslav Sikora, Tomáš Srna, Martin Šlapák, Ladislav Vagner, Josef Vogel, Jakub Zahradník
Supervisor:
Department of Computer Science
Synopsis:

Students gain the ability to formulate algorithms for solving basic problems and write them in the C language. They understand data types (simple, structured, pointers), expressions, statements, functions, concept of recursion. They learn to analyse simple cases of algorithm complexity. They know fundamental algorithms for searching, sorting, and manipulating with linked lists.

Requirements:

None.

Syllabus of lectures:

1. Algorithm, program, programming languages. Development environments.

2. Variables, assignment statement, input and output for integer data types.

3. Data types for real numbers. Expressions.

4. Control structures, branching, cycles.

5. Functions, input/output parameters.

6. Decomposition of a problem into subproblems, recursion.

7. Arrays, strings.

8. Pointers, dynamic variables.

9. Files.

10. Complexity of algorithms, sorting and searching.

11. Structures, structured files.

12. Linked lists.

13. Modular programming, other features of C.

Syllabus of tutorials:

1. Numeral systems, conversions. Bit, byte, word, double word. Development environments.

2. Integer types, variables, assignments, I/O. Displaying integers, twos complement code.

3. Real data types. Displaying floating-point numbers. Expressions.

4. Conditional statements.

5. Cycles, processing sequences.

6. Functions.

7. Recursive functions.

8. Arrays and strings.

9. Pointers and dynamic variables.

10. Files.

11. Complexity of algorithms, examples of algorithms with various complexities.

12. Structures, structured files.

13. Linked lists.

14. Reserved.

Study Objective:

The module provides fundamental algorithmics and procedural programming skills that are crucial for further studying.

Study materials:

1.

2.

Note:
Time-table for winter semester 2011/2012:
06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon
roomT9:107
Vogel J.
12:45–14:15
(lecture parallel2
parallel nr.201)

Dejvice
Posluchárna
roomTK:PU1
Malinský R.
14:30–16:00
(lecture parallel2
parallel nr.201)

Dejvice
NTK PU 1
roomTK:PU1
Malinský R.
16:15–17:45
(lecture parallel2
parallel nr.201)

Dejvice
NTK PU 1
roomTK:PU1
Malinský R.
18:00–19:30
(lecture parallel2
parallel nr.201)

Dejvice
NTK PU 1
roomTK:PU2
Šlapák M.
14:30–16:00
(lecture parallel2
parallel nr.201)

Dejvice
NTK PU 2
roomTK:PU2
Šlapák M.
16:15–17:45
(lecture parallel2
parallel nr.201)

Dejvice
NTK PU 2
roomTK:PU2
Havlíček F.
18:00–19:30
(lecture parallel2
parallel nr.202)

Dejvice
NTK PU 2
roomT9:107
Vogel J.
14:30–16:00
(lecture parallel2
parallel nr.202)

Dejvice
Posluchárna
Tue
roomT9:155
Vagner L.
07:30–09:00
(lecture parallel1
parallel nr.103)

Dejvice
Posluchárna
roomTK:PU1
Srna T.
09:15–10:45
(lecture parallel1
parallel nr.101)

Dejvice
NTK PU 1
roomTK:PU1
Krupička M.
11:00–12:30
(lecture parallel1
parallel nr.101)

Dejvice
NTK PU 1
roomTK:PU1
Krupička M.
12:45–14:15
(lecture parallel1
parallel nr.102)

Dejvice
NTK PU 1
roomTK:PU2
Dostál J.
09:15–10:45
(lecture parallel1
parallel nr.101)

Dejvice
NTK PU 2
roomTK:PU2
Dostál J.
11:00–12:30
(lecture parallel1
parallel nr.101)

Dejvice
NTK PU 2
roomTK:PU2
Richtr R.
12:45–14:15
(lecture parallel1
parallel nr.102)

Dejvice
NTK PU 2
Fri
roomT9:105
Balík M.
11:00–12:30
(lecture parallel1)
Dejvice
Posluchárna
roomT2:E1-8
Balík M.
14:30–16:00
(lecture parallel1
parallel nr.102)

Dejvice haly
Počítačová učebna
roomT2:E1-8
Balík M.
16:15–17:45
(lecture parallel2
parallel nr.203)

Dejvice haly
Počítačová učebna
Thu
roomTK:PU1
Hunka J.
12:45–14:15
(lecture parallel2
parallel nr.203)

Dejvice
NTK PU 1
roomTK:PU1
Hunka J.
14:30–16:00
(lecture parallel1
parallel nr.102)

Dejvice
NTK PU 1
roomTK:PU1
Hunka J.
16:15–17:45
(lecture parallel1
parallel nr.103)

Dejvice
NTK PU 1
roomTK:PU1
Hunka J.
18:00–19:30
(lecture parallel2
parallel nr.202)

Dejvice
NTK PU 1
roomTK:PU2
Zahradník J.
12:45–14:15
(lecture parallel2
parallel nr.203)

Dejvice
NTK PU 2
roomTK:PU2
Zahradník J.
14:30–16:00
(lecture parallel1
parallel nr.102)

Dejvice
NTK PU 2
roomTK:PU2
Máca M.
16:15–17:45
(lecture parallel2
parallel nr.203)

Dejvice
NTK PU 2
roomTK:PU2
Máca M.
18:00–19:30
(lecture parallel2
parallel nr.202)

Dejvice
NTK PU 2
roomT9:105
Vogel J.
14:30–16:00
(lecture parallel2)
Dejvice
Posluchárna
Fri
roomT9:155
Vagner L.
07:30–09:00
(lecture parallel1
parallel nr.101)

Dejvice
Posluchárna
roomT9:155
Vagner L.
09:15–10:45
(lecture parallel1
parallel nr.102)

Dejvice
Posluchárna
roomTK:PU1
Jirkovský V.
11:00–12:30
(lecture parallel2
parallel nr.202)

Dejvice
NTK PU 1
roomTK:PU1
Jirkovský V.
12:45–14:15
(lecture parallel1
parallel nr.101)

Dejvice
NTK PU 1
roomTK:PU1
Jirkovský V.
15:15–17:00
(lecture parallel1
parallel nr.103)

Dejvice
NTK PU 1
roomTK:PU1
Sikora M.
07:30–09:00
(lecture parallel1
parallel nr.103)

Dejvice
NTK PU 1
roomTK:PU1
Richtr R.
09:15–10:45
(lecture parallel2
parallel nr.203)

Dejvice
NTK PU 1
roomTK:PU2
Polách R.
11:00–12:30
(lecture parallel2
parallel nr.202)

Dejvice
NTK PU 2
roomTK:PU2
Polách R.
12:45–14:15
(lecture parallel1
parallel nr.102)

Dejvice
NTK PU 2
roomTK:PU2
Polách R.
15:15–17:00
(lecture parallel1
parallel nr.103)

Dejvice
NTK PU 2
roomTK:PU2
Richtr R.
07:30–09:00
(lecture parallel1
parallel nr.103)

Dejvice
NTK PU 2
roomTK:PU2
Polách R.
09:15–10:45
(lecture parallel2
parallel nr.203)

Dejvice
NTK PU 2
roomT9:155
Vogel J.
11:00–12:30
(lecture parallel2
parallel nr.203)

Dejvice
Posluchárna
Time-table for summer semester 2011/2012:
Time-table is not available yet
The course is a part of the following study plans:
Generated on 2012-7-9
For updated information see http://bilakniha.cvut.cz/en/predmet1121506.html