A Very HOT Question [MUST SOLVE]

Duration: 27 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/reasoning/coding-decoding/multiple-topics/asset-a-very-hot-question-must-solve after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Database Management System: 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
  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, 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
  4. 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
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. 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, Complexity Theory
  10. 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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This video is a comprehensive tutorial on solving coding-decoding problems, a common topic in competitive exams. The lecture begins by introducing a substitution cipher, specifically a ROT13 cipher, where each letter is shifted by 13 positions in the alphabet. It then transitions to a more complex problem involving a unique digit-based coding scheme. The core of the video is a detailed analysis of a sentence, "Peacock is designated as the national bird of India," which is encoded as a sequence of numbers. The instructor systematically deduces the code for each letter by analyzing the length of the code and the rules provided: the scheme is case-insensitive, each letter has a unique digit code from 1 to 9, digit 9 codes two letters, and all other digits code three letters. The code for a word is formed by arranging the digits in non-decreasing order. The video concludes with a set of four multiple-choice questions that test the understanding of the derived coding rules, with the instructor working through the logic to find the correct answers.

Chapters

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

    The video opens with a title slide for a lesson on "CODING DECODING". It presents a problem where the word "MONKEY" is coded as "KMLICW" and "ORANGE" is coded as a question mark. The solution is shown to be a simple shift cipher, where each letter is decreased by 2 positions in the alphabet (e.g., M->K, O->M, N->L, etc.). The instructor then transitions to a new topic, introducing a different type of coding problem involving a sentence and a sequence of numbers.

  2. 2:00 – 5:00 02:00-05:00

    The video presents a new coding problem. The sentence "Peacock is designated as the national bird of India" is shown with its corresponding code: 5688999 35 1135556678 56 458 13666689 1334 79 13366. The rules for this coding scheme are listed: it is case-insensitive, each letter has a unique digit code from 1-9, digit 9 codes two letters, all other digits code three letters, and the code for a word is the digits arranged in non-decreasing order. The instructor begins to analyze the code for "Peacock" (5688999) to deduce the code for the letter 'P'.

  3. 5:00 – 10:00 05:00-10:00

    The instructor continues to analyze the code for "Peacock" (5688999). He identifies that the letter 'P' must be coded as 5, as it is the only letter that appears once in the code. He then analyzes the code for "India" (13366), which is a 5-digit code. Since the code is in non-decreasing order, the digits are 1, 3, 3, 6, 6. He deduces that the letter 'I' is coded as 1, and the letter 'D' is coded as 3. He then analyzes the code for "the" (458), which is a 3-digit code, and deduces that 'T' is 4, 'H' is 5, and 'E' is 8. He also identifies that 'A' is 6 and 'N' is 3.

  4. 10:00 – 15:00 10:00-15:00

    The instructor continues to deduce the codes for the remaining letters. He analyzes the code for "national" (13666689), which is a 8-digit code. He identifies that the letter 'L' is coded as 1, as it is the only letter that appears once. He then analyzes the code for "bird" (1334), which is a 4-digit code, and deduces that 'B' is 3 and 'R' is 4. He also identifies that 'S' is 5, 'F' is 9, and 'O' is 9. He then analyzes the code for "is" (35), which is a 2-digit code, and deduces that 'I' is 3 and 'S' is 5. He then analyzes the code for "designated" (1135556678), which is a 10-digit code, and deduces that 'D' is 1, 'E' is 5, 'S' is 5, 'I' is 3, 'G' is 6, 'N' is 3, 'A' is 6, 'T' is 8, and 'E' is 5.

  5. 15:00 – 20:00 15:00-20:00

    The instructor summarizes the complete code table, listing each letter and its corresponding digit. He then proceeds to answer the four multiple-choice questions. Question 1 asks about the code for letter 'L', which he deduces is 1. Question 2 asks about the code for letter 'B', which he deduces is 3. Question 3 asks for how many digits the complete list of letters can be identified, which he determines is 2 (digits 1 and 9). Question 4 asks which set of letters cannot be coded with the same digit, and he determines that the set S, E, Z cannot be coded with the same digit because S is 5, E is 8, and Z is 9.

  6. 20:00 – 25:00 20:00-25:00

    The instructor continues to work through the multiple-choice questions. He confirms that the code for letter 'L' is 1, as it is the only letter in the code for "national" that appears once. He confirms that the code for letter 'B' is 3, as it is the only letter in the code for "bird" that appears once. He explains that the complete list of letters can be identified for only two digits: 1 and 9. He then analyzes the options for question 4, determining that the set S, E, Z cannot be coded with the same digit because S is 5, E is 8, and Z is 9.

  7. 25:00 – 27:09 25:00-27:09

    The video concludes with a final summary of the answers to the four questions. The instructor reiterates that the code for 'L' is 1, the code for 'B' is 3, the number of digits for which the complete list of letters can be identified is 2, and the set of letters that cannot be coded with the same digit is S, E, Z. The final slide displays the text "THANKS FOR WATCHING".

The video provides a step-by-step guide to solving a complex coding-decoding problem. It begins by establishing a foundational understanding of a simple cipher (ROT13) before introducing a more intricate system based on digit assignment. The core of the lesson is the application of logical deduction to a set of rules. The instructor uses the length of the code for each word as a primary clue, combined with the rule that the code is arranged in non-decreasing order. By analyzing the frequency of digits in the codes for words like "Peacock" and "India", and leveraging the rule that digit 9 codes two letters while others code three, the instructor systematically deduces the unique digit for each letter. The process demonstrates a powerful problem-solving strategy: breaking down a complex problem into smaller, manageable parts and using constraints to eliminate possibilities. The final section of the video applies this newly acquired knowledge to answer a set of multiple-choice questions, reinforcing the concepts and ensuring the viewer can apply the logic independently.

Loading lesson…