Practice Question

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/GATE-GUIDANCE-BY-SANCHIT-SIR/computer-architecture/floating-point-rep/ieee-754-standards/asset-practice-question-24032 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics, Combinatorics
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  7. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. 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
  9. 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
  10. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  11. 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
  12. Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, 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
  13. General Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Mensuration and Geometry, Mental Ability, Arithmetic, Profit and Loss, Powers and Exponents (Surds and Indices), Average, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Syllogisms, Venn Diagram, Seating Arrangements, Blood Relations, Directions (Direction Test), Analogy, Algebra, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Cubes & Dices, Ranking, Order and Sequence, Mixture and Alligation, Age Problems, Clock, Selection Decision Table (Decision Making), Data Arrangement, Ratio and Proportion, Vocabulary, Averages, Mixtures and Alligation, Percentages, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Statistics, Three-Dimensional Patterns and Visualization, Permutations and Combinations, Trigonometry, Simplification and Approximation, Constraint Puzzles, Numerical Reasoning, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Direction Sense, Assembling and Grouping of Shapes, Cubes and Dice, Profit, Loss and Discount, Mensuration, Probability, Measurement and Quantity Take-Off, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Order, Ranking and Sequence, Logical Deduction and Induction, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Clocks and Calendars, Time and Work, Algebra, Data Interpretation, Speed, Time and Distance, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Calendar, Alphabet and Word Tests, Sequences and Series, Powers, Surds and Logarithms, Number System, Transformation of Shapes
  14. English (Verbal Aptitude): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Direct and Indirect Speech, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Verb, Articles, Adverb, Modals, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Articles and Determiners, Adjectives and Adverbs, Modals, Conditionals and Subjunctive, Voice and Reported Speech, Blood Relations, Tenses, Vocabulary
  15. Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
  16. Full Mock Test:
  17. Previous Year Papers:
  18. GATE 2026 Counselling: Counselling and Guidance Sessions
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This video explains a GATE-2005 floating-point representation problem using a custom 16-bit format: one sign bit, an excess-64 exponent field (bits 8–14), and a mantissa field (bits 0–7). The instructor first presents the unnormalized hexadecimal question for 0.239 × 2^13, showing the biased exponent calculation B.E = TE + Bias = 13 + 64 = 77, and identifies option (D) 4D3D as the answer. The slide then transitions to a normalized-representation question involving an implicit 1 preceding the binary point, with options (A) 0A20, (B) 1134, (C) 4DD0, and (D) 4AE8. The instructor converts the decimal fraction to binary using repeated multiplication by 2, normalizes it to the form 1.xxxx × 2^E, and computes the biased exponent. The final normalized representation is determined to be option (D) 4AE8.

Chapters

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

    The video opens with the GATE-2005 question header and a bit-field diagram labeled 'Sign bit', 'Excess - 64 Exponent', and 'Mantissa' across positions 15 through 0. The instructor writes the binary expansion of 0.239 × 2^13, underlines it as M, and calculates the biased exponent using 'B.E = TE + Bias = 13 + 64 = 77'. Option (D) 4D3D is ticked as the correct answer for the unnormalized hexadecimal representation. The slide then transitions to a normalized-representation question mentioning 'an implicit 1 preceding the binary (radix) point' with new options (A) 0A20, (B) 1134, (C) 4DD0, and (D) 4AE8.

  2. 2:00 – 4:03 02:00-04:03

    The instructor works through the normalized representation by converting the decimal fraction to binary via repeated multiplication by 2, then normalizing it to the form 1.xxxx × 2^E. The biased exponent is calculated as 13 + 64 = 79 (0x4F), and the mantissa bits are filled into the format diagram. The final normalized representation is determined to be option (D) 4AE8, which is underlined as the correct answer. The teaching progression emphasizes using repeated multiplication for fractional decimal-to-binary conversion, normalizing to 1.xxxx × 2^E, and adding the excess value (64) to find the biased exponent.

The core concept is converting a decimal number into a custom floating-point format with an excess-64 exponent bias. The key steps are: (1) convert the decimal fraction to binary using repeated multiplication by 2, (2) normalize the binary number to the form 1.xxxx × 2^E by shifting the radix point, (3) calculate the biased exponent as actual exponent plus 64, and (4) assemble the sign bit, biased exponent bits, and mantissa bits into the 16-bit format. The video distinguishes between unnormalized representation (where the mantissa is a pure fraction in sign-magnitude form) and normalized representation (with an implicit 1 preceding the binary point). The worked example uses 0.239 × 2^13, yielding biased exponent 77 for the unnormalized case and demonstrating the normalization process for the second question.

Loading lesson…