Computers and Technology, 06.03.2021 17:50 dmanvaldez

139. Pentru n (n≤100) numere întregi x cu cel mult 4 cifre fiecare citite de la tastatură să se determine: a. Ultimul pătrat perfect din şirul valorilor citite
b. Primul pătrat perfect din şirul valorilor citite
c. Penultimul pătrat perfect din şirul valorilor citite
d. Antepenultimul pătrat perfect din şirul valorilor citite
e. Aceleaşi prelucrări pentru condiţiile de număr prim, număr palindrom
(conditia pentru patrat perfect if(sqrt(x)==floor(sqrt(x))) si biblioteca #include
un nr. e patrat perfect daca radical din n este egal cu partea intreaga din radical din n

Answers: 1

Show answers

Another question on Computers and Technology

Computers and Technology, 21.06.2019 23:30

Show that there is a language a âš† {0, 1} â— with the following properties: 1. for all x â a, |x| â‰¤ 5. 2. no dfa with fewer than 9 states recognizes a. hint: you donâ€™t have to define a explicitly; just show that it has to exist. count the number of languages satisfying (1) and the number of dfas satisfying (2), and argue that there arenâ€™t enough dfas to recognize all those languages. to count the number of languages satisfying (1), think about writing down all the strings of length at most 5, and then to define such a language, you have to make a binary decision for each string about whether to include it in the language or not. how many ways are there to make these choices? to count the number of dfas satisfying (2), consider that a dfa behaves identically even if you rename all the states, so you can assume without loss of generality that any dfa with k states has the state set {q1, q2, . . , qk}. now think about how to count how many ways there are to choose the other four parts of the dfa.

Answers: 3

Answer

Computers and Technology, 22.06.2019 13:00

Write a program which asks you to enter a name in the form of first middle initial last. so you might enter for example samuel p. clemens. use getline to read in the string because it contains spaces. also, apparently the shift key on your keyboard doesn’t work, because you enter it all lower case. pass the string to a function which uses .find to locate the letters which need to be upper case and use toupper to convert those characters to uppercase. the revised string should then be returned to main in the form last, first mi where it will be displayed.

Answers: 1

Answer

Computers and Technology, 22.06.2019 19:30

Once the data center routes to the destination server that hosts the website, what's the next step in the internet process? user’s browser renders html code from destination server into web page request goes through router/model and isp request routed to nameserver and datacenter

Answers: 2

Answer

Computers and Technology, 23.06.2019 06:30

On early television stations, what typically filled the screen from around 11pm until 6am? test dummies test patterns tests testing colors

Answers: 1

Answer

You know the right answer?

139. Pentru n (n≤100) numere întregi x cu cel mult 4 cifre fiecare citite de la tastatură să se dete...

Questions