SYLLABUS

FILE STRUCTURES
Sub Code : 06IS63   IA Marks : 25
Hrs/ Week : 04 Exam Hours : 03
Total Hrs. : 52 Exam Marks : 100

PART-A

UNIT – 1 7 Hours

INTRODUCTION: File Structures: The Heart of the file structure Design, A Short
History of File Structure Design, A Conceptual Toolkit; Fundamental File Operations:
Physical Files and Logical Files, Opening Files, Closing Files, Reading and Writing,
Seeking, Special Characters, The Unix Directory Structure, Physical devices and
Logical Files, File-related Header Files, UNIX file System Commands; Secondary
Storage and System Software: Disks, Magnetic Tape, Disk versus Tape; CD-ROM:
Introduction, Physical Organization, Strengths and Weaknesses; Storage as Hierarchy,
A journey of a Byte, Buffer Management, Input /Output in UNIX.
 
UNIT – 2 6 Hours

FUNDAMENTAL FILE STRUCTURE CONCEPTS, MANAGING FILES OF

RECORDS: Field and Record Organization, Using Classes to Manipulate Buffers,
Using Inheritance for Record Buffer Classes, Managing Fixed Length, Fixed Field
Buffers, An Object-Oriented Class for Record Files, Record Access, More about
Record Structures, Encapsulating Record Operations in a Single Class, File Access
and File Organization.
 
UNIT – 3 7 Hours

ORGANIZATION OF FILES FOR PERFORMANCE, INDEXING:    Data

Compression, Reclaiming Space in files, Internal Sorting and Binary Searching,
Keysorting; What is an Index? A Simple Index for Entry-Sequenced File, Using
Template Classes in C++ for Object I/O, Object-Oriented support for Indexed, Entry-
Sequenced Files of Data  Objects, Indexes that are too large to hold in Memory,
Indexing to provide access by Multiple keys, Retrieval Using Combinations of
Secondary Keys, Improving the Secondary Index structure: Inverted Lists, Selective
indexes, Binding.

UNIT – 4 6 Hours

COSEQUENTIAL PROCESSING AND THE SORTING OF LARGE FILES:

A Model for Implementing Cosequential Processes, Application of the Model to a
General Ledger Program, Extension of the Model to include Mutiway Merging, A
Second  Look at Sorting in Memory, Merging as a Way of Sorting Large Files on
Disk.
PART - B
 
UNIT – 5 7 Hours

MULTI-LEVEL INDEXING AND B-TREES: The invention of B-Tree, Statement

of the problem, Indexing with Binary Search Trees; Multi-Level Indexing, B-Trees,
Example of Creating a B-Tree, An Object-Oriented Representation of B-Trees, B-
Tree Methods; Nomenclature, Formal Definition of B-Tree Properties, Worst-case
Search Depth, Deletion, Merging and Redistribution, Redistribution during insertion;
B* Trees, Buffering of pages; Virtual B-Trees; Variable-length Records and keys.
 
UNIT – 6 6 Hours

INDEXED SEQUENTIAL FILE ACCESS AND PREFIX B + TREES: Indexed

Sequential Access, Maintaining a Sequence Set, Adding a Simple Index to the
Sequence Set, The Content of the Index: Separators Instead of Keys, The Simple
Prefix B+ Tree and its maintenance, Index Set Block Size, Internal Structure of Index
Set Blocks: A Variable-order B- Tree, Loading a Simple Prefix B+ Trees, B-Trees,
B+ Trees and Simple Prefix B+ Trees in Perspective.
 
UNIT – 7 7 Hours

HASHING: Introduction, A Simple Hashing Algorithm, Hashing Functions and

Record Distribution, How much Extra Memory should be used?, Collision resolution
by progressive overflow, Buckets, Making deletions, Other collision resolution
techniques, Patterns of record access.
 
UNIT – 8 6 Hours
EXTENDIBLE HASHING: How Extendible Hashing Works, Implementation,
Deletion, Extendible Hashing Performance, Alternative Approaches.
                                                                                                     
 
TEXT BOOK:
1. File Structures-An Object Oriented Approach with C++ - Michael J.
Folk,
Bill Zoellick, Greg Riccardi, 3rd Edition, Addison-Wesley, 1998.

REFERENCE BOOKS:
1.       File Structures Using C++ - K.R. Venugopal, K.G. Srinivas, P.M.
Krishnaraj,  Tata McGraw-Hill, 2008.
2.       C++ Components and Algorithms - Scot Robert Ladd, BPB Publications,
1993.
3.       Database Management Systems - Raghu Ramakrishan and Johannes
Gehrke, 3rd Edition, McGraw Hill, 2003.

