Type of course: |
Compulsory |
Language of instruction: |
Romanian |
Erasmus Language of instruction: |
English |
Name of lecturer: |
Corina Rotar |
Seminar tutor: |
Liana Luminiţa Boca |
Form of education |
Full-time |
Form of instruction: |
Class |
Number of teaching hours per semester: |
70 |
Number of teaching hours per week: |
5 |
Semester: |
Autumn |
Form of receiving a credit for a course: |
Grade |
Number of ECTS credits allocated |
5 |
Course aims:
• Develop algorithmic thinking and skills for developing complex algorithms
• Learning basic tools for developing fundamental algorithms.
• Knowledge of different types of fundamental algorithms and their development methods.
• Use of an advanced programming language for implementing the studied algorithms.
Course Entry Requirements:
Imperative and language programming
Course contents:
- Introduction to computer programming. Examples of computer programs.
- Information coding.
- Algorithms. Properties of algorithms. The description algorithms.
- Subalgorithms. Formal parameters, current parameters.
- Language description: C. Variables, predefined types.
- Syntactic units. Operations. Expressions.
- Instructions. The decisional instruction if.
- switch ... case instruction
- Repeated instructions. (while, do ... while, for).
- Arrays. Declaration and use of arrays.
- Pointers.
- Search methods.
- Sorting methods.
- Functions in C. Transmission of parameters.
- Recursion.
Teaching methods:
Lecture, conversation, exemplification, problem solving, documentation.
Learning outcomes:
• acquisition of basic and specific knowledge about the concept of fundamental algorithms; • the ability to identify the applicability of the studied algorithms in real problems; • understanding the need of using advanced methods to create efficient algorithms when addressing problems from an specific domain; • Acquiring advanced knowledge of algorithms complexity and apply efficient methods to solve different practical problems.
Learning outcomes verification and assessment criteria:
Written exams – 50%; Continuous assessment and laboratory practical works – 50%.
Recommended reading:
-,
• Adriana Bîrluțiu, Maria Muntean, Ovidiu Domsa, Fundamental Algorithms, Course notes and applications, Seria Didactică, 2015., -
, -
, -
, -
-,
• Cormen T.H., Leiserson E.C., Rivest R.R., Introduction in algorithms, MIT Press, 2001., -
, -
, -
, -
-,
• Dahl O.J., Dijkstra E.W., Hoare C.A.R., Structured Programing, Academic Press, 1972., -
, -
, -
, -