Write a simple substitution code for an alphabetic string. That is, declare a permutation of the 26 alphabetic characters i.e. char perm[] = "ajczieaungsdfxmphybklortvw" Now, given a message string e.g. char msg[] = "secret message to encode"; Replace all occurrences of 'a' with 'q' (since perm[0]='q') Replace all occurrences of 'b' with j' (since perm[1]='j'") Replace all occurrences of 'z' with "w' (since perm[25]='w') So that, the message is modified to "bicyik fibbqai km ixcmzi" Improve your solution so that is will handle uppercase characters too, so that if "Secret Message To Encode"; the message is modified to "Bicyik Fibbqai Km Ixcmzi"

Write a simple substitution code for an alphabetic string. That is, declare a permutation of the 26 alphabetic characters i.e. char perm[] = "ajczieaungsdfxmphybklortvw" Now, given a message string e.g. char msg[] = "secret message to encode"; Replace all occurrences of 'a' with 'q' (since perm[0]='q') Replace all occurrences of 'b' with j' (since perm[1]='j'") Replace all occurrences of 'z' with "w' (since perm[25]='w') So that, the message is modified to "bicyik fibbqai km ixcmzi" Improve your solution so that is will handle uppercase characters too, so that if "Secret Message To Encode"; the message is modified to "Bicyik Fibbqai Km Ixcmzi"

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write down the algorithm (not code) to search a string in a BST?
write a program in C++ Fibonacci NumbersThe Fibonacci numbers are defined by the sequencef1 = 1f2 = 1fn = fn-1 + fn-2Reformulate that as5t1 = 1;t2 = 1;nextTerm = t1 + t2;After that, discard t1, which is no longer needed, and set t1 to t2 and t2 to nextTerm.Repeat fnew an appropriate number of times. Implement a program that given a numberN, prints the first N numbers in the Fibonacci sequence. For example, given the number8, the output isThe Fibonacci sequence: 1, 1, 2, 3, 5, 8, 13, 21
Implement the first round of AES ( Advanced Encryption Standard ) in python. Given a message with 128 bits, two subkeys subkey0 and subkey1, your program should be able to perform one AddKey before Round 1 and the corresponding operations (SubBytes, ShiftRows, Mix-Columns, and AddKey) in Round 1, and output the result of the encryption after Round 1.
Computer Science you are given a string X of length n and another string Y of length m ≤n. Say,the indexes p1, p2, p3, p4 and q1, q2, q3, q4 form two sub-sequences, i.e., 0 ≤ p1 < p2 < p3 < p4 < nand 0 ≤q1 < q2 < q3 < q4 < n; then, they are non-overlapping if p4 < q1.The task is to count the maximum number of non-overlapping sub-sequences of X that are thesame as Y . Thus, if X = GAXTYAWBGTAUGBTABGRGTAXB and Y = GTAB, then the answer is3 as shown by the red fonts. We cannot select the underlined GTAB as it overlaps with a red GTAB(i.e., among overlapping sub-sequences, you can select only one of them).Describe an O(m + n) time algorithm to obtain the count. Write a pseudo-code.
Implement a technique that compresses strings in a basic way by counting repeated characters. The string aabcccccaa, for instance, would become a2blc5a3. Your function should return the original string if the "compressed" string did not end up being any smaller than the original string. You can assume that the string only contains letters in upper- and lowercase (a–z).
Write a Java program to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string. Provide an explanation of the code and its time and space complexity.
Draw a DFA over the alphabet {a,b,c}that only accepts strings with no c's and an even number of a's, or an odd number of c's and an odd number of b's. For example, it should accept aa, aba, abbabaa, cbacabcb, cbcca, and abc but not aca, bacc, or aaa.
Write a program that takes in two positive integer inputs, m and n, and prints out a neatly formatted table of size m * n of all integers between 1 and m in n rows. For example; m = 3, n = 4 1 2 3 1 2 3 1 2 3 1 2 3 Please help me with this problem using c++.
What is the Huffman code for a string whose characters are all from a twocharacter alphabet? Give an example showing the maximum number of bits that couldbe used in a Huffman code for an N-character string whose characters are all from atwo-character alphabet.
Write a program in c language to analyze the letter frequencies in a block of text. Ignore case (upper and lower count the same). It should count the number of times each letter appears in the text, the number of times each pair of letters appears, and the number of times each sequence of 3 letters appears. Your program should sort the counts of single letters, pairs of letters (bigrams), and triples of letters (trigrams), then print the non-zero values in decreasing order. For single letters, print all non-zero values; for bigrams and trigrams, print the first 30 non-zero values.(monoalphabetic substitution ciphers)
Write a Java program to find the longest common prefix among a given array of strings. If there is no common prefix, return an empty string "".
C programming Implement an encoder. When completed, your program should be able to accept a short sentence from the user and display an encrypted version of it. For simplicity, let us assume one case of letters throughout, say CAPITALS. We can use a substitution method to scramble a sentence and then use the reverse of this process to recover it. If we take two rows of the alphabet and shift the bottom row along a specified amount (our key), we can then read the letters in our sentence from the top row and use the substituted letter from the bottom row to form the encrypted sentence. A B C D E F G H I J K L M N O P Q R S T U V W X Y Z X Y Z A B C D E F G H I J K L M N O P Q R S T U V W In the example above, the key is 3, hence the second row is shifted by three characters along. Take, for instance, the sentence “HELLO”. Each letter of your message should be replaced by the letter in the alphabet that comes three letters before. For “HELLO” that would be: EBIIL Your program is required…