25% off with code “SUMMER”
![Perform the following tasks on your lab machine: 1. Create a list with the following numbers (100, 300, 500, 2300, 2500) using the range function and answer the following: a. Print the length of the list b. Print the elements in the list such that each element appears in a separate line c. Print the average of all the items in the list d. Replace the maximum element of the list with the average value of the list e. Insert a new element at index 7. The value of the new element is the nth root of the value that is located in the middle of the list. Take n from the user. f. Write a for loop to print the last 3 elements in the list in reverse order g. Divide the list into two new lists where the first 3 elements will be in list X and the remaining elements will be in list Y. Print both lists. 2. Create two empty dictionaries dict1 and dict2: a. Create dict1. dict1 has two keys: 'car type' and 'size'. The value of each field is obtained from the user. b. Create dict2. dict2 has three keys: 'engine', 'origin', and 'date of release'. The value of each field is obtained from the user. The value of "date of release" is a dictionary {'day': value, 'month': value, 'year': value]. c. Add another field 'color' to dict1 and initialize it with your favorite color. d. Using the values stored in dict1 and dict2, print the following statement: "The car type is considered a size car. It has an engine CC engine. It is released on day/month/year". e. Merge both dictionaries into one dictionary called dict. f. Use the keys() method to print the following sentence: "The keys of dict2 are: engine, origin, and date of release".](https://gotit-pro.com/wp-content/uploads/2023/10/60a12885-bc90-4a0c-aacb-ca765f70006e-300x439.jpg)
1. Create a TypeScript program that repeats the values 1 to 100, with the following loop operation:
a. The first 10 loops display odd values (1, 3, 5, …, 19).
b. The second 10 repetitions display even values (2, 4, 6, …, 20).
c. And so on until we get to 100 repetitions.
d. Each multiple of 10 displays the number of numbers displayed.
e. Example output:
Quantity: 25
2nd 10 repetitions:
12
14
16
18
20
Quantity: 80
3rd 10 repetitions:
21
23
…
2nd 10 repetitions: 12, 14, 16, 18, 20 | Quantity: 80
3rd 10 repetitions: 21, 23, …
![(b) Modify the program in Q3(a), with the following new rules: - Players will need to win 3 games to become the overall winner. - Implement a penalty - for the player who skipped, entered an incorrect expression, or entered an expression that evaluated to the wrong result, will draw 2 random digits into their hand. - The player who loses the game will be awarded a "Skip" card in the next game. With the "Skip" card, the player can hit < Enter > to skip, without a penalty. - If not utilized, the "Skip" cards CANNOT be carried forward to the next game. Illustration of the "new" game on the left column, with the rules of the game explained on the right column: Enter player: Alan Enter player: Betty Enter player: Starting hand (number) of digits: 4 Let's play... Game 1 Round 1: Result 6 Betty's hand: [5,2,1,1] Enter expression: 5+1 Correct! Betty's hand: [2,1] Alan wins this game in 4 rounds!! Overall game score: Alan 1, Betty 0 Let's play... Game 2 Round 1: Result 5 Betty's hand: [3, 6, 5, 7, 'S'] Enter expression: Skipped with no penalty!! Betty's hand: [3,6,5,7] Alan's hand: [2,1,2,1] Enter expression: Skipped and 2 digits added to hand Alan's hand: [2,1,2,1,4,7] Betty wins this game in 5 rounds!! Overall game score: Alan 1, Betty 1 Let's play... Game 3 Round 1: Result 6 Betty's hand: [1, 2, 8, 7] Enter expression: 8-2 Correct! Betty's hand: [1, 7] Computer randomized the play sequence and will stay the same for every game/round End of game, if no overall winner, continue to play another game. Loser will be awarded a "Skip" card in the next game. "S" represents the "Skip" card awarded to Betty. No penalty for Betty as she has a "Skip" card. Hit < Enter > key to skip if cannot form an expression. In this case, the player who skipped will draw 2 random digits into their hand. End of game, if no overall winner, continue to play another game. Loser will be awarded a "Skip" card in the next game.](https://gotit-pro.com/wp-content/uploads/2023/10/1fa83cc6-5755-4d51-b5f6-f4335b49f1c8.jpg)
![Wordle is a popular online word game called Wordle. There are instructions given at the official site for Wordle, but essentially, it is a word guessing game. In this game, each guess is marked by indicating which letters of your guess match a secret answer. A Green mark indicates that you have found a correct letter in the correct position in the secret word. A Yellow mark indicates that you have found a correct letter but in an incorrect position relative to the secret word. A Grey mark indicates that the given letter does not appear in the secret word at all. Be careful of duplicate letters: a letter that is guessed twice may be marked once as Green or Yellow and once as Grey if there is only a single occurrence of that letter in the secret word. In particular, Green markings take priority over Yellow markings, and Yellow markings have a priority in the guess, reading from Left to Right. Given the datatypes dataCheck = GreenYellowGrey deriving (Eq, Show, Read), typeMarking = [(Char, Check)], write a function markGuess :: String -> String -> Marking that takes the secret word to be guessed and a guess of the same length. The function should return a marking according to the Wordle rules. The order of the returned marking matters and should satisfy map fst (markGuess secret guess) == guess. An example marking showing the marking priorities is markGuess "aaabb" "bbxxb" should return [(b, Yellow), (b, Grey), (x, Grey), (x, Grey), (b, Green)]. The final 'b' in the guess is marked Green because it is correctly placed in the secret word. The first 'b' in the guess is marked Yellow because there is a second occurrence of 'b' in the secret word in a different position. The second 'b' in the guess is marked Grey because there is no third occurrence of 'b' in the secret word. Note that your solution should work with strings of any length but should report an error where the two given strings are of different lengths. Hint: A reasonable strategy is to write a helper function that finds the characters marked Green first. Then feed the result of that helper function into another helper function that finds the Yellow markings.](https://gotit-pro.com/wp-content/uploads/2023/10/20e3b46d-d1f9-447e-bb76-76edd25bf950-300x155.png)
Andrew Porteck –
Great Work In Timely Fashion. Something what I wanted.
Cassondra Halpin –
Solution I got is great! Before deadline and is great with changes
Felicia Schoenthal –
I have received phenomenal service that is consistent. The quality of work is A+ and the prices are very reasonable.
Kimberly Yagovane –
Work was finished long before due and tutor was considerate and engaging. Perfect!
Tangela Arnwine –
Great job, very quick and informative! Done in an hours! Thank you for a job well done.
Karina Cisneros –
Everything was completed on time and met my expectations.