SubjectsSubjects(version: 853)
Course, academic year 2019/2020
  
Programming and Algorithmics 1 - B500001
Title: Programování a algoritmizace 1
Guaranteed by: CTU in Prague, Faculty of Information Technology (500)
Actual: from 2019
Semester: winter
Points: winter s.:6
E-Credits: winter s.:6
Examination process: winter s.:
Hours per week, examination: winter s.:2/4 C+Ex [hours/week]
Capacity: unlimited / unlimited (unknown)
Min. number of students: unlimited
Language: Czech
Teaching methods: full-time
Level:  
For type: Bachelor's
Guarantor: Balík Miroslav Ing. Ph.D.
Vagner Ladislav Ing. Ph.D.
Interchangeability : N500002
Annotation -
Last update: Kubová Petra Ing. (02.01.2018)
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.
Aim of the course -
Last update: Kubová Petra Ing. (02.01.2018)

Students will be able to:

Understand fundamental algorithmics.

Use procedural programming skills that are crucial for further studying.

Literature -
Last update: Kubová Petra Ing. (02.01.2018)

R:Brassard, G., Bratley, P. ''Fundamentals of Algorithmics.'' Prentice Hall, 1995. ISBN 0133350681.

R:Sedgewick, R. ''Algorithms in C, Parts 1--5.'' Addison Wesley, 2001. ISBN 0201756080.

Learning resources -
Last update: Kubová Petra Ing. (02.01.2018)

https://edux.fit.cvut.cz/courses/BI-PA1/

(login necessary)

Syllabus -
Last update: Kubová Petra Ing. (02.01.2018)

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.

Entry requirements
Last update: Kubová Petra Ing. (02.01.2018)

none

Registration requirements - Czech
Last update: Kubová Petra Ing. (02.01.2018)

žádné

Course completion requirements - Czech
Last update: Svozil Daniel doc. Mgr. Ph.D. (07.02.2018)

Pro zı́skánı́ zápočtu je potřeba dostatek bodů z domácích úkolů a ze zápočtových testů. Zkouška se skládá z povinné pı́semné části (praktická a teoretická) a z volitelné ústnı́ části.

Teaching methods
Activity Credits Hours
Účast na přednáškách 1 28
Příprava na přednášky, semináře, laboratoře, exkurzi nebo praxi 0,5 14
Práce na individuálním projektu 2 56
Příprava na zkoušku a její absolvování 0,5 14
Účast na seminářích 2 56
6 / 6 168 / 168
Coursework assessment
Form Significance
Report from individual projects 20
Examination test 60
Continuous assessment of study performance and course -credit tests 20

 
VŠCHT Praha