CS

FI:PB162 Java - Course Information

PB162 Java

Faculty of Informatics
Autumn 2009
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)
RNDr. Radek Ošlejšek, Ph.D. (lecturer)
doc. RNDr. Tomáš Pitner, Ph.D. (lecturer)
Mgr. Luděk Bártek, Ph.D. (seminar tutor)
doc. Ing. RNDr. Barbora Bühnová, Ph.D. (seminar tutor)
Mgr. Marek Grác, Ph.D. (seminar tutor)
Mgr. Martin Janík (seminar tutor)
RNDr. Martin Kuba, Ph.D. (seminar tutor)
Mgr. Rastislav Mirek (seminar tutor)
Mgr. Michal Oprendek (seminar tutor)
Mgr. Ľuboš Pecho (seminar tutor)
RNDr. Šimon Suchomel, Ph.D. (seminar tutor)
Mgr. Jan Šťastný (seminar tutor)
RNDr. Aleš Zlámal (seminar tutor)
RNDr. Jan Papoušek, Ph.D. (assistant)
Supervisor
prof. RNDr. Václav Matyáš, M.Sc., Ph.D.
Department of Computer Systems and Communications - Faculty of Informatics
Timetable
Mon 18:00–19:50 D1, Thu 16:00–17:50 D3
  • Timetable of Seminar Groups:
PB162/01: Mon 8:00–9:50 B116, M. Janík
PB162/02: Mon 10:00–11:50 B116, M. Janík
PB162/03: Tue 12:00–13:50 B116, B. Bühnová
PB162/04: Tue 16:00–17:50 B117, B. Bühnová
PB162/05: Tue 18:00–19:50 B117, B. Bühnová
PB162/06: Mon 14:00–15:50 B117, A. Zlámal
PB162/07: Mon 16:00–17:50 B117, A. Zlámal
PB162/08: Mon 10:00–11:50 B130, L. Bártek, J. Papoušek
PB162/09: Tue 14:00–15:50 B130, L. Bártek, Š. Suchomel
PB162/10: Tue 16:00–17:50 B130, L. Bártek, Š. Suchomel
PB162/11: Mon 10:00–11:50 B117, M. Kuba
PB162/12: Thu 16:00–17:50 B117, Ľ. Pecho
PB162/13: Thu 18:00–19:50 B117, Ľ. Pecho
PB162/14: Fri 8:00–9:50 B116, J. Šťastný
PB162/15: Fri 10:00–11:50 B116, J. Šťastný
PB162/16: Thu 18:00–19:50 B116, L. Bártek
PB162/17: Tue 8:00–9:50 B116, M. Oprendek
PB162/18: Tue 10:00–11:50 B116, M. Oprendek
PB162/19: Mon 16:00–17:50 B116, R. Ošlejšek
PB162/20: Mon 18:00–19:50 B116, M. Grác
PB162/21: Tue 10:00–11:50 B117, R. Ošlejšek
PB162/22: Tue 12:00–13:50 B117, R. Ošlejšek
PB162/23: Thu 14:00–15:50 B117, R. Mirek
Prerequisites
Command of a procedural programming language (Pascal, C) in the extent of the IB001 Introduction to Programming using C.
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 the course is directly associated with
there are 25 fields of study the course is directly associated with, display
Course objectives
At the end of the course students should:
gain the basic knowledge of object oriented programming in Java;
become familiar with the basic Java and OO terminology, as well as necessary language syntax and semantics rules;
be able to analyze, design and implement simple software solutions with the appropriate tools.
Syllabus
  • Introduction to Java - principles, history. Java development lifecycle, basic development tools.
  • Basic concepts and terminology of object-oriented programming - class, instance (object), variable, method. Encapsulation.
  • Cooperation and communication among objects.
  • Interfaces, specification, implementation.
  • Basic programmer's conventions - coding style, naming, documentary comment, API documentation.
  • Unit testing with junit.
  • Inheritance, polymorphism. Class hierarchy. Architecture of Java programs - methods, classes, packages.
  • Abstract classes. Access modifiers.
  • Basic program constructs. Primitive datatypes, object types and arrays.
  • Exceptions. Built-in exceptions, design of custom exceptions.
  • Java containers.
  • Java I/O.
  • Basic design patterns.
Literature
  • PITNER, Tomáš. Java - začínáme programovat : podrobný průvodce začínajícího uživatele. Praha: Grada, 2002. 222 s. ISBN 8024702959. info
  • ECKEL, Bruce. Myslíme v jazyku Java : knihovna programátora. Praha: Grada, 2001. 431 s. ISBN 8024790106. info
  • Učebnice jazyka JAVA. Edited by Pavel Herout. 1. vyd. České Budějovice: KOPP, 2001. 349 s. ISBN 80-7232-115-3. info
  • ECKEL, Bruce. Myslíme v jazyku Java : knihovna zkušeného programátora. Praha: Grada, 2000. 470 s. ISBN 8024700271. info
Teaching methods
Theoretical lectures with examples, practical lessons, homeworks.
Assessment methods
In the course of the semester, the students will be given 6 tasks (+ one premium), 6 points each, gaining 36 points together. The algorithmic optimality together with coding style and documentation will be taken into evaluation. Another 12 point can be obtained on practical lessons. 30 points can be obtained from in-term tests, as well as 22 points from the final one. 70 out of the total 100 points is required to complete the course successfully.
Language of instruction
Czech
Follow-Up Courses
Further Comments
Study Materials
The course is taught annually.
Listed among pre-requisites of other courses
The course is also listed under the following terms Autumn 2002, Autumn 2003, Autumn 2004, Autumn 2005, Autumn 2006, Autumn 2007, Autumn 2008, Autumn 2010, Autumn 2011, Autumn 2012, Autumn 2013, Autumn 2014, Autumn 2015, Autumn 2016, Autumn 2017, Autumn 2018.
  • Enrolment Statistics (Autumn 2009, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2009/PB162