Monday, November 8, 2010

IA -2 | Syllabus

Please have a look at IA-2 syllabus. 
Extra classes would be conducted to cover the syllabus.

Indexing
A Simple Index for Entry- Sequenced File,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.

Consequential Processing and The Sorting of Large Files: A Model for Implementing Consequential 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.
HASHING: Introduction, A Simple Hashing Algorithm, Hashing Functions and Record Distribution, Collision resolution by progressive overflow, Buckets.


EXTENDIBLE HASHING: Working of Extendible Hashing, Implementation, Deletion, Extendible Hashing Performance.

Objective is to give more time for study holidays :-)


Slides - File Structures

Check Your Understanding - Objective Questions