E LOW yur u0 LIIIS by CredLing %23 storing a list containing your class mates details in each element of the list. # EXTENSION # 1. Research dictionaries in Python, create a copy of the file and re-write the code using a dictionary instead. # 2. Explain which is more suited to the task # Create empty list called 'database' to hold each record database = [] # Create an empty list to store the details of each student # Boolean value used to check if data entry is complete data_complete = False # loop whilst data entry is not complete while not data_complete: # get student information and add it to the list 'student' # this should include name, age, nationality and favourite colour # add a copy of the list 'student' to list 'database' - if you don't make it a copy, all the data will be the same!! # clear the list 'student' of any data ready for next data entry # check if data entry is complete option = input("Is data entry complete? y/n \n").lower() # update Boolean value only if user enters 'y'

E LOW yur u0 LIIIS by CredLing %23 storing a list containing your class mates details in each element of the list. # EXTENSION # 1. Research dictionaries in Python, create a copy of the file and re-write the code using a dictionary instead. # 2. Explain which is more suited to the task # Create empty list called 'database' to hold each record database = [] # Create an empty list to store the details of each student # Boolean value used to check if data entry is complete data_complete = False # loop whilst data entry is not complete while not data_complete: # get student information and add it to the list 'student' # this should include name, age, nationality and favourite colour # add a copy of the list 'student' to list 'database' - if you don't make it a copy, all the data will be the same!! # clear the list 'student' of any data ready for next data entry # check if data entry is complete option = input("Is data entry complete? y/n \n").lower() # update Boolean value only if user enters 'y'

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

MIPS Assembly code (no pseudoinstruction in the program) An array that contains 10 integers, A = {5,3,6,8,9,1,4,7,2,10}. Use bubble sort algorithm to sort it in ascending order. In MIPS program, should store these values into the data segment of the memory, before trying to sort them out.
+|| 8 Exercise 1 (2%) Create an anonymous block that displays a course list. Declare a cursor and use the OPEN,FETCH, and CLOSE cursor statements to access the cursor. Use the %ROWTYPE attribute for the cursor. Output: Course Code Course Title Accounting Theory Microeconomics Financial Accounting Anthropology Introduction to Business Businéss Planning Web Technologies I Programming Logic Web Technologies II Python Programming Web Technologies III Database Design & SQL Communications I ACC104 ACC205 ANT100 BUS100 BUS230 CIS100 CIS105 CIS200 CIS225 00ESI) CIS400 ENG101 ENG201 GEO101 MGT410 Communication II The Physical Environment Human Resources Management Project Management Algebra Geometry Nursing Theory I Nursing Theory II MGT415 MTH120 MTH400 NSG130 NSG230 -19°C Mostly sunny ^ o prt sc home end insert delete F6 F7 F10 F11 F12 81 ) ( num backspace lock 6 } { ] enter 7. shift B. / dn 6d up 6d alt ctrl >
O b. Remove the O. Remove the second element in the list O d. Remove the element before the last element in the list QUESTION 6 The following code inserts an element at the beginning of the list public void insertBegin(T e) { Node temp = new Node (e); head = temp; temp.Next = head; size++; } O True O False QUESTION 7 what does the following code do?
Help me on below python program.
5 partition_list (head) This is a little like split_list() from the Short problem, except that, instead of splitting the list into two by cutting it into the middle, you will now build two lists to return, using alternate values. The first value in the input list should be returned at the head of the first new list; the second value should be the head of the second list. Keep on alternating from there, putting one new value on the first list, and one on the second. (But remember that the length of the input list might be odd.) Example Suppose you have the following input list: 10 - 13 -> -1 -> 1000 - 0 It should return the following two lists: 10 1 0 13 -> 1000
Help make a C++ program that:1. Queries the user for the name of a file of text.2. Opens the file, and maintains two lists: one list for words beginning with the letter"D" or "d", and a second list for words beginning with any other letter. Each listmust maintain words in alphabetical order.3. Each node in the list must contain the word and the number of times that the word appears.4. Display (a screen at a time) each of the lists showing the alphabetized list of words and thenumber of times that each appears. Please have the main function as the first function in the program. Please make the least amount of functions as possible. Like for the file input have the file error thing in the same function. And please add comments throughout the code.
FIX THE PROGRAM BELOW. #Function to get the key value ind dictionary def get_key(val): for key, value in result.items(): if val == value: return key return "key doesn't exist" #Function definition to find the tallest height def tall(list_height): return max(list_height) #Function to find the shortest height def short(list_height): return min(list_height) # creating an empty list list_names list_names = [] # Get the number of baby names as input from user num1 = int(input("Enter number of baby names : ")) # iterating till the range for i in range(0, num1): name = input() list_names.append(name) # adding the element print("list of baby names : ",list_names) # creating an empty list list_height list_height = [] # iterating till the range for i in range(0, num1): height = int(input()) list_height.append(height) # adding the element print("list of baby heights : ", list_height) # using…
Complete 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 newValues
Indexing in a list is accomplished by specifying a position number, in brackets, to access a particular element. True or false?