Practice Questions
Duration: 2 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Quantitative Aptitude and Math: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Algebra, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Statistics, Probability, Percentage, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Average, Calculus, Trigonometry, Vectors, Linear Algebra
- Logical and Analytical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Verbal Analogy (Word Based Analogy), Directions (Direction Test), Blood Relations, Ranking, Order and Sequence, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning)
- English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Pronoun, Conjunction, Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Cloze Test (Cloze Passage)
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
- Computer Networks: 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, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cyber and Info Security
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- 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, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
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
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: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.