Question Paper Pattern: Student should answer FIVE full questions out of
8 questions to be set each carrying 20 marks, selecting at least TWO
questions from each part.

1
 FILE STRUCTURES
Sub Code : 06IS63 IA Marks : 25
Hrs/ Week : 04 Exam Hours : 03
Total Hrs. : 52 Exam Marks : 100

PART – A
UNIT 1: 6 Hours
Objectives:
In this unit we are going to focus on survey the history of file structure design, since
tracing the developments in file structure teaches us much about how to design our
own file structures. The need for precise specification of data structures
literacy,describe the process of linking a logical file within a program to an actual
physica; file or device.Introduction to the organization of hierarchical file system.

Outcomes:
students going to learn about minimizing disk accesses and maximizing the likehood
that the information the user will want is already in memory, the basic concepts and
issues associated with file structures and the fundamental operations of file systems,

UNIT 2: 7 Hours

Objectives:
In this unit we are going to focus on introduce file structure concepts dealing with
o Stream files
o Reading and writing fields and records
o Fields and records boundaries.
 Present an object oriented approach to file structures are methods of
encapsulating object value and behavior and operations.
 Class for buffer manipulation
 Template classess.

Outcomes:
Students going to learn about the lower level of organization that we normally impose
on a file is a stream of bytes. learn about storing data in file as a stream of bytes, the
ability to distinguish between the fundamental informational units of data. we use
record structure with a length indicators .at beginning of each record to develop
programs for reading and writing a sample file of variablelengthrecords.

2
UNIT 3: ORGANIZATION OF FILES FOR PERFORMANCE, INDEXING:   
7 Hours
Objectives:
In this unit we are going to look at several approaches to data compression, data
compaction as a simple way of reusing space in a file, and develop a procedure for
deleting fixed length records that allow vacate file space to be reused dynamically.
And also focus on limitation of binary searching, Introduces a concepts of pinned
records, it consider several approach to the problem of deleting fixed length records

Outcomes:
students going to learn about :
 Data compression methods are used to make files smaller by re encoding that
goes into a file.
 The notation used for representing information can often made more compact.
 The placement strategy used up to the point by the variable length records
deletion and reuse procedures.

UNIT 4: 6 Hours
Objectives: COSEQUENTIAL PROCESSING AND THE SORTING OF
LARGE FILES:

In this unit we are going to focus on Model for Implementing all varieties of
Cosequential Processes, It describes a class of frequently used processing activities
known as Cosequential Processes,  we are going to Look at Sorting very large file in
Memory, how Merging provides basis for Sorting very Large Files on Disk.

Outcomes:
students going to learn about Cosequential model can be applied to problem that
involves operations such as matching and merging two or more sorted input files.
Learn about multiway merge to show how the ,model might be extended to with
more than two inputs.

PART – B
UNIT 5: MULTI-LEVEL INDEXING AND B-TREES
3 Hours
Objectives:
In this unit we are going to look at the development of b-tree in the historical context
of the problems they were designed to solve. Look briefly at other tree structure that
might be used on secondary storage such as paged AVL trees.
Introduce multi record and multilevel indexes and evaluate the speed of the search
operations. Explain the implementation at the fundamental operations on B-Trees

3
Outcomes:
Students going to learn about B-trees begin by emphasizng the multilevel index
approach. Learn about the matter of buffering pages, creating a virtual B-trees.
Brief look at the use of variable length records within the pages of a B-trees,

UNIT 6: INDEXED SEQUENTIAL FILE ACCESS AND PREFIX B + TREES:

7 Hours
Objectives:
In this unit we are going to focus on introduce indexed sequential files and describes
operation on a sequence set of blocks that maintains records in order by key. Look at
how an index set can be built on top of the sequence set to produce an indexed
sequence file structure and compare the strength and weakness of B+trees, simple
prefix b+ trees and B-trees

Outcomes:
students going to learn about A class based on the use of a blocked sequence set and
an associate index set. We also discuss the how large to make sequence set blocks.
we study the mechanism used to maintain the index set as insertion and deletion are
made in the sequence set of B+ tree

