Type 4 Important Practice Questions

Duration: 14 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/part-2-primary-maths/coding-decoding/symbols-based-coding/asset-type-4-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 comprehensive lecture on solving coding-decoding problems, a common topic in competitive exams. The instructor, Yash Jain, systematically explains various types of coding-decoding puzzles. The video begins with a demonstration of a substitution cipher using the ROT13 algorithm, where letters are shifted by 13 positions in the alphabet, illustrated with the example 'HOLA' becoming 'UBYN'. It then transitions to a series of multiple-choice questions. The first question involves a code language where 'mok dan sil' means 'nice big house', 'fit kon dan' means 'house is good', and 'warm tir fit' means 'cost is high', asking for the word for 'good'. The instructor analyzes the common words to deduce that 'kon' is the code for 'good'. The second question uses the phrases 'nitco sco tingo' for 'softer than flower', 'tingo rho mst' for 'sweet flower fragrance', and 'mst sco tmp' for 'sweet than smile', to determine the code for 'fragrance', concluding it is 'tingo'. The third question presents 'Tom Kun Sud' for 'Dogs are barking', 'Kun Jo Mop' for 'Dogs and Horses', and 'Mut Tom Ko' for 'Donkeys are mad', to find the code for 'barking', which is 'Sud'. The final question is a data sufficiency problem asking what 'orange' represents, providing three statements: 'rim pa xab' means 'orange and apple', 'na pie tac' means 'I dislike sweet', and 'na tsi pa' means 'orange is sweet'. The instructor explains that statements 1 and 3 are sufficient to determine that 'pa' represents 'orange'. The video concludes with a 'Thanks for Watching' screen.

Chapters

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

    The video opens with a slide titled 'CODING DECODING' that presents a problem: 'MONKEY KMLICW then ORANGE ?'. It shows the word 'MONKEY' being converted to 'KMLICW' by subtracting 2 from each letter's position in the alphabet (e.g., M=13, 13-2=11=K). The slide then applies the same logic to 'ORANGE', showing that each letter should be decreased by 2 to get the code. The instructor, Yash Jain, is visible in a small window in the bottom right corner. The slide also features a paper airplane graphic and a blue background with a red speech bubble containing the title.

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

    This segment introduces the concept of a 'ROT13' cipher. A diagram shows the alphabet split into two rows, with arrows indicating that each letter is shifted by 13 positions. For example, 'A' maps to 'N', 'B' to 'O', and so on. The instructor demonstrates this with the word 'HOLA', which becomes 'UBYN' after applying the ROT13 shift. The slide includes the text 'YASH JAIN SIR' and 'KNOWLEDGE GATE EDUCATOR' at the bottom. The instructor is seen in a small window, explaining the concept.

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

    The video presents a series of multiple-choice questions. The first question asks for the code for 'good' given that 'mok dan sil' means 'nice big house', 'fit kon dan' means 'house is good', and 'warm tir fit' means 'cost is high'. The instructor analyzes the common words: 'dan' appears in both 'nice big house' and 'house is good', so 'dan' must mean 'house'. 'fit' appears in 'house is good' and 'cost is high', so 'fit' must mean 'is'. Therefore, 'kon' is the only word left for 'good'. The second question asks for the code for 'fragrance' given 'nitco sco tingo' for 'softer than flower', 'tingo rho mst' for 'sweet flower fragrance', and 'mst sco tmp' for 'sweet than smile'. The instructor identifies 'tingo' as the common word in 'softer than flower' and 'sweet flower fragrance', so 'tingo' must mean 'flower'. 'mst' is common in 'sweet flower fragrance' and 'sweet than smile', so 'mst' means 'sweet'. Therefore, 'rho' is the only word left for 'fragrance'.

  4. 10:00 – 14:21 10:00-14:21

    The third question asks for the code for 'barking' given 'Tom Kun Sud' for 'Dogs are barking', 'Kun Jo Mop' for 'Dogs and Horses', and 'Mut Tom Ko' for 'Donkeys are mad'. The instructor identifies 'Tom' as common in 'Dogs are barking' and 'Donkeys are mad', so 'Tom' means 'are'. 'Kun' is common in 'Dogs are barking' and 'Dogs and Horses', so 'Kun' means 'Dogs'. Therefore, 'Sud' is the only word left for 'barking'. The final question is a data sufficiency problem: 'What does 'orange' represent in a coded language?' with three statements. Statement 1: 'rim pa xab' means 'orange and apple'. Statement 2: 'na pie tac' means 'I dislike sweet'. Statement 3: 'na tsi pa' means 'orange is sweet'. The instructor explains that statement 1 gives 'orange and apple', and statement 3 gives 'orange is sweet'. The word 'pa' is common in both, so 'pa' must mean 'orange'. Therefore, statements 1 and 3 are sufficient. The video ends with a 'Thanks for Watching' screen.

The video provides a structured and methodical approach to solving coding-decoding problems. It begins with a fundamental concept, the ROT13 cipher, to establish the basic idea of substitution. It then progresses to more complex, real-world style problems that require logical deduction. The core method demonstrated is identifying common words or phrases across different coded sentences to isolate the meaning of individual code words. This is applied to three distinct types of problems: finding a single word's code, finding a word's code from a set of phrases, and a data sufficiency question. The instructor consistently uses a step-by-step analysis, breaking down each problem to its core components, which is a valuable technique for students preparing for competitive exams.

Loading lesson…