M2160 Introduction to Programming II

Faculty of Science
Spring 2007
Extent and Intensity
2/2/0. 4 credit(s) (fasci plus compl plus > 4). Type of Completion: k (colloquium).
Teacher(s)
RNDr. Jaroslav Pelikán, Ph.D. (lecturer)
RNDr. Petr Medek, Ph.D. (seminar tutor)
RNDr. Aleš Zlámal (seminar tutor)
Guaranteed by
RNDr. Jaroslav Pelikán, Ph.D.
Department of Machine Learning and Data Processing – Faculty of Informatics
Contact Person: RNDr. Jaroslav Pelikán, Ph.D.
Timetable
Fri 8:00–9:50 A107
  • Timetable of Seminar Groups:
M2160/01: Tue 10:00–11:50 A104, A. Zlámal
M2160/02: Wed 14:00–15:50 A104, A. Zlámal
M2160/03: Fri 10:00–11:50 A104, A. Zlámal
Prerequisites
! IB001 INNOLEC prof. Serge Morand
The course Introduction to Programming II requires an extent of knowledge, that is adequate to the course M1160 Introduction to Programming I.
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 course Introduction to Programming II aims to introduce students to advanced techniques used in algorithm design and coding. The students acquire knowledge about possibilities of using recursion, backtracking, and dynamic structures. The students also learn basic principles of object oriented programming. This course is taught, similarly as the course Introduction to Programming I, with usage of the Pascal programming language.
Syllabus
  • Data type record, with command.
  • Data type file - typed files, text files, standard text files.
  • Program units - standard program units. Design of program units.
  • Dynamic variables, pointer.
  • Dynamic data structures - stack, queue, linear list, binary searching tree. Usage of dynamic data structures.
  • Introduction to object oriented programming - class, object. Encapsulation, inheritance, polymorphism.
  • Complexity of algorithms, concept of asymptotic complexity of algorithms. Polynomial and exponential algorithms.
Literature
  • MIHULA, Pavel and Jiří SOUKENKA. Borland pascal 7.0 : kompendium. Edited by Kateřina Juhová. Praha: Grada. 913 s. ISBN 8071690090. 1994. info
  • WIRTH, Niklaus. Algoritmy a štruktúry údajov. Translated by Pavol Fischer. 2. vyd. Bratislava: Alfa. 481 s. ISBN 80-05-00153-3. 1989. info
Language of instruction
Czech
Further comments (probably available only in Czech)
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 Spring 2008 - for the purpose of the accreditation, Spring 2011 - only for the accreditation, Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, spring 2012 - acreditation, Spring 2013, Spring 2014, Spring 2015, Spring 2016, Spring 2017, spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024.
  • Enrolment Statistics (Spring 2007, recent)
  • Permalink: https://is.muni.cz/course/sci/spring2007/M2160