Types of Analysis
Duration: 5 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Prelims: General Knowledge: Physics Chemistry Biology History Geography Polity Indian Economy Static General Knowledge GK- Current Affairs Environment
- Prelims: General English: Vocabulary Noun Pronoun Adjectives Preposition Articles Direct and Indirect Speech Tenses Conjunction Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Sentence Correction (Error Correction) Sentence Completion (Fill in the blanks) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Cloze Test (Cloze Passage) Verbal Analogy (Word Based Analogy) Sentence Construction Adverb Verb
- Prelims: Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) HCF LCM Divisibility Rules Average Sequence and Series (Series) Number System Powers and Exponents (Surds and Indices) Algebra Profit and Loss Simple Interest and Compound Interest Time and Work Pipe and Cistern Speed Time and Distance Mixture and Alligation Mensuration and Geometry Age Problems Partnership Statistics Data Interpretation Arithmetic
- Prelims: General Agriculture: Agriculture in India and Tripura Natural Resource Management Fundamentals of Crop Production Horticulture Crop Improvement Crop Protection Social Science
- IT Mains: Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management Distributed Systems
- IT Mains: Computer Networking: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control 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
- IT Mains: DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery Big Data Systems Database Security & Authorization Enhanced Data Models NoSQL
- IT Mains: Software Engineering: Fundamentals of Software Engineering Software Requirements and Quality Assurance Software Design, Estimation and Metrics Software Testing Software Maintenance and Configuration Management
- IT Mains: Data Structures & Algorithms: Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing Algorithm Analysis Time Complexity Analysis Sorting Algorithms
- IT Mains: OOPS with C++ & Java: C Fundamentals OOPS with C++ Java Fundamentals Array, String, IO & References OOPS with Java Generic & Collections Multithreading File Handling & I/O
- IT Mains: Python: Introduction to Python Tokens, Variables, Data Types, I/O Operators & Expressions Control Flow & Looping Collections & Strings Functions & Modules
- IT Mains: Website Development: Website, Browser & Services Internet Fundamentals Web Design & Development Protocols & Services Web Publishing & Hosting Server Side & Security Emerging Technologies HTML Basics HTML5 CSS JavaScript-Basics .Net Programming PHP
- IT Mains: Mobile App Development: Mobile Computing Multimedia
- IT Mains: Linux / Windows Server Admin: Unix OS Linux OS
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture introduces the two main types of algorithm analysis: experimental (a posteriori) and theoretical (a priori). The instructor first defines experimental or relative analysis as evaluating an algorithm after it has been converted to code. Its advantage is that it provides exact values with no rough estimates, but its disadvantage is that the final result depends on many factors beyond the algorithm itself, such as background software, hardware, programming language, and even room temperature. The lesson then transitions to a priori analysis, also called independent or absolute analysis, which evaluates only the algorithm using asymptotic notations and mathematical tools. In this approach, performance is determined in terms of input size rather than actual execution time. The instructor writes example functions f1(n) = n^2 + 2n + 5 and f2(n) = n^3 to illustrate comparing growth rates. Finally, the concept of order of magnitude is defined as the number of times fundamental operations are involved in a statement, determined through a two-step process: finding the number of fundamental operations and then determining how many times they execute.
Chapters
0:00 – 2:00 00:00-02:00
The slide titled 'Types of Analysis' presents the first type, 'Experimental or Apostrium or relative analysis,' defined as analyzing an algorithm after it is converted to code. Red underlines are added progressively to key phrases, including the definition and the advantage line 'Exact values no rough.' The disadvantage section notes that results depend on many factors such as background software, hardware, programming language, and even the temperature of the room. The instructor gestures while explaining these points.
2:00 – 4:36 02:00-04:36
The slide transitions to 'Apriori Analysis or Independent analysis or Absolute analysis,' which uses asymptotic notations and mathematical tools to evaluate only the algorithm in terms of input size. The instructor writes f1(n) = n^2 + 2n + 5 and f2(n) = n^3 to illustrate comparing functions. A new slide then states 'Asymptotic Analysis is not perfect' with advantage and disadvantage lines. The final slide defines 'Order of magnitude' as the number of times fundamental operations are involved in a statement, broken into two steps: finding the number of fundamental operations and determining how many times they execute.
The lecture progresses from practical to theoretical analysis. Experimental (a posteriori) analysis measures actual running times after coding, yielding exact values but being affected by external factors like hardware and software. A priori (independent) analysis is purely mathematical, using asymptotic notation to determine the order of magnitude based on input size. The example functions f1(n) and f2(n) demonstrate how polynomial terms are compared to assess growth. The order of magnitude concept is operationalized as a two-step counting process for fundamental operations, providing the foundation for asymptotic analysis.

