Annotation

Students learn to construct 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 the basics of algorithm complexity analysis. They know fundamental algorithms for searching, sorting, and manipulating with linked lists.

Lecture Program

- Algorithm, program, programming languages. Development environments.
- Variables, assignment statement, input and output for integer data types.
- Data types for real numbers. Expressions.
- Control structures, branching, cycles.
- Functions, input/output parameters.
- Decomposition of a problem into subproblems, recursion.
- Arrays, strings.
- Pointers, dynamic variables.
- Files.
- Complexity of algorithms, sorting and searching.
- Structures, structured files.
- Linked lists.
- Modular programming, other features of C.

Labs Program

- Numeral systems, conversions. Bit, byte, word, double word. Development environments.
- Integer types, variables, assignments, I/O. Representation of integers, two’s complement code.
- Real data types. Representation of floating-point numbers. Expressions.
- Conditional statements.
- Cycles, processing of sequences.
- Functions.
- Recursive functions.
- Arrays and strings.
- Pointers and dynamic variables.
- Files.
- Complexity of algorithms, examples of algorithms with various complexities.
- Structures, structured files.
- Linked lists.

Last modified: 7.9.2010, 11:10