1 ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" 2 word = [] 3 4▼ def encrypt(key): 5 6 ▼ 7 8 Y 9 10 123 11 12 13 ▼ 14 15 encrypted_result = for original_char in word[0]: alphabetic_index = ALPHABET.find(original_char) if alphabetic_index >= 0: new_index = alphabetic_index + key new_index = new_index % len(ALPHABET) new_character = ALPHABET[new_index] encrypted_result += new_character else: encrypted_result += original_char word.append(encrypted_result) 16 17 message=input("Enter a word to Enrcypt: ") 18 word.append(message.upper()) 19 shift = int(input("Please enter a shift: ")) 20 21 print("Your encerpted word is....") 22 encrypt(shift) 23 print (word[1])

1 ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" 2 word = [] 3 4▼ def encrypt(key): 5 6 ▼ 7 8 Y 9 10 123 11 12 13 ▼ 14 15 encrypted_result = for original_char in word[0]: alphabetic_index = ALPHABET.find(original_char) if alphabetic_index >= 0: new_index = alphabetic_index + key new_index = new_index % len(ALPHABET) new_character = ALPHABET[new_index] encrypted_result += new_character else: encrypted_result += original_char word.append(encrypted_result) 16 17 message=input("Enter a word to Enrcypt: ") 18 word.append(message.upper()) 19 shift = int(input("Please enter a shift: ")) 20 21 print("Your encerpted word is....") 22 encrypt(shift) 23 print (word[1])

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

