How to find HCF Quickly with the help of given options
Duration: 6 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Communication Round: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, 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), Direct and Indirect Speech, Active Passive Voice (Voice), Verbal Analogy (Word Based Analogy), Articles, Preposition, Conjunction, Sentence Construction, English Writing Ability, Communication Assessment
- Quantitative Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Speed Time and Distance, Percentage, Average, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Age Problems, Pipe and Cistern, Probability, Profit and Loss, Simple Interest and Compound Interest, Algebra
- Analytical and Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Puzzle Solving (Puzzles), Syllogisms, Seating Arrangements, Calendar, Clock, Blood Relations, Cubes & Dices, Venn Diagram, Analytical Reasoning (Counting Figures Reasoning)
- Cognizant Gaming Aptitude: Gamified / Game Based Aptitude
- Java (Cluster 1): Java
- ANSI SQL MySQL (Cluster 1,2,3): SQL
- HTML, CSS, JavaScript (Cluster 1,3): HTML, CSS, JavaScript
- Python (Cluster 2): Python for Placements by Yash Sir
- Cloud Fundamentals (Cluster 2): Emerging Tech Trends
- C# (Cluster 3): C#
- OOPs: Object Oriented Programming (OOPS)
- Technical Assessment (Coding): Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Pseudo Codes
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- DBMS: 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
- Operating Systems: 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
- Computer Networks: 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, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video is a lecture on finding the Highest Common Factor (HCF) using the method of prime factorization, presented by an instructor from Knowledge Gate Eduventures. The video begins with a title slide introducing the topic of LCM and HCF, followed by a section on 'HCF using Least Number'. The core of the lecture consists of two worked examples. The first example asks to find the HCF of 24, 60, 84, and 108. The instructor demonstrates the prime factorization method by dividing all numbers by the smallest common prime factor, 2, and continues the process with the resulting quotients until no common factors remain. The final HCF is calculated as the product of the common prime factors, which is 12. The second example involves finding the HCF of 108, 288, and 360. The instructor applies the same method, dividing by 2 and then by 3, and concludes that the HCF is 36. The video concludes with a 'Thanks for Watching' screen.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a title slide featuring the text 'LCM & HCF' against a dark, digital-themed background. It then transitions to a presentation slide with a green chalkboard background, where the instructor, Yash Jain, introduces the topic 'HCF' and 'LCM' with a diagram showing the prime factorization method. The slide also displays the title '5. HCF using Least Number' and the 'Knowledge Gate Educa' logo. The instructor is visible in a small window in the bottom right corner, beginning to explain the concept.
2:00 – 5:00 02:00-05:00
The video displays a question on a yellow background: 'Que: Find the HCF of 24, 60, 84, 108?'. The instructor begins the solution by writing the numbers and then divides them by the smallest common prime factor, 2, as shown by the equation '24/2 = 12'. He continues this process, dividing the resulting quotients by 2 again, and then by 3, as seen in the handwritten calculations. The final HCF is determined to be 12, which is circled as the correct answer (D) from the multiple-choice options.
5:00 – 6:23 05:00-06:23
A new question appears: 'Que: Find the HCF of 108, 288, 360?'. The instructor applies the same prime factorization method, starting by dividing all numbers by 2, as shown by the calculation '108/2 = 54'. He continues the process, dividing by 2 again and then by 3, with the calculations '108/36 = 3' and '288/36 = 8' visible. The final HCF is identified as 36, which is marked as the correct answer (A). The video ends with a 'THANKS FOR WATCHING' screen.
The video provides a clear, step-by-step demonstration of the prime factorization method for finding the Highest Common Factor (HCF). It begins with an introduction to the topic and then presents two distinct problems. The first problem, finding the HCF of 24, 60, 84, and 108, is solved by systematically dividing all numbers by their common prime factors (2, 2, and 3), resulting in an HCF of 12. The second problem, for 108, 288, and 360, follows the same procedure, yielding an HCF of 36. The consistent use of visual annotations and a clear, methodical approach makes the concept accessible for students preparing for competitive exams.