Use a while loop function instead of a for loop sing python a = ['Jan', 'Yan', 'Islam', 'Li', 'Volkov', 'Ankalaev']b = ['Glover', 'Sandhagen', 'Hooker', 'Khamzat', 'Iybura', 'Oezdemir']www.mwwwwwwwwwwwwwwwwwwwfighters = list(zip(a, b))%3Dwinners = []for i in range (0, 2**len (a)):tmp[]wwwhamap = str(format(i, '06b'))for j in range (0, len(a)):tmp.append (fighters[j][int(map[j])])A winners.append (tmp)wwwwwww wwprint (winners) def loopy_madness(string1: str, string2: str) -> str:Given two strings and , return a new string thatcontains letters from these two strings "interwoven" together, starting withthe first character of . If the two strings are not of equallength, then start looping "backwards-and-forwards" in the shorter stringuntil you come to the end of the longer string."interwoven" (or "interweaving") means constructing a new string by takingthe first letter from the first string, adding the first letter of thesecond string, adding the second letter of the first string,adding the second letter of the second string, and so on."backwards-and-forwards" is a custom looping term. First the loop startsat position 1 (index 0) and goes until position n (i.e., the end). Once theLoop reaches position n, it goes backwards, starting at positionn- 1 andgoes to position 1 (index 0). This repeats until the two strings areinterwoven. For example, the backwards-and-forwards operations of "abc"would be "abcbabcba..."wwwwExamples:If you are given "abc" and "123", then the output string is "alb2c3".This is after taking "a" from the first string, adding "1" from thesecond string, adding "b" from the first string, and so on.Things get more interesting when you are given two strings that differin length. For example, if you are given "abcde" and "12", then thewwwwwwwoutput would be "alb2c1d2e1". Notice how the shorter string loopsaround when it runs out of characters, and continues looping until thelonger string is exhausted.

Answered: Use a while loop function instead of a…

Engineering

Computer Science

Use a while loop function instead of a for loop sing python

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 18SA

See similar textbooks

Similar questions

