Type 6.3 Important Practice Questions

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/GATE-GUIDANCE-BY-SANCHIT-SIR/general-aptitude/coding-decoding/renaming-based-coding-object-substitution/asset-type-63-important-practice-questions after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  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
  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. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  6. C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. 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
  10. 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
  11. 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
  12. Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics, Combinatorics
  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 educational video is a lecture on coding-decoding problems, a common topic in competitive exams. The instructor, Yash Jain, begins by introducing the concept of a coding system where each letter is assigned a number. He demonstrates a specific example where the word 'MONKEY' is coded as 'KMLICW', and the word 'ORANGE' is to be decoded. The solution is derived by identifying a pattern: each letter in the original word is shifted backward by two positions in the alphabet (a ROT13 cipher). The video then transitions to a series of practice questions. The first question shows 'ACID' coded as '1C3D', which is a substitution cipher where the letter 'C' is replaced by the number '3'. The second question shows 'ACID' coded as '1233', which is a positional cipher where each letter is replaced by its position in the alphabet (A=1, C=3, I=9, D=4). The instructor systematically works through these problems, explaining the logic and method for each type of coding-decoding puzzle. The video concludes with a final 'THANKS FOR WATCHING' screen.

Chapters

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

    The video opens with a title slide titled 'CODING DECODING'. It presents a problem: 'MONKEY' is coded as 'KMLICW', and the task is to decode 'ORANGE'. The instructor explains the pattern by showing the alphabetical positions of the letters in 'MONKEY' (13, 15, 14, 11, 5, 25) and the corresponding coded numbers (11, 13, 9, 3, 3, 23). He identifies that each number is reduced by 2, which corresponds to shifting each letter back by two positions in the alphabet. The slide concludes with the statement, 'So, each alphabet of ORANGE should be decreased by 2 alphabet', setting up the solution for the problem.

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

    The video transitions to a new section titled 'Questions Type 6'. The instructor presents three different coding problems. The first is 'ACID = 1C3D', the second is 'ACID = 1233', and the third is 'ACID = 1233' with 'BOMBAY = B4MB1Y'. The instructor begins to analyze the first problem, 'ACID = 1C3D', by writing the alphabet and assigning numbers to each letter (A=1, B=2, C=3, etc.). He explains that this is a substitution cipher where the letter 'C' is replaced by the number '3'. He then moves to the second problem, 'ACID = 1233', and explains that this is a positional cipher where each letter is replaced by its position in the alphabet (A=1, C=3, I=9, D=4). He notes that the code '1233' is incorrect for 'ACID' and that the correct code should be '1394'.

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

    The instructor continues to work through the coding problems. He analyzes the third problem, 'ACID = 1233' and 'BOMBAY = 141112', and identifies that the code is based on the position of the letters in the alphabet. He then moves to the problem 'ACID = 9' and 'BOMBAY = 37', which is a different type of problem where the sum of the positions of the letters is calculated. He explains that for 'ACID', the sum is 1+3+9+4=17, but the code is 9, so he must be missing something. He then analyzes the problem 'ACID = 1C3D' and 'BOMBAY = B4MB1Y', which is a substitution cipher where the letter 'C' is replaced by '3' and 'B' is replaced by '4'. He then moves to the problem 'ACID = 1233' and 'BOMBAY = 14101120', which is a positional cipher where each letter is replaced by its position in the alphabet. He explains that the code '14101120' is incorrect for 'BOMBAY' and that the correct code should be '214121525'. He then moves to the problem 'ACID = 1233' and 'BOMBAY = 141112', which is a positional cipher where each letter is replaced by its position in the alphabet. He explains that the code '141112' is incorrect for 'BOMBAY' and that the correct code should be '214121525'. He then moves to the problem 'ACID = 9' and 'BOMBAY = 37', which is a different type of problem where the sum of the positions of the letters is calculated. He explains that for 'ACID', the sum is 1+3+9+4=17, but the code is 9, so he must be missing something.

  4. 10:00 – 10:38 10:00-10:38

    The video concludes with a final screen that displays the text 'THANKS FOR WATCHING' in large white letters against a dark red background. This is a standard closing slide for the educational content, indicating the end of the lecture.

The video provides a comprehensive tutorial on solving coding-decoding problems, a key skill for competitive exams. It begins with a clear, step-by-step demonstration of a letter-shifting cipher (ROT13), using the example of 'MONKEY' to 'KMLICW' to establish the core concept. The instructor then systematically introduces and explains different types of coding systems, including substitution ciphers (where letters are replaced by numbers, e.g., 'C' becomes '3') and positional ciphers (where letters are replaced by their alphabetical position, e.g., 'A' becomes '1'). The progression from a simple example to a series of practice questions allows students to apply the learned methods. The video effectively uses on-screen text and handwritten annotations to illustrate the logic, making it a valuable resource for understanding the fundamental patterns in this type of logical reasoning problem.

Loading lesson…