Study guide

6.3 Blood Relations, Order & Ranking, Family Tree Logic

UGC NET National Eligibility Test

Track your progress as you read

Finished sections get a check mark.

1 Introduction & UGC NET Exam Structure

1.1 Exam Format, Scoring & Qualification Rules 1.2 Paper 1 Blueprint, Unit Weighting & High-Yield Strategy 1.3 CBT Interface Navigation, Pacing & Error Traps

2 Unit 1: Teaching Aptitude

2.1 Concept, Objectives & Levels of Teaching 2.2 Learner Characteristics & Factors Affecting Teaching 2.3 Teacher-Centred vs. Learner-Centred & Digital Teaching Methods 2.4 Evaluation Systems, CBCS & Computer-Based Assessment 2.5 Teaching Support Systems: Traditional, Modern & ICT-Based

3 Unit 2: Research Aptitude

3.1 Meaning, Types & Characteristics of Research 3.2 Steps of Research & Experimental Methodologies 3.3 Thesis Writing, Formatting Styles & Shodhganga 3.4 Research Ethics, UGC Plagiarism Regulations 2018 & Academic Integrity

4 Unit 3: Reading Comprehension

4.1 Academic Text Analysis & Core Question Archetypes 4.2 Logical Inferences, Authorial Stance & Contextual Vocabulary 4.3 High-Density Passage Walkthroughs & Question Deconstruction

5 Unit 4: Communication

5.1 Meaning, Types & Models of Communication 5.2 Verbal, Non-Verbal & Classroom Communication Dynamics 5.3 Psychological, Semantic, Cultural & Organizational Barriers 5.4 Mass Media, Digital Communication & Societal Impact

6 Unit 5: Mathematical Reasoning & Aptitude

6.1 Types of Reasoning: Verbal, Non-Verbal, Deductive, Inductive & Analogical 6.2 Number Series, Letter Series, Coding-Decoding & Direction Tests 6.3 Blood Relations, Order & Ranking, Family Tree Logic 6.4 Mathematical Aptitude: Fractions, Percentages, Profit & Loss 6.5 Ratios, Proportions, Mixtures & Averages 6.6 Time & Work, Speed-Time-Distance, Simple & Compound Interest

7 Unit 6: Logical Reasoning & Indian Logic

7.1 Structure of Arguments, Deductive vs. Inductive Reasoning, Syllogisms 7.2 Classical Square of Opposition, Categorical Propositions & Connotation/Denotation 7.3 Venn Diagrams, Moods & Figures, Formal and Informal Fallacies 7.4 Indian Logic: Six Pramanas 7.5 Structure of Anumana & Hetvabhasa

8 Unit 7: Data Interpretation

8.1 Sources, Acquisition & Graphical Representation 8.2 Tabular Data Analysis & Quantitative Calculation Shortcuts 8.3 Pie Charts, Bar Charts & Multi-Variable Data Sets 8.4 Data and Governance, Common NTA Traps & Error Prevention

9 Unit 8: Information & Communication Technology (ICT)

9.1 ICT Terminology, Acronyms, Hardware & Memory Hierarchy 9.2 Binary, Octal, Decimal, Hexadecimal Conversions & File Formats 9.3 Internet, Intranet, TCP/IP, Protocols, Email Mechanics & Cyber Security 9.4 Digital Initiatives in Higher Education 9.5 Audio & Video Conferencing: Protocols, Codecs & Educational Deployment 9.6 ICT and Governance: e-Governance Models, Digital India & Service Delivery

10 Unit 9: People, Development & Environment

10.1 Millennium Development Goals (MDGs) & Sustainable Development Goals (SDGs) 10.2 Air, Water, Soil & Noise Pollution and Health Impacts 10.3 Solid Waste, Hazardous Waste, Climate Change & Global Warming 10.4 Solar, Wind, Hydro, Biomass & India's Clean Energy Targets 10.5 Environmental Protection Act 1986, NAPCC & International Accords 10.6 Natural Hazards, Disasters & Mitigation Strategies

11 Unit 10: Higher Education System

11.1 Institutions of Higher Learning in Ancient India 11.2 Evolution of Higher Learning in Pre & Post-Independence India 11.3 Apex Regulatory Bodies, Accreditations & Institutional Classifications 11.4 National Education Policy (NEP 2020) & Institutional Transformation 11.5 Professional, Technical & Skill-Based Education 11.6 Value Education & Environmental Education

12 Paper 2 Strategy, Mock Testing & Exam Day Execution

12.1 Paper 2 Subject Strategy & Core Discipline Methodologies 12.2 Full 150-Question Timed Simulation Strategy, Error Logging & Endurance 12.3 NTA Exam-Day Protocols, CBT Test-Taking Rules & Score Maximization

6.3 Blood Relations, Order & Ranking, Family Tree Logic

Key Takeaways Explain This Topic AI

Family tree mapping uses standardized symbols: male ( + + + or □ \square □ ), female ( − - − or ◯ \bigcirc ◯ ), marital union ( = = = ), sibling bond ( − - − ), and vertical branches for generational descent.

