We are building EduLadder(ELADR) - Protocol

The Eladr Protocol is a decentralized, security and efficiency enhanced Web3 noSQL database powered by IPFS as the data storage layer https://ipfs.io/, and the Cardano block chain as the rewards token platform, https://cardano.org/. It provides a JSON based, IPFS layer 2 solution for data indexing and retrieval in an 'append only' file system built with open source Node.js API libraries.

The ELADR token was designed to incentivize and reward community members as a proof of contribution. Token holders are also granted access to EduLadder.com premium features as well as associated ELADR token enabled apps.


Real Problems! Real Experts!

Join Our Telegram Channel !

The Eduladder is a community of students, teachers, and programmers. We help you to solve your academic and programming questions fast.
In eduladder you can Ask,Answer,Listen,Earn and Download Questions and Question papers.
Watch related videos of your favorite subject.
Connect with students from different parts of the world.
Apply or Post Jobs, Courses ,Internships and Volunteering opportunity. For FREE
See Our team
Wondering how we keep quality?
Got unsolved questions? Ask Questions
ELADR beta version launched

We launched Anonymous immutable internet on eladr protocol

For any question or query please joinOur Telegram Channel !

Youtube Videohttps://www.youtube.com/watch?v=ySLPZu3Jxro

Our Github Repo
FrontEnd BackEnd

We are looking for some great and cool people to work with us. Please sent your resume to admin@eduladder.com

You are here:Open notes-->VTU-->FILE-STRUCTURES-10IS63


How to study this subject

Subject Code: 10IS63
Hours/Week : 04
Total Hours : 52
I.A. Marks : 25
Exam Hours: 03
Exam Marks: 100
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.
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.
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.
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.
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.
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.
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.
6 Hours
Extendible Hashing: How Extendible Hashing Works, Implementation,
Deletion, Extendible Hashing Performance, Alternative Approaches.

Official Notes

Add contents here

Notes from other sources



Model question papers

Add contents here

Previous year question papers


Useful links

Add contents here



You might like this video:Watch more here

Watch more videos from this user Here

Learn how to upload a video over here