Introduction to Computer Science


This course is an introduction to Computer Science. The structure and function of the electronic computer is presented. The course is also an introduction to computer programming using the language Fortran 90. The concept of Algorithms is also discussed. Emphasis is given in Mathematics applications.


Objectives

The aim of this course is the acquaintance of students with the basic concepts of Informatics and programming. After successfully attending the course the students are expected to: • Know the historical evolution of computation machines • Know the structure and functioning of the digital computer • Understand the functioning of basic computational units (e.g. addition, comparison, etc.) • Understand the differences among high level and low level programming languages • Understand the concept of Algorithm • Understand algorithms expressed in flow charts and pseudocode. • Develop algorithms for solving simple problems • Compose, compile and run programs in Fortran 90. • Αναπτύσσουν αλγορίθμους για την επίλυση απλών προβλημάτων. • Implement basic algorithms in Fortran 90. Create and call subprograms (functions and subroutines) • Evaluate the performance of basic algorithms.


Prerequisites

There are no prerequisite courses


Syllabus

• Introduction to Computer Science Historical review. Computation. • Numerical systems. Binary numerical system. Fixed point arithmetic and floating point arithmetic. • Boolean Algebra Basic digital design. • Structure and organization of the digital computer. Central processing unit, integrated circuits. Hardware and software. • Introduction to Fortran 90 Programming. High level and low level programming languages. Compilers. Expressions and commands, constants and variables. • Control structures Logical expressions. Conditional execution. • Iteration expressions Termination condition. • Algorithms Termination. Performance and correctness. • Procedures Functions and subroutines. Parameter passing. Scope of variables. • Arrays Searching and sorting. • Input/Output Files. Formatted and unformatted files. Sequential and random access.

COURSE DETAILS

Level:

Type:

Undergraduate

(A)


Instructors: Andreas Papasalouros
Department: Department of Mathematics - Track in Mathematics
Institution: Aegean University
Subject: Computer Science, Information Technology, Telecommunications
Rights: CC - Attribution-NonCommercial-NoDerivatives

Visit Course Page

SHARE THIS COURSE
RELATED COURSES