Poll

No polls currently selected on this page!

Repository

Repository is empty

Introduction to Computer Science

Code: 38077
ECTS: 6.0
Lecturers in charge: doc. dr. sc. Andrej Novak
Take exam: Studomat
Load:

1. komponenta

Lecture typeTotal
Lectures 30
Exercises 15
Laboratory exercises 30
* Load is given in academic hour (1 academic hour = 45 minutes)
Description:
COURSE GOALS: Acquire knowledge about computer hardware, operating systems and other software. Acquire operational knowledge of the basic principles of how computer operates (data storage and manipulation). Acquire knowledge and understanding of basic techniques for design and analysis of algorithms.

LEARNING OUTCOMES AT THE LEVEL OF THE PROGRAMME:

1. KNOWLEDGE AND UNDERSTANDING
1.3. demonstrate a thorough knowledge and understanding of basic concepts in techniques
1.4. demonstrate a thorough knowledge and understanding of basic concepts in information and communication technology
2. APPLYING KNOWLEDGE AND UNDERSTANDING
2.2. identify and describe important aspects of techniques and their applications
2.3. recognize and follow the logic of arguments, evaluate the adequacy of arguments and construct well supported arguments
2.4. use mathematical methods to solve standard physics problems

LEARNING OUTCOMES SPECIFIC FOR THE COURSE:
Upon passing the course on Introduction to computer science, the student will be able to:
1.define basic parts of the machine architecture ( RAM, ROM, CPU, mass storage, U/I units)
2.demonstrate knowledge of data encoding , data storage and data manipulation (binary systems, arithmetic/logic Instructions, storing integers and fractions)
3.demonstrate knowledge of the basic functional principles of machine parts
4.demonstrate knowledge of the role and meaning of the operating systems and internet protocols
5.demonstrate knowledge of the machine language and program execution
6.demonstrate knowledge of the network fundamentals
7.demonstrate working knowledge of UNIX OS
8.create and analyze simple algorithms which include iterative, recursive and branching structures
9.create and analyze solutions for simple mathematical and physical problems using C programming language.

COURSE DESCRIPTION:
1. week: introduction to unix OS, basic commannds and unix file sistem
2. week: Boolean operations, gates and flip-flops, bits and their storage, hexadecimal notation
3. week: main memory (RAM), memory organization and capacity, mass storage
4. week: the binary system, storing integers and fractions, representing text, images and sound, data compression
5. week: CPU basics, the stored-program concept
6. week: machine language, the instruction repertoire, program execution, an illustrative machine language
7. week: programs versus data, arithmetic/logic instructions in machine language
8. week: computer architecture, the role of controllers, direct memory access, communication, pipelining, multiprocessor machines
9. week: operating systems, architecture and components, a software survey, the concept of a process and administration, computer protection
10. week: network fundamentals, architecture, internet protocols, internet addressing, software
11. week: web implementation, html, xml, protection and cures
12. week: algorithms, rewiev, concepts and definition, pseudocode, the art of problem solving
13. week: iterative and recursive structures
14. week: computer science skills and mathematical/physical problem-solving ability
15. week: review and discussion

REQUIREMENTS FOR STUDENTS:
Students must attend 75% of the lectures and practical exercises. During the practical exercises students work in computer laboratories on the given assignments. These assignments consist of practical problems, which students solve in small groups. All students must deliver at least 10 written reports. In addition, students must attend two written midterm exams.

GRADING AND ASSESSING THE WORK OF STUDENTS:
Grading and assessing the work of students during the semester:
* students deliver at least 10 written reports on their projects
* there are two mid-term written exams
Grading after the semester:
* final written and oral exam

Contributions to the final grade:
* 40% of the grade are carried by the results of the written reports (students who fail to deliver at least 10 reports must repeat the course),
* 30% + 30% of the grade are carried by the results of the two mid-term exams (students who fail to complete a 40% of each exam must attend the final written exam to pass the course),
* oral exam is only for students who want to raise a grade.
Literature:
  1. Computer Science, an overview (J. Glenn Brookshear)
  2. Experiments in computer science, A C Laboratory Manual to Accompany (J. Jung)
1. semester
Mandatory course - Regular study - Physics and Technology Education
Consultations schedule: