Root Words, Prefixes, Suffixes
Duration: 17 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Paper-2 | Databases / DBMS & SQL: 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
- Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Paper-2 | Computer Networks & Security: Introduction to CN, Data Communication, 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, Hardware Basics, Network Access Technologies, Network Security
- Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, 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, Waveform Generators and Timer 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
- Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
- Paper-2 | 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
- Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- Paper-2 | 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
- Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
- Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
- Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
- Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
- Coal India Previous Year Paper:
- Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
- Coal India Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video module introduces the systematic approach to vocabulary expansion through Root Words, Prefixes, and Suffixes. The core teaching philosophy is the 'Golden Rule': instead of memorizing thousands of individual words, students should learn approximately 100 root words to unlock over 3,000 related terms. The lesson defines a root word as the core semantic unit of a vocabulary item that cannot be broken down further, providing examples such as 'Spect' (To See), 'Port' (To Carry), and 'Dict' (To Speak). It further distinguishes prefixes, which are added before the root to alter meaning (e.g., 'Un-' in Unhappy), from suffixes, which are added after the root to modify part of speech (e.g., '-er' in Teacher). The instructional flow progresses from defining these components to demonstrating their combination via the formula Prefix + Root + Suffix = Complete Word. The module emphasizes practical application through word families and compound words, offering a workflow for decoding unfamiliar terms by breaking them into components. It concludes with an analysis of parts of speech conversion, illustrating how suffixes transform nouns to adjectives or verbs to adjectives, thereby enhancing grammatical understanding and retention.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with an introduction to the module on Root Words, Prefixes, and Suffixes. The instructor presents learning objectives focused on decoding thousands of words without rote memorization. A key visual aid is the 'Golden Rule' strategy, which posits that mastering 100 root words can automatically unlock over 3,000 related terms. The efficiency of this method is illustrated using a pyramid diagram, contrasting the effort of memorizing individual words against learning foundational roots. Specific examples are introduced early on, such as the root 'BIO' (Life), which generates a list of derivatives including Biology, Biography, and Biodegradable. The instructor underlines key phrases like 'Without Memorizing Them' to emphasize the strategic advantage of this approach over traditional vocabulary lists.
2:00 – 5:00 02:00-05:00
The lesson formally defines a root word as the core part of a word that carries its basic meaning and cannot usually be broken down further. The instructor provides concrete examples of high-frequency roots, including 'Spect' (To See), 'Port' (To Carry), and 'Dict' (To Speak). A table format is used to categorize these roots with their corresponding meanings and derived words. An exam tip is highlighted, suggesting that identifying the root makes unfamiliar words significantly easier to understand. The instructor uses red annotations and underlining to emphasize key definitions and root words within the examples, reinforcing the visual structure of the lesson. This section establishes the foundational vocabulary required to understand how words are constructed.
5:00 – 10:00 05:00-10:00
The instructional focus shifts to the structural components of word formation: prefixes and suffixes. The instructor explains that a prefix is added before the root to change meaning, while a suffix is added after the root to change the part of speech. A formula is presented on screen: Prefix + Root + Suffix = Complete Word. Specific examples are used to demonstrate these functions, such as 'Un-' in Unhappy (meaning Not) and '-er' in Teacher (indicating a person). The instructor uses red brackets and circles to group these examples visually. The lesson also introduces the concept of word families, arguing that learning an entire family of words improves retention and grammar. This section transitions from isolated root definitions to the mechanics of combining word parts.
10:00 – 15:00 10:00-15:00
The video reviews a list of the most important prefixes and suffixes, including 'Un-', 'Re-', 'Dis-' for prefixes and '-er/-or', '-ness', '-ment' for suffixes. The instructor highlights an exam insight: many vocabulary questions can be solved simply by recognizing the prefix or suffix. The lesson then defines compound words as combinations of two complete words, distinguishing them from derived words formed by roots and affixes. A workflow is introduced for guessing the meaning of unknown words: Break Word, Find Prefix, Find Root, Find Suffix, Guess & Confirm. This section emphasizes practical application and test-taking strategies, encouraging students to analyze word structure rather than relying on blind memorization.
15:00 – 17:14 15:00-17:14
The final segment focuses on parts of speech conversion, explaining how specific suffixes change the grammatical category of a word. The instructor provides examples such as 'Beauty' transforming into 'Beautiful' (Noun to Adjective) and 'Succeed' becoming 'Successful'. The lesson lists common parts of speech including Noun, Adjective, Verb, and Adverb. A visual list of common mistakes is shown, warning against memorizing blindly while ignoring root meanings. The video concludes by reinforcing the workflow for decoding unknown words, using 'Biodegradable' as a final example to demonstrate how Bio (Life) + degrade (Break Down) + -able (Capable of) yields the complete meaning. This section ties together all previous concepts to show how word analysis aids in grammatical understanding and vocabulary expansion.
The lecture systematically deconstructs vocabulary acquisition into manageable components, prioritizing understanding over memorization. The central thesis is that language follows a predictable structure where roots provide meaning and affixes modify it. The 'Golden Rule' serves as the pedagogical anchor, promising efficiency by learning 100 roots to access 3,000 words. The progression moves logically from definition (roots) to mechanics (prefixes/suffixes) to application (word families and compound words). Visual aids like pyramids, tables, and color-coded annotations support the retention of these abstract concepts. The inclusion of exam tips and common mistakes grounds the theoretical content in practical assessment strategies. By the end, students are equipped with a workflow to analyze any unfamiliar word by identifying its constituent parts. The emphasis on parts of speech conversion further extends the utility of this method beyond simple definition to grammatical fluency. This structured approach aims to reduce cognitive load by replacing rote memory with pattern recognition.

