Task 4 Suppose you have a sitting arrangement of the students who will give the final exam in a list. The list contains the last two digits of their student ID as given below. sitting_list = [10,30,20,70,11,15,22,16,58,100,12,56,70,80] Now you want to organize the sitting arrangement of the students in your own way. You decide to sort all the students in the even indices of the list in ascending order and all the students in the odd indices of the list in descending order. So, write a python program that organizes the list for you in this way. Sample Output [10, 100, 11, 80, 12, 70, 20, 56, 22, 30, 58, 16, 70, 15]

Task 4 Suppose you have a sitting arrangement of the students who will give the final exam in a list. The list contains the last two digits of their student ID as given below. sitting_list = [10,30,20,70,11,15,22,16,58,100,12,56,70,80] Now you want to organize the sitting arrangement of the students in your own way. You decide to sort all the students in the even indices of the list in ascending order and all the students in the odd indices of the list in descending order. So, write a python program that organizes the list for you in this way. Sample Output [10, 100, 11, 80, 12, 70, 20, 56, 22, 30, 58, 16, 70, 15]

New Perspectives on HTML5, CSS3, and JavaScript

6th Edition

ISBN:9781305503922

Author:Patrick M. Carey

Publisher:Patrick M. Carey

Chapter12: Working With Document Nodes And Style Sheets: Creating A Dynamic Document Outline

Section12.2: Visual Overview: Exploring Attribute Nodes

Problem 2QC

See similar textbooks

Similar questions

