a) Suppose we are trying to hide a secret message by embedding it in random extra letters. Write a function decode that takes a string called message and a list called key as parameters and returns a new string that represents the decoded text. key contains the index positions of the secret message in message. Example: For a message "KSGIAOELWIERUXOVPQIERCZXIETSQNBY" and key [3, 7, 14, 15, 19 ,21, 27] the function returns "ILOVECS" It is possible that the key contains numbers that are invalid index positions they greater than the length of message. These extra numbers should be ignored. Example: For a message "OK" and key [0, 1, 2, 3, 4] the function returns "OK"

a) Suppose we are trying to hide a secret message by embedding it in random extra letters. Write a function decode that takes a string called message and a list called key as parameters and returns a new string that represents the decoded text. key contains the index positions of the secret message in message. Example: For a message "KSGIAOELWIERUXOVPQIERCZXIETSQNBY" and key [3, 7, 14, 15, 19 ,21, 27] the function returns "ILOVECS" It is possible that the key contains numbers that are invalid index positions they greater than the length of message. These extra numbers should be ignored. Example: For a message "OK" and key [0, 1, 2, 3, 4] the function returns "OK"

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

Write a function, namely fourslicebidirectionSearch(), that will slice a list of integers into four slices and applies bidirection search to each slice. Note that a length of list could be any size and must be at least 4.
create a function my_code(u) that sorts a list of words alphabetically using a FOR loop. example: my_code(u) will output the list ['apple', 'bear', 'cat', 'dog'] u = "dog cat bear apple"
1. Implement a function insertBook(Book newBook) to add a book at the end of thelinked list.a. Ask the librarian to input all the necessary book information.b. Use the information to create a Book objectc. Pass through the Book object as the parameter to the functiond. Store the Book object into the Node objecte. “Link” the object with the rest of the linked list2. Implement a function insertBefore(Book newBook, int bookID) to add a book infront of another book given its bookID.a. Ask the librarian to input all the necessary book information.b. Use the information to create a Book objectc. Pass through the Book object and bookID as the parameter to the functiond. Search for the matching Book objecte. Store the Book object into the Node objectf. “Link” the object with the rest of the linked list3. Implement a function searchBook(int bookID) to search for a book by its bookIDcode and return the book object.a. Ask the librarian to input the bookID.b. If the book doesn’t exist display an…
Question 2: Write a function that takes a list of distinct integers l, and an integer k. Your function then finds the index of the integer in l, whose removal from l results in a list whose sum is k. For example, given [3,6,4,1,5,2] and 18, your function should return index 0, which corresponds to 3 in the list. Because, when 3 is removed from the list, the sum of the remaining list [6,4,1,5,2] is 18. You can assume that the given problem is always solvable. """ def removeOne(l, k):
TROUBLESHOOT my PYTHON code, please :) The code of a sequential search function is shown on textbook page 60. In fact, if the list is already sorted, the search can halt when the target is less than a given element in the list. For example, given my_list = [2, 5, 7, 9, 14, 27], if the search target is 6, the search can halt when it reaches 7 because it is impossible for 6 to exist after 7. Define a function linearSearchSorted, which is used to search a sorted list. This function displays the position of the target item if found, or 'Target not found' otherwise. It also displays the elements it has visited. To test your function, search for these targets in the list [2, 5, 7, 9, 14, 27]: 2, 6, 14, 27 and 28. Expected output: List: [2, 5, 7, 9, 14, 27] Search target: 2 Elements visited: 2 Target found at position 0 Search target: 6 Elements visited: 2 5 7 Target not found Search target: 14 Elements visited: 2 5 7 9 14 Target found at position 4 Search target: 27 Elements visited: 2…
Write the code for the following function."""def unmask_chars(s1: str, s2: str, mask: str) -> str:'''Return a new string where the character at index i iss1[i] if mask[i] is 0and s2[i] if mask[i] is 1.len(s1), len(s2), and len(mask) are equal.>>> unmask_chars('cat', 'bat', '001')'cat'>>> unmask_chars('a', 'b', '0')'a'>>> unmask_chars('apple', 'graph', '01011')'arpph''''# TODO: Write your code here
In C In C, strings are implemented by a contiguous sequence of characters, terminated by NUL character, otherwise known as ASCII code 0 (10'). CAPI, provides a function stropy for copying strings. The prototype of the function is given in the following: char* strepy(char* destination, const char* source); A) Write your own version of stropy that receives two character pointers and copies the source string into the destination string, character by character, until it reaches a null character. • The function stops when it reaches the end of the string, in which case it makes sure the destination string is properly terminated. • The function returns the original destination pointer as its return value. • The function assumes that source and destination strings are valid pointers. • In case either source or destination pointers are NULL, the function simply returns NULL. B) Write a small program that demonstrates the use of your version of strepy() function. • Define a character array and…
Implement the following functions in the same application in C#: 1. Given a number (integer) N (greater than 1). Implement a Fibonacci sequence of length N. (Function name ComputeFibonacciSequence )ComputeFibonacciSequence receives N.2. Given a list L with n numbers (integers), implement a function that returns whether that list is even prone or not (i.e.: the number of even numbers in the list must be higher than that of the odd numbers.) (Function name ComputeEvenProne) - Return 1 if the list is even prone, return 0 if it is not.ComputeEvenProne receives L.
(This question is for a linked list of the type described on the front page, Item 5). Write a recursive function CountGE60. that receives a linked list (may or may not be empty) and returns the number of nodes (each containing a data item value) greater than or equal to 60.
Write a C++ Function that returns the data of the middle node in a linked list and in case the linked list contains only one node return the data inside this node then returns the sum of all the nodes in linked list then returns the maximum data value in the linked list
Create a function that takes a grid of # and -, where each hash (#) represents amine and each dash (-) represents a mine-free spot.Return a grid, where each dash is replaced by a digit, indicating the number ofmines immediately adjacent to the spot i.e. (horizontally, vertically, anddiagonally).Example of an input:[ ["-", "-", "-", "#", "#"],["-", "#", "-", "-", "-"],["-", "-", "#", "-", "-"],["-", "#", "#", "-", "-"],["-", "-", "-", "-", "-"] ]Example of the expected output:[ ["1", "1", "2", "#", "#"],["1", "#", "3", "3", "2"],["2", "4", "#", "2", "0"],["1", "#", "#", "2", "0"],["1", "2", "2", "1", "0"] ]Here is a tip. When checking adjacent positions to a specific position in the grid,the following table might assist you in determining adjacent indexes:NW position =current_row - 1current_col - 1N position =current_row - 1current_colNE position =current_row - 1current_col + 1W position =current_rowcurrent_col - 1Current position =current_rowcurrent_colE position…
C. Consider the following function headers and type contracts:def aragorn(x: int, y: str, z: float) -> str:def gandalf(x: list) -> list:def elrond(x: list, y: bool) -> bool:If the following code runs without errors, what is a header and type contractfor treebeard?a = aragorn(11, 'good', 2.0)b = treebeard(5, gandalf([1, 2, 3]), a)print(elrond(gandalf([4, 5]), b))Write the header and type contract for treebeard.