Segregate 0s and 1s in an array
Duration: 3 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Section A | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Preposition, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Articles, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Verbal Analogy (Word Based Analogy)
- Section A | Quant Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Arithmetic, Algebra, Powers and Exponents (Surds and Indices), Average, Age Problems, Percentage, Profit and Loss, Partnership, Time and Work, Simple Interest and Compound Interest, Mensuration and Geometry, Probability, Pipe and Cistern
- Section A | Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Calendar, Clock, Blood Relations, Directions (Direction Test), Seating Arrangements, Ranking, Order and Sequence, Puzzle Solving (Puzzles)
- Section B | C Programming: C Programming by Yash Sir, Coding Questions by Yash Sir
- Section B | Data Structures: Algorithm Analysis, Greedy Algorithms, Time Complexity Analysis, Sorting Algorithms, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs
- Section B | OOP (C++): Object Oriented Programming (OOPS), Programming in C++
- Section B | OS: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS
- Section B | Networking: Introduction to CN, Data Communication, 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
- Section B | AI & Big Data Basics: AI & ML by Arun Sir, Big Data Systems
- Section C | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
- Section A, C | Comp. Fundamentals, COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
- MOCK TEST:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This video is a programming tutorial from Knowledge Gate that teaches how to segregate 0s and 1s in an array. The instructor first presents the problem statement, which is to rearrange an array of 0s and 1s so that all 0s are on the left and all 1s are on the right, with the constraint of traversing the array only once. The solution logic is then explained: first, count the number of 0s (C), then place C zeros at the beginning of the array and fill the remaining positions with 1s. The video then shows the complete C code implementation, including a function to segregate the array and a function to print the result. The final segment demonstrates the code running in an online compiler, where the user inputs an array, and the program outputs the segregated array, confirming the solution works as expected.
Chapters
0:00 – 2:00 00:00-02:00
The video begins with the Knowledge Gate logo, followed by a slide showing the various educational channels offered by the platform. The main content starts with a problem statement on a digital blackboard: 'Q8: Segregate 0s and 1s in an array'. The problem is to take an array of 0s and 1s in random order and rearrange it so that all 0s are on the left and all 1s are on the right, with the constraint of traversing the array only once. An example is provided: Input array = [0, 1, 0, 1, 0, 0, 1, 1, 1, 0], Output array = [0, 0, 0, 0, 0, 1, 1, 1, 1, 1]. The instructor then explains the logic, which is to first count the number of 0s (let's call it C), and then place C zeros at the beginning of the array and 1s in the remaining n-C positions. This logic is written on the board in two steps: 1) Count the number of 0s. Let count be C. 2) Once we have count, we can put C 0s at the beginning and 1s at the remaining n-C positions in array.
2:00 – 2:30 02:00-02:30
The video transitions to the code implementation. The instructor displays a C program on the digital blackboard. The code includes the necessary header files, a function `void segregate0and1(int arr[], int n)` that implements the logic, and a `void print(int arr[], int n)` function to display the result. The `segregate0and1` function first counts the number of 0s, then uses two for loops to fill the array: the first loop sets the first 'count' elements to 0, and the second loop sets the remaining elements to 1. The `main` function is shown to allocate memory, take user input for the array, call the segregation function, and print the output. The final segment shows the code being executed in an online C compiler. The user inputs an array of 10 elements, and the program successfully outputs the segregated array, demonstrating the solution's correctness.
The video provides a clear, step-by-step tutorial on solving a classic array manipulation problem. It follows a logical progression from problem definition to algorithmic logic and finally to a complete, executable code solution. The instructor effectively uses the digital blackboard to explain the core concept of counting and then reassigning values, which is a fundamental technique in array problems. The demonstration in the online compiler serves as a practical validation of the theoretical solution, making the learning experience comprehensive and actionable for students.