(PYTHON) a) get_total_cases() takes the a 2D-list (similar to database) and an integer x from this set {0, 1, 2} as input parameters. Here, 0 represents Case_Reported_Date, 1 represents Age_Group and 2 represents Client_Gender (these are the fields on the header row, the integer value represents the index of each of these fields on that row). This function computes the total number of reported cases for each instance of x in the text file, and it stores this information in a dictionary in this form {an_instance_of_x : total_case}. Finally, it returns the dictionary and the total number of all reported cases saved in this dictionary. (Suppose we want to know the total number of cases reported on each date, so use x = 0.) >>> result, total_cases = get_total_cases(database, 0) >>> display_dict(result) 2021-05-19: 8 2021-05-20: 2 2021-05-21: 1 2021-05-22: 1 >>> print(total_cases) 12
Please provide code in the form of SML language, read directions carefully One file will have the two functions in it, the other file will be a test file with calls to the functions to test that they work. Thank you for any help you can provide. Write a union function that takes two lists that are in order from smallest to largest and produces a list with a single copy of all elements from both lists. The resulting list must also be in order from smallest to largest. Write an intersection function much like union, but with the result containing only those elements that appear in both lists. All lists will be in order from smallest to largest.
b. Using user-defined function, create a C++ or Java application implementing a linked list datastructure. The application should be able to perform the following operations on the datastructure can with the following operations.i. Insertion into the list ii. Deletion from the list iii. Printing the content of the list
Consider the following declaration. int list[] = {3, 8, 10, 13, 6, 11};a. Write a C++ code that will output the value stored in each component of list.b. Write a C++ code that will set the values of the first five components of list as follows: The value of the the ith component is the value of the ith component minus three times the value of the (i+1)th component.
2. Write a function addname( ) that takes two strings, a filename, memberList.txt, and person’s name as parameters and adds the new name to the end of the list. The function will write the new file as memberList.txt. If the name is already in the list, the name will not be added.
q9) In which of the following linked list there will be no beginning and ending? a. Depends on the Problem. b. Single Linked List. c. Double Linked List. d. Circular Linked List.
Write a struct ‘Student’ that has member variables: (string) first name, (int) age and (double) fee. Create a sorted (in ascending order according to the age) linked list of three instances of the struct Student. The age of the students must be 21, 24 and 27. Write a c++ function to insert the new instances (elements of the linked list), and insert three instance whose member variable have age (i) 20, (ii) 23 and (iii) 29. Write a c++ function to remove the instances from the linked list, and remove the instances whose member variables have age (i) 21 and (ii) 29. Write a c++ function to count the elements of the linked list. Write a c++ function to search the elements from the linked list, and implement the function to search an element whose age is 23. Write a c++ function to print the linked list on the console.
in C++ kth ElementExtend the class linkedListType by adding the following operations:a. Write a function that returns the info of the kth element of the linked list. If no such element exists, terminate the program.b. Write a function that deletes the kth element of the linked list. If no such element exists, terminate the program. Provide the deﬁnitions of these functions in the class linkedListType. please, do not copy from any other sources, give me a fresh new code. Thank you
c++ You have a list with student ratings. Into the hit list from two different universities University A evaluates students on a 5-point scale (0-failed ... 5-excellent) University B evaluates students on a 100 point scale (below 50 - failed. 50..59 = 2, 60..74 = 3, 75..89 = 4, 90..100 = 5) As a result of an error, the scores were mixed into the general list, without equalization It is necessary to sort all the marks in the list from the highest to the lowest, not forgetting that for example, a score of 5 on a 5-point scale is higher than 89 on a 100-point scale (Note 1: there are no grades below 50 at the university) (Note 2: Personality A is considered higher than B. That is, a score of 5 is better than 100)
Please do this in C++. The only parts needed are commented as //TODO in MAIN. Please do not use cout, the PrintNodeData in MileageTrackerNode.cpp needs to be called. I am struggling with adding data into the linked list. Given the MileageTrackerNode class, complete main() to insert nodes into a linked list (using the InsertAfter() function). The first user-input value is the number of nodes in the linked list. Use the PrintNodeData() function to print the entire linked list. DO NOT print the dummy head node. Ex. If the input is: 3 2.2 7/2/18 3.2 7/7/18 4.5 7/16/18 the output is: 2.2, 7/2/18 3.2, 7/7/18 4.5, 7/16/18 Main.cpp #include "MileageTrackerNode.h"#include <string>#include <iostream>using namespace std; int main (int argc, char* argv[]) {// References for MileageTrackerNode objectsMileageTrackerNode* headNode;MileageTrackerNode* currNode;MileageTrackerNode* lastNode; double miles;string date;int i; // Front of nodes listheadNode = new…
8.17 LAB: Inventory (linked lists: insert at the front of a list) C++ Given main(), define an InsertAtFront() member function in the InventoryNode class that inserts items at the front of a linked list (after the dummy head node). Ex. If the input is: 4 plates 100 spoons 200 cups 150 forks 200 the output is: 200 forks 150 cups 200 spoons 100 plates InventoryNode.h #include <iostream>#include <string>using namespace std; class InventoryNode {private:string item;int numberOfItems;InventoryNode *nextNodeRef; public://ConstructorInventoryNode() {this->item = "";this->numberOfItems = 0;this->nextNodeRef = NULL;} //ConstructorInventoryNode(string itemInit, int numberOfItemsInit) {this->item = itemInit;this->numberOfItems = numberOfItemsInit;this->nextNodeRef = NULL;} //ConstructorInventoryNode(string itemInit, int numberOfItemsInit, InventoryNode nextLoc) {this->item = itemInit;this->numberOfItems = numberOfItemsInit;this->nextNodeRef =…
in C++... kth Element Extend the class linkedListType by adding the following operations:a. Write a function that returns the info of the kth element of the linked list. If no such element exists, terminate the program.b. Write a function that deletes the kth element of the linked list. If no such element exists, terminate the program. Provide the deﬁnitions of these functions in the class linkedListType. PLEASE DON'T reject this question, this is the whole question that I have... so please do it however u can, Thank you!