Type 6.3 Important Practice Questions
Duration: 11 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- 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
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- 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
- 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
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- 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
- 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
- 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
- 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
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- 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
- 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
- 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
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
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
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: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'.
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.
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.

