Let Set A = {the quick brown fox jumped over the lazy dog} be a set of strings (two or more characters) formed by characters (single letters) in the standard alphabet. %3D Enumerate (assign numbers to) the alphabet as G|H 7 8 A E F M Q R V W X Y 2 3 4 5 6 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 Consider the following encryption algorithm written in pseudo code: Encrypt(set): define f (x) = x + 13 mod 26. Now, Vx E characters of A, If x = 14 mod 26, f (x) Then x → If not,

Let Set A = {the quick brown fox jumped over the lazy dog} be a set of strings (two or more characters) formed by characters (single letters) in the standard alphabet. %3D Enumerate (assign numbers to) the alphabet as G|H 7 8 A E F M Q R V W X Y 2 3 4 5 6 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 Consider the following encryption algorithm written in pseudo code: Encrypt(set): define f (x) = x + 13 mod 26. Now, Vx E characters of A, If x = 14 mod 26, f (x) Then x → If not,

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 program that reads a text file and creates an alphabetical index of words and in which lines of this original example. The file name is given as an argument to main (). Ignore the small-capital (all lowercase: k,l,p) and punctuation. Solve with ternary tree using the TST.java class (https://algs4.cs.princeton.edu/52trie/TST.java.html). An execution snapshot is then given. For the file: It was the best of times, it was the worst of times, it was the age of wisdom, it was the age of foolishness It will appear Index of file: exercise.txt age 3-4 best 1 foolishness 4 it 1-2-3-4 of 1-2-3-4 the 1-2-3-4 times 1-2 was 1-2-3-4 wisdom 3 worst 2
Suppose you generate the following RSA key pairs: • p = 37199• q = 49031• N = p · q = 1823904169• (p − 1) · (q − 1) = 1823817940• e = 65537 (for encryption)• d = 1578812933 (for decrption)Assuming a=01, b=02, . . . , z=26, and we group the digits in groups of three. (i) If someone wants to send the following message: “SELLALL” using your public key, what strings of digits should they send you (i.e., encrypt this message)?
Given the following Java functions, transcribe it into a Python 3 program. /*** Removes and returns the entry associated with the specified key* in the Hash Table. Returns null if the Hash Table contains no mapping* for this key.*/Entry removeEntryForKey(Object key) {int hash = hash(key);int i = indexFor(hash, table.length);Entry prev = table[i];Entry e = prev; while (e != null) {Entry next = e.next;if (e.hash == hash && eq(k, e.key)) {size--;if (prev == e)table[i] = next;elseprev.next = next;return e;}prev = e;e = next;}return e;}
Store a dictionary of a limited set of words as a hash table. Implement a spell check program that, given an input text file, will check for the spelling using the hash table-based dictionary and in the case of misspelled words will correct the same.
Write a program that uses a HashMap to compute a histogram of positivenumbers entered by the user. The HashMap’s key should be the numberthat is entered, and the value should be a counter of the number of timesthe key has been entered so far. Use −1 as a sentinel value to signal theend of user input. For example, if the user inputs:512355321-1then the program should output the following (not necessarily in this order):The number 3 occurs 2 times.The number 5 occurs 3 times.The number 12 occurs 1 times.The number 21 occurs 1 times.
Substitution ciphers are encryption/decryption algorithms that replace one letter or number with another. The first attested use of a substitution cipher in military affairs was by Julius Caesar, described by him in Gallic Wars (cf. Kahn pp83-84). In caesar cipher , you replace each letter by 3rd letter on. If it is out of bound (later than Z), then round to the head (letter A) and continue the shift. For example:meet me after the toga party PHHW PH DIWHU WKH WRJD SDUWB Please write a program in Java to implement the Caesar Cipher: a. Implement the encryption algorithm. Ask the user to input one all lower case normal sentence (called plaintext) using the nextLine method, and then output the encrypted text (called ciphertext). b. Implement the decryption algorithm. Ask the user to input one encrypted sentence (i.e. ciphertext) using the nextLine method, and then output the decrypted text (i.e. plaintext).
In class HashTable implement a hash table and consider the following:(i) Keys are integers (therefore also negative!) and should be stored in the tableint[] data.(ii) As a hash function take h(x) = (x · 701) mod 2000. The size of the table istherefore 2000. Be careful when computing the index of a negative key. Forexample, the index of the key x = −10 ish(−10) = (−7010) mod 2000 = (2000(−4) + 990) mod 2000 = 990.Hence, indices should be non-negative integers between 0 and 1999!(iii) Implement insert, which takes an integer and inserts it into a table. Themethod returns true, if the insertion is successful. If an element is already inthe table, the function insert should return false.(iv) Implement search, which takes an integer and finds it in the table. The methodreturns true, if the search is successful and false otherwise.(v) Implement delete, which takes an integer and deletes it form the table. Themethod returns true, if the deletion is successful and false otherwise.(vi)…
Binary Search? When Jojo was a little kid, his teacher asked him a question. What was the answer of 1^2+2^2+3^2+...+N^2? Of course that problem was hard enough for a primary student. Buts ince he is a university student, and he knows that the answer is 1/6∗N∗(N +1)∗(2N +1), such problem is to easy for him. Now Jojo came up with a new problem. If he has an integerM, what is the smallest integer N such that 1^2 + 2^2 + 3^2+ ...+N^2 is greater than or equal to M. After thinking for some time, he came up with a solution, but his solution takes a lot of time. Since you are his nemesis, he challenges you to solve the problem quicker than him. Of course you accept his challenge! Format InputThe first line is an integer T representing the number of test cases.For each test case there will be 1 line consisting of an integerM. Format OutputFor each test case output “Case #X: N”. X is the test case number andN is the smallest integer such that 1^2 + 2^2 + 3^2+ ...+N^2is greater than or equal to…
Find 2N strings, each of length 2N, that have the same hashCode() value, supposing that the hashCode() implementation for String is the following:public int hashCode(){ int hash = 0; for (int i = 0; i < length(); i ++) hash = (hash * 31) + charAt(i); return hash;}Strong hint : Aa and BB have the same value
a. Given an array containing Strings, you need to write a code to store them in a hashtable.Assume that the Strings contain a combination of capital letters and numbers, and the String array will contain no more than 11 values.Use the hash function to be the|(summation of the alphabets of the String-product of the digits)|%11, where A=10, B=11, C=12, D=13, E=14…….up to Z=35.In case of a collision, use linear probing. For a String “C11SG2”, it’s hash function will produce the value=(value of C + value of S + value of G-1*1*2 ) - (12+28+16-2)%11=10, hence it will be stored in index 10 of the hash table. Plesse ans it asap, badly needed...!
Write a function, slens, that borrows a Vector of Strings and returns aHashMap that maps each string to its length.fn slens(stuff: &Vec<String>) -> HashMap<String, usize> {...}fn main() {let stuff = vec![String::from("A"),String::from("fine"),String::from("mess"),];println!("{:?}", slens(&stuff));println!("{:?}", stuff);}/* Output:{"fine": 4, "mess": 4, "A": 1}["A", "fine", "mess"]*/
Draw a diagram of the hashtable of size 23 that would result from inserting these Strings in the following order: A, W, X, Y, CM, CK, BD, H, MOB, BD. Manually compute the number of collisisons that should result. JAVA