UNIT 7: HASHING:
6 Hours
Objectives:
In this unit we are going to focus on introduce the concepts of hashing, Examine the
problem of choosing a good hashing algorithms, Explores three approaches for
reducing collisions: randomization of addresses, use of extra memory, storage of
several records per address, Examine effects of patterns of records access on
performance.

Outcomes:
students going to learn about hashing can provides faster access than most of the other
organization. Learn reduce the Number of collisions.

UNIT 8: EXTENDIBLE HASHING

7 Hours
Objectives:
In this unit we are going to focus on describe the problem solved by extendible
hashing and related approaches. Explain how extendible hashing works; how it
combines tries with conventional, static hashing, Learn extendible hashing
performance, Examine alternate approaches to the same problem, including dynamic
hashing and linear hashing schemes that control splitting by allowing for overflow
buckets.
Outcomes:

4
students going to learn about In extendible hashing we fill out all the leaves of the
tries until we have a perfect tree. dynamic hashing uses very simple approaches but it
uses the directory and linear hashing is away with the directory.

TEXT BOOK:
1. File Structures-An Object Oriented Approach with C++ - Michael J.
Folk,
Bill Zoellick, Greg Riccardi, 3rd Edition, Addison-Wesley, 1998.

REFERENCE BOOKS:
1.       File Structures Using C++ - K.R. Venugopal, K.G. Srinivas, P.M.
Krishnaraj,  Tata McGraw-Hill, 2008.
2.       C++ Components and Algorithms - Scot Robert Ladd, BPB Publications,
1993.
3.       Database Management Systems - Raghu Ramakrishan and Johannes
Gehrke, 3rd Edition, McGraw Hill, 2003.

1. List additional reference book or books or web materials each one is

using / referencing.
 Textbook Michael T. Goodrich and Roberto Tamassia "Data
Structures and Algorithms in JAVA", John Wiley & Sons, Inc.

Question Paper Pattern:

Student should answer FIVE full questions out of 8 questions to be set each carrying
20 marks, selecting at least TWO questions from each part.
ADD as a summary:
The following is OK and what is required BUT for first stage all may
not be able to write.

Subject Overview:

File concepts, basic file operations, physical file organization and compression
techniques,sequential file structures, hashing and direct organization structures,
indexed structures, list filestructures (inverted, multi-key, ect.), tree structures (B
trees, B+ trees,... etc.), external sortingtechniques, searching techniques.

 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.

5
  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.
A. Start with this section as this is what constitutes CLOs

Objectives:
On completion of this subject, students will be expected to:
1. Be familiar with the use of data structures as the foundational base for
computer solutions to problems.
2. Become introduced to and investigate the differing logical relationships
among various data items.
3. Understand the generic principles of computer programming as applied to
sophisticated data structures.
4. Comprehend alternative implementations using the differing logical
relationships and appreciate the significance of choosing a particular logical
relationship for implementation within real-world setting.
5. Demonstrate the ability to plan, design, execute and document sophisticated
technical programs to handle various sorts of data structures.

TEXT BOOK:
Text Books:
1. Elmasri and Navathe: Fundamentals of Database Systems,5th Edition, Pearson
Education, 2007.(Chapters 1, 2, 3 except 3.8, 5, 6.1 to 6.5, 7.1, 8, 9.1, 9.2 except
SQLJ, 9.4, 10)
2. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems, 3rd
Edition, McGraw-Hill, 2003. (Chapters 16, 17.1, 17.2, 18)
Reference Books:
1. Silberschatz, Korth and Sudharshan: Data base System Concepts, 6th Edition, Mc-
GrawHill, 2010.
2. C.J. Date, A. Kannan, S. Swamynatham: An Introduction to Database Systems, 8th
Edition, Pearson Education, 2006

6
 B. Continue with this section as this is what constitutes COs.
Generic Skills or Outcomes:
On completion of this subject students will be able 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.

C. Add this Plus Prerequisites

Breadth Options:

 This subject potentially can be taken as a breadth subject component for the
following courses: Bachelor of Engineering specialization in ECE

Prerequisite:

 Write whether this Prerequisite for some subject or is this subject requires
any prerequisite subject: C, C++,CS152


Question Paper Pattern:

Student should answer FIVE full questions out of 8 questions to be set each carrying
20 marks, selecting at least TWO questions from each part.

SIMPLE and STRAIGHT FORWARD WAY, LEAVE OUT

ALL THAT COMES UNDER RULES & REGULATIONS
OF THE UNIVERSITY as The TOP OF THE PAGE
COVERS IT IN ABBREVIATED WAY.