Quick assignment: Lists For this assignment, you must create and make use of lists and master the basic skills in() and append(). 1. Create a new list. The list should be called "colour_list". The list should contain the following items: Red, Blue, Purple, Green, Orange, Beige, Peach. 2. Create another list now, which is called "fruit_list". This list should contain: Apple, Banana, Orange, Prune, Pineapple Peach. 3. Print both lists 4. Now create a new EMPTY list and call it "fruits_that_are_colours" 5. Iterate (using a for loop) through the first list, and check whether it is in the second list. if it is, add it to the third list with append() 6. Now print the list of fruits that are colours. Done. For a little extra challenge (optional), make use of functions to make the code slicker. Try to keep your main code as only calls to functions. Take note that lists created INSIDE functions will not "exist" outside of the functions unless you define them as global variables. However, if you define a list outside a function, it can be modified outside

Quick assignment: Lists For this assignment, you must create and make use of lists and master the basic skills in() and append(). 1. Create a new list. The list should be called "colour_list". The list should contain the following items: Red, Blue, Purple, Green, Orange, Beige, Peach. 2. Create another list now, which is called "fruit_list". This list should contain: Apple, Banana, Orange, Prune, Pineapple Peach. 3. Print both lists 4. Now create a new EMPTY list and call it "fruits_that_are_colours" 5. Iterate (using a for loop) through the first list, and check whether it is in the second list. if it is, add it to the third list with append() 6. Now print the list of fruits that are colours. Done. For a little extra challenge (optional), make use of functions to make the code slicker. Try to keep your main code as only calls to functions. Take note that lists created INSIDE functions will not "exist" outside of the functions unless you define them as global variables. However, if you define a list outside a function, it can be modified outside

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

