Practice Question - Primary Indexing Cont...
Duration: 8 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
- Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: Introduction to TOC Deterministic FA (DFA) Non-Deterministic FA Regular Expressions Grammar Regular Language Properties Moore & Mealy Machines Pushdown Automata & CFG Turing Machines Complexity Theory
- Paper 2 | Compiler Design: Intro to Compilers Lexical Analysis Grammar & CFG Syntax Analysis: Top-Down Syntax Analysis: Bottom-Up Semantic Analysis & SDT Intermediate Code Gen Code Optimization Run Time Environment
- Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
- Paper 2 | DataBase Management System/DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF File Organization & Indexing Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery
- Paper 2 | Computer Networks: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control DLL: Framing Data Link Layer - Ethernet Net Layer: IPv4 & Proto Net Layer: IP Addressing Net Layer:Routing Protocol Transport Layer Services TL: Congestion & UDP Application Layer Hardware Basics
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture video works through a primary indexing practice question for an ordered file. The problem states: suppose we have an ordered file with records stored, r = 30,000, on a disk with Block Size B = 1024 B, record length R = 100 B, a 9 B key field, and a 6 B block pointer. The instructor asks how to implement primary indexing. The solution proceeds in steps: first compute the blocking factor BF = floor(1024 / 100) = [10.24] = 10 records per block (one frame shows a variant BF = floor((1024 - 8)/100) = [10.16] = 10, suggesting possible overhead subtraction). Then compute the number of data blocks: n = r / BF = 30,000 / 10 = 3,000 blocks. Then compute the number of index entries needed: one per data block = 3,000. Each index entry is key (9 B) + pointer (6 B) = 15 B. The number of index entries per block is floor(1024 / 15) = [68.2] = 68. The number of index blocks at the first level is ceil(3000 / 68) = [44.11] -> 45 blocks (rounded up in a later frame). A logarithmic calculation log2(3000) = [11...7] -> 12 is also shown, which appears to relate to pointer size or a related bound. Hand-drawn diagrams show index blocks with 9 B key and 6 B pointer fields (15 B total) linked to stacked data blocks labeled 30,000. The teaching flow moves from problem statement, to blocking factor, to block count, to index entry size and multi-level structure.
Chapters
0:00 – 2:00 00:00-02:00
The orange problem statement at the top reads 'Q Suppose we have ordered file with records stored r = 30,000 on a disk with Block Size B = 1024 B' and ends 'Implement primary indexing?'. Red handwritten work on the left shows BF = 1024 / 100 B = [10.24] = 10, then = 30000 / 10 = 3000, and log2(3000) = [11...7] = 12. A red block diagram on the right shows stacked rectangles labeled '9 B', a pointer line marked '6 B', and a bottom block labeled '30,000'. The instructor establishes the blocking factor as 10 records per block and the total data blocks as 3,000.
2:00 – 5:00 02:00-05:00
The whiteboard continues the primary indexing solution. The instructor writes BF = (1024 - 8) / 100 B = [10.16] = 10 in one frame, indicating a possible overhead adjustment, while other frames show BF = 1024 / 100 = [10.24] = 10. The total blocks remain 30,000 / 10 = 3,000. The index block diagram is drawn with key (9 B) and pointer (6 B) fields, totaling 15 B per entry. The log2(3000) = [11...7] = 12 calculation is shown, relating to the index structure. The instructor visualizes the relationship between file blocks and index entries on the whiteboard.
5:00 – 7:39 05:00-07:39
A middle column computes BF = 1024/15, [68.2] = 68 index entries per block, then [3000/68] = [44.11], with the rounded value 45 added in a later frame for the number of first-level index blocks. Hand-drawn index block diagrams on the right carry labels KG, 9B, 6B and 15B, with arrows linking them to a stacked multi-level structure. The left column retains BF = 1024/100 = [10.24] = 10, 30000/10 = 3000, and log2(3000) = [11...7] = 12. The instructor completes the multi-level index design by computing how many key-pointer pairs fit in one block and how many blocks are needed to cover all 3,000 data blocks.
The video teaches primary indexing for an ordered file through a numerical example. Key concepts: blocking factor (records per data block), number of data blocks, index entry size (key + pointer), entries per index block, and multi-level index structure. The method: (1) BF = floor(B / R); (2) n = r / BF; (3) index entry size = key length + pointer length; (4) entries per index block = floor(B / entry size); (5) first-level index blocks = ceil(n / entries per block). The worked example yields BF = 10, n = 3,000, entry size = 15 B, entries per block = 68, and first-level index blocks = 45. The log2(3000) = 12 calculation appears alongside, possibly indicating pointer bit-width or a related bound. Diagrams show index blocks with 9 B keys and 6 B pointers linked to data blocks containing 30,000 records. Central ideas: primary index has one entry per data block; entries are ordered by key; multi-level structure reduces I/O. Minor details: the (1024 - 8) variant suggests block overhead may be subtracted in some formulations.

