File Structures Home

 

Course Information

 

Course Prefix

Course No.

Credit Hour

Course Title

CS

403

2

File Structures

 

Course Contents

 

Course Syllabus

Storage device structures and input output mechanisms. Concepts of record, block, and file.
File Structures: Pile, Sequential, Indexed Sequential, Direct access, Inverted files; Indexing structures- B-tree and its variations.

Main Text

Michael J. Folk et. al. :File Structures : An object-Oriented Approach with C++, Pearson

Loomis, Marry :  Data Management and File Structures, PHI

Reference

Horowitz and Sahni : Data Structures, Narosa Publishing House

 

Objectives

 

Course Objectives

·         Provide a solid introduction to the topic of file structure design.

·         Discuss, in detail, the data structures necessary for achieving its efficiency objectives.

·         Introducing techniques for organization and manipulation of data in secondary storage including the low level aspects of file manipulation which include basic file operations, secondary storage devices and system software.

·         Introducing the most important high-level file structures tools which include indexing, co-sequential processing, B trees, Hashing.

·         Applying the techniques in the design of C++ programs for solving various file management problems.

Learning Objectives

After completing this course, the student should demonstrate the knowledge and ability to:

·         Explain the importance of file structures in the Data Storage and Manipulation.

·         Show how various kind of secondary storage devices to store data.

·         Show how the File Structure approach differs from the data base approach.

·         Know the low level aspects of file manipulation.

·         Know the importance of data compression.

·         Know some of the high-level file structures tools and recognize the difference between various indexing techniques.

·         Implement some of the learned techniques and concepts using C++ for solving various file management problems.

 

Evaluation Plan

 

Evaluation Plan

Activity

Credit

 

Mid-term Examination

50

End-term Examination

70

Homework & Assignments

50

 

Total

170

 

Class Schedule

 

Week Day

Room No.

Time

Tuesday

DB-1 ( Dean’s Building )

10:05-11:00 AM

Friday

DB-1 ( Dean’s Building )

12:05-01:00 PM

 

Lecture Notes & Reading Materials

 

Topic

Materials & Links

Introduction to the design and specification of file structures

 

Fundamental file processing operations

 

Secondary storage system hardware (magnetic disk, RAID, tape, and optical disk)

 

Fundamental file structure concepts

 

Managing files of records and “beyond record structures”

 

Organizing files for performance

 

Simple indexing

Will be uploaded very soon

Co-sequential processing and the sorting of large files

 

Multilevel indexing and ISAM files (historical overview)

 

Multilevel indexing and B trees

 

Indexed sequential file access and prefix B+trees

 

Static Hashing

 

Dynamic and extensible hashing

 

Other indexing structures ( brief  introduction)

 

Inverted File concepts

 

 

 

 

Assignments & Home Works

 

Topic

Materials & Links

Set 1

 

Set 2

 

Set 3

Will be uploaded from time to time

Set 4

 

Set 5