Demo: Algorithm Classification
Duration: 15 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
- Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and Data Structures: 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
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: 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
- Paper 2 | Compiler Design: 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
- Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
- Paper 2 | DataBase Management System/DBMS: 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
- Paper 2 | Computer Networks: Introduction to CN 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
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture segment introduces the fundamental classification of algorithms into deterministic and non-deterministic categories. The instructor begins by defining a Deterministic Algorithm as one that always produces the same output for a given input and follows a predictable sequence of steps. This definition is emphasized through underlining key phrases on the slide titled 'Algorithm Classification: - Deterministic vs Non-Deterministic'. To illustrate this concept, the instructor presents a C-style code snippet named `Deterministic_Search(int A[], int n, int key)`. The implementation utilizes a standard linear search loop: `for(int i = 1; i <= n; i++)`, checking if `A[i] == key` to print 'Found' and return, or printing 'Not Found' if the loop completes. The instructor then populates an array A with specific integer values, such as [20, 15, 37, 83, 5, 10], and sets a search key (e.g., 15 or 5) to demonstrate the algorithm's execution. The visual trace shows the loop variable `i` incrementing sequentially from 1 to n, comparing each element against the target key. This step-by-step progression highlights the predictable nature of deterministic algorithms, where every iteration is known in advance. The segment transitions to Non-Deterministic Algorithms, defined as those that may produce different outputs for the same input due to inherent randomness. A new function `NonDeterministic_Search` is introduced, featuring the line `i = random(1, n); // randomly choose any index`. The instructor demonstrates this by simulating two executions on the same array with key=5. In one run, a random index might select 83 (resulting in 'Not Found'), while another run could randomly select the index containing 5 (resulting in 'Found'). This contrast effectively illustrates how non-deterministic algorithms lack the fixed, predictable path of their deterministic counterparts.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with the definition of a Deterministic Algorithm, emphasizing that it 'Always produces the same output for a given input and follows a predictable sequence of steps'. The instructor underlines these key phrases on the slide 'Algorithm Classification: - Deterministic vs Non-Deterministic'. A C-style code snippet `Deterministic_Search(int A[], int n, int key)` is displayed to provide a concrete example. The code shows a linear search loop `for(int i = 1; i <= n; i++)` that iterates through an array. The instructor initializes the array A with values [20, 15, 37, 83, 5, 10] and sets the search key to 15. This setup establishes the baseline for understanding how deterministic algorithms operate systematically.
2:00 – 5:00 02:00-05:00
The instructor traces the execution of the deterministic search algorithm on the array [30, 15, 37, 83, 5, 10] with a search key of 5. The visual notes track the loop condition `i <= n` (where n=6) and the comparison logic. For iteration i=1, A[1]=20 is compared to key 5 (Mismatch). For i=2, A[2]=15 is compared (Mismatch). The trace continues through indices 3 and 4, showing A[3]=37 and A[4]=83 failing the check. The instructor highlights that the algorithm proceeds sequentially, incrementing `i` by 1 each time until the condition is met or the array ends. This detailed walkthrough reinforces the concept of a 'predictable sequence of steps' where every action is determined by the previous state.
5:00 – 10:00 05:00-10:00
The lecture transitions to Non-Deterministic Algorithms, defined on-screen as those that 'May produce different output for the Same input due to inherit randomness'. The instructor introduces a function `NonDeterministic_Search(int A[], int n, int key)` containing the line `i = random(1, n); // randomly choose any index`. Unlike the deterministic version, this algorithm does not iterate sequentially. Instead, it selects a random index immediately. The instructor demonstrates this by simulating an execution where the random selection picks index 4 (value 83), which does not match key=5, resulting in 'Not Found'. This example contrasts sharply with the deterministic trace shown previously.
10:00 – 14:55 10:00-14:55
The instructor completes the non-deterministic demonstration by showing a second execution path where the random index selection picks 5 directly, resulting in 'Found'. This variability for the same input (key=5) underscores the definition of non-determinism. The final segment revisits the Deterministic Algorithm to reinforce the contrast, showing the full loop `for(int i = 1; i <= n; i++)` again. The instructor walks through the iterations until A[5] matches key=5, printing 'Found' and returning. The slide text explicitly contrasts the two approaches: deterministic algorithms follow a fixed path, while non-deterministic ones rely on randomness. The video concludes by summarizing these classifications through the lens of algorithmic predictability and output consistency.
The lecture effectively distinguishes between deterministic and non-deterministic algorithms using linear search as a primary example. The core distinction lies in predictability: deterministic algorithms follow a fixed, sequential path (e.g., `for(int i = 1; i <= n; i++)`), ensuring the same output for identical inputs. In contrast, non-deterministic algorithms introduce randomness (e.g., `i = random(1, n)`), leading to variable outcomes even with the same input data. The instructor uses visual traces of array indices and loop conditions to make these abstract concepts concrete. Key takeaways include the definition of determinism as 'always producing the same output' and the mechanism of non-determinism via random index selection. The use of specific array values like [30, 15, 37, 83, 5, 10] and search keys like 5 allows students to follow the logic step-by-step. This foundational classification is crucial for understanding algorithm behavior in computer science.

