Find sum of all prime numbers in a given range

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/COCUBES-PREPARATION/coding/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 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.

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…