subject

Write code that fills an array values with each set of number belowR7.1a) 1 2 3 4 5 6 7 8 9 10for (int i = 0; i < 10; i++){ values[i] = i + 1;}b) 0 2 4 6 8 10 12 14 16 18 20for (int i = 0; i <= 10; i++){ values[i] = i * 2;}c) 1 4 9 16 25 36 49 64 81 100for (int i = 0; i < 10; i++){ values[i] = (i + 1) * (i + 1);}d) 0 0 0 0 0 0 0 0 0 0for (int i = 0; i < 10; i++){ values[i] = 0;}e) 1 4 9 16 9 7 4 9 11int[] values = {1, 4, 9, 16, 9, 7, 4, 9, 11};f) 0 1 0 1 0 1 0 1 0 1for (int i = 0; i < 10; i++){ values[i] = i % 2;}g) 0 1 2 3 4 0 1 2 3 4for (int i = 0; i < 10; i++){ values[i] = i % 5;}}

ansver
Answers: 1

Another question on Computers and Technology

question
Computers and Technology, 22.06.2019 03:30
Some of your friends have gotten into the burgeoning field of time-series data mining, in which one looks for patterns in sequences of events that occur over time. purchases at stock exchanges--what’s being bought-- are one source of data with a natural ordering in time. given a long sequence s of such events, your friends want an efficient way to detect certain "patterns" in them--for example, they may want to know if the four events buy yahoo, buy ebay, buy yahoo, buy oracle occur in this sequence s, in order but not necessarily consecutively. they begin with a collection of possible events (e.g., the possible’ transactions) and a sequence s of n of these events. a given event may occur multiple times in s (e.g., yahoo stock may be bought many times in a single sequence s). we will say that a sequence s’ is a subsequence of s if there is a way to delete certain of the events from s so that the remaining events, in order, are equal to the sequence s’. so, for example, the sequence of four events above is a subsequence of the sequence buy amazon, buy yahoo, buy ebay, buy yahoo, buy yahoo, buy oracle their goal is to be able to dream up short sequences and quickly detect whether they are subsequences of s. so this is the problem they pose to you: give an algorithm that takes two sequences of even~s--s’ of length m and s of length n, each possibly containing an event more than once--and decides in time o(m n) whether s’ is a subsequence of s
Answers: 2
question
Computers and Technology, 23.06.2019 05:00
Acompany is inviting design for its new corporate logo from its users. this is an example of ? a. crowdfunding b. crowdvoting c. crowdsourced design d. crowdtracking
Answers: 3
question
Computers and Technology, 23.06.2019 13:30
Jace needs to answer a question on square roots to win a quiz. how can he use a spreadsheet to find the square root of 786? a. use the functions round and count b. create a table and chart c. use the function sqrt d. use the function now
Answers: 3
question
Computers and Technology, 24.06.2019 02:30
Write the pseudo code for this problem based on what you learned from the video. the purpose is to design a modular program that asks the user to enter a distance in kilometers, and then converts that distance to miles. the conversion formula is as follows: miles = kilometers x 0.6214
Answers: 3
You know the right answer?
Write code that fills an array values with each set of number belowR7.1a) 1 2 3 4 5 6 7 8 9 10for (i...
Questions
question
Mathematics, 23.02.2021 21:10
question
Mathematics, 23.02.2021 21:10
question
Mathematics, 23.02.2021 21:10
question
Health, 23.02.2021 21:10
question
Mathematics, 23.02.2021 21:10