Presentation of methods to transport the algorithmic formulation of a problem in a programming language. The student needs to understand the entire process of the transformation of a problem from its original version to the final results, as well as be able to prepare comprehensive plans and manage the data of the problem. 

Description of the Course

Theory: Introductory Concepts. Programming Languages. Algorithms and Data Structures. Execution Algorithms and Compilers. Programming methodology. Planning and Evaluation.

Laboratory: Application of the programming language C: Simple data types, constants and variables, expressions, simple commands. Control structures, functions and procedures, parameter passing, repetition and recursion. Complex data structures and applications. Files. 

Expected Course Outcome

After the end of the course students will be able to: 

• Plan, implement, test, debug and document articulated programs by applying the programming methodology "software development cycle".
• Demonstrate skills in problem solving through a structured, procedural manner.
• Be able to use the high-level programming language C. 

Bibliography

Greek: 

1. Εισαγωγή στους Αλγορίθμους, Τόμος Ι, Τ. Cormen, E. Leiserson, L. Rivest, C. Stein, Παν/κές Εκδόσεις Κρήτης.
2. Αλγόριθμοι σε C, R. Sedgewick, Εκδόσεις Κλειδάριθμος, 2005.
3. Δομές δεδομένων, αλγόριθμοι, Μ. Λουκάκης, Εκδόσεις Σοφία, 2010.
4. Εισαγωγή στις δομές δεδομένων και στους αλγόριθμους, Ι. Παπουτσής, Εκδόσεις Σταμούλη, 2010.
5. Μαθαίνετε εύκολα C, Δ. Καρολίδης, Εκδόσεις ΚΑΡΟΛΙΔΗ, 2013.

English: