Write a complete program in C++ that counts the number of duplicates in a list of integer numbers.

Write a C++ program for the following. In each plastic container of Pez candy, the colors are stored in random order. Your little brother only likes the yellow ones, so he painstakingly takes out all of the candies, one at a time, eats the yellow ones, and keeps the others in order so he can return them to the container in exactly the same order as before, minus the yellow candies, of course. Write a program to simulate this process. You must use Nyhoff's stack class; other solutions including the use of the STL stack class are unacceptable. Assume that the candies are denoted as Y for yellow, B for blue, R for red, O for orange. Your program is to query the user for ten letters (representing ten Pez candies), and after using appropriate stack operations, display the contents of the container minus the yellow candies.  The order in which the letters are entered is the order that they were removed from the Pez container.  When your answer is displayed the results must be in the same…

Implement a function alterCase in Python that converts a word to "alterCase". Given a word, using any mix of upper and lower case letters, the function then returns the same word, except that the first letter is upper case, the second is lower case, and then cases of letters alternate throughout the rest of the word. >>> alterCase('apple')'ApPlE'

mplement a Java program that applies the Newton-Raphson's method xn+1 = xn – f(xn) / f '(xn) to search the roots for this polynomial function ax6 – bx5 + cx4 – dx3+ ex2 – fx + g = 0. Fill out a, b, c, d, e, f, and g using the first 7 digits of your  ID, respectively. For example, if ID is 4759284, the polynomial function would be 4x6 – 7x5 + 5x4 – 9x3+ 2x2 – 8x + 4 = 0. The program terminates when the difference between the new solution and the previous one is smaller than 0.00001 within 2000 iterations. Otherwise, it shows Not Found as the final solution.

A beginner has tried to write a Python function which takes as input an integer N and returns a list of all integers from 1 to N which are not divisible by 7 and are not perfect cubes. def PerfectSquare (N): for i in range (N): if not i % 7 = 0: print (i) if not i** (1/3) print (i) = int(i** (1/3)): How would you improve this code? (Comment on problems with this function, do not include your own function in your answer.)

Python

In Python, Compute the: sum of squares total (SST), sum of squares regression (SSR), sum of squares error(SSE), and the r, R^2 values. You can use the sum() and mean() built-in functions. Here are the x and y values to use. x = [-5,-1,3,7,5,10] y = [-10,-3,5,8,7,10]

Write programs to find the sum of elements of an array of n numbers in both Python and Java. Which of the two programs has higher degree of readability and why?

make a C program that implements the "guess my number" game.  The computer chooses a random number using the following random generator function srand(time(NULL)); int r = rand() % 100 + 1;   that  creates a random number between 1 and 100 and puts it in the variable  r. (Note that you have to include <time.h>)  Then it asks the user to make a guess. Each time the user makes a guess, the program tells the user if the entered number is larger or smaller than its number. The user then keeps guessing till he/she finds the number. If the user doesn't find the number after 10 guesses, a proper game over message will be shown and the actual guess is revealed. If the user makes a correct guess in its allowed 10 guesses, then a proper message will be shown and the number of guesses the user made to get the correct answer is also printed. After each correct guess or game over, the user decides to play again or quit and based on the user choice, the computer will make another guess and…