Fisierul numere. txt contine pe lnia unu un numar intreg n, pe linia a 2-a n numere intregi separate prin spatiu. Se cere:
-cititi numerele in vectorul a;
-folosind cautarea secventiala , cautati un numar x, cititi de la tastatura, in vectorul a;
-aflati cel mai mic si cel mai mare numar din a; daca min si max apar de mai multe ori, afisati toate pozitiile pe care apar si numarul de repetari
-creati fisierul prime .txt cu numerele prime din a
-verificati daca a are elementele ordonate crescator; in caz afirmativa realizati cauarea binara in a a numarului x;

Consider a direct-mapped cache with 216 words in main memory. the cache has 16 blocks of 8 words each. it is a word-addressable computer (rather than a byte-addressable computer which we normally discuss). (a) how many blocks of main memory are there? (b) what is the format of a memory address as seen by the cache, that is, what are the sizes of the tag, cache block, and block offset fields (if they apply)? (c) to which cache block will the memory reference db6316 map?

Write a modular program (no classes yet, just from what you learned last year), that allows two players to play a game of tic-tac-toe. use a two-dimensional char array with 3 rows and 3 columns as the game board. each element of the array should be initialized with an asterisk (*). the program should display the initial board configuration and then start a loop that does the following: allow player 1 to select a location on the board for an x by entering a row and column number. then redisplay the board with an x replacing the * in the chosen location. if there is no winner yet and the board is not yet full, allow player 2 to select a location on the board for an o by entering a row and column number. then redisplay the board with an o replacing the * in the chosen location. the loop should continue until a player has won or a tie has occurred, then display a message indicating who won, or reporting that a tie occurred. player 1 wins when there are three xs in a row, a column, or a diagonal on the game board. player 2 wins when there are three ox in a row, a column, or a diagonal on the game board. a tie occurs when all of the locations on the board are full, but there is no winner. input validation: only allow legal moves to be entered. the row must be 1, 2, or 3. the column must be 1, 2 3. the (row, column) position entered must currently be empty (i.e., still have an asterisk in it).

The place where the extended axis of the earth would touch the celestial sphere is called the celestial