def city_dict(adict): """ Question 6 -Given a dictionary that maps a person to a list of countries they want to travel to, return a dictionary with the value being the list sorted by the last letter in each countries name. If two countries have the same last letter, sort by the first letter. -For an extra challenge, try doing this in one line (Optional). Args: adict (dict) Returns: dict >>> city_dict({"Pablo": ["Belgium", "Canada", "Germany"], "Athena": ["Italy", "France", "Egypt"], "Liv": ["Japan", "Bolivia", "Greece"]}) {'Pablo': ['Canada', 'Belgium', 'Germany'], 'Athena': ['France', 'Egypt', 'Italy'], 'Liv': ['Bolivia', 'Greece', 'Japan']} >>> city_dict({"Jacob": ["Bahamas", "Brazil", "Chile"], "Lexi": ["Colombia", "Finland", "Panama"], "Emily": ["Ireland", "Russia", "Kenya", "Jordan"]}) {'Jacob': ['Chile', 'Brazil', 'Bahamas'], 'Lexi': ['Colombia', 'Panama', 'Finland'], 'Emily': ['Kenya',…
Complete the docstring below, and use the helper functions attached if necessary: def check_syllable_counts(poem_lines: POEM, description: POETRY_FORM_DESCRIPTION, word_to_phonemes: PRONUNCIATION_DICT) \ -> List[POEM_LINE]: """Return a list of lines from poem_lines that do NOT have the right number of syllables as specified by the poetry form description, according to the pronunciation dictionary word_to_phonemes. If all lines have the right number of syllables, return the empty list. Precondition: len(poem_lines) == len(description[0]) >>> poem_lines = ['The first line leads off,', ... 'With a gap before the next.', 'Then the poem ends.'] >>> description = ((5, 5, 4), ('*', '*', '*')) >>> word_to_phonemes = {'NEXT': ('N', 'EH1', 'K', 'S', 'T'), ... 'GAP': ('G', 'AE1', 'P'), ... 'BEFORE': ('B', 'IH0', 'F',…
How many references must you changes to insert a node between two nodes in a double linked list. Show your answer with a drawing highlighting the new references. Assuming current is the reference of the next-to-last node in a linked list, write a statement that deletes the last node from the list. What is the time complexity of deleting a node from a linked listed? Is it faster than deleting a node from an array? Why?
True or False For each statement below, indicate whether you think it is True or False. If you like, you can provide a description of your answer for partial credit in case you are incorrect. Use the standard linked list below to answer True/False statements 9-12: 8 7 null 4 10 The “head” pointer of this list is pointing to Node 4 If we called “insert(5)”, the new node’s “next” pointer will point to Node 8 If we called “delete(10)”, Node 7’s “next” pointer will point to Node 8 If we called “search(20)”, the “head” pointer will be at Node 4 after the search function ends
Suppose a list contains marks earned in the courses CSE110, PHY111, and MAT110 of each student consecutively in a nested list form. Your task is to take a course name as input and sort the list based on the marks obtained in that course to finally print the names of the students in descending order of marks obtained i.e. from the student who earned the highest marks to the student who earned the lowest. For example, the list may look like stu_lst = [ ["Alan", 95, 87, 91], ["Turing", 92, 90, 83], ["Elon", 87, 92, 80], ["Musk", 85, 94, 90] ] where for each nested list, 1st index holds the name of the student, 2nd index is total marks earned in the CSE110 course, 3rd index is PHY111 marks and 4th index is MAT110 marks. [You cannot use python build-in sort() function, you can call your own sort function or copy your code from previous tasks instead] =============================================================== Sample Input 1 MAT110 Sample Output 1 ['Alan', 'Musk', 'Turing', 'Elon']…
Suppose a list contains marks earned in the courses CSE110, PHY111, and MAT110 of each student consecutively in a nested list form. Your task is to take a course name as input and sort the list based on the marks obtained in that course to finally print the names of the students in descending order of marks obtained i.e. from the student who earned the highest marks to the student who earned the lowest. For example, the list may look like stu_lst = [ ["Alan", 95, 87, 91], ["Turing", 92, 90, 83], ["Elon", 87, 92, 80], ["Musk", 85, 94, 90] ] where for each nested list, 1st index holds the name of the student, 2nd index is total marks earned in the CSE110 course, 3rd index is PHY111 marks and 4th index is MAT110 marks. [You cannot use python build-in sort() function, you can call your own sort function or copy your code from previous tasks instead] =============================================================== Sample Input 1 MAT110 Sample Output 1 ['Alan', 'Musk', 'Turing', 'Elon']…
Need help with this: Given the following challenges, use append(), extend(), pop(), and insert()to change the contents of the lists. Suppose that we have the following list: Strawberry, Blueberry, Blackberry, Cranberry Define the list berries with the following elements shown in Snippet 5.11: Strawberry, Blueberry, Blackberry, Cranberry Using the built-in append() method, add the value Raspberry to the list berries. Using the built-in extend() method, extend an empty fruits list from the berries list that you created previously. Insert Mangoes into the fruits list at index 2 using the built-in method insert(). Remove the element at index 1 from the fruits list using the built-in method pop() and replace it with Apples, using the insert() built-in method. Finally, sort the elements in the fruits list by using the built-in method sort() with keyword arguments. Set the key argument to None and the reverse argument to False.
Please check the instructions on the images given. Sample output are also given on the image while the code for modification is provided below. hash.c #include <stdlib.h>#include <stdio.h> struct Node { int val; struct Node * next;}; struct HashTable { int size; struct Node ** table;}; struct Node * create_node(int val);struct HashTable * create_table(int size);void destroy_table(struct HashTable * h);void display_table(struct HashTable *h);int hash_function(int key, int size);void insert(struct HashTable *h, int val);int search(struct HashTable * h, int val);struct Node * delete(struct HashTable * h, int val); void main(){struct HashTable * h = create_table(8);display_table(h); int val_insert[12] = {12, 31, 45, 83, 72, 29, 84, 39, 61, 24, 10, 50}; for (int i=0; i<12; i++) { insert(h,val_insert[i]);}display_table(h); int val_search[4] = {29, 99, 72, 20};for (int i=0; i<4; i++) { int result = search(h,val_search[i]); printf("Search value %2d:…
From the code supplied by the tutor, modify it so that: 1. Ask what kind of animal it is (for example, carnivore, herbivore, and omnivore) When prompting for the information, it is saved in a list for each of the three animal types (for example, lions in carnivores, bears in omnivores, giraffes in herbivores) and they are saved depending on the number that the user adds in each list. 2. At the end, a list of lists is printed that presents the data of each of the saved animals according to their type.
Answer properly What type of data is being stored into a list and identify the name of the list being processed. //Create variables//stores data from the dog table in listsvar dogList = getColumn("Dogs", "Name");var breedList = getColumn("Dogs", "Breed Group");var temperamentList = getColumn("Dogs", "Temperament"); var breedGroup = "";var tempGroup = "";var message = "";var message2 = ""; //Filtered listsvar filteredDogList = [];var filteredTemperamentList = []; //Filtered list to filter filteredDogListvar filteredDogList2 = []; //Button to filter the dogs by breed and takes you to the next screen that displays the filtered dogsonEvent("nextButton", "click", function( ) {breedGroup = getText("breedDropdown");setScreen("dogTypesScreen");filter();updateScreen1();}); //Button to sort the filtered dogs by temperament and takes you to the next screen that displays themonEvent("temperamentButton", "click", function( ) {tempGroup =…
import json, datetime, csvfrom pprint import pprint Question 3 - Using the cleaned list of lists from question 1, create a dictionary of dictionaries where each key in the outer dictionary is an author whose last name starts with the letter 'S'. - Each inner dictionary should contain the number of books that author has written as 'Number of Books' - It should contain the earliest book title for that author based on year with the key 'First Book' - Finally it should contain the latest book title for that author based on year with the key 'Last Book' - If an author has only one book put the same title in both places - Return the dictionary of dictionaries def author_history(cleaned_list): Args: cleaned_list (list) Returns: dictionary of dictionaries Output: {'SafranFoer,Jonathan': {'First Book': 'ExtremelyLoudandIncrediblyClose', 'Last Book': 'ExtremelyLoudandIncrediblyClose',…
Write a line of code in R that will change the Location column of the tibble in my_Costco_list to an ordered factor where the order of the levels is in the following order: Clothes, Cereal, Refrigerated. Then write a line of code using the previous line to compute the minimum amount of items (not the number of different items) required in each location. my_Costco_list <- list(tibble(Item = c("Milk", "Coffee", "Lettuce","Pants"),Amount = c(4,1,2,2),Location = c("Refrigerated","Cereal","Refrigerated","Clothes")))