Find sum of all prime numbers in a given range

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/codingautomata-round/coding-questions/coding-question/asset-find-sum-of-all-prime-numbers-in-a-given-range after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): 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
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): 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
  11. Computer Networks (Technical): 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
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video is a programming tutorial from Knowledge Gate, focusing on solving a problem to find the sum of all prime numbers within a given range. The instructor first presents the problem statement, which requires a program to take two integers as input (the start and end of a range) and output the sum of all prime numbers in that range. Two public test cases are shown: for the range 1 to 10, the sum is 17 (2+3+5+7), and for 1 to 100, the sum is 1060. The solution is implemented in C, using a helper function `findPrime` to check if a number is prime by testing divisibility up to its square root. The main function reads the range, iterates through each number, calls `findPrime`, and accumulates the sum of primes. The instructor demonstrates the logic with a step-by-step walkthrough, showing how the sum is calculated for the first few numbers. The video concludes with a live coding session in an online compiler, where the program is executed and the correct output of 17 for the first test case is verified.

Chapters

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

    The video begins with the 'KNOX MEEHEGATF' logo, which is a stylized version of 'KNOWLEDGE GATE'. It then transitions to a slide that introduces the problem: 'Q6: Write a program to find print sum of all possible prime numbers within the range'. The input is defined as two positive integers separated by a space, representing the start and end of the range. The output is the sum of all prime numbers within that range. Two public test cases are provided: Input: 1 10, Output: 17; and Input: 1 100, Output: 1060. The instructor, Yash Jain Sir, is visible in a small window, and the video is branded as 'PLACEMENT EXPERT' content from 'KNOWLEDGE GATE EDUVENTURES'. The instructor explains the problem and the expected logic.

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

    The instructor displays the C code for the solution. The code includes a function `int findPrime(int n)` that returns 1 if the number is prime and 0 otherwise. The function uses a flag variable and a loop from 2 to the square root of n to check for divisibility. The `main` function declares variables `n1`, `n2`, `i`, and `sum`, reads the input range, and uses a for loop to iterate from `n1` to `n2`. Inside the loop, it calls `findPrime(i)` and if it returns 1, it adds `i` to the `sum`. Finally, it prints the sum. The instructor explains the logic, and the video shows a live execution in an online compiler where the program is compiled and run, successfully outputting 17 for the test case 1 10.

The video provides a complete, step-by-step guide to solving a common programming interview problem. It starts with a clear problem definition, including input/output specifications and test cases. The solution is then broken down into a modular C program, with a dedicated function to check for primality, which is a fundamental algorithmic concept. The instructor demonstrates the logic of the program by walking through the code and the expected calculations, reinforcing the understanding of the algorithm. The final live coding and execution in an online compiler serve as a practical validation of the solution, ensuring the code is correct and functional.

Loading lesson…