Concepts, Rules, Short Tricks & Questions
Duration: 1 hr 10 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 lecture teaches paragraph jumbles (sentence reordering) for competitive exams. It begins by defining the task: four or more jumbled sentences must be rearranged into a coherent paragraph, with options showing numerical sequences. The instructor emphasizes prerequisites—basic grammar and passage understanding—and warns against the “big mistake” of relying only on mock tests without concepts, illustrated by stagnant scores. The core method is finding mandatory pairs: names/pronouns (a pronoun follows its proper noun), assertion and example/reason, general-to-specific flow, and closing sentences signaled by Hence/Finally/Therefore. A summary workflow is given: check options, track pronouns, identify pairs, eliminate options. Worked examples include a family morning walk (answer SQPR), job applications/certification, the 1971 war sentence, a farmer/wealthy man story (answer 4132), and an Infosys/Wipro passage using general-to-specific logic. The lesson consistently uses board annotations—circles, crosses, underlines—to demonstrate elimination and pairing.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces “What are Para Jumbles?” on a blackboard, writing four numbered lines (1–4) and lettered options with sequences such as 1324, 1243, 4123, and 4231. He labels the structure as “Paragraph re-ordering” and “Sentence re-ordering,” boxing S1, bracketing middle lines as S2–S5, and marking S6 to show how sentences are numbered before rearrangement.
2:00 – 5:00 02:00-05:00
The board shows a worked Para Jumble with options like a) 2314 and d) 3214, each crossed out with an X, while the correct sequence “1/2/3/4” is circled in a bottom oval. The instructor uses green marker to eliminate wrong options and circle the answer, demonstrating that jumbles are solved by identifying the one coherent order among permutations.
5:00 – 10:00 05:00-10:00
A “Pre-requisites” slide lists “1. Grammar (Basic)” and “2. Understanding of Passages,” with a CHECKLIST graphic and the note: “Read Newspapers daily… establish link between sentences in a faster way.” The instructor then presents the “Big Mistake” slide: students think there are no concepts in Para Jumbles, shown by mock test scores 16/20 down to 12/20 and the line “You are not scoring marks, paper is giving you marks.”
10:00 – 15:00 10:00-15:00
The lesson moves to “Concept 3: Find the Pair Sentences,” writing P Q R S and highlighting “[SR pair]” to mean two sentences that must stay together. An example sentence “Yash Sir is a handsome guy” is broken into S1–S4, with a diagram “S1 _ S4” and an X mark showing how pair logic constrains the possible order.
15:00 – 20:00 15:00-20:00
A brief clip transitions to “Types of Mandatory pairs.” Type 1, “Names and Pronouns,” states a pronoun always follows the proper noun it refers to. In an example about Adithal, options A and B are crossed out while C and D remain. Type 2, “Assertion and Example,” is introduced: an assertion is made and the next sentence explains the reason.
20:00 – 25:00 20:00-25:00
The instructor annotates the Assertion and Example rule with a red “Statement” label. In an example about software stocks, lines A–D include “ABX Software have quoted a 150% rise,” with side labels “Conclusion,” “Assertion example,” and “Reason.” Options A. BDCA, B. ACDB, C. DCAB are shown as the candidate orders to test against the pair logic.
25:00 – 30:00 25:00-30:00
The “General to Specific” pair is taught: initial sentences give a broad idea, subsequent ones add details. In a Cognizant US/Bangalore example, sentences are labeled General and Specific, and option BCAD is marked correct. The instructor then shifts to “How to identify the starting sentence?” using definitions, universal truths, and clue words like firstly.
30:00 – 35:00 30:00-35:00
Starting-sentence rules are applied to an ISP free-internet example, with option ABCD marked correct. The slide lists: “Starting statements can be definitions, universal truths,” “Try to collect clue words like firstly, in the beginning,” and “Use Noun-Pronoun relationship approach.” This consolidates how to anchor a paragraph before pairing the rest.
35:00 – 40:00 35:00-40:00
The instructor explains closing sentences, noting they often begin with “Hence,” “Finally,” or “Therefore.” A SUMMARY slide lists the method: 1. Options, 2. Pronoun, 3. Pairs, 4. Eliminate Options. A new five-fragment example is introduced with pieces like “it becomes an honor of a lifetime” and “win an award,” setting up pronoun tracking.
40:00 – 45:00 40:00-45:00
The five-fragment award example is analyzed by circling pronouns and underlining key phrases to link fragments. The method reinforces that pronoun references determine which fragment must follow another, narrowing the permutation before options are eliminated.
45:00 – 50:00 45:00-50:00
A family morning walk question is solved: “Devansh and his family went for morning walk,” with options a) PSQR b) QPRS c) RQSP d) SQPR. The instructor circles pronouns “her” and “she,” marks (a) crossed out, and selects (d) SQPR with a checkmark. A new job-application/certification question then appears.
50:00 – 55:00 50:00-55:00
The job-application question continues with lines such as “He wants to get a job” and “Most of the companies have refused his resume for being unskilled.” The board shows pair markers like “Q _ P” and “R S,” illustrating how pronoun-noun links fix relative order before the final option is chosen.
55:00 – 60:00 55:00-60:00
A 1971 war sentence, “1971 war changed the political geography of the subcontinent,” is reviewed as a starting-statement example. Options 1324, B. 3142, C. 2143, D. 1423 are shown, with the instructor using it to demonstrate how a broad historical statement can anchor a paragraph.
60:00 – 65:00 60:00-65:00
A farmer/wealthy man story is solved. Sentence 4, “There is a story about a wealthy [man] who was once offered all the land he could walk on in a day,” is identified as introductory. Options a) 4312 b) 3124 c) 4132 d) 4123 are tested; a and b are crossed out, and c) 4132 is circled with a checkmark.
65:00 – 69:31 65:00-69:31
The final example uses an Infosys/Wipro passage with figures “Rs 54,000 crore each” and “$15 billion each.” The instructor circles “Infosys Wipro,” writes “Specif” in red, and underlines the monetary details to apply General-to-Specific logic. Options a) 2341 b) 1432 c) 1342 d) 2313 are shown for elimination.
The lecture builds a systematic approach to Para Jumbles. It starts with the task format—numbered sentences and permutation options—then establishes prerequisites (grammar, passage comprehension) and warns against concept-free mock practice. The central technique is mandatory pairing: pronoun-noun links, assertion-reason/example pairs, general-to-specific progression, and closing markers (Hence/Finally/Therefore). A four-step workflow—Options, Pronoun, Pairs, Eliminate Options—is repeatedly applied to worked examples: the family walk (SQPR), job applications, 1971 war statement, farmer story (4132), and Infosys/Wipro passage. Board annotations (circles, crosses, underlines) consistently show how to eliminate wrong orders and confirm the coherent sequence.

