The course aims to introduce the fundamentals of IT, of computers and their operation.
The course will explain the rudiments of basic programming. After completing this course the student knows the concepts of algorithm, program, information, know at the elementary level hardware structure of a computer, the structure of an operating system, the structure of a network, the structure of the Internet.
And 'able to read simple Programi written in C/C++ and is able to write simple programs if driven into the C/C++ language.
The course is not treated object-oriented programming.
Algorithms and Programs: Concepts to know and be able to solve a problem, interpreting a language, simple and complex problem, breaking down a problem into subproblems algorithm. Ownership of a performer.
Programming Languages: Syntax and semantic categories of instructions (input / output, arithmetic / logic control), operators, major constructs (if-then-else), variables and types of data elements.
Elements of information theory: Conditions for existence of information, concept code, syntactic semantic and pragmatic information, measurement information and the concept of bits, bytes and its multiples, the definition of entropy, binary data, representation of numbers under other than 10. Hardware structure of a computer: Machine Von Neumannm structure of the CPU (internal block diagram, with execution of an instruction fetch and execute phases), memory (structure, main memory and mass memory electronic, optical, magnetic, magneto- optic, flash, comparison in terms of access speed, capacity, volatility, cost per bit sequential access memories, random, mixed associations, block structure of an electronic memory, memory hierarchy), input / output ( hard disk, CD, CD-R, keyboard, video, mouse, printer interfacing the I / O mechanism breaks).
Operating Systems: Objectives, functions, and main components. Process management (queues ready, running, waiting), memory (cache, virtual memory), management of devices (interaction with heterogeneous devices, use of drivers), file system management (logical structure of a file system).
Computer Networks: Local networks and geographical links to circuit switching and packet switching, transmission ISDN, DSL, ATM, a modem function, topology (star, ring, bus) and communication (token ring, CSMA / CD) in a local network, network components (hubs, swithc, bridges, routers, gateways), IP address, symbolic function of the DNS.
The course is carried out in 42 hours of lectures divided into 14 classes of three hours each, and six hours laboratory divided into 3 sessions of 2 hours each. The theory lessons are deliberately dense and richer in content than stated in the training objectives. This is to address the fundamental issues with the highest number of examples as possible and to provide interested students the tools to more personal insights. The lessons of the laboratory is in the resolution of simple exercises on the Linux filesystem.
The exam is oral Informatics.
For admission consideration, students must pass a written tutorial that consists of 2-3 hours in test questions and multiple answers (each question can have more true answers and wrong answers penalize the score) and 2 / 3 open questions on the application of theory and on the laboratory. The tutorial written is passed if the student gets a score of at least 18/30.
At the exam the student may bring only pens and pencils (book or other script arent admitted).
At the oral exam the student may decide to exercise voting record or written to be reviewed by interview. In this case the final grade will be based purely on examination interview without taking any account of the outcome of the exercise in writing.
It 'may compel the interview of the teacher.