Blood relationship parsing requires differentiating maternal kin (mother's lineage: Nana, Nani, Mama, Mami) from paternal kin (father's lineage: Dada, Dadi, Chacha, Bua) and recognizing that spouse's siblings are brothers-in-law or sisters-in-law.

Coded blood relations ( A + B , A × B A + B, A \times B A + B , A × B ) are solved efficiently by tracking generational increments ( Δ G = + 1 , 0 , − 1 \Delta G = +1, 0, -1 Δ G = + 1 , 0 , − 1 ) and eliminating options that violate required gender identities.

Linear ranking formulas resolve total individuals via T = L + R − 1 T = L + R - 1 T = L + R − 1 , overlapping intervals via Overlapping Middle = ( L 1 + R 2 ) − T − 2 \text{Overlapping Middle} = (L_1 + R_2) - T - 2 Overlapping Middle = ( L 1 ​ + R 2 ​ ) − T − 2 , and position swaps via T = New Rank A + Old Rank B − 1 T = \text{New Rank}_A + \text{Old Rank}_B - 1 T = New Rank A ​ + Old Rank B ​ − 1 .

Last updated: August 2026

Blood Relations, Order & Ranking, Family Tree Logic

Quick Answer: Blood relations and ranking problems require converting complex descriptive or coded constraints into rigorous visual models. Solve blood relations using a standardized Family Tree (vertical lines for generations, double horizontal lines for marriage, single lines for siblings, and signs + / − +/- + / − for gender). Solve linear ranking using the total formula T = L + R − 1 T = L + R - 1 T = L + R − 1 , middle overlap formula Middle = ( L 1 + R 2 ) − T − 2 \text{Middle} = (L_1 + R_2) - T - 2 Middle = ( L 1 ​ + R 2 ​ ) − T − 2 , and swap formula T = New Rank A + Old Rank B − 1 T = \text{New Rank}_A + \text{Old Rank}_B - 1 T = New Rank A ​ + Old Rank B ​ − 1 .

1. Family Tree Mapping Notations and Taxonomy

To eliminate cognitive confusion in multi-step relational descriptions, always translate textual statements into a standardized visual family tree.

Standard Symbolic Notations

Male Individual: Enclosed in a square [ + ] [+] [ + ] or designated with a plus sign ( + ) (+) ( + ) .

Female Individual: Enclosed in a circle [ − ] [-] [ − ] or designated with a minus sign ( − ) (-) ( − ) .

Marital Relationship (Husband & Wife): Double horizontal link ( A = B A = B A = B or A ⇔ B A \Leftrightarrow B A ⇔ B ).

Sibling Relationship (Brothers & Sisters): Single horizontal line ( A − B A - B A − B ).

Generational Descent (Parents to Children): Vertical downward line ( A ↓ B A \downarrow B A ↓ B ). [ Grandfather (+) ] = [ Grandmother (-) ] <-- Generation +2

  • |
  • +------------------+------------------+
  • | |
  • [ Father (+) ] = [ Mother (-) ] [ Uncle (+) ] = [ Aunt (-) ] <-- Generation +1
  • |
  • +-----------+-----------+
  • | |
  • [ Son (+) ] [ Daughter (-) ] = [ Son-in-law (+) ] <-- Generation 0 (Self)
  • Comprehensive Kinship Taxonomy Table

Relationship Maternal Lineage (Mother's Side) Paternal Lineage (Father's Side)

Grandparents Mother's Father (Maternal Grandfather), Mother's Mother (Maternal Grandmother) Father's Father (Paternal Grandfather), Father's Mother (Paternal Grandmother)

Uncles & Aunts Mother's Brother (Maternal Uncle), Mother's Sister (Maternal Aunt) Father's Brother (Paternal Uncle), Father's Sister (Paternal Aunt)

In-Law Relationships Uncle's Wife (Maternal Aunt / Mami), Aunt's Husband (Mausa) Uncle's Wife (Chachi/Tai), Aunt's Husband (Phupha)

Offspring of Siblings Brother's Son (Nephew), Brother's Daughter (Niece) Sister's Son (Nephew), Sister's Daughter (Niece)

Spousal Kin Spouse's Father (Father-in-law), Spouse's Mother (Mother-in-law) Husband's Brother (Brother-in-law), Wife's Sister (Sister-in-law)

Offspring's Spouse Daughter's Husband (Son-in-law), Son's Wife (Daughter-in-law) —

Important

Critical Kinship Trap: The term "only son of my father" spoken by a male refers to himself . Spoken by a female, it refers to her brother . Similarly, "only daughter of my mother" spoken by a female refers to herself .

  • 2. Solving Blood Relation Problem Archetypes
  • Type 1: Pointing / Descriptive Statements

In these problems, a person introduces another by describing a chain of relationships (e.g., "He is the only son of the father of my sister's mother" ).

Step-by-Step Backtracking Strategy:

Identify the speaker and locate the phrase "my / mine" .

Work backward from the end of the phrase toward the speaker.

  • Example Walkthrough: "Pointing to a man, a woman says: 'His mother is the only daughter of my mother.'"
  • Phrase: "My mother's only daughter"

