Tricks to Solve Questions on Binary Strings

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/GATE-GUIDANCE-BY-SANCHIT-SIR/engineering-mathematics/permutation-and-combination/special-applied-problems/asset-tricks-to-solve-questions-on-binary-strings after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  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
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  6. C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. Computer Networks: 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
  10. 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
  11. 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
  12. Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics, Combinatorics
  13. General Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Mensuration and Geometry, Mental Ability, Arithmetic, Profit and Loss, Powers and Exponents (Surds and Indices), Average, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Syllogisms, Venn Diagram, Seating Arrangements, Blood Relations, Directions (Direction Test), Analogy, Algebra, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Cubes & Dices, Ranking, Order and Sequence, Mixture and Alligation, Age Problems, Clock, Selection Decision Table (Decision Making), Data Arrangement, Ratio and Proportion, Vocabulary, Averages, Mixtures and Alligation, Percentages, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Statistics, Three-Dimensional Patterns and Visualization, Permutations and Combinations, Trigonometry, Simplification and Approximation, Constraint Puzzles, Numerical Reasoning, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Direction Sense, Assembling and Grouping of Shapes, Cubes and Dice, Profit, Loss and Discount, Mensuration, Probability, Measurement and Quantity Take-Off, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Order, Ranking and Sequence, Logical Deduction and Induction, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Clocks and Calendars, Time and Work, Algebra, Data Interpretation, Speed, Time and Distance, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Calendar, Alphabet and Word Tests, Sequences and Series, Powers, Surds and Logarithms, Number System, Transformation of Shapes
  14. English (Verbal Aptitude): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Direct and Indirect Speech, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Verb, Articles, Adverb, Modals, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Articles and Determiners, Adjectives and Adverbs, Modals, Conditionals and Subjunctive, Voice and Reported Speech, Blood Relations, Tenses, Vocabulary
  15. Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
  16. Full Mock Test:
  17. Previous Year Papers:
  18. GATE 2026 Counselling: Counselling and Guidance Sessions
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video is a lecture on combinatorics, specifically focusing on permutations, combinations, and binary strings. The instructor begins by introducing the fundamental difference between permutations (where order matters) and combinations (where order does not matter), using a visual metaphor of a detective trying to unlock a door with a permutation or combination lock. The main content then shifts to solving problems related to binary strings. The first problem asks for the number of 8-bit strings that start with '00' or end with '111', which is solved using the principle of inclusion and exclusion. The second problem asks for the number of binary strings with 'n' 0's and 'n' 1's such that the digits alternate, which is solved by recognizing the two possible alternating patterns. The final problem asks for the number of 8-bit numbers with exactly 3 zeros, which is solved using the combination formula C(8,3). The video uses a digital whiteboard for all calculations and explanations.

Chapters

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

    The video opens with a title card that visually distinguishes between 'PERMUTATION' and 'COMBINATION' using a casino theme (dice and roulette) and a fruit basket, respectively. The instructor then transitions to a slide titled 'Confused' which poses the question, 'Should I unlock with Permutation or Combination?'. This slide features a cartoon detective with a magnifying glass, standing between two doors labeled 'Permutation' and 'Combination', both of which are locked. The instructor, Yash Jain, introduces the core concept: permutations are about order (like a lock), while combinations are about selection (like a basket). The video then transitions to a new topic, 'Concept of Binary String', with a space-themed background.

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

    The instructor presents the first problem: 'Number of 8 bit strings that start with 00 or end with 111'. He explains that this is a classic inclusion-exclusion problem. He writes the formula: |A ∪ B| = |A| + |B| - |A ∩ B|. He calculates |A| (strings starting with 00) as 2^6, |B| (strings ending with 111) as 2^5, and |A ∩ B| (strings starting with 00 and ending with 111) as 2^3. He then adds these values to get the final answer. The second problem is introduced: 'Number of binary strings that has 'n' 0's and 'n' 1's such that 0's and 1's are alternating?'. He explains that for alternating strings, there are only two possible patterns: starting with 0 (010101...) or starting with 1 (101010...). He writes the two patterns on the board to illustrate this.

  3. 5:00 – 9:48 05:00-09:48

    The instructor moves to the third problem: 'Number of 8 bit numbers a) With exactly 3 zeros b) At least 3 zeros'. For part (a), he explains that this is a combination problem, C(8,3), which is the number of ways to choose 3 positions out of 8 for the zeros. He writes the formula C(8,3) = 8! / (3! * 5!) and calculates the result as 56. For part (b), he explains that 'at least 3 zeros' means 3, 4, 5, 6, 7, or 8 zeros. He writes the sum: C(8,3) + C(8,4) + C(8,5) + C(8,6) + C(8,7) + C(8,8). He then provides a more efficient method: total number of 8-bit numbers (2^8) minus the number of strings with fewer than 3 zeros (C(8,0) + C(8,1) + C(8,2)). He writes the formula: 2^8 - (C(8,0) + C(8,1) + C(8,2)) and begins the calculation. The video ends with a 'THANKS FOR WATCHING' screen.

The video provides a structured and clear explanation of key combinatorics concepts. It begins by establishing the fundamental difference between permutations and combinations through a relatable analogy. The core of the lecture is a series of progressively complex problems on binary strings, demonstrating the application of the inclusion-exclusion principle and the combination formula. The instructor uses a digital whiteboard to clearly show the step-by-step logic and calculations, making the problem-solving process transparent and easy to follow. The progression from simple counting to more complex conditional counting effectively builds the student's understanding of combinatorial principles.

Loading lesson…