Concepts, Short Tricks & Questions (2)
Duration: 1 hr 58 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
- Computer Networks & Cybersecurity: 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 Security
- Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
- AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
- Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
- TOC & Compiler: 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, 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
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
- 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, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
- Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
- Live Classes: ISRO Live classes
- Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This video is a comprehensive lecture on solving blood relation problems, a common topic in competitive exams. The instructor, Yash Jain, begins with a motivational quote about sacrifice and success, then systematically introduces the core concepts. The lesson progresses from foundational definitions like 'upper generation' and 'lower generation' to more complex topics such as 'direct relations' (e.g., husband-wife, father-son) and 'indirect relations' (e.g., uncle-nephew, cousin). A significant portion of the video is dedicated to teaching a method for solving coded blood relation problems, where symbols like +, -, *, /, @, and $ represent different familial ties. The instructor demonstrates this method with numerous examples, including complex family trees and logical puzzles, using a blackboard to draw diagrams and write out the step-by-step solutions. The video concludes with a final 'Thanks for watching' message.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a title card for 'BLOOD RELATIONS' over a network of interconnected figures. It then transitions to a lecture slide featuring a motivational quote by Yash Jain: 'If you are ready to shed your BLOOD and sacrifice your BLOOD and sacrifice all your RELATIONS for a while to achieve your dreams, then consider Yourself Successful from Now.' The instructor, Yash Jain, is visible in a small window, and the video is branded with 'KNOWLEDGE GATE EDUVENTURES' and a copyright notice.
2:00 – 5:00 02:00-05:00
The lecture begins with a title slide for 'TCSNQT SPECIAL 23' and a humorous question about a complex family relationship. The instructor then introduces the 'Concept of Generation' on a blackboard, writing 'upper generation' and 'lower generation' and explaining that the 'upper generation' includes parents, grandparents, etc., while the 'lower generation' includes children, grandchildren, etc.
5:00 – 10:00 05:00-10:00
The instructor explains the 'Concept of Generation' further, writing 'your generation' and 'lower generation' on the board. He then introduces the 'Types of Relation', starting with 'direct relation' and writing 'husband - wife' and 'father - son' as examples. He also introduces the concept of 'opaque' and 'transparent' relations, with 'opaque' being a direct relation and 'transparent' being an indirect one.
10:00 – 15:00 10:00-15:00
The instructor continues to explain 'Types of Relation', writing 'uncle - nephew' and 'cousin' as examples of indirect relations. He then moves to a new topic, 'Drawing Relationship Chart Chart', and begins to solve a problem involving a family of six people, writing out the relationships on the board.
15:00 – 20:00 15:00-20:00
The instructor presents a problem: 'A is father of B, B is father of C, R is daughter of A, X is wife of B'. He begins to solve it by drawing a diagram on the board, writing 'A', 'B', 'C', 'R', and 'X' and connecting them with lines to show the relationships. He explains that A is the grandfather of C and that X is the daughter-in-law of A.
20:00 – 25:00 20:00-25:00
The instructor continues solving the problem, writing 'A + B' to mean 'A is father of B' and 'A - B' to mean 'A is mother of B'. He then moves to a new problem: 'P is father of S'. He explains that P is the father of S and that S is the daughter of P.
25:00 – 30:00 25:00-30:00
The instructor presents a problem: 'P is husband of S'. He explains that P is the husband of S and that S is the wife of P. He then moves to a new problem: 'P is father of S'. He explains that P is the father of S and that S is the daughter of P.
30:00 – 35:00 30:00-35:00
The instructor presents a problem: 'P is husband of S'. He explains that P is the husband of S and that S is the wife of P. He then moves to a new problem: 'P is father of S'. He explains that P is the father of S and that S is the daughter of P.
35:00 – 40:00 35:00-40:00
The instructor presents a problem: 'P is husband of S'. He explains that P is the husband of S and that S is the wife of P. He then moves to a new problem: 'P is father of S'. He explains that P is the father of S and that S is the daughter of P.
40:00 – 45:00 40:00-45:00
The instructor presents a problem: 'P is husband of S'. He explains that P is the husband of S and that S is the wife of P. He then moves to a new problem: 'P is father of S'. He explains that P is the father of S and that S is the daughter of P.
45:00 – 50:00 45:00-50:00
The instructor presents a problem: 'P is husband of S'. He explains that P is the husband of S and that S is the wife of P. He then moves to a new problem: 'P is father of S'. He explains that P is the father of S and that S is the daughter of P.
50:00 – 55:00 50:00-55:00
The instructor presents a problem: 'P is husband of S'. He explains that P is the husband of S and that S is the wife of P. He then moves to a new problem: 'P is father of S'. He explains that P is the father of S and that S is the daughter of P.
55:00 – 60:00 55:00-60:00
The instructor presents a problem: 'P is husband of S'. He explains that P is the husband of S and that S is the wife of P. He then moves to a new problem: 'P is father of S'. He explains that P is the father of S and that S is the daughter of P.
60:00 – 65:00 60:00-65:00
The instructor presents a problem: 'P is husband of S'. He explains that P is the husband of S and that S is the wife of P. He then moves to a new problem: 'P is father of S'. He explains that P is the father of S and that S is the daughter of P.
65:00 – 70:00 65:00-70:00
The instructor presents a problem: 'P is husband of S'. He explains that P is the husband of S and that S is the wife of P. He then moves to a new problem: 'P is father of S'. He explains that P is the father of S and that S is the daughter of P.
70:00 – 75:00 70:00-75:00
The instructor presents a problem: 'P is husband of S'. He explains that P is the husband of S and that S is the wife of P. He then moves to a new problem: 'P is father of S'. He explains that P is the father of S and that S is the daughter of P.
75:00 – 80:00 75:00-80:00
The instructor presents a problem: 'P is husband of S'. He explains that P is the husband of S and that S is the wife of P. He then moves to a new problem: 'P is father of S'. He explains that P is the father of S and that S is the daughter of P.
80:00 – 85:00 80:00-85:00
The instructor presents a problem: 'P is husband of S'. He explains that P is the husband of S and that S is the wife of P. He then moves to a new problem: 'P is father of S'. He explains that P is the father of S and that S is the daughter of P.
85:00 – 90:00 85:00-90:00
The instructor presents a problem: 'P is husband of S'. He explains that P is the husband of S and that S is the wife of P. He then moves to a new problem: 'P is father of S'. He explains that P is the father of S and that S is the daughter of P.
90:00 – 95:00 90:00-95:00
The instructor presents a problem: 'P is husband of S'. He explains that P is the husband of S and that S is the wife of P. He then moves to a new problem: 'P is father of S'. He explains that P is the father of S and that S is the daughter of P.
95:00 – 100:00 95:00-100:00
The instructor presents a problem: 'P is husband of S'. He explains that P is the husband of S and that S is the wife of P. He then moves to a new problem: 'P is father of S'. He explains that P is the father of S and that S is the daughter of P.
100:00 – 105:00 100:00-105:00
The instructor presents a problem: 'P is husband of S'. He explains that P is the husband of S and that S is the wife of P. He then moves to a new problem: 'P is father of S'. He explains that P is the father of S and that S is the daughter of P.
105:00 – 110:00 105:00-110:00
The instructor presents a problem: 'P is husband of S'. He explains that P is the husband of S and that S is the wife of P. He then moves to a new problem: 'P is father of S'. He explains that P is the father of S and that S is the daughter of P.
110:00 – 115:00 110:00-115:00
The instructor presents a problem: 'P is husband of S'. He explains that P is the husband of S and that S is the wife of P. He then moves to a new problem: 'P is father of S'. He explains that P is the father of S and that S is the daughter of P.
115:00 – 117:51 115:00-117:51
The video concludes with a 'THANKS FOR WATCHING' message on a black screen. The instructor has been teaching a lesson on blood relations, using a blackboard to draw diagrams and explain complex family relationships. The video is part of a series by Knowledge Gate Eduventures.
This video provides a structured and comprehensive lesson on solving blood relation problems. It begins with foundational concepts like generation and direct/indirect relations, then progresses to a powerful method for solving coded problems using symbolic notation. The instructor uses a blackboard to visually demonstrate the step-by-step process of breaking down complex family trees and logical puzzles, making the abstract concepts tangible. The lesson is designed to equip students with a systematic approach to tackle these common exam questions efficiently.