SubjectsSubjects(version: 953)
Course, academic year 2019/2020
  
* - B50001
Title: *
Guaranteed by: CTU in Prague, Faculty of Information Technology (500)
Faculty: University of Chemistry and Technology, Prague
Actual: from 2019 to 2020
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 [HT]
Capacity: unknown / unknown (unknown)
Min. number of students: unlimited
State of the course: cancelled
Language: Czech
Teaching methods: full-time
Teaching methods: full-time
Level:  
Guarantor: Vagner Ladislav Ing. Ph.D.
Interchangeability : N500002
Examination dates   Schedule   
Annotation -
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.
Last update: Kubová Petra (02.01.2018)
Aim of the course -

Students will be able to:

Understand fundamental algorithmics.

Use procedural programming skills that are crucial for further studying.

Last update: Kubová Petra (02.01.2018)
Literature -

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.

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

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

(login necessary)

Last update: Kubová Petra (02.01.2018)
Syllabus -

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.

Last update: Kubová Petra (02.01.2018)
Entry requirements

none

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

žádné

Last update: Kubová Petra (02.01.2018)
 
VŠCHT Praha