
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Question
![D
Question 34
What is output?
new_list = ['python', 'development']
new_list.append('in progress')
print(new_list)
O [python; 'development, 'in progress']
O ['python', 'development', ['in progress']]
O ['python', 'developmentin progress']
O [python, "in progress']
Question 35
Consider the list my_list = ['www', 'python', 'org']. Choose the option that returns 'www.python.org' as the value to
my_string.
O my_string - ('.'). join(my_list)
O my_string-','.join(my_list)
O my_string = (' ').join(my_list)
O my_string = (.).join(my_list)](https://content.bartleby.com/qna-images/question/d21fe99f-4b35-4dba-8417-03a5b613362f/2958481b-6a2c-4068-b459-7f10c710fcd0/82k4usm_thumbnail.jpeg)
Transcribed Image Text:D
Question 34
What is output?
new_list = ['python', 'development']
new_list.append('in progress')
print(new_list)
O [python; 'development, 'in progress']
O ['python', 'development', ['in progress']]
O ['python', 'developmentin progress']
O [python, "in progress']
Question 35
Consider the list my_list = ['www', 'python', 'org']. Choose the option that returns 'www.python.org' as the value to
my_string.
O my_string - ('.'). join(my_list)
O my_string-','.join(my_list)
O my_string = (' ').join(my_list)
O my_string = (.).join(my_list)
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution
Trending nowThis is a popular solution!
Step by stepSolved in 2 steps with 2 images

Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- help with python code import time timeStamp = time.ctime()print(timeStamp)forum_list = [ {'date':'10-01-2022', 'name':'Student1', 'comment':'Very helpful'}, {'date': '10-01-2022', 'name': 'Student2', 'comment': 'Very good'} ] menu = """ Forum Comments 0: Exit 1: Display Comments 2: Add Comment """ done = False while not done: print(menu) selection = input('Please make a selection: ') if selection == "0": done = True print('Exiting now, thank you for participating') if selection == "1": for d in forum_list: print(d['date'], end='') print(' ', end='') print(d['name']) print(d['comment']) if selection == "2": comment = {} comment['date'] = input('Please enter date: ') comment['name'] = input('Please enter name: ') comment['comment'] = input('Please enter comment: ') forum_list.append(comment) # what's inside the data.txt file #Date Name…arrow_forwardSelect problem below. Your post must include: The problem statement. A description of your solution highlighting the use of the split(), join(), lists and the different list operations involved in solving the problems. Include line numbers from your program. please make it simple and DONT use Java Create a program that reads a domain name and displays the top level domain it belongs to. Select any 5 top level domain names from the ICANN Registry Listings. The program shall display “No information available” for other top level domains. Use the split method to separate the different names in the domain name. Here is sample execution of the program:arrow_forwardInteger m and string my_name are read from input. Then, four strings are read from input and stored in the list names_data. Delete the first element in names_data, and then replace the element at index m with my_name.arrow_forward
- Is there a different way to write this function in python? Please provide the code. Thanks!arrow_forwardPlease answer the quesarrow_forwardWrite a function called find_duplicates which accepts one list as a parameter. This function needs to sort through the list passed to it and find values that are duplicated in the list. The duplicated values should be compiled into another list which the function will return. No matter how many times a word is duplicated, it should only be added once to the duplicates list. NB: Only write the function. Do not call it. For example: Test Result random_words = ("remember","snakes","nappy","rough","dusty","judicious","brainy","shop","light","straw","quickest", "adventurous","yielding","grandiose","replace","fat","wipe","happy","brainy","shop","light","straw", "quickest","adventurous","yielding","grandiose","motion","gaudy","precede","medical","park","flowers", "noiseless","blade","hanging","whistle","event","slip") print(find_duplicates(sorted(random_words))) ['adventurous', 'brainy', 'grandiose', 'light', 'quickest', 'shop', 'straw', 'yielding']…arrow_forward
- 6. list_n_perfect_squares This function takes a positive integer, n, and returns a list containing n perfect square numbers, starting with 1 and counting up to n2 Use a list comprehension and a range! Sample runs should look like: >>> list_n_perfect_squares ( 6) [1, 4, 9, 16, 25, 36] >>> list_n_perfect_squares (1) [1] >>> list_n_perfect_squares (20) [1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 225, 256, 289, 324, 361, 400]arrow_forward4 ete t of With the following lists: list1 = [x + y for x in ['a', 'b', 'c'] for y in ['1', '2', '3']] list2 = [[x + y for x in ['a', 'b', 'c']] for y in ['1', '2', '3']] which option is true? Select one: A. len(list1)> len(list2) B. 'a1' is an element (or subelement) for list1 whereas '1a' is for list2 C. list1 and list2 will error because numbers and letters cannot be added. D. Both A and B are true.arrow_forwarddef 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 Pythonarrow_forward
- 3 4 5 5 7 3 9 3 1 2 B 4 5 7 9 0 2 3 4 5 8 0 1 def calculate_trip_time( iata_src: str, iata_dst: str, flight_walk: List[str], flights: FlightDir ) -> float: Return a float corresponding to the amount of time required to travel from the source airport to the destination airport to the destination airport, as outlined by the flight_walk. PERBE The start time of the trip should be considered zero. In other words, assuming we start the trip at 12:00am, this function should return the time it takes for the trip to finish, including all the waiting times before, and between the flights. If there is no path available, return -1.0 >>> calculate_trip_time("AA1", 2.0 >>> calculate_trip_time("AA1", >>> calculate_trip_time("AA1", >>> calculate_trip_time("AA1", 0.0 >>> calculate_trip_time("AA4", 14.0 >>> calculate_trip_time("AA1", 7.5 >>> calculate_trip_time("AA1", 2.0 *** "AA2", ["AA1", "AA2"], TEST_FLIGHTS_DIR_FOUR_CITIES) "AA7", ["AA7"] "AA1"], TEST_FLIGHTS_DIR_FOUR_CITIES) "AA7", ["AA1",…arrow_forwarddef sw_vehicle_search(cargo_capacity: int, max_speed: int, cost: int) -> list: This function will use the https://swapi.dev/ API to collect its information. This function is meant to be used to search for vehicles in Star Wars that meet the specified criteria. The function should return a list of names of the vehicles that have cargo capacities and a max speed greater than or equal to the value specified but also cost less than or equal to the cost given. Vehicles with "unknown" or "none" for any of the mentioned categories should not be regarded. Keep in mind that not all of the vehicles in star wars are returned in one request to https://swapi.dev/api/vehicles/. The JSON object returned by this request has a next attribute that represents the next page of information. You must make multiple requests for each page to collect all vehicle information. You might find it helpful to use the following API handle(s): https://swapi.dev/api/vehicles/ - to retrieve all vehicles in Star Wars…arrow_forwardComplete the following function that creates a duplicate version of a list but with the elements stored in reverse order from the original. 1 def reverseOrder (origValues): newValues = [] 1234567 # Add the elements from the origValues List to newValues, in reverse order. # Your code goes here return newValuesarrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education

Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON

Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education