Loops Time Complexity - 5

Duration: 17 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-COMPLETE-COURSE/design-analysis-of-algorithms/time-complexity-analysis/iterative-loops-code/asset-loops-time-complexity-5 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Section A: General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, History, Geography, Indian Economy, GK- Current Affairs, Evolution of Indian Banking (Banking & Financial Awareness), Environment
  3. Section A: General Intelligence & Reasoning ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analytical Reasoning (Counting Figures Reasoning), Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Directions (Direction Test), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability
  4. Section A: Arithmetical & Numerical Ability: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Powers and Exponents (Surds and Indices), Algebra, Probability, Mental Ability, Age Problems, Partnership, Statistics, Arithmetic, Speed Mathematics and Basic Mathematics, Miscellaneous
  5. Section A: English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Articles, Sentence Construction, Preposition, Direct and Indirect Speech, Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Modals, Active Passive Voice (Voice), Sentence Correction (Error Correction), Adverb, Conjunction, Cloze Test (Cloze Passage)
  6. Section A: Hindi Language & Comprehension: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  7. Section B: Programming, Data Structures, OOP & Java: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  8. Section B: Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Access Technologies, Network Security, Society, Law & Ethics, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  9. Section B: Teaching Methodology: Child Development, Concept of Pedagogy, Theories, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Curriculum Framework & Reforms, National Education Policy (NEP) 2020, Psychology, Teaching-Learning Process, Personality Development, Teaching Methods & Strategies, Learning and Motivation, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Nature, Objectives & Characteristics of Teaching, Teaching-Learning Aids & ICT Integration, Classroom Management & Communication, Evaluation, Assessment & Measurement, Curriculum & School Environment, Inclusive Education & Special Needs, Professional Development & Ethics
  10. Section B: Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  11. Section B: Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  12. Section B: Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  13. Section B: Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, HTML Basics, CSS, Emerging Technologies, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML
  14. Section B: Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Terms & Abbreviations, MS Office Applications, Instr Formats & Modes, Floating Point Rep, Artificial Intelligence, साइबर सुरक्षा / Cyber Safety and Security, कंप्यूटर सॉफ़्टवेयर / Computer Software, ऑपरेटिंग सिस्टम / Operating System, वर्ड प्रोसेसिंग (MS Word) / Word Processing (MS Word), कंप्यूटर नेटवर्क / Computer Networks
  15. Section B: Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  16. Section B: Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  17. Section B: Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  18. Section B: Mathematics: Linear Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory, Number System & Place Value, Factors, Multiples, Divisibility, HCF & LCM, Mensuration — Perimeter, Area, Surface Area, Volume, Data Handling, Graphs & Probability, Coordinates & Graphs, Higher Mathematics — Trigonometry, Quadratics, Polynomials, Progressions, Statistics, Logarithms, समतल क्षेत्रमिति / Plane Mensuration, प्रतिचयन / Sampling
  19. Section B: Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  20. Section B: Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing
  21. DSSSB Previous Year Paper:
  22. Business Studies and Management: Business Communication, Business Organization and Management, Financial Accounting, Business Economics, Management Information System (MIS), Knowledge Management & New Economy
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment focuses on deriving the time complexity of for loops where the iterator is divided by a constant factor in each iteration. The instructor systematically analyzes two specific loop structures: one where the iterator `i` is halved (`i = i / 2`) and another where it is divided by seven (`i = i / 7`). The core pedagogical method involves tracing the sequence of values for `i` across iterations, establishing a mathematical inequality to determine when the loop terminates (when `i < 1`), and solving for the number of iterations using logarithms. The analysis demonstrates that dividing a variable by a constant factor results in logarithmic time complexity, specifically O(log n). The instructor writes out the sequence of values (n, n/2, n/4...), sets up the condition `n / 2^k >= 1`, and solves for k to show that the number of iterations is proportional to log base 2 of n. This pattern is then generalized for division by other constants, such as 7, confirming that the base of the logarithm changes but the complexity class remains O(log n).

Chapters

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

    The instructor introduces the first problem, a for loop where the iterator `i` starts at `n`, continues while `i >= 1`, and is halved in each iteration (`i = i / 2`). He begins the analysis by writing the loop structure on the board: `for(i = n; i >= 1; i = i / 2)`. He establishes the initial state by setting `i` to `n` and noting that the condition `n >= 1` must hold true for the loop to execute. This sets up the base case for determining how many times the loop will run before `i` drops below 1.

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

    The instructor traces the sequence of values for `i` to visualize the loop's progression. He writes down the first few iterations: `n`, then `n/2`, and subsequently `n/4` (or `n/2^2`). He explicitly checks the loop condition for each step, writing inequalities like `n >= 1`, `n/2 >= 1`, and `n/4 >= 1` to verify that the loop continues. This step-by-step substitution illustrates how the variable decreases exponentially, which is a key concept in identifying logarithmic behavior. The instructor writes `n/2^k` to represent the value of `i` after k iterations.

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

    The instructor formalizes the termination condition by setting up an inequality to solve for the number of iterations `k`. He writes that the loop runs as long as `n / 2^k >= 1`, which implies `n >= 2^k`. He explains that the total number of iterations is `(k+1) Times` because the loop runs for `i = n/2^0` through `n/2^k`. To find the exact value of k, he applies logarithms to both sides of the inequality `n >= 2^k`, resulting in `log n >= k log 2`. This mathematical derivation is crucial for converting the exponential reduction into a logarithmic complexity measure.

  4. 10:00 – 15:00 10:00-15:00

    The instructor transitions to a second example where the iterator is divided by 7 instead of 2. He writes the new loop structure: `for(i = n; i >= 1; i = i / 7)`. He repeats the same analytical process, writing the sequence of values `n`, `n/7`, and `n/49` (or `n/7^2`). He sets up the termination inequality `n / 7^k >= 1`, which leads to `n >= 7^k`. He solves for k by taking the logarithm base 7, deriving that `k <= log_7 n`. This demonstrates that changing the divisor changes the base of the logarithm but not the fundamental complexity class.

  5. 15:00 – 17:09 15:00-17:09

    The instructor concludes the analysis by summarizing the time complexity for both examples. For the loop divided by 2, he confirms the complexity is O(log n). For the loop divided by 7, he writes `Time Complexity = O(log n)` on the board, noting that while the base is 7, it is still logarithmic. He emphasizes that the number of iterations is `(r+1) Times` where r is derived from `n >= 7^r`. The final takeaway is that any loop dividing the iterator by a constant factor results in logarithmic time complexity, regardless of the specific divisor used.

The lecture provides a rigorous mathematical derivation for determining the time complexity of loops with geometric progression in their iterator. The instructor's method is consistent across examples: first, trace the variable values to identify the pattern (n, n/c, n/c^2...); second, establish the termination inequality (n/c^k >= 1); third, solve for k using logarithms. The key insight is that the number of iterations k satisfies `c^k <= n`, which implies `k <= log_c(n)`. Since the base of a logarithm only introduces a constant factor difference (log_a n = log_b n / log_b a), the Big-O notation simplifies to O(log n) for any constant divisor c > 1. This confirms that halving or dividing by any fixed integer results in logarithmic time complexity, a fundamental concept for analyzing algorithms like binary search or recursive divide-and-conquer strategies.

Loading lesson…