Write a program that will continually input up to 500 numbers, but will stop asking for numbers after the user enters a letter or word. After the user enters a letter, the program should ask users if they want to see the average or standard deviation, and display the user's choice. Average and standard deviation calculation should be a function. |
Write a program that reads in an array of type int. You may assume that there are fewer than 50 entries in the array. Your program determines how many entries are used. The output is to be a two-column list. The first column is a list of the distinct array elements; the second column is the count of the number of occurrences of each element. The list should be sorted on entries in the first column, largest to smallest. For the array values: |
-12 3 -12 4 1 1 -12 1 -1 1 2 3 4 2 3 -12 |
the output should be |
N Count 4 2 3 3 2 2 1 4 -1 1 -12 4 |
Write a program that will allow two users to play tic-tac-toe. The program should ask for moves alternately from player X and player O. The program displays the game positions as follows: 1 2 3 4 5 6 7 8 9 The players enter their moves by entering the position number they wish to mark. After each move, the program displays the changed board. A sample board configuration is as follows: X X O 4 5 6 O 8 9 |
The mathematician John Horton Conway invented the “Game of Life.” Though not a “game” in any traditional sense, it provides interesting behavior that is specified with only a few rules. This project asks you to write a program that allows you to specify an initial configuration. The program follows the rules of Life (listed shortly) to show the continuing behavior of the configuration. LIFE is an organism that lives in a discrete, two-dimensional world. While this world is actually unlimited, we don’t have that luxury, so we restrict the array to 80 characters wide by 22 character positions high. If you have access to a larger screen, by all means use it. This world is an array with each cell capable of holding one LIFE cell. Generations mark the passing of time. Each generation brings births and deaths to the LIFE community. The births and deaths follow this set of rules: 1. We define each cell to have eight neighbor cells. The neighbors of a cell are the cells directly above, below, to the right, to the left, diagonally above to the right and left, and diagonally below, to the right and left. 2. If an occupied cell has zero or one neighbor, it dies of loneliness. If an occupied cell has more than three neighbors, it dies of overcrowding. 3. If an empty cell has exactly three occupied neighbor cells, there is a birth of a new cell to replace the empty cell. 4. Births and deaths are instantaneous and occur at the changes of generation. A cell dying for whatever reason may help cause birth, but a newborn cell cannot resurrect a cell that is dying, nor will a cell’s death prevent the death of another, say, by reducing the local population. ----------------------------* Examples: *** becomes * then becomes *** again, and so on. ----------------------------* (disregard all the -, they were supposed to be spaces, but it was not rendering it) Notes: Some configurations grow from relatively small starting configurations. Others move across the region. It is recommended that for text output you use a rectangular char array with 80 columns and 22 rows to store the LIFE world’s successive generations. Use an * to indicate a living cell and use a blank to indicate an empty (or dead) cell. If you have a screen with more rows than that, by all means make use of the whole screen. Suggestions: Look for stable configurations. That is, look for communities that repeat patterns continually. The number of configurations in the repetition is called the period. There are configurations that are fixed, that is, that continue without change. A possible project is to find such configurations. Hints: Define a void function named generation that takes the array we call world, an 80-column by 22-row array of type char, which contains the initial configuration. The function scans the array and modifies the cells, marking the cells with births and deaths in accord with the rules listed previously. This involves examining each cell in turn and either killing the cell, letting it live, or, if the cell is empty, deciding whether a cell should be born. There should be a function display that accepts the array world and displays the array on the screen. Some sort of time delay is appropriate between calls to generation and display. To do this, your program should generate and display the next generation when you press Return. You are at liberty to automate this, but automation is not necessary for the program. |
|
|
|
|
|
|
Thanks for the qustions :D I just completed question 1 |
Standard deviation |
Sd |
Question 2(Help check pls xD) |
|
|
int Array[6] = {4,3,2,1,-1,-12};
#include <string.h>
#include <string>
|
|
Problem #4: (very nearly impossible) <--- Challenge to everybody reading this. I'll be surprised if anyone can do that one! |
Write a program to enter a string containing random numbers and words. Try to extract every number in the string and store each number in a number vector and extract every word in the string and store each word in a string vector. After that, print out all elements in the number vector first, then the string vector. |
|
|
dfd 557 sdj 113 356 msdn 77553 sdhs asas
557 113 356 77553 dfd sdj msdn sdhs asas |