ttu.ee lehel ITV0050 aine vastava labori Quizzi vastuseks. 1) Installeerida GIT. Sudo apt-get install git 2) Looge kasutaja "kasutaja" kodukataloogi kaust projekt1_salv. Mkdir projekt1_salv 3) Looge kausta projekt1_salv tühi ilma töökataloogita salv (ingl. k. "bare repository"). Git --bare init 4) Kloonige vastloodud salve sisu kausta projekt1. Git clone /home/kasutaja/projekt1_salv ~/projekt1 5) Looge tekstiredaktoriga fail ~/projekt1/anagram.py, mille sisuks on 1. def anagram(string, comp): 2. """ 3. Check whether two strings are anagrams of each other. 4. 5. For more information see: https://en.wikipedia.org/wiki/Anagram 6. 7. Arguments: 8. string -- first string 9. comp -- second string 10. 11. Returns: 12. True if the strings are anagrams, False otherwise. 13. """ 14. if len(string) != len(comp): 15
After they had understood that this sentence is an anagram, Sophie remembered that her grandfather liked to create anagrams of famous paintings. When she was young, he took her to visit the Mona Lisa when the museum was closed. She didn't care much of that painting that time. She knew that grandfather had an access to the Mona Lisa, so she decided to go to the painting. She gave car keys to Mr. Langdon, but when he realized why Sophie's granddad told to Sophie to find him, he started to running back to Sophie.
return isTrue; Strings 1. Two strings given, calculate number of words that start with same letter in both strings. int count = 0; for (int i = 0; i < a.length; i++) { String tmp1 = a[i]; String tmp2 = b[i]; if (!tmp1.equals("") && !tmp2.equals("")) { if (tmp1.charAt(0) == tmp2.charAt(0)) count++;}} return count; 2. Anagram check String s1; String s2; if (s1.length() != s2.length()) { System.out.println("FALSE"); System.exit(1);} char[] arr1 = s1.toCharArray(); Arrays.sort(arr1); char[] arr2 = s2.toCharArray(); Arrays.sort(arr2); for (int i = 0; i < arr1.length; i++) { if (arr1[i] != arr2[i]) {
SUMMA (Sektsioon 6) Sektsioon 7 Ma naudin igasuguste materjalide lugemist Märkmete tegemine aitab mul meelde jätta ja aru saada Ma suhtun lugupidamisega suhtlemisse kirjade või e-maili teel 134 LISA 3 Mul on kerge oma ideid teistele selgitada Ma pean päevikut Sõnalised mõistatused/ristsõnad on toredad Ma naudin kirjutamist Ma armastan mängida sõnadega (näiteks sõnamängud, anagram- mid/tähevahetused jne) Võõrkeeled huvitavad mind Mulle meeldib avalik esinemine ja debattidel osalemine SUMMA (Sektsioon 7) Sektsioon 8 Ma olen kindel oma moraalsetes veendumustes Ma õpin kergemini, kui mul on õpitavaga emotsionaalne side Õiglus on mulle väga oluline Minu suhtumine mõjutab seda, kuidas ma õpin Sotsiaalse õigluse teemad lähevad mulle korda
AUIAY CJYHH IYJIE ALBIN KITA PA-K2 did not pose much of a problem to experienced American cryptanalysts. ROchefort estimated that his unit could crack a PA-K2 message in from six hours to six days, with three days a good average. The transposition was vulnerable because each line was shuffled identically; the cryptanalyst could slice a cryptogram into groups of 15 or 17 or 19 and anagram these simultaneously until the predominant vowel-consonant alternation appeared on all lines; the underlying code could then be solved by assuming that the most frequent codegroups represented the most frequent kana (i, followed by ma, shi, o, etc.) and filling out the skeleton words that resulted. Since the system had remained in use for several years, this reconstruction had long been accomplished by the Washington agencies. Hence solution involved only
annaabi.ee 
