Computers and Technology
Identify the hardware components in your own computer. If you don't have a computer, use a friend's, or one at work or in an NVCC lab. The following list shows the components you should identify and how to find the information on a Windows computer. Describe model computer: type (laptop, desktop, notebook, tablet, etc.) Indicate your manufacturer (HP, Apple: iPad, MacBook Air, etc., Lenovo, Dell, etc.) of the computer. Input devices (include internal and external devices) - they usually have a model name and number somewhere on the device. Output devices (include internal and external devices) - they usually have a model name and number somewhere on the device. Storage devices (include internal and external devices, and how much data each can hold) - Open Windows Explorer and right click on a drive name to open its properties. Amount of RAM - Open System Properties in the Windows Control Panel. Type and speed of CPU - Open System Properties in the Windows Control Panel. Ports (number and type) - Look for jacks into which a connector can be plugged on the front, back and sides of the machine. Compare the jacks to pictures in your textbook.
Prime numbers can be generated by an algorithm known as the Sieve of Eratosthenes. The algorithm for this procedure is presented here. Write a program called primes.js that implements this algorithm. Have the program find and display all the prime numbers up to n = 150.Sieve of Eratosthenes Algorithm To Display All Prime Numbers Between 1 and n Step 1: We need to start with all the numbers representing the range of numbers that are possible candidate primes. So, create an array of consecutive integers from 2 to n: (2,3,4,..n). I wouldn't hand-code this. I would use a loop to populate the array. Step 2: At each step we select the smallest number and remove all it's multiples. So we'll start with an outer loop that goes from 2 to n. initially, let p equal 2, the first prime number. Step 3: In an inner loop we need to iterate over all the numbers that are multiples of p, i.e for 2, that's 2,4,6,8 etc. Each time, setting it's value to false in the original array. Step 4: Find the first number greater than p in the list that is not marked False. If there was no such number, stop. Otherwise, let p now equal this number( which is the next prime), and repeat from step 3.When the algorithm terminates, all the numbers in the list that are not marked False are prime Example: Let us take an example when n = 50. So we need to print all print numbers smaller than or equal to 50. We create list of all numbers from 2 to 50. 2 3 4 5 6 7 8 9 1011 12 13 14 15 16 17 18 19 2021 22 23 24 25 26 27 28 29 3031 32 33 34 35 36 37 38 39 4041 42 43 44 45 46 47 48 49 50