Tricks to Solve Questions on Binary Strings
Duration: 10 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
- Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
- Quantitative Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
- Data Structures - Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Python- Professional Knowledge: Python for Placements by Yash Sir, Python Basics
- Operating System- Professional Knowledge: Introduction to OS, Process Management, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management
- DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control
- Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security
- Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer
- Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
- Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
- Programming Languages- Professional Knowledge: C Programming by Yash Sir, Object Oriented Programming (OOPS), Programming in C++, Java, C Language Core
- Emerging Tech- Professional Knowledge: Emerging Tech Trends
- Artificial Intelligence: Artificial Intelligence
- Unit Test - Professional Knowledge:
- Full Length Mock Test:
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
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: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.
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.

