Poll

No polls currently selected on this page!

Repository

Repository is empty

Computer programming 1

Code: 36933
ECTS: 5.0
Lecturers in charge: doc. dr. sc. Marko Horvat
doc. dr. sc. Matej Mihelčić
Lecturers: dr. sc. Karmen Grizelj - Exercises
Ivan Novak , mag. math. - Exercises
Bruno Predojević , mag. math. - Exercises
English level:

1,0,0

All teaching activities will be held in Croatian. However, foreign students in mixed groups will have the opportunity to attend additional office hours with the lecturer and teaching assistants in English to help master the course materials. Additionally, the lecturer will refer foreign students to the corresponding literature in English, as well as give them the possibility of taking the associated exams in English.
Load:

1. komponenta

Lecture typeTotal
Lectures 30
Exercises 30
* Load is given in academic hour (1 academic hour = 45 minutes)
Description:
COURSE AIMS AND OBJECTIVES: Introduction to computer science and algorithms, elementary programming with C.

COURSE DESCRIPTION AND SYLLABUS:
1. Introductory concepts. Algorithms - examples and properties. Number systems. Logic of propositions, operators, normal forms.
2. Computer architecture and principles. Input, output, memory and processor. Statements and their execution. Von Neumann's model.
3. Simple data types. Representation of integers and integer arithmetic. Floating point numbers, IEEE standard for representation and arithmetic. Rounding errors and examples.
4. Introduction to programming. Introduction to programming languages and programming in UNIX and Windows environments. Some simple C programs. Program structure and execution. Keywords and identifiers.
5. Simple data types in C. Simple constants and string constants. Variables. Declarations. Expressions. Simple statements.
6. Operators and expressions. Arithmetic operators. Relational and logical operators. Unary operators. Assignment operators. Operator precedence table.
7. Control statements. Branching: if-else and switch statements. Looping: for, while and do-while statements. Statements break and continue. The goto statement.
8. Elementary integer algorithms. Representation of a number in a given base. Extraction of digits, operations on digits. Euclid's algorithm.
9. Functions. A brief overview. Defining a function. Function prototypes. Passing arguments to a function. Recursive functions.
10. Data input and output. Functions getchar, putchar, gets, puts, scanf and printf.
11. Arrays. Onedimensional arrays in C, definition and initialization. Passing arrays to functions. Simple operations on arrays (minimal and maximal elements, arithmetic mean).
12. Searching and sorting. Sequential search. Binary search in a sorted array. Sorting by selection and Bubblesort. Complexity of searching and sorting algorithms.
Literature:
3. semester
Izborni predmet 1 - Regular study - Mathematics Education
Consultations schedule:

Content

Link to the course web page: https://web.math.pmf.unizg.hr/nastava/prog1/


News - Archive

Return

Results 0 - 0 of 0
Page 1 of 0
Results per page: 
No news!