Gain insights into basic computer anatomy, binary systems, and program lifecycles. Delve into logic building and core programming concepts with hands-on exercises and quizzes to reinforce learning.

This language-agnostic course is your guide to programming and acquiring problem-solving skills. You will start reviewing the anatomy of computers and the binary number system. You will then look at the lifecycle of a program before moving on to the core concepts of programming. Overall, the primary focus of this course is logic building within the context of computer science and programming.

Throughout each chapter, you will get hands-on experience with exercises and quizzes to solidify what you’ve learned. If you’re looking to build strong programming fundamentals then this course is the perfect place to start.

Introduction to Computers & Programming

# Problem statement

You are required to print the first *n* prime numbers. 

# The main steps in problem-solving

## Understand the problem 

Carefully read the problem and think about the expected output. For instance, if *n* is 4, the first four prime numbers will be output as 2, 3, 5, and 7.

## Come up with a practical solution

One possible solution is to generate numbers starting from 2, check if they are prime, and continue generating them until we have found the first *n* prime numbers. Since we want to repeatedly generate numbers and check if they are prime or not, we can use a loop.

> Note that a prime number is not divisible by any other number except itself and 1. Hence, one possible solution to check if a number *num* is prime is to ensure that *num* is not divisible by any number from 2 to *num* / 2. We can use another loop to check this. Note that *num* / 2 is rounded down to the nearest integer if it is a decimal number.

## Implement your solution
Execute the solution on different test cases to verify it. For instance, if *n* equals 5, the output should be 2, 3, 5, 7, and 11. 

# Pseudocode

```
INPUT n
counter = 0
num = 2
WHILE counter < n
    i = 2
    isPrime = true 
    WHILE i <= num / 2
        IF num % i is not equal to 0
            i = i + 1
        ELSE
            isPrime = false
            END WHILE LOOP
    IF isPrime == true 
        counter = counter + 1 
        OUTPUT num
    num = num + 1
```

## Explanation

We take `n` as an input. `counter` contains the number of prime numbers found, and we set it to 0 initially. `num` contains the number we will test for being prime. The pseudocode inside the WHILE block will run until we have found `n` prime numbers.

Inside the WHILE block:

* We set `i` to 2, and `i` will take on values from 2 to `num / 2` and is used to check if `num` is prime. Remember that `num / 2` is rounded down to the nearest integer if it is a decimal number.

* `isPrime` by default is true and will be set to false if `num` is not prime.

* The inner WHILE block determines if `num` is prime by checking if it is divisible only by itself and 1. If `num` is divisible by any number from 2 to `num / 2`, we set `isPrime` to false to indicate that the number is not prime and exit the inner WHILE block using `END WHILE LOOP`.

* We check if `isPrime` is true. If it is, we increment `counter` because we have found a prime number and output the newly found prime number. The process is repeated for the new value of `num`.

# Flowchart

Learn to write pseudocode and draw a flowchart to output the first n prime numbers.

Introduction

Getting to Know Computers

Problem Solving

Variables

Decision in Programs

Repetition in Programs

Conclusion

Display the First 'n' Prime Numbers

Problem statement

The main steps in problem-solving

Understand the problem

Come up with a practical solution