Type 6.3 Important Practice Questions

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/part-2-primary-maths/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. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
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…