Since the speaker is a woman, "my mother's only daughter" is herself (the woman) .

Therefore, "His mother = The woman" .

Conclusion: The man is the woman's son (and the woman is his mother).

Type 2: Coded Blood Relations

Relationships are expressed through mathematical symbols (e.g., P + Q P + Q P + Q means P P P is the father of Q Q Q ).

Generational Gap ( Δ G \Delta G Δ G ) and Gender Elimination Method:

Assign generational weights to operators:

  • Parents, Uncles, Aunts: Δ G = + 1 \Delta G = +1 Δ G = + 1
  • Siblings, Spouses: Δ G = 0 \Delta G = 0 Δ G = 0
  • Children, Nephews, Nieces: Δ G = − 1 \Delta G = -1 Δ G = − 1
  • Grandparents: Δ G = + 2 \Delta G = +2 Δ G = + 2

Gender Elimination: If looking for a female relation (e.g., "M is the aunt of N" ), eliminate any option where M M M is defined as male or where M M M 's gender is indeterminate (e.g., at the terminal end of an expression without a gender-defining operator).

Generational Check: Calculate the net Δ G \Delta G Δ G across the expression. If M M M is the aunt of N N N , the net generation difference between M M M and N N N must equal + 1 +1 + 1 .

Loading diagram... Generational Stratification in Family Tree Logic

3. Order and Ranking Principles and Formulations

Order and ranking problems evaluate position tracking within linear queues, rows, or comparative hierarchies.

Fundamental Position Formulations

Total Number of Persons in a Row ( T T T ): When the position of a single individual A A A is given from both the left end ( L L L ) and the right end ( R R R ): T = L + R − 1 T = L + R - 1 T = L + R − 1

(We subtract 1 1 1 because the person A A A is counted twice—once from the left and once from the right.)

Finding Rank from an Opposite End:

  • Rank from Left ( L L L ): L = T − R + 1 L = T - R + 1 L = T − R + 1
  • Rank from Right ( R R R ): R = T − L + 1 R = T - L + 1 R = T − L + 1
  • Rank from Top ( T o p Top T o p ): T o p = T − B o t t o m + 1 Top = T - Bottom + 1 T o p = T − B o tt o m + 1
  • Persons Between Two Individuals

Given the positions of two individuals, A A A (ranked L L L from left) and B B B (ranked R R R from right), in a total row of T T T individuals:

Non-Overlapping Case ( T > L + R T > L + R T > L + R ): The two persons do not cross each other; there is empty space between them. Number of Persons in Between = T − ( L + R ) \text{Number of Persons in Between} = T - (L + R) Number of Persons in Between = T − ( L + R )

Overlapping Case ( T < L + R T < L + R T < L + R ): The two persons cross each other's paths, causing double-counting of the two individuals and the middle segment. Number of Persons in Between = ( L + R ) − T − 2 \text{Number of Persons in Between} = (L + R) - T - 2 Number of Persons in Between = ( L + R ) − T − 2

  • (We subtract 2 2 2 to remove the two individuals themselves who were counted in both ranks.)
  • Position Interchanging in a Row

When two individuals, A A A and B B B , swap their positions:

Let A A A 's original rank from the left be L 1 L_1 L 1 ​ , and B B B 's original rank from the right be R 1 R_1 R 1 ​ .

After swapping, A A A occupies B B B 's original position, and A A A 's new rank from the left becomes L 2 L_2 L 2 ​ .

Total Persons in the Row ( T T T ): T = New Rank of A ( L 2 ) + Old Rank of B ( R 1 ) − 1 T = \text{New Rank of } A (L_2) + \text{Old Rank of } B (R_1) - 1 T = New Rank of A ( L 2 ​ ) + Old Rank of B ( R 1 ​ ) − 1

New Rank of B B B from the Right ( R 2 R_2 R 2 ​ ): R 2 = Old Rank of B ( R 1 ) + ( L 2 − L 1 ) R_2 = \text{Old Rank of } B (R_1) + (L_2 - L_1) R 2 ​ = Old Rank of B ( R 1 ​ ) + ( L 2 ​ − L 1 ​ ) (The shift in rank for both individuals is identical in magnitude: ∣ L 2 − L 1 ∣ = ∣ R 2 − R 1 ∣ |L_2 - L_1| = |R_2 - R_1| ∣ L 2 ​ − L 1 ​ ∣ = ∣ R 2 ​ − R 1 ​ ∣ .)

Comparative Inequalities (Vertical Ranking)

For problems comparing heights, weights, marks, or speeds, construct vertical chains of transitive inequalities:

Clue: " P P P is heavier than Q Q Q but lighter than R R R " ⟹ R > P > Q \implies R > P > Q ⟹ R > P > Q .

Clue: " S S S is heavier than T T T but not as heavy as Q Q Q " ⟹ Q > S > T \implies Q > S > T ⟹ Q > S > T .

Combined Chain: R > P > Q > S > T R > P > Q > S > T R > P > Q > S > T .

Deduction: R R R is the heaviest, and T T T is the lightest.