PC Seminar

• 12 hrs lectures
• 12 hrs pc labs
• 2 hrs projects

• 70 pts mid-term test (written part)
• 12 pts numeric exercises
• 18 pts projects

• 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).

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. 

After taking PC Seminar students will have a good grasp of the basic work with a computer from a view of the software creation. The knowledge can be used in various areas of IT domains. 

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.

volně dostupné

• Honzík, J., Hruška, T., Máčel, M.: Vybrané kapitoly z programovacích technik, Ed.stř. VUT Brno, 1991.
• BS ISO/IEC 9899:2011, Information technology. Programming languages. C, 2012, ISBN 978 0 580 80165 5.
• Cormen, T.H., Leiserson, Ch.E., Rivest, R.L.: Introduction to Algorithms.
• Cormen, T.H., Leiserson, Ch.E., Rivest, R.L.: Introduction to Algorithms.
• Prokop,J.: Algoritmy v jazyku C a C++. Grada Publishing, 2015.
• Aho A.V., Hoppcroft J.E., Ullman J.D.: Data Structures and Algorithms.
• Kruse, R.L.: Data Structures and Program Design. Prentice- Hall,Inc. 1984
• Baase, S.: Computer Algorithms - Introduction to Design and Analysis. Addison Wesley, 1998
• Sedgewick ,R.: Algoritmy v C. (Základy. Datové struktury. Třídění. Vyhledávání.) Addison Wesley 1998. Softpress 2003.

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 - terms and attributes. Design and implementation of algorithms.
4. Problem-solving techniques.
5. Overview of data structures and their manipulation. Pointer as an abstract data type and its specification.
6. Elementary terms used in programming languages: expression, statement, statement composition, control flow determination. Summary.

Seminars correspond to the content of individual lectures and demonstrate the presented topics.

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

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

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.

• To earn at least 50 points within the semester
• Attendence on at least 5 from the 6 lectures (the absence can be justified by a properly submitted Request for recording of an impairment during studies or any lawful reasonabsenci lze omluvit pomocí zaevidované překážky ve studiu) 

by email