1. komponenta

Lecture type	Total
Lectures	30
Exercises	30

* Load is given in academic hour (1 academic hour = 45 minutes)

COURSE AIMS AND OBJECTIVES: Advanced programming with C.

COURSE DESCRIPTION AND SYLLABUS:
1. Functions. Defining a function. Function prototypes. Passing arguments to a function. Variable arguments through pointers. Recursive functions. Recursive algorithms: Quicksort, Partitions, Towers of Hanoi.
2. Program structure. Storage classes. Global and local variables. Multifile programs and header files.
3. Arrays. Multidimensional arrays, definition and initialization. Passing multidimensional arrays to functions. Examples: matrices and operations on matrices.
4. Pointers. Operations on pointers. Passing pointers to functions. Pointers and arrays. Pointers and functions. Dynamic memory allocation. Strings and string functions. Command line arguments.
5. Structures and unions. Defining a structure. Structures and pointers. Unions.
6. Self-referential structures. Linked lists and binary trees. Operations on linked lists, insertion and deletion of elements. Insertion sort, merge, Mergesort.
7. Data files. Creating a data file. Opening and closing a data file. Formatted reading and writing. Unformatted data files, reading and writing. Sequential and direct access.
8. The C preprocessor. Symbol and macro definitions, parametrized macros. File inclusion. Conditional compilation.
9. Standard C library. A brief overview. Mathematical functions library. Sorting and searching. Time functions.

1. B. S. Gottfried: Theory and Problems of Programming with C, Schaum's outline series
2. B. W. Kernighan, D. M. Ritchie: The C Programming Language, 2nd edition
3. S. Prata: C Primer Plus, 4th edition

Enrollment :
Passed : Computer programming 1

Izborni predmet 2 - Regular study - Mathematics Education