Find Maximum Number from Given Bits

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/COCUBES-PREPARATION/coding/coding-questions/coding-question/asset-find-maximum-number-from-given-bits after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude: Number System, Divisibility Rules, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Mixture and Alligation, Partnership, Age Problems, Time and Work, Pipe and Cistern, Speed Time and Distance, Algebra, Arithmetic, Data Interpretation, Sequence and Series (Series), Logarithm, Powers and Exponents (Surds and Indices), Permutation and Combination, Probability, Speed Mathematics and Basic Mathematics, Trigonometry
  2. Logical Reasoning: Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Syllogisms, Inequality, Data Sufficiency, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Venn Diagram, Logical Sequence Of Words, Calendar, Clock, Cubes & Dices, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Noun, Pronoun, Adjectives, Verb, Adverb, Tenses, Subject Verb Agreement (Verb Noun Agreement), Articles, Preposition, Conjunction, Modals, Determiner, Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Construction
  4. Data Structures (Domain Test): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  5. Algorithms (Domain Test):
  6. OOPs (Domain Test): Object Oriented Programming (OOPS)
  7. DBMS (Domain Test): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  8. SQL (Domain Test): SQL
  9. Operating Systems (Domain Test): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  10. Computer Networks (Domain Test): 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, Network Security, Cloud Computing and IoT, Cyber and Info Security
  11. Coding: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
  12. Written English Test: English Writing Ability
  13. Psychometric Test: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This video is a programming lecture from Knowledge Gate Eduventures, presented by an instructor named Yash Jain Sir. The lesson focuses on solving a problem related to finding the maximum number of shops Jetha can visit, given constraints on the number of bits (L) used to represent the total number of shops (N). The problem is introduced with a narrative about Jetha liking chocolates and needing to visit shops. The instructor explains that the total number of shops N is 2^L, and the number of shops he can visit is N - i, where i is his starting shop. The solution is derived as (2^L) - i. The lecture then transitions to a C programming implementation, where the instructor writes code to solve the problem. The code uses the pow() function to calculate 2^L, subtracts the starting shop index i, and prints the result. The video includes on-screen text, code snippets, and a small video feed of the instructor.

Chapters

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

    The video begins with the Knowledge Gate logo, followed by a slide showing the company's various educational offerings, including 'KG GATE & COLLEGE', 'KG PLACEMENT PREP', 'KG CODING', and 'KG UGC NET PREP'. The main content starts with a PowerPoint slide presenting a programming problem. The problem states that there are N shops in a market, labeled 1 to N, and Jetha starts from shop i. He has L bits to represent N, and the task is to find the maximum number of shops he can visit. The slide provides two examples: Example 1 with i=2, L=3, resulting in N=8 and 6 shops to visit; Example 2 with i=1, L=2, resulting in N=4 and 3 shops to visit. The instructor, Yash Jain Sir, is visible in a small window at the bottom right, and the slide includes a meme of a man with the text 'When Someone Unknown Reacts Haha On my Profile Pic'.

  2. 2:00 – 4:30 02:00-04:30

    The instructor explains the problem, emphasizing that the total number of shops N is 2^L, as L bits can represent 2^L different values. He writes the formula on the screen: N = 2^L. He then explains that the number of shops Jetha can visit is N - i, which simplifies to 2^L - i. He demonstrates this with the examples: for L=3, N=8, and 8-2=6; for L=2, N=4, and 4-1=3. The instructor then transitions to coding, writing a C program. He declares variables i, l, and j. He uses scanf to read i and l. He calculates j as pow(2, l) - i, where pow(2, l) is 2^l. He then prints the result j. The code is shown on the screen, with the instructor explaining each line. The video ends with the instructor concluding the explanation of the code.

The video presents a complete, step-by-step tutorial on solving a programming problem. It starts with a clear problem statement, uses real-world examples to illustrate the concept of binary representation (2^L), and then provides a direct, functional C code solution. The progression from problem understanding to code implementation is logical and well-structured, making it an effective learning resource for students preparing for coding interviews or competitive programming.

Loading lesson…