Attached File: a2provided: grades = [[71, 14, 41, 87, 49, 93],[66, 73, 54, 55, 94, 79],[20, 51, 77, 20, 86, 15],[79, 63, 72, 57, 63, 73],[30, 66, 78, 65, 41, 45],[11, 83, 51, 47, 68, 63],[99, 43, 85, 86, 24, 75],[67, 102, 11, 84, 64, 109],[16, 24, 101, 78, 55, 89],[100, 26, 37, 95, 106, 100],[55, 77, 30, 34, 28, 15],[87, 67, 13, 71, 67, 83],[95, 65, 94, 56, 15, 92],[102, 23, 36, 39, 60, 39],[90, 59, 96, 105, 83, 16],[101, 40, 17, 12, 44, 36],[39, 63, 96, 12, 65, 82],[95, 20, 105, 34, 69, 95],[95, 93, 75, 18, 105, 102],[35, 15, 82, 106, 73, 30],[80, 52, 67, 49, 11, 88],[86, 17, 44, 75, 78, 49],[22, 60, 74, 110, 92, 37],[13, 14, 15, 82, 75, 57],[71, 106, 15, 77, 30, 98],[43, 80, 76, 85, 102, 53],[26, 98, 60, 80, 104, 79],[12, 28, 40, 106, 88, 84],[82, 75, 101, 29, 51, 75],[20, 31, 84, 35, 19, 85],[84, 63, 56, 101, 83, 102],[25, 106, 36, 24, 61, 80],[86, 75, 89, 47, 28, 27],[38, 48, 22, 72, 53, 83],[70, 34, 46, 86, 32, 58],[83, 59, 38, 16, 94, 104],[62, 110, 13, 12, 13, 83],[90, 59, 55,…
Trus or false: The back_inserter iterator always causes the new elements to be inserted following the existing ones.
/** * Inserts the specified key-value pair into the symbol table while maintaining the * ordering of keys. Overwrites the old value with the new value if the symbol table * already contains the specified key. Deletes the specified key (and its associated * value) from this symbol table if the specified value is {@code null}. * * @param key the key * @param val the value * @throws IllegalArgumentException if {@code key} is {@code null} */ public void put(Key key, Value val) { // TODO // Change this code to make sure the list remains sorted! if (key == null) throw new IllegalArgumentException("first argument to put() is null"); if (val == null) { delete(key); return; } for (Node x = first; x != null; x = x.next) { if (key.equals(x.key)) { x.val = val; return; } } first = new Node(key, val, first); n++; }…
/** * Inserts the specified key-value pair into the symbol table while maintaining the * ordering of keys. Overwrites the old value with the new value if the symbol table * already contains the specified key. Deletes the specified key (and its associated * value) from this symbol table if the specified value is {@code null}. * * @param key the key * @param val the value * @throws IllegalArgumentException if {@code key} is {@code null} */ public void put(Key key, Value val) { // TODO // Change this code to make sure the list remains sorted! Also, solve this using recursion. // To do this, you will need to add a recursive helper function that takes the front of a // list (Node) as an argument and returns the front of the modified list (Node). if (key == null) throw new IllegalArgumentException("first argument to put() is null"); if (val == null) { delete(key); return; }…
from dateutil import parserimport datetimefrom datetime import datetimeusernames = []passwords = [] def reg_user():"""Return for registering new user"""withopen('user.txt', 'a') asfile1: iflogin_username == "admin": new_username = input("Enter a username: ") whilenew_usernameinusernames:print("This username already exists.")new_username = input("Enter a username: ") new_password = input("Enter a password: ")confirm_password = input("Re-enter the password: ")whileconfirm_password != new_password:print("Passwords do not match.")new_password = input("Enter your password: ")confirm_password = input("Re-enter your password: ")else:print("Welcome ", new_username) whilenew_passwordinpasswords:print("This password already exists.")new_password = input("Enter a password: ")confirm_password = input("Re-enter the password: ") else:print("User not authorised to register a new user.")return file1.writelines(f"\n{new_username}, {new_password}") def add_task():"""Return for adding…
return_dict() that takes the name of a CSV file as the input parameter and returns a dictionary, where each key is the Reporting_PHU_ID and the value is a list containing the following data. name of CSV file is "data23.csv"
save_compressed_image: takes a nested list and a filename (string) as input, and saves it in the compressed PGM format to a file with the given filename. If the image matrix given as input is not a valid compressed PGM image matrix, instead raise a AssertionError with an appropriate error message. >>> save_compressed_image([["0x5", "200x2"], ["111x7"]], "test.pgm.compressed") >>> fobj open("test.pgm.compressed", 'r') >>> fobj.read() = 'P2C\\n7_2\\n255\\n0x5 200x2\\n111x7\\n' >>> fobj.close() >>> image [["0x5", "200x2"], ["111x7"]] >>> save_compressed_image(image, "test.pgm") >>> image2 = >>> image True = == load_compressed_image("test.pgm") image2 • save_image: takes a nested list and a filename (string) as input. Checks the type of elements in the list If thou are intogors thon saves the posted list as a PCM imago matrix into a file with the given
dictionary = { 37:1, 38:2, 39:2, 40:1, 41:1, 42:2, 43:3, 44:1, 45:2, 46:3, 47:1, 48:1, 49:2, 50:3, 51:2, 52:2, 53:3, 54:3, 55:1, 56:2 } def examFun (val): if val < 1: return 0 if val < 3: return if val < 5: return if val < 6: return if val < 9: return if val < 19: dictionary [56] dictionary [37] dictionary [42] dictionary [53] return dictionary[39] + examFun (6) return dictionary[52] + examFun(val - 16) + examFun(val - 23) print( examFun (27) % 10 )
Ele formula - Google Search es/28101/quizzes/385141/take/questions/5322873 001A-CE12S.. fiP ITE 001A-CE12S3 -.. TIP PE 002-CE12S3 - Ph... FOUNDATION F Question 45 What is the element stored in x[0]? int n = 10; int x[n],i=0.j; while(i!=n){ x[i]=pow(i,2); i++;} O 1 O 25 O4
1) set1 = set([10, 20, 30, 40]) set2 = set([40, 50, 60]) set3 = set1.union(set2) set4 = set1.difference(set2) set5 = set2.difference(set1) set6 = set1.symmetric_difference(set2) print(set3) print(set4) print(set5) print(set6) What is the output of the print statements?
A ValueError exception is raised if you try to retrieve a value from a dictionary using a nonexistent key. True or False
Python please char_data.txt: This is a Test. It is Only a Test. Testing 1234567. #$%^&*()+