Two friends are exchanging messages through regular post mail. They don't want anyone to understand their messages in case anyone read them. The messages are in the form of an array of characters, where each character has a numeric value as illustrated in the below lookup table. ABCDE 1 2 3 4 FG JKLM 7 8| 9 10 11 12 13 RS TUV 14 15 16 17 18 19 20 21 22 23 24 25 26 NOPQ W xY They decided to change the characters in the array in a way that cannot be observed by any accidental reading. They do so as follows: 1- Given the original message, for example: GREETINGS 2- transform the original character to its numeric value 7 18 5 5 20 9 14 7 19 3- For each number, subtracting from its value the value of the first lower value character after it, and if there's no such character they will keep that character without any change. 2 12 55 11 2 77 19

Two friends are exchanging messages through regular post mail. They don't want anyone to understand their messages in case anyone read them. The messages are in the form of an array of characters, where each character has a numeric value as illustrated in the below lookup table. ABCDE 1 2 3 4 FG JKLM 7 8| 9 10 11 12 13 RS TUV 14 15 16 17 18 19 20 21 22 23 24 25 26 NOPQ W xY They decided to change the characters in the array in a way that cannot be observed by any accidental reading. They do so as follows: 1- Given the original message, for example: GREETINGS 2- transform the original character to its numeric value 7 18 5 5 20 9 14 7 19 3- For each number, subtracting from its value the value of the first lower value character after it, and if there's no such character they will keep that character without any change. 2 12 55 11 2 77 19

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 a Java program to display the three highest monthly speeding fines recorded for fourdifferent cities. The following rows and columns represent the monthly speeding fines of eachcity. JAN FEB MARJHB 128km 135km 139kmDBN 155km 129km 175kmCTN 129km 130km 185kmPE 195km 155km 221km Using a Two Dimensional array, produce the speeding fines report including the speeding finesstatistics. The speeding fines statistics must display the highest and lowest speeding fines in thetwo dimensional array.
Write a script in Python to play two-dimensional Tic-Tac-Toe between two human players who alternate entering their moves on the same computer. Use a 3-by-3 two-dimensional array . Each player indicates their moves by entering a pair of numbers representing the row and column indices of the square in which they want to place their mark, either an 'X' or an 'O'. When the first player moves, place an 'X' in the specified square. When the second player moves, place an 'O' in the specified square. Each move must be to an empty square. After each move, determine whether the game has been won and whether it’s a draw.
Given a group of characters a circular array AL]. It is required for each one to print the index of the first bigger character on its right. Print -1 if no one is bigger than it. Example 1: Explanation of example 1: (reter to the figure below) The given array All of character is as follows: AQ={L,B.Q.F.T.M A[index] A[0] A[1] A[2] A[3] A[41 A[5) Output: ContentL B Q Zu2 4 4 -1 2 O Regarding "L", the first bigger character on its right is Example 2: "Q' (i.e., A[2]), and hence 2 is printed. AI={J,P,S,D,N} O Regarding and hence "B" 2 is printed again has also the same on her right, Output: D... and so on. 1.2 -1 4 1 a) Describe how a brute-force approach algorithm would solve the above problem, and explain its complexity. b) Design a more efficient algorithm to solve this problem. [The efficiency of your algorithm is the main driver of the mark], and analyze the complexity of your solution. [full explanation of your answer should be provided] c) Develop a python code to implement your…
Write a program to calculate students’ average test scores and their grades. You mayassume the following input data:Johnson 85 83 77 91 76Aniston 80 90 95 93 48Cooper 78 81 11 90 73Gupta 92 83 30 69 87Blair 23 45 96 38 59Clark 60 85 45 39 67Kennedy 77 31 52 74 83Bronson 93 94 89 77 97Sunny 79 85 28 93 82Smith 85 72 49 75 63Use three arrays: a one-dimensional array to store the students' names, a (parallel)two-dimensional array to store the test scores, and a parallel one-dimensional array tostore grades. Your program must contain at least the following functions: a function toread and store data into two arrays, a function to calculate the average test score and andgrade, and a function to output the results. Have your program also output the classaverage
I have a file name fileReading1.csv In that file there is (exactly as written): 73.2 42.5 35.7 17.1 28.5 91.6 34.9 12 19.3 Using PYTHON How can I open that file then, using a “for line in file:” formula to transform this string into numbers into an array ? P.s : I need to transform it like that without typing them again : array=[73.2,42.5,35.7,17.1,28.5,91.6,34.9,12,19.3] Using PYTHON Images as support.
Write a procedure for encryption by rotating each plaintext byte different number of positions. For example, in the following array that represents the encryption key, each number indicates a left rotation: key BYTE 6, 4, 1, 2, 7, 5, 2, 4, 3, 6. Pass the pointer to the text string in EDX, the array size to ECX, a pointer to the key array in ESI, and the direction value (0 or 1) in EBX. Assume that the key array size is 10. Your procedure should loop through plain text and align the key to the first 10 bytes of the message. Rotate each plain text to the left (if the value in EBX is 0) or to the right (if the value in EBX is 1) by the amount in the key array: first byte by 6, second byte by 4 etc. Then align the key to the next 10 bytes until the whole message is encrypted. Write a program that tests the procedure by calling : one time with EBX = 0 (encrypting), then with EBX = 1 (decrypting). Print out the text three times: the original, then the encrypted, then the decrypted.
Using Java & Apache NetBeans Provide screenshots of the OUTPUT! Create a two-dimensional array of type double to contain the three different SD Marks (JD521, PRG521, and IP521) for six different students. A single array of type String must be used to store the student names (Maxwell, Carl, Gerhard, Paul, James, and Cena). Allow a user to enter in a number, ranging from 1 to 6, which will represent the student position in the table MCSD max and present the marks for each respecting module. The program can only stop when the user enter a number greater than 6. Printout the student name including the JD521, PRG521, and IP521 max, the total of marks and the average of all marks. Use a condition statement to decide that the student has passed or not (Pass rate is 70).
Please solve not copy wrong answer from other website ???? Consider arrays A and B, each of which is indexed from 1 to n. The array entries are bank customerPIN numbers, where a PIN number is a sequence of exactly 3 digits (ex. 460 or 013 are each valid PINs).Array A consists of the PIN numbers of customers from bank A, and array B consists of the PIN numbersof customers from bank B. Your job is to design an algorithm that outputs all safe passwords from bankA. The safe passwords from bank A are those which are used by a customer from bank A but not alsoused by a customer in bank B. Write the pseudo-code for your algorithm, and justify why it runs in timeO(n) in the worst-case.
Considering the following code fragment, what is the output? int **p = new int*[5];for(int i=0; i< 5; i++){ p[i] = new int[5];}p[0][0] = 96;p[0][1] = 97;p[0][2] = 98;cout << *((*p)+1) << endl; Group of answer choices 96 97 98 Segmentation Fault ================== Which of the following would correctly output the third slot in a dynamic, single dimensional array of integers named numbers? Group of answer choices cout << *(numbers+2); cout << *numbers+2; cout << *(numbers)+2; None of these =============== It is required to create a dynamic array that can store 10 integers. Which of the following will work? Group of answer choices int array=(int*) malloc(10*sizeof(int)); int* array=(int*) malloc(10*sizeof(int)); int array=(int) malloc(10*sizeof(int)); int* array=malloc(10*sizeof(int));
TODO 3: Invoke the gaussian() function, which accepts x_values, mu, and sig. Save the results in the variable y_values. # TODO 3 y_values = display(y_values) todo_check([ (y_values.shape == (120,),'y_values does not have the correct shape of (120,)'), (np.all(np.isclose(y_values,…
Write a java labguage program to use parallel arrays to save User ID and Password. Ask the user to enter the user ID and Passwords for 3 users Save the above information in two parallel arrays (using the same index for each user) After the input is completed, ask the user to enter any user ID and then ask the password for that ID. Confirm if the User ID and password match, if not ask the password
"John is very interested in history and all the generations of his family. He does a lot of research and realizes that he is descended from the great Mayan dynasty. After a lot of searching through ancient records and the latest records of the society, he is able to find out all the parent-child relationships in his family all the way from the great emperor Ming of the dynasty to himself These relationships are given in the form of a linear array where the emperor is at the first position and his children are at pos (2i + 1) and (2i + 2) Subject: Java Programming This is the pattern followed throughout. Henry wants to figure out all the siblings of the person X from the data. Return the sorted list of all of john's siblings. If no sibling return {-1} input 1: N, the length of the arrayinput2: An array representing the ancestral treeinput 3: X, the person whose siblings are sought. output - return the array of all siblings in increasingly sorted order. Examples : input…