Javascript question. Please solve with JavaScript NOT jQueryBuild a word list sorter with browser LocalStorage. How it works: A user will enter a word into an input or textarea and press submit. When clicking the submit button, the value of the intput/textarea should be added as a bullet point on a <ul> list below the intput/textarea. When added, the displayed list is re-sorted to include the new word and displayed again immediately. Requirements: Sort lexically in increasing order from top to bottom Use document.queryselector and event listeners to accomplish the list add word functionality Save word list in localStorage so that data persist on browser refresh Add a delete functionality to your list Please solve with JavaScript NOT jQuery
Which best describes this axiom: aList.getLength ( ) = ( aList.remove ( i ) ) . getLength ( ) + 1 You cannot remove an item from from existing list that is empty Removing an item from an existing list decreases its length by one Removing an item from an existing list increases the list size by one None of these
Consider the following linked list of the form. This list already exists, so you do not need to write the code to create the list below: struct nodeType { int infoData; nodeType * next; }; nodeType *first; … and containing the values: first (( See image for values )) Use this linked list to perform the following actions. Declare any additional pointers, etc., if needed, to complete the code. You do not need to write any includes or using statements—just program segments. Write a code segment that creates a new node with infoData = 13 and inserts the node after the node with the value 12.
Using Java programming language create a linked list named Cars with four elements: "SUV cars", "Pickup cars", "Sport cars", and "Sedan cars". Apply the following activities on the code you’ve created and provide screen shot of each result: Add a new element “Classic car” at the beginning of the linked list using iterator. Add a new element “Economic cars" after the element "Sedan Cars" using iterator. Print the LinkedList backward from the last element to the first element using hasPrevious()
4. In lab4_p4.py a list items is declared and initialized with 6 words. Use join to create a string obtained by combining all the words in the list items separated by commas. Assign your string to a variable named favorite_things and print this string. Be sure to include a space after each comma in your answer so that favorite_things has value "raindrops, roses, whiskers, kittens, kettles, mittens". Do not modify the value of items.
def create_category(info): li = info.split() if len(li) == 2: if is_numeric(li[1]) == True: li[2] = float(l[2]) else: return -1 else: return -2 """ Given a string `info`, which is supposed to contain the category name and its percentage, return a two-element list, which contains this information stored as a string and a float respectively. Calls is_numeric() to verify that the percentage is a numeric value (int or float). Stores the percentage as a float (not as a string). E.g., if the input is "Quiz 25", the function returns a list: ["Quiz", 25.0] If splitting the `info` string does not result in a two-element list, then return -2. If the last input value (the percentage) in `info` is not numeric (int or float), does not update the list and returns -1 instead. """ debug
def hike(lists: list[list[int]], start: tuple[int, int],end: tuple[int, int]) -> int:"""Given an elevation map <lists> and a start and end calculate the cost itwould take to hike from <start> to <end>. If the start and end are the same, then return 0.Some definitions and rules:1. You can only hike to either a vertically or horizontally adjacentlocation (you cannot travel diagonally).2. You must only travel in the direction of the <end_point>. Moreexplicitly, this means that any move you make MUST take you closerto the end point, so you cannot travel in the other direction.3. We define the cost to travel between two adjacent blocks as theabsolute difference in elevation between those blocks.4. You will calculate the naive route here, so at every position, youwill have two choices, to either move closer to the end point alonga row, or along a column, and you will chose the position that coststhe least at that point (you do not need to look ahead to see if…
2)At the interactive prompt define a list named L that contains four strings or numbers(eg,L=[0,1,2,3]) a. What happens when you try to index out of bounds (e.g., L[4])?
Don't copy from other websties a) Write a function to get the value of the Nthnode in a Linked List. [Note: The first (N=1) item in the list means the item at index 0.] It takes two parameters: the list or its head, and N. Return False if the list has fewer than N elements. The Linked List structure supports the following function. def getHead(self): return self.head # it points to a Node structure The Node structure supports the following functions. def getData(self): return self.data # it returns the value stored in the Node def getNext(self): return self.next # it points to the next Node b) Write a function that counts the number of times a given integer occurs in a Linked List. Assume similar structures as defined in 1.
def my_index_1(my_list:List[int], my_element:int)->int:"""Our version of the one-argument version of the index function.https://docs.python.org/dev/library/stdtypes.html#common-sequence-operations)This function takes a list and an element, and returns the smallestindex where the element occurs in the list. This function returnsNone if the element is not in the list.Arguments:my_list (list): A list of integers.my_element (int): The element to be found.Returns:int: The smallest index at which my_element is found in my_list.Examples:>>> print(my_index_1([], 2))None>>> print(my_index_1([1, 2, 3], 2))1>>> print(my_index_1([3, 1, 2, 3, 1], 2))2>>> print(my_index_1([3, 1, 2, 3, 1], 3))0""" Please solve this in Python
InterpolationAssignment DescriptionMeike, our climate scientist, was very happy with the program you wrote to calculate the maximum temperature drop. Now she has the following problem; in a series of measurements shediscovers one data point is missing, but not which one. She does know that the measurementsshow a constant increase.Write a function, interpolate(list), that completes a given series. Provide as output the indexbehind which the element should be inserted and the value. You can assume that the measurements are natural numbers and that the input consists of at least 3 measurements. You can assumethat both the first and the last data point have not been droppedP.S. Meike is in a hurry; your algorithm must run in O(log n) time.ExampleInput Output 1 Output 2[1, 2, 4] 1 3[3, 7, 11, 19] 2 15NotesMake sure to turn in your code with the filename “Interpolation.py”. If you turn it in withany other name it will fail the tests. This is due to instead of this assignment giving you an…
Java Please provide Comment and test cases. PLease see attachment Create a Linked List data structure by writing your own Linked List class which contains a node class. The node class will house the data (integer in this case) and a pointer to the next node element. Populate your linked list with the following integers and print it . 50, 11, 33, 21, 40, 71 No you do not need to print the commas ;) Delete N-th node from the end of the linked list and print the linked list after deletion. Here N = 2 Below is the expected output after deleting the second last element. 50, 11, 33, 21, 71 ATTN : Note : Here we do not know the length of the list. Complete the above deletion operation without calculating the length of the list. Your solution should only make a single pass through the linked list, adhering to O(n) time complexity overall and O(1) space complexity. Hint : Maintain two pointers : a ’Fast’ Pointer and a ’Slow’ pointer. Initialize both pointers to a dummy node which points to…