Algorithms and Programming Course code: 117001 | 5 ECTS credits

Basic information
Level of Studies: Undergraduate applied studies
Year of Study: 1
Semester: 2
Requirements:
Goal: Introducing students to the essential features of data structures and algorithms, with methods for creating and presentation of algorithms and enables them to algorithmically solve problems from the engineering profession, as well as to independently construct, represent and test the algorithm. Enabling students to master problem analysis methodology, program design, principles of modular programming, and writing programs using the basic elements of the programming language C.
Outcome: The student will be able to independently solve problems and tasks with the help of computers, analysis, and by presenting a solution to a problem in the form of an algorithm, as well as by applying appropriate structures data to solve the problem. Students are trained to with the help of a modern development environment design, write and test programs in the C programming language, as well as to apply the acquired knowledge to other professional subjects.
Contents of the course
Theoretical instruction:
  1. Development, classification, and chronology of the origin of important programming languages
  2. Algorithms: concept, meaning, and definition
  3. Data structures
  4. Basic elements of structural programming language
  5. The notion of a variable, the notion of a constant, the notion of an operator.
  6. Functions and procedures from libraries
  7. Subroutines
  8. One-dimensional and multidimensional numerical sequences
  9. Pointers and application of pointers
  10. Syllables: definition and processing
  11. Checking the correctness of the program: testing the program, selection of adequate test examples
Practical instruction (Problem solving sessions/Lab work/Practical training):
  1. Practical classes follow theoretical units by solving specific examples and tasks. Includes analysis examples of programs that solve various tasks and problems, as well as independent problem solving using the language C.
Textbooks and References
  1. Jovanović, D., „Uvod u Algoritme“, Akademska izdanja, Beograd 2004
  2. Živković, D., „Uvod u algoritme i strukture podataka“, Univerzitet Singidunum, Beograd, 2013
  3. Jovanović, D., „Autorizovana predavanja i primeri sa vežbi“, VŽŠSS, Beograd, 2015
  4. Kraus, L., „Programski jezik S sa rešenim zadacima“, Akademska misao, Beograd, 2012
  5. Đenić, S., „Osnovi programiranja na jeziku S, zbirka primera i zadataka za laboratorijske vežbe iz predmeta Programiranje 1“, Visoka škola elektrotehnike i računarstva, Beograd, 2013.
Number of active classes (weekly)
Lectures: 2
Practical classes: 2
Other types of classes: 0
Grading (maximum number of points: 100)
Pre-exam obligations
Points
activities during lectures
0
activities on practial excersises
0
seminary work
0
colloquium
0
Final exam
Points
Written exam
0
Oral exam
0