Practice Questions

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/computer-organization-architecture/input-output-organisation/disk-structure-address/asset-practice-questions-1952 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & 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
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: Introduction to CN, Data Communication, 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, Network Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  7. 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
  8. Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video presents a computer architecture problem involving disk storage capacity and addressing. The instructor analyzes a disk configuration with 512 tracks, 128 sectors per track, and 256 bytes per sector. He calculates the total capacity in bytes and converts it to megabytes. Additionally, he determines the number of bits required to uniquely address each component of the disk structure. The lecture emphasizes converting decimal numbers to powers of 2 to simplify multiplication and addition of exponents.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor reads the problem statement displayed on screen: "Consider a disk where there are 512 tracks, each track is capable of holding 128 sector and each sector holds 256 bytes..." He begins by visualizing the disk structure, drawing concentric red circles on the whiteboard to represent the tracks. He then breaks down the numbers into powers of 2 to facilitate calculation: 512 becomes 2^9, 128 becomes 2^7, and 256 becomes 2^8. He sets up the multiplication for total capacity: 2^9 x 2^7 x 2^8. He sums the exponents to find the total power of 2, resulting in 2^24 bytes. Finally, he converts this value to 16 MB, writing "16 MB" on the board next to the equation. He explicitly writes the exponents 9, 7, and 8 above the respective terms in the multiplication.

  2. 2:00 – 2:27 02:00-02:27

    The instructor shifts focus to the second part of the question: finding the number of bits required to reach the correct track, sector, and disk. He points to the exponents he previously calculated: 9, 7, and 8. He writes the summation 9 + 7 + 8 below the main equation. He explains that 9 bits are needed to address the 512 tracks, 7 bits for the 128 sectors, and 8 bits for the 256 bytes. He circles the total sum, which is 24, indicating the total addressing bits required. He reinforces the final capacity calculation of 16 MB while discussing these addressing bits. He underlines "16 MB" to emphasize the final capacity result.

The lesson effectively demonstrates how to calculate storage capacity by multiplying the number of tracks, sectors, and bytes per sector. It also highlights the relationship between the number of items in a hierarchy and the binary bits required to address them, showing that the total addressing bits equal the sum of the logarithms of each component count. The visual progression from drawing the disk to writing the mathematical formula reinforces the connection between physical structure and logical addressing.

Loading lesson…