Search results
Results From The WOW.Com Content Network
I created a string of alphanumerics such that their placement in the string describes their Morse code representation. Originally I was going to use binary, but 01 would be the same as 1. So I used ternary with - = 1 and . = 2. Thus is character c is at index 1121 in this string, its Morse code representation is --.-.
Closed 3 years ago. Inspired by the Morse code question, and the Twinkle Twinkle little star question, write a program to accept a letter and generate the morse code audio for that letter. Shell script (2 characters): cw. Accepts a line from standard input. Before running, do sudo apt-get install cw.
Because converting from binary to decimal costs bytes, we use a hash function which works directly on binary blocks interpreted in base 10. Example. dot dash dot dot = 101110101 101110101 * 1741 = 176032685841 176032685841 % 8360 = 3081 3081 % 51 = 21 --> The 21st character in the lookup table is 'L' (0-indexed).
All the Morse codes for the letters in this set end with .. [AJKMOQT-Y] $&- All the Morse codes for the letters in this set end with -. T`L`\EDKN_UMS\EWNRTTMWGAI_ISADKG Replace each letter with the letter whose Morse code is the prefix of that letter (here E and T are simply deleted via the unescaped _, but normally they would be turned into ...
A string is dot-heavy when its morse representation contains more dots than dashes. For example, the letter E is a single dot, which means it is Dot-heavy. Input The input string will only contain
G --.. --.-. --- O ---. ----. This is a formatted table of the Morse codes of the letters from A to Z. Each column is separated by three spaces. There are four missing slots, which are used by international character sets. Your program must write a space there. The output must consist of ASCII spaces, dots, dashes, uppercase letters and ...
The current global accumulated result is the definitive value. This is tranformed into Morse digits and displayed. Detailed explanation 5:t!< % first half of the 10x5 array of Morse digits, with 0 for - and 1 for . t~v % vertically concat second half, i.e. first half vertically flipped 45+cXI % transform 0 1 to chars - .
Morse code symbols are stored by changing "." and "-" into binary digits 0 and 1, prepending a "1" (so that leading dots aren't gobbled up), converting the binary number into decimal, and then encoding the character with the value 61 higher (which gets me all printable chars and nothing that needs backslashing).
From the specs "Your goal is to write a hash function, that accepts Morse Code characters and returns a hash code that you get to define." Standard hash codes, e.g. from md5 or sha1 can be interpreted as negative numbers, especially in languages without unsigned types like Java or Basic. There are two requirements: the returned number should be ...
GolfScript ( 116 113 97 chars) This includes non-printable characters used in a lookup table, so I'm giving it as xxd output: 0000000: 6e2d 2720 272f 7b60 7b5c 6261 7365 2035. 0000010: 3925 2210 a9cd 238d 57aa 8c17 d25c d31b. 0000020: 432d 783e 277a 3823 e146 e833 6423 23ac.