M1160 Introduction to Programming I

Faculty of Science
autumn 2021
Extent and Intensity
2/2/0. 4 credit(s) (příf plus uk k 1 zk 2 plus 1 > 4). Type of Completion: k (colloquium).
Teacher(s)
RNDr. Jaroslav Pelikán, Ph.D. (lecturer)
RNDr. Aleš Zlámal (seminar tutor)
Guaranteed by
RNDr. Jaroslav Pelikán, Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Contact Person: RNDr. Jaroslav Pelikán, Ph.D.
Supplier department: Department of Computer Systems and Communications – Faculty of Informatics
Timetable
Fri 12:00–13:50 A217
  • Timetable of Seminar Groups:
M1160/01: Wed 14:00–15:50 B117, A. Zlámal
M1160/02: Fri 10:00–11:50 B117, A. Zlámal
M1160/03: Mon 14:00–15:50 B117, A. Zlámal
M1160/04: Tue 10:00–11:50 B117, A. Zlámal
M1160/05: Mon 10:00–11:50 B117, A. Zlámal
Prerequisites
!( FI:IB001 Intro to Prog. using C )
The course Introduction to Programming I requires basic knowledge of PC computer handling (on a user level).
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
Course objectives
The main aim of the course Introduction to Programming I is to introduce students to basic principles of computer problem-solving. This course is based on the use of the C programming language.
Learning outcomes
At the end of this course, students should be able to:
design an algorithm to solve a given problem;
code an algorithm in the C programming language;
debug a created program.
Syllabus
  • Basic concepts, units of information.
  • Design of algorithms - phases of task processing on a computer. Algorithm - algorithm properties, possibilities of algorithm notation, design of simple algorithms.
  • Programming languages - compiler. C programming language. Basic lexical units of C language. Program structure in C language.
  • C language commands - input and output functions, assignment, composed command, conditional command, loop commands.
  • Data types - integer types, char type, real types, enumerated types.
  • Switch command.
  • Structured data types - array, strings.
  • Pointer type.
  • Searching and sorting algorithms - linear and binary searching, sorting methods of SelectSort, BubbleSort and InsertSort.
  • Subprograms (functions). Formal and actual parameters, global and local objects.
Literature
  • HEROUT, Pavel. Učebnice jazyka C. 6. vyd. České Budějovice: Kopp, 2009, 271, viii. ISBN 9788072323838. info
  • KERNIGHAN, Brian W. Programovací jazyk C. Edited by Dennis M. Ritchie. 1. vyd. Brno: Computer Press, 2006, 286 s. ISBN 802510897X. info
  • Učíme se programovat v jazyce C. Edited by Václav Kadlec. Vyd. 1. Praha: Computer Press, 2002, xiii, 277. ISBN 8072267159. info
Teaching methods
Theoretical lectures with examples - 2 hours per week (the attendance is optional), class exercises - 2 hours per week (class exercises take place in a computer classroom, the attendance is mandatory, and the students also must successfully pass intrasemestral tests and make homeworks).
Assessment methods
Colloquium takes place in computer classroom and students code a program solving a given problem. Afterwards, the solution of the given problem is discussed.
Language of instruction
Czech
Follow-Up Courses
Further comments (probably available only in Czech)
Study Materials
The course is taught annually.
Teacher's information
http://www.fi.muni.cz/usr/pelikan/Vyuka/Vyuk2.html
The course is also listed under the following terms Autumn 2007 - for the purpose of the accreditation, Autumn 2010 - only for the accreditation, Autumn 2002, Autumn 2003, Autumn 2004, Autumn 2005, Autumn 2006, Autumn 2007, Autumn 2008, Autumn 2009, Autumn 2010, Autumn 2011, Autumn 2011 - acreditation, Autumn 2012, Autumn 2013, Autumn 2014, Autumn 2015, Autumn 2016, autumn 2017, Autumn 2018, Autumn 2019, Autumn 2020, Autumn 2022, Autumn 2023.
  • Enrolment Statistics (autumn 2021, recent)
  • Permalink: https://is.muni.cz/course/sci/autumn2021/M1160