Find the Nth Term of the Series
Duration: 3 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Quantitative Aptitude: Number System, Divisibility Rules, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Mixture and Alligation, Partnership, Age Problems, Time and Work, Pipe and Cistern, Speed Time and Distance, Algebra, Arithmetic, Data Interpretation, Sequence and Series (Series), Logarithm, Powers and Exponents (Surds and Indices), Permutation and Combination, Probability, Speed Mathematics and Basic Mathematics, Trigonometry
- Logical Reasoning: Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Syllogisms, Inequality, Data Sufficiency, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Venn Diagram, Logical Sequence Of Words, Calendar, Clock, Cubes & Dices, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
- Verbal Ability: Noun, Pronoun, Adjectives, Verb, Adverb, Tenses, Subject Verb Agreement (Verb Noun Agreement), Articles, Preposition, Conjunction, Modals, Determiner, Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Construction
- Data Structures (Domain Test): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms (Domain Test):
- OOPs (Domain Test): Object Oriented Programming (OOPS)
- DBMS (Domain Test): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
- SQL (Domain Test): SQL
- Operating Systems (Domain Test): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
- Computer Networks (Domain Test): 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, Cloud Computing and IoT, Cyber and Info Security
- Coding: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
- Written English Test: English Writing Ability
- Psychometric Test: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This video is a programming tutorial from Knowledge Gate that teaches how to solve a pattern recognition problem. The instructor presents a series of numbers: 2, 10, 30, 68, 130, and asks the viewer to identify the pattern. The solution is derived by analyzing the relationship between the index (starting from 1) and the corresponding number, which is found to be n^3 + n. The video then demonstrates how to implement this formula in a C program using the scanf and printf functions. The final code snippet is shown, and the instructor explains that the program reads an integer X, calculates X^3 + X, and prints the result. The video also includes public test cases to verify the solution, such as input 8 yielding output 520 and input 12 yielding output 1740.
Chapters
0:00 – 2:00 00:00-02:00
The video begins with the Knowledge Gate logo, followed by a slide outlining the problem. The problem statement is displayed: given a series of numbers 2, 10, 30, 68, 130, identify the pattern and print the number at the Xth index. The input is a single integer X, and the output is the number at that index. The instructor, Yash Jain Sir, is visible in a small window. The instructor starts to analyze the series, writing on the screen to find the pattern. He begins by testing the formula n^3 + n for the first few terms, writing '1^3 + 1 = 2' and '2^3 + 2 = 10' to verify the pattern.
2:00 – 2:58 02:00-02:58
The instructor continues to verify the pattern by writing '3^3 + 3 = 30' and '4^3 + 4 = 68' on the screen, confirming the formula n^3 + n. He then shows public test cases: for input 8, the output is 520, and for input 12, the output is 1740, which are calculated as 8^3 + 8 and 12^3 + 12 respectively. The video then transitions to a code editor where the instructor writes a C program. The code includes the necessary header, a main function, and the logic to read an integer n, calculate n^3 + n, and print the result. The instructor explains the code line by line, emphasizing the use of scanf and printf.
The video provides a clear, step-by-step guide to solving a common programming problem. It starts with a problem statement, moves to a logical analysis to discover the mathematical pattern (n^3 + n), and then demonstrates the implementation of this solution in C code. The progression from problem understanding to code writing is logical and educational, making it a useful resource for students learning basic programming and pattern recognition.

