Number Systems - HOT Questions (2)

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/general-aptitude-reasoning/number-system-bff2d7/perfect-squares-perfect-cubes-power-square-root-and-patterns/asset-number-systems-hot-questions-2 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. 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
  3. 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
  4. 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
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. 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
  7. 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. 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
  10. 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
  11. 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
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video, presented by Yash Jain from Knowledge Gate, is a tutorial on solving a specific type of number system problem. The video begins with an introduction to the topic, followed by a detailed analysis of a question asking for the sum of 'n' and 'p' where the square root of the number 12345678987654321 is expressed as a repeating digit 'n' repeated 'p' times. The instructor uses a step-by-step approach, first demonstrating the pattern by calculating the squares of numbers composed of repeated 1s (e.g., 11, 111, 1111) to show that 111111111 squared equals 12345678987654321. This reveals that the square root is 111111111, which is the digit '1' repeated 9 times. Therefore, 'n' is 1 and 'p' is 9, making their sum 10. The video concludes with a final answer and a thank you message.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with a title card displaying 'NUMBER SYSTEM' in a stylized font against a grey background. It then transitions to a presentation slide with a colorful, patterned background. The slide is titled 'NUMBER SYSTEM' and includes the text 'The mysterious world of numbers...' and 'Basic To Advance'. The instructor, Yash Jain, is visible in a small window in the bottom right corner. The main content area of the slide shows a question: 'q. The square root of 12345678987654321 is nnnnn... upto 'p' times, find sum of n and p ?'. The instructor begins to explain the problem, writing the square root symbol and the number 12345678987654321 on the screen.

  2. 2:00 – 5:00 02:00-05:00

    The instructor continues to work on the problem, writing the equation '√12345678987654321 = nnnnn... p times' on the screen. He then begins to analyze the pattern of the number 12345678987654321. He writes a series of equations on the left side of the screen to demonstrate the pattern: '(11)^2 = 121', '(111)^2 = 12321', and '(1111)^2 = 1234321'. He then extends this pattern to the full number, writing '(111111111)^2 = 12345678987654321'. This shows that the number is the square of a number composed of nine 1s. He then writes 'n = 1' and 'p = 9' to identify the values of n and p.

  3. 5:00 – 6:10 05:00-06:10

    The instructor completes the solution by calculating the sum of n and p. He writes 'n + p = 1 + 9 = 10' on the screen. He then circles the number 10 to emphasize the final answer. The video concludes with a black screen displaying a red neon-style text box that says 'THANK YOU FOR WATCHING'. The instructor's voiceover confirms the answer is 10.

The video presents a clear, step-by-step solution to a number theory problem. It begins by identifying the problem: finding the sum of 'n' and 'p' where the square root of a large, palindromic number is a repeating digit. The core of the solution lies in recognizing a mathematical pattern: the square of a number composed of 'k' ones results in a palindrome that increases from 1 to k and then decreases back to 1. By applying this pattern to the given number, the instructor deduces that the square root is 111111111, which is the digit 1 repeated 9 times. This directly gives n=1 and p=9, leading to the final answer of 10. The video effectively uses visual aids and a logical progression to teach a problem-solving technique for a specific class of number system questions.

Loading lesson…