After passing this exam, student will be able to: 1. Create a C program that corresponds to a given algorithmic scheme. 2. Create a C program that includes the input, processing and printing of data. 3. Properly use the flow control structures in the C programming language (if selection, while and for loops). 4. Explain the difference between the basic algorithms for searching and sorting arrays. 5. Explain the characteristics of complex data types - lists, graphs and trees.
Name | Lectures | Exercises | Laboratory |
---|---|---|---|
DANILO PLANINIĆ | 2x1 1B+19S | ||
MILAN JOVANOVIĆ | 2x2 29B+19S | ||
SLAVKO KOVAČEVIĆ | 1x1 29B+19S+50P | 2x1 1B+19S | |
STEFAN VUJOVIĆ | 2x1 29B+19S+50P |