PC Seminar

Public info:http://www.fit.vutbr.cz/study/courses/ISC/public/
Type of
Hour/semLecturesSem. ExercisesLab. exercisesComp. exercisesOther
Guarantee:Květoňová Šárka, Ing., Ph.D., DIFS
Lecturer:Květoňová Šárka, Ing., Ph.D., DIFS
Instructor:Bartl Vojtěch, Ing., DCGM
Květoňová Šárka, Ing., Ph.D., DIFS
Martiško Jakub, Ing., DIFS
Mazura František, Ing., FIT
Faculty:Faculty of Information Technology BUT
Department:Department of Information Systems FIT BUT
Introduction to Programming Systems (IZP), DIFS
Operating Systems (IOS), DITS
Learning objectives:
  Student accomplishes 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. Student will understand the way of the saving and representation of numbers in a computer. Student gets to know the manners of results presentation (word processor and spreadsheet editor) and tools supporting more effective creation of programs. Student will understand the basic terms that are relating to abstract data types and s/he learns to use them.
  This is an intensive course running in the first half of the semester only. The aim is to bring to life the work with a computer from a view of the software creation. Especially, the course concentrates on number manipulation and treatment in various numeral systems and their representation in computer as it is common in everyday programming practice. Together with this, elementary terms used in program development and implementation are discussed. Next, it is presented usage of tools supporting efficient (not only) program creation and development. The last, but not least topic presented is the ability to present results of projects, measurements, ideas, etc., in a suitable way using PC.
Knowledge and skills required for the course:
  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 maneuvering.
Subject specific learning outcomes and competences:
  • Student gains an overview about 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 (e.g. audio/video processing, biometrics, robotics, web design etc.).
  • 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 with real /floating point/ numbers).
  • S/he gains an overview about common editors, usage of tool-tips/hints and utilities that make the work on a computer more efficient (e.g. software development).
  • S/he accomplishes manners of result presentation: word processor - WYSIWYG, PSpad, Notepad++, Eclipse, spreadsheets, electronic presentation (ppt, excel, word), WWW pages editors, interconnection and portability of documents, alternative office applications.
Generic learning outcomes and competences:
  • Student learns domain specific terminology in Czech and English language
  • Student learns to create small software projects and related project documentation
  • Student learns to present and defend the results of their work
Syllabus of lectures:
  1. Presentation of areas and domains where computers are key tool, von Neumann computer architecture, model of computation/evaluation, model of program development and implementation.
  2. Representation and manipulation of numbers in a computer (difference between viewing numbers as man and as a computer, problems in representation of fully floating point numbers in a computer).
  3. Elementary terms used in programming languages: expression, statement, statement composition, control flow determination.
  4. Elementary terms of algorithm description. Overview of data structures and their manipulation. Pointer as an abstract data type and its specification.
  5. Editors, exploitation of tool-tips/hints, various utilities.
  6. Tools for result presentation - text editors: WYSIWYG, PSpad, Notepad++, Eclipse; spreadsheets; electronic presentaion (ppt, excel, word); WWW pages editors; interconnection and portability of documents; alternative office applications.
Syllabus of computer exercises:
 Seminars correspond to the content of individual lectures and demonstrate the presented topics.
Fundamental literature:
  • Cormen, T.H., Leiserson, Ch.E., Rivest, R.L.: Introduction to Algorithms.
  • 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.
Study literature:
 Honzík, J., Hruška, T., Máčel, M.: Vybrané kapitoly z programovacích technik, Ed.stř. VUT Brno, 1991.
Controlled instruction:
  Within this course, attendance on the lectures is not monitored. The knowledge of students is examined by the active attending classes, individual assignments and by the final credit test.
Progress assessment:
  • Evaluated individual assignments - up to 12 points
  • Attendance list of classes - up to 12 points
  • Final written test - up to 76 points
Exam prerequisites:
  • To earn at least 50 points within the semester