|
|
Syllabus of Andhra University MCA - MCA 2.1.3 File Structures
With effect from 2004-05 admitted batch
Instruction: 3 Periods/week
Sessional Marks: 50
Univ-Exam-Marks:100
Time: 3 Hours
File Processing Operations
Physical and logical files, opening, reading & writing and closing files in C, seeking and special characters in files, physical devices and logical files, file -related header files in C
Secondary Storage
Disks – organization, tracks, sectors, blocks, capacity, non-data overhead, cost of a disk access, Magnetic Tape – types, performance, organization estimation of tape length and data transmissiontimes, disk vs tape, CD-ROM – CD-ROM as a file structure, physical organization, strengths and weakness of CD -ROMS, storage hierarchy
Byte Journey and buffer Management
File manager, I/O buffer, I/O processing, buffer strategies and bottlenecks
File Structure Concepts
A stream file, field structures, reading a stream of fields, record structures and that uses a length indicator, Mixing numbers and characters – use of a hex dump, reading the variable lengthrecords from the files
Managing records in C files
Retrieving records by keys, sequential search, direct access, choosing a record structure andrecord length, header records, file access and file organization
Organizing files for performance
Data compression, reclaiming space – record deletion and storage compaction, deleting fixed length records for reclaiming space dynamically, deleting variable-length records, spacefragmentation, replacement strategies.
Indexing
Index, A simple index with an entry sequenced file, basic operations on an indexed, entry sequenced file, indexes that are too large to hold in memory, indexing to provide access by multiple keys, retrieval using combination of secondary keys, improving the secondary indexstructure – inverted lists
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, simple prefix B+tree maintenance, index set block size, internal set block size, internal structure of index setblocks: a variable order B-tree, loading a simple prefix B+ tree
Hashing
Collisions in hashing, a simple hashing algorithms, hashing functions and record distributions, memory requirements, collision resolution by progressive overflow, buckets, deletions
Extendable hashing
Working of extendable hashing, implementation, deletion, extendable hashing performance
Designing file structure for CD-ROM
Tree structure on CD -ROM, hashing files on CD-ROM, CD-ROM file structure
Implementation in C++
Text Book:
File Structures – An Object Oriented Approach with C++, Michael J. Folk, Bill Zoellick and Greg Riccardi, Pearson Education
|
No responses found. Be the first to respond and make money from revenue sharing program.
|