FI:PV062 File Structures - Course Information

PV062 File Structures

Extent and Intensity

2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).

Teacher(s)

doc. Ing. Jan Staudek, CSc. (lecturer)

Guaranteed by

doc. RNDr. Eva Hladká, Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Contact Person: doc. Ing. Jan Staudek, CSc.
Supplier department: Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Wed 10:00–11:50 D1

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

• Applied Informatics (programme FI, B-AP)
• Applied Informatics (programme FI, N-AP)
• Information Technology Security (eng.) (programme FI, N-IN)
• Information Technology Security (programme FI, N-IN)
• Bioinformatics (programme FI, B-AP)
• Bioinformatics (programme FI, N-AP)
• Economic Information Systems (programme ESF, B-SI)
• Information Systems (programme FI, N-IN)
• Informatics with another discipline (programme FI, B-EB)
• Informatics with another discipline (programme FI, B-FY)
• Informatics with another discipline (programme FI, B-IO)
• Informatics with another discipline (programme FI, B-MA)
• Informatics with another discipline (programme FI, B-TV)
• Public Administration Informatics (programme FI, B-AP)
• Mathematical Informatics (programme FI, B-IN)
• Parallel and Distributed Systems (programme FI, B-IN)
• Parallel and Distributed Systems (programme FI, N-IN)
• Computer Graphics and Image Processing (programme FI, B-IN)
• Computer Graphics (programme FI, N-IN)
• Computer Networks and Communication (programme FI, B-IN)
• Computer Networks and Communication (programme FI, N-IN)
• Computer Systems and Data Processing (programme FI, B-IN)
• Computer Systems (programme FI, N-IN)
• Embedded Systems (eng.) (programme FI, N-IN)
• Programmable Technical Structures (programme FI, B-IN)
• Embedded Systems (programme FI, N-IN)
• Service Science, Management and Engineering (eng.) (programme FI, N-AP)
• Service Science, Management and Engineering (programme FI, N-AP)
• Social Informatics (programme FI, B-AP)
• Theoretical Informatics (programme FI, N-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, N-SS) (2)
• Artificial Intelligence and Natural Language Processing (programme FI, B-IN)
• Artificial Intelligence and Natural Language Processing (programme FI, N-IN)
• Image Processing (programme FI, N-AP)

Course objectives

At the end of the course students should be able
understand and explain data coding
apply data compressing algorithms
use file systems interfaces
apply indexing and hashing to file structures

Syllabus

• Information theory, data coding techniques
• Data Compression
• Secondary Memories
• File systems
• Sequential Files Organization
• Indexes, Index-Sequential File Organization, Inverted File Organization
• Hashing, hash index tables, Direct Access File Organization
• Trees, B+ tress, B trees

Literature

• GARCIA-MOLINA, Hector, Jeffrey D. ULLMAN and Jennifer WIDOM. Database system implementation. Upper Saddle River: Prentice Hall, 2000, xv, 653 s. ISBN 0-13-040264-8. info
• FOLK, Michael J., Bill ZOELLICK and Greg RICCARDI. File structures :an object-oriented approach with C++. Reading, Mass.: Addison-Wesley, 1998, xxiv, 724. ISBN 0-201-87401-6. info

Teaching methods

lectures

Assessment methods

written test

Language of instruction

Czech

Further Comments

Study Materials
The course is taught annually.

• Enrolment Statistics (Spring 2016, recent)
  
• Permalink: https://is.muni.cz/course/fi/spring2016/PV062