Concepts, Rules, Short Tricks & Questions

Duration: 1 hr 10 min

This video lesson is available to enrolled students.

Return to /learn/IBPS-SO-IT-MAINS/english-language/sentence-re-arrangements-para-jumbles-narrative-sequencing/basic-sentence-re-arrangement-para-jumbles-narrative-sequencing/asset-concepts-rules-short-tricks-questions-6608 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
  3. Quantitative Aptitude & Numerical Ability: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
  4. Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
  5. Data Structures- Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  7. Python- Professional Knowledge: Python for Placements by Yash Sir, Collections & Strings, Functions & Modules, File Handling & Data Analysis, Python Basics
  8. Operating System- Professional Knowledge: Introduction to OS, Process Management, Process Synchronization, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Windows OS
  9. DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control, Relational Algebra, Relational Calculus, NoSQL, Data Warehousing & Mining
  10. Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security, Transport Layer Services, DLL: Flow Control, Cloud Computing
  11. Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer, Instr Formats & Modes
  13. Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  14. Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
  15. Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
  16. Programming Languages- Professional Knowledge: C Programming by Yash Sir, Language Design, DMA, Macros, Scoping & File Handling, Object Oriented Programming (OOPS), Programming in C++, Java, HTML, C Language Core
  17. Emerging Tech- Professional Knowledge: Emerging Tech Trends, MS Office Applications
  18. Artificial Intelligence: Artificial Intelligence
  19. Image Processing: Digital Image Fundamentals
  20. Internet & Web Technology: Website, Browser & Services, Internet Fundamentals, Server Side & Security, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Cyber Safety and Security, Ethical Hacking
  21. Descriptive Paper: English Writing Ability
  22. Mains - Unit Tests:
  23. Mains - Full Mock Tests:
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

  1. 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. 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.

  3. 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.”

  4. 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.

  5. 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.

  6. 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.

  7. 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.

  8. 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.

  9. 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.

  10. 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.

  11. 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.

  12. 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.

  13. 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.

  14. 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.

  15. 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.

Loading lesson…