• The student gains an overview of basic work with a computer, especially, for what a computer is used and how it works.
• S/he gets to know key domains where a computer plays an irreplaceable role.
• S/he understands the meaning of a computer and its exploitation in order to build a software.
• S/he gets to know the basic (abstract) data types and structures.
• S/he gains the basic generic and general knowledge from programming languages domain.
• S/he understands the ways of numbers manipulation and representation in a computer (how a man and a computer work with numbers /usually different way/ and why there are some complications with real /floating point/ numbers).

This course takes place in the winter term of the first year of the bachelor's study program. Thus, we expect that students have the secondary school knowledge of mathematics and computer manoeuvring.

The course is running in the first half of the semester only by way of lectures (mandatory attendance), excercises and individual projects. 

• Evaluated individual assignments - up to 12 points
• Attendance list of classes - up to 18 points
• Final written test - up to 70 points

1. Presentation of areas and domains where computers are the key tool, von Neumann computer architecture, the model of computation/evaluation, the model of program development and implementation.
2. Representation and manipulation of numbers in a computer (the difference between viewing numbers as man and as a computer, problems in representation of fully floating point numbers in a computer).
3. Algorithms - basic terms, properties and notations for describing algorithms.
4. Problem-solving techniques. Design and implementation of algorithms.
5. Elementary terms used in programming languages: expression, statement, statement composition, control flow determination.
6. Elementary terms of algorithm description. Overview of data structures and their manipulation. Pointer as an abstract data type and its specification. Summary revision.

Student accomplishes the understanding of the basic principles of the work with a computer and s/he will be able to use this knowledge in the process of programs creation. The student will able to analyse and design simply algorithms. The student will understand the way of the saving and representation of numbers in a computer. 

Within this course, attendance on the lectures is monitored. The knowledge of students is examined by the active attending classes, individual assignments and by the final credit test. The attendance in PC labs is awarded points. A possibility of a substitute is by an individual task.

• Programme BIT Bachelor's 1 year of study, winter semester, elective
  
• Programme BIT Bachelor's 1 year of study, winter semester, elective
  

• Programme IT-BC-3 Bachelor's

  branch BIT , 1 year of study, winter semester, elective
  

• Programme VUB Bachelor's

  branch VU-D , 2 year of study, winter semester, elective
  branch VU-D , 2 year of study, winter semester, elective
  branch VU-IDT , 2 year of study, winter semester, elective
  branch VU-VT , 2 year of study, winter semester, elective
  branch VU-VT , 2 year of study, winter semester, elective
  branch VU-VT , 2 year of study, winter semester, elective
  branch VU-VT , 2 year of study, winter semester, elective
  branch VU-IDT , 2 year of study, winter semester, elective
  branch VU-IDT , 2 year of study, winter semester, elective
  branch VU-IDT , 2 year of study, winter semester, elective
  branch VU-IDT , 2 year of study, winter semester, elective
  branch VU-VT , 2 year of study, winter semester, elective
  branch VU-D , 2 year of study, winter semester, elective
  branch VU-VT , 2 year of study, winter semester, elective
  branch VU-IDT , 2 year of study, winter semester, elective
  branch VU-IDT , 2 year of study, winter semester, elective