Courses

Computer Science

General

Course Contents

Theory

  1. The computer and its applications.
  2. Data storage in digital format.
  3. Numbering systems and operations.
  4. Fundamentals of digital design, gates, circuits.
  5. Computer architecture, Von Neuman model, technologies, progress and future issues.
  6. Algorithms – basic concepts.
  7. Presentation of algorithms, Sequence, selection.
  8. Basic repeating structures.
  9. Data structures, arrays, dynamic structures.
  10. Algorithms in one-dimensional arrays.
  11. Algorithms in two-dimensional arrays.
  12. Search and sort I.
  13. Dynamic data structures

Laboratory

The Laboratory part of the course generally follows the course of the theoretical part. During the first five weeks there is a complete introduction to office applications. From the 6th week onwards, the VBA programming language is used for the algorithmic part of the material.

Educational Goals

Computer science literacy is a top priority for the development of society. In recent years, considerable effort has been made in secondary education, albeit with mixed results. Students admitted to the Department of Economic Sciences have already acquired a good knowledge base from Secondary Education, at an initial – theoretical level. However, they present inhomogeneity in terms of practical knowledge and application in the subject of Information Technology.

The course includes an introduction to modern computer science. Hardware is presented, including data storage methods, digital design and architecture. In addition, there is an introduction to the study and development of algorithms with a real programming language (VBA). Finally, during the introductory exercises of the laboratory part of the course, an effort is made to acquire a common level of practical knowledge of handling the most important office applications, with an emphasis on word processing, spreadsheets, presentation software and their use in the cloud.

Upon successful completion of the course, students will be able to:

  • Describe and analyze the basic components of a computer.
  • Determine the usefulness and importance of each subsystem of the Computer.
  • Evaluate and be able to select the appropriate subsystem, conducting the appropriate cost/benefit discussion.
  • Evaluate and select appropriate peripherals for storage.
  • Explain at a basic level the digital way of processing data.
  • Be prepared for future hardware developments.
  • Identify, analyze and monitor the execution progress of an algorithm.
  • Apply appropriate algorithms for basic problems of searching, sorting and processing tables.
  • Investigate the needs of development and synthesis of algorithmic techniques for specific applications of their specialty.
  • Compose algorithms in a Programming Language in order to solve problems.
  • Review algorithmic techniques for similar problems.
  • Acquire the necessary skills to use and apply text writing and editing either locally or in the cloud. To acquire skills in the use and application of spreadsheets.

General Skills

  • Working independently.
  • Team work.
  • Decision-making.
  • Production of free, creative and inductive thinking.
  • Search for, analysis and synthesis of data and information, with the use of the necessary technology.

Teaching Methods

  • In the classroom, face to face.

Use of ICT means

  • Basic software (windows, word, power point, the web, etc.).
  • Support of learning process through the electronic platform / e-class.

Teaching Organization

ActivitySemester workload
Lectures26
Laboratory Practice Works26
Coursework Writing20
Independent Study53
Total125

Students Evaluation

Theory:
Written final exams (60%) that may include:

  • Judgemental questions.
  • Short answer questions.
  • Comparative evaluation of theory elements.
  • True/False and multiple choice Questions .
  • Application exercises.

In each question, corresponding evaluation points are specified.

The Laboratory part is checked on a weekly basis. Prepared assignments covering a specific part of the material each time are distributed and their correct execution is checked by all students. At the end of the semester, all students are tested in a laboratory examination (40% of the total grade).

Recommended Bibliography

  1. Β. Βράνα, Δ. Κύδρος, Εισαγωγικά θέματα πληροφορικής – Αλγοριθμικής, Εκδόσεις ΣΟΦΙΑ, Θεσ/νίκη, 2010
  2. Γ. Γιαγλής, Αρχές λειτουργίας και προγραμματισμού ηλεκτρονικών υπολογιστών, ΟΠΑ ΑΕ, 2012
  3. https://www.khanacademy.org/computing/computer-science