FI:PB071 Introduction to the C language - Course Information
PB071 Introduction to the C language
Faculty of InformaticsSpring 2010
- Extent and Intensity
- 2/2. 4 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).
- Teacher(s)
- Ing. Jan Kučera (lecturer)
doc. RNDr. Petr Švenda, Ph.D. (lecturer)
Mgr. Ondřej Bouda (seminar tutor)
Mgr. Pavel Černohorský (seminar tutor)
Mgr. Jan Hegr (seminar tutor)
Martin Hradil (seminar tutor)
Mgr. Eva Michálková (seminar tutor)
RNDr. Ondřej Strnad, Ph.D. (seminar tutor)
RNDr. Šimon Tóth (seminar tutor)
RNDr. Aleš Zlámal (seminar tutor)
RNDr. Mgr. Jaroslav Bayer (assistant) - Guaranteed by
- prof. RNDr. Václav Matyáš, M.Sc., Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Contact Person: Ing. Jan Kučera - Timetable
- Mon 12:00–13:50 D3
- Timetable of Seminar Groups:
PB071/02: Mon 17:00–17:50 B116, O. Strnad
PB071/03: Thu 14:00–14:50 B116, O. Strnad
PB071/04: Thu 15:00–15:50 B116, O. Bouda
PB071/05: Tue 14:00–14:50 B117, J. Kučera
PB071/06: Tue 15:00–15:50 B117, E. Michálková
PB071/07: Thu 10:00–10:50 B117, P. Švenda
PB071/08: Thu 11:00–11:50 B117, P. Švenda
PB071/09: Fri 10:00–10:50 B117, A. Zlámal
PB071/10: Fri 11:00–11:50 B117, P. Černohorský
PB071/11: Mon 16:00–17:50 B130, M. Hradil, Š. Tóth
PB071/12: Mon 18:00–19:50 B130, P. Švenda, Š. Tóth
PB071/13: Thu 16:00–17:50 B130, M. Hradil, Š. Tóth
PB071/14: Thu 18:00–19:50 B130, M. Hradil, Š. Tóth
PB071/15: Tue 12:00–12:50 B116, A. Zlámal
PB071/16: Tue 13:00–13:50 B116, A. Zlámal
PB071/17: Thu 14:00–14:50 B117, A. Zlámal
PB071/18: Thu 15:00–15:50 B117, A. Zlámal - Prerequisites
- Knowledge of algorithmization in Pascal or another procedural language is supposed. User level knowledge of Unix operating system is also supposed (practical exercices run under Unix).
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- there are 21 fields of study the course is directly associated with, display
- Course objectives
- The student will learn how to write programs in ANSI C and ISO/IEC C. The language is taught rather in details but not to full extent. Stress is laid on practical student's work under Unix-like OS.
- Syllabus
- Historical background of the C language. Its relation to the Unix OS.
- C compilers under Unix and MS-DOS/MS-Windows.
- Data types, constants, declarations, expressions. Assignment expressions and statements.
- Basic program structure. Preprocessor statements. Comments.
- Relational expressions and control structures.
- Strings and string manipulation. Standard C library according to ANSI and ISO/IEC standards.
- Arrays and pointers.
- Functions (K-R and ANSI styles). Further differences between K-R C, ANSI C, and ISO/IEC C. C-program as a subprogram called from the OS shell.
- User defined data types. Dereference operators. Memory allocation.
- I/O in details. Using files.
- Safe programming. How to prevent frequent errors.
- Calling Unix core services. Further Unix libraries for C.
- Literature
- Kernighan, Brian W. - Ritchie, Dennis M. Programovací jazyk C. Brno: Computer Press, 2006. ISBN 80-251-0897-X
- HEROUT, Pavel. Učebnice jazyka C. 3. upr. vyd. České Budějovice: KOPP, 1996, 269 s. ISBN 80-85828-21-9. info
- HEROUT, Pavel. Učebnice jazyka C. České Budějovice: KOPP, 1998, 236 s. ISBN 80-85828-50-2. info
- DRESSLER, Miroslav. Programovací jazyky GNU : volně šiřitelná programátorská prostředí : Fortran, jazyk C, Pascal, GRX, DJGPP, RHIDE, RSX, VESA, EMX, MAKE. 1. vyd. Praha: Computer Press, 1998, xix, 225. ISBN 8072260707. info
- Bookmarks
- https://is.muni.cz/ln/tag/FI:PB071!
- Teaching methods
- Teaching consists from theoretical lectures combined with the practical exercises and programming homework selected to practice topics from lectures.
- Assessment methods
- The students are separately programming given homework (once a week, usually finalized at home or in computer lab). Homework are awarded by point according to given criteria. Recommended finalization is exam, which is maintained as test questionnaire on computer. Precondition for undertake exam is to have awarded credit from practical exercises and autonomously programmed final assignment. Classification is based on points gathered from exercises, test questionnaire and final assignment. When only credit for practical exercises is required, student's classification is based only on points gathered from exercises. Participation on practical exercises is mandatory, unless teacher allows for exception (e.g., based on student exceptional knowledge of the subject).
- Language of instruction
- Czech
- Follow-Up Courses
- Further comments (probably available only in Czech)
- Study Materials
The course is taught annually. - Listed among pre-requisites of other courses
- IB113 Introduction to Programming and Algorithms
!NOW(IB111) && !IB111 && !PB162 && !PB161 && !PB071 && !IB001 && !program(B-INF) && !program(B-PVA) && !program(B-CS) - PB006 Principles of Programming Languages and OOP
(IB111 || NOW(IB111)) && (PB071 || PB111) - PB152cv Operating Systems - practicals
(PB153 || PB152) && (PB111 || PB071 || SOUHLAS) - PB173 Domain specific development
PB111 || PB071 || SOUHLAS - PB176 Basics of Quality and Managment of Source Code
PB006 || PB071 || now(PB071)
- IB113 Introduction to Programming and Algorithms
- Teacher's information
- http://www.fi.muni.cz/usr/jkucera/pb071/
- Enrolment Statistics (Spring 2010, recent)
- Permalink: https://is.muni.cz/course/fi/spring2010/PB071