Maximum of list Program plan: Import the package. Define the “Max()” function, Make simultaneous assignment to initialize the variables. Assign the values return from “len()”. Execute while loop when both “lst_1” and “lst_2” have more items, Check whether top of “lst_1” is larger, If it is “True”, copy that top value into current location in “lst_3”. Increment “s1” by “1”. Otherwise, Copy the top of “lst_2” into the current location in “lst_3”. Increment “s2” by “1”. Increment “s3” by “1” when element is added to “lst_3”. Execute the “while” loop to copy remaining elements from “lst_1”, Copy the element. Increment “s1” by “1”. Increment “s3” by “1”. Execute the "while" loop to copy remaining elements from “lst_2”, Copy the element. Increment “s2” by “1”. Increment “s3” by “1”. Define the function “merge_Sort()”, Assign the initial values for the variable. Check whether the number element is greater than 1, Split the list into two sub lists. Make simultaneous assignment to assign two sub lists using slicing. Make recursive calls to sort each sub list. Merge the sorted sub list into original list. Create empty list. Create for loop to iterate “100” times. Append the random value to the end of the list. Call the “merge_Sort()” function. Print the list.

Question

Want to see more full solutions like this?

Answer 1

Question

Chapter 13, Problem 4PE

Program Plan Intro

Maximum of list

Program plan:

Import the package.

Define the “Max()” function,

Make simultaneous assignment to initialize the variables.

Assign the values return from “len()”.

Execute while loop when both “lst_1” and “lst_2” have more items,

Check whether top of “lst_1” is larger,

If it is “True”, copy that top value into current location in “lst_3”.

Increment “s1” by “1”.

Otherwise,

Copy the top of “lst_2” into the current location in “lst_3”.

Increment “s2” by “1”.

Increment “s3” by “1” when element is added to “lst_3”.

Execute the “while” loop to copy remaining elements from “lst_1”,

Copy the element.

Increment “s1” by “1”.

Increment “s3” by “1”.

Execute the "while" loop to copy remaining elements from “lst_2”,

Copy the element.

Increment “s2” by “1”.

Increment “s3” by “1”.

Define the function “merge_Sort()”,

Assign the initial values for the variable.

Check whether the number element is greater than 1,

Split the list into two sub lists.

Make simultaneous assignment to assign two sub lists using slicing.

Make recursive calls to sort each sub list.

Merge the sorted sub list into original list.

Create empty list.

Create for loop to iterate “100” times.

Append the random value to the end of the list.

Call the “merge_Sort()” function.

Print the list.

Expert Solution & Answer

Program Description Answer

This Python program is to demonstrate a recursive function “Max()” to find the largest number in a list where the largest number is the larger of the first item and the maximum of all the other items.

Explanation of Solution

Program:

File name: “conference.py”

#Import the package

from random import randrange

#Define the function

def Max(lst_1, lst_2, lst_3):

#Make simultaneous assignment

s1, s2, s3 = 0, 0 , 0

#Assign the values return from len()

n1, n2 = len(lst_1), len(lst_2)

'''Execute while loop when both lst_1 and lst_2 have more items'''

while s1 < n1 and s2 < n2:

#Check whether top of lst_1 is larger

if lst_1[s1] > lst_2[s2]:

'''Copy that top value into current location in lst_3'''

lst_3[s3] = lst_1[s1]

#Increment by "1"

s1 = s1 + 1

#Otherwise

else:

'''Copy the top of lst_2 into the current location in lst_3'''

lst_3[s3] = lst_2[s2]

#Increment by "1"

s2 = s2 + 1

#Increment by "1" when element added into lst_3

s3 = s3 + 1

'''Execute the "while" loop to copy remaining elements from lst_1'''

while s1 < n1:

#Copy the element

lst_3[s3] = lst_1[s1]

#Increment by "1"

s1 = s1 + 1

#Increment by "1"

s3 = s3 + 1

'''Execute the "while" loop to copy remaining elements from lst1_2'''

while s2 < n2:

#Copy the element

lst_3[s3] = lst_2[s2]

#Increment by "1"

s2 = s2 + 1

#Increment by "1"

s3 = s3 + 1

#Define the function

def merge_Sort(num):

#Assign the value

n = len(num)

'''Check whether the number element is greater than 1'''

if n > 1:

#Split the list into two sub lists

v = n // 2

'''Make simultaneous assignment to assign two sub lists using slicing'''

nums_1, nums_2 = num[:v], num[v:]

#Make recursive calls to sort each sub list

merge_Sort(nums_1)

merge_Sort(nums_2)

#Merge the sorted sub list into original list

Max(nums_1, nums_2, num)

#Create empty list

lst = []

#Create for loop

for n in range(100):

#Append the random value to the end of the list

lst.append(randrange(1, 1000))

#Call the function

merge_Sort(lst)

#Print the list

print(lst)

Sample Output

Output:

[996, 992, 975, 974, 956, 952, 947, 937, 921, 915, 902, 899, 891, 889, 886, 863, 863, 862, 856, 841, 837, 819, 808, 791, 760, 755, 754, 739, 736, 732, 685, 663, 638, 628, 623, 622, 612, 594, 569, 562, 552, 532, 531, 528, 527, 523, 492, 475, 468, 461, 452, 451, 444, 438, 431, 413, 405, 401, 375, 370, 358, 354, 350, 350, 347, 339, 325, 290, 286, 246, 227, 220, 215, 188, 185, 182, 168, 161, 149, 142, 141, 141, 139, 135, 115, 114, 112, 101, 96, 94, 94, 85, 84, 84, 80, 78, 70, 18, 13, 11]

>>>

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!

Students have asked these similar questions

Using the following execution shown below, explain what is done in each of the ARIES recovery algorithm phases: LSN LOG 00 begin_checkpoint 10 end_checkpoint 20 update: T1 writes P1 30 update: T2 writes P2 40 update: T3 writes P3 50 T2 commit 60 update: T3 writes P2 70 T2 end 80 update: T1 writes P5 90 T3 abort CRASH, RESTART In addition to the execution shown here, the system crashes during recovery after writing two log records to stable storage and again after writing another two log records

A new application is being developed and will be using a database that includes a relation about items: Item (item_id:integer, item_name:string, color:string, price:real). Both the purchasing department in charge of obtaining raw material and the manufacturing department in charge of manufacturing the items can change the price of manufactured items according to changes that may happen in the raw material cost or production cost. The two departments use different transactions to update the price of items. The new application uses the following sequences of actions, listed in the order they are submitted to the DBMS: Sequence S1: T1:R(X), T2:W(X), T2:W(Y), T3:W(Y), T1:W(Y), T1:Commit, T2:Commit, T3:Commit Sequence S2: T1:R(X), T2:W(Y), T2:W(X), T3:W(Y), T1:W(Y), T1:Commit, T2:Commit, T3:Commit For each of the following concurrency control mechanisms, describe how they will handle each of the sequences (S1 & S2). Strict 2PL with timestamps used for deadlock prevention. Conservative…

As a database administrator of a large manufacturing organization, you are in charge of their website database that handles suppliers, parts, catalog, customers, and payments of delivered items. The following relations are part of the large database: Supplier(SID, Sname, Saddress, Stelephone)Customer(CID, Cname, Caddress, Ctelephone)Part(PID, Pname, Pmodel, Pcolor)Catalog(SID, PID, Price) (The Catalog relation lists the prices charged for parts by Suppliers). Because the application is web-based and the database is accessed by many users, you want to increase the concurrency usage without compromising the data quality. For each of the following transactions, state the minimum SQL isolation level you would use in order to avoid any conflict problems in them. Please explain your choice. A transaction that adds a new part to a supplier’s catalog. A transaction that increases the price that a supplier charges for a part. A transaction that determines the total number of items for a given…

Answer 2

Question

Chapter 13, Problem 4PE

Program Plan Intro

Maximum of list

Program plan:

Import the package.

Define the “Max()” function,

Make simultaneous assignment to initialize the variables.

Assign the values return from “len()”.

Execute while loop when both “lst_1” and “lst_2” have more items,

Check whether top of “lst_1” is larger,

If it is “True”, copy that top value into current location in “lst_3”.

Increment “s1” by “1”.

Otherwise,

Copy the top of “lst_2” into the current location in “lst_3”.

Increment “s2” by “1”.

Increment “s3” by “1” when element is added to “lst_3”.

Execute the “while” loop to copy remaining elements from “lst_1”,

Copy the element.

Increment “s1” by “1”.

Increment “s3” by “1”.

Execute the "while" loop to copy remaining elements from “lst_2”,

Copy the element.

Increment “s2” by “1”.

Increment “s3” by “1”.

Define the function “merge_Sort()”,

Assign the initial values for the variable.

Check whether the number element is greater than 1,

Split the list into two sub lists.

Make simultaneous assignment to assign two sub lists using slicing.

Make recursive calls to sort each sub list.

Merge the sorted sub list into original list.

Create empty list.

Create for loop to iterate “100” times.

Append the random value to the end of the list.

Call the “merge_Sort()” function.

Print the list.

Expert Solution & Answer

Program Description Answer

This Python program is to demonstrate a recursive function “Max()” to find the largest number in a list where the largest number is the larger of the first item and the maximum of all the other items.

Explanation of Solution

Program:

File name: “conference.py”

#Import the package

from random import randrange

#Define the function

def Max(lst_1, lst_2, lst_3):

#Make simultaneous assignment

s1, s2, s3 = 0, 0 , 0

#Assign the values return from len()

n1, n2 = len(lst_1), len(lst_2)

'''Execute while loop when both lst_1 and lst_2 have more items'''

while s1 < n1 and s2 < n2:

#Check whether top of lst_1 is larger

if lst_1[s1] > lst_2[s2]:

'''Copy that top value into current location in lst_3'''

lst_3[s3] = lst_1[s1]

#Increment by "1"

s1 = s1 + 1

#Otherwise

else:

'''Copy the top of lst_2 into the current location in lst_3'''

lst_3[s3] = lst_2[s2]

#Increment by "1"

s2 = s2 + 1

#Increment by "1" when element added into lst_3

s3 = s3 + 1

'''Execute the "while" loop to copy remaining elements from lst_1'''

while s1 < n1:

#Copy the element

lst_3[s3] = lst_1[s1]

#Increment by "1"

s1 = s1 + 1

#Increment by "1"

s3 = s3 + 1

'''Execute the "while" loop to copy remaining elements from lst1_2'''

while s2 < n2:

#Copy the element

lst_3[s3] = lst_2[s2]

#Increment by "1"

s2 = s2 + 1

#Increment by "1"

s3 = s3 + 1

#Define the function

def merge_Sort(num):

#Assign the value

n = len(num)

'''Check whether the number element is greater than 1'''

if n > 1:

#Split the list into two sub lists

v = n // 2

'''Make simultaneous assignment to assign two sub lists using slicing'''

nums_1, nums_2 = num[:v], num[v:]

#Make recursive calls to sort each sub list

merge_Sort(nums_1)

merge_Sort(nums_2)

#Merge the sorted sub list into original list

Max(nums_1, nums_2, num)

#Create empty list

lst = []

#Create for loop

for n in range(100):

#Append the random value to the end of the list

lst.append(randrange(1, 1000))

#Call the function

merge_Sort(lst)

#Print the list

print(lst)

Sample Output

Output:

[996, 992, 975, 974, 956, 952, 947, 937, 921, 915, 902, 899, 891, 889, 886, 863, 863, 862, 856, 841, 837, 819, 808, 791, 760, 755, 754, 739, 736, 732, 685, 663, 638, 628, 623, 622, 612, 594, 569, 562, 552, 532, 531, 528, 527, 523, 492, 475, 468, 461, 452, 451, 444, 438, 431, 413, 405, 401, 375, 370, 358, 354, 350, 350, 347, 339, 325, 290, 286, 246, 227, 220, 215, 188, 185, 182, 168, 161, 149, 142, 141, 141, 139, 135, 115, 114, 112, 101, 96, 94, 94, 85, 84, 84, 80, 78, 70, 18, 13, 11]

>>>

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!

Answer 3

Question

Chapter 13, Problem 4PE

Program Plan Intro

Maximum of list

Program plan:

Import the package.

Define the “Max()” function,

Make simultaneous assignment to initialize the variables.

Assign the values return from “len()”.

Execute while loop when both “lst_1” and “lst_2” have more items,

Check whether top of “lst_1” is larger,

If it is “True”, copy that top value into current location in “lst_3”.

Increment “s1” by “1”.

Otherwise,

Copy the top of “lst_2” into the current location in “lst_3”.

Increment “s2” by “1”.

Increment “s3” by “1” when element is added to “lst_3”.

Execute the “while” loop to copy remaining elements from “lst_1”,

Copy the element.

Increment “s1” by “1”.

Increment “s3” by “1”.

Execute the "while" loop to copy remaining elements from “lst_2”,

Copy the element.

Increment “s2” by “1”.

Increment “s3” by “1”.

Define the function “merge_Sort()”,

Assign the initial values for the variable.

Check whether the number element is greater than 1,

Split the list into two sub lists.

Make simultaneous assignment to assign two sub lists using slicing.

Make recursive calls to sort each sub list.

Merge the sorted sub list into original list.

Create empty list.

Create for loop to iterate “100” times.

Append the random value to the end of the list.

Call the “merge_Sort()” function.

Print the list.

Expert Solution & Answer

Program Description Answer

This Python program is to demonstrate a recursive function “Max()” to find the largest number in a list where the largest number is the larger of the first item and the maximum of all the other items.

Explanation of Solution

Program:

File name: “conference.py”

#Import the package

from random import randrange

#Define the function

def Max(lst_1, lst_2, lst_3):

#Make simultaneous assignment

s1, s2, s3 = 0, 0 , 0

#Assign the values return from len()

n1, n2 = len(lst_1), len(lst_2)

'''Execute while loop when both lst_1 and lst_2 have more items'''

while s1 < n1 and s2 < n2:

#Check whether top of lst_1 is larger

if lst_1[s1] > lst_2[s2]:

'''Copy that top value into current location in lst_3'''

lst_3[s3] = lst_1[s1]

#Increment by "1"

s1 = s1 + 1

#Otherwise

else:

'''Copy the top of lst_2 into the current location in lst_3'''

lst_3[s3] = lst_2[s2]

#Increment by "1"

s2 = s2 + 1

#Increment by "1" when element added into lst_3

s3 = s3 + 1

'''Execute the "while" loop to copy remaining elements from lst_1'''

while s1 < n1:

#Copy the element

lst_3[s3] = lst_1[s1]

#Increment by "1"

s1 = s1 + 1

#Increment by "1"

s3 = s3 + 1

'''Execute the "while" loop to copy remaining elements from lst1_2'''

while s2 < n2:

#Copy the element

lst_3[s3] = lst_2[s2]

#Increment by "1"

s2 = s2 + 1

#Increment by "1"

s3 = s3 + 1

#Define the function

def merge_Sort(num):

#Assign the value

n = len(num)

'''Check whether the number element is greater than 1'''

if n > 1:

#Split the list into two sub lists

v = n // 2

'''Make simultaneous assignment to assign two sub lists using slicing'''

nums_1, nums_2 = num[:v], num[v:]

#Make recursive calls to sort each sub list

merge_Sort(nums_1)

merge_Sort(nums_2)

#Merge the sorted sub list into original list

Max(nums_1, nums_2, num)

#Create empty list

lst = []

#Create for loop

for n in range(100):

#Append the random value to the end of the list

lst.append(randrange(1, 1000))

#Call the function

merge_Sort(lst)

#Print the list

print(lst)

Sample Output

Output:

[996, 992, 975, 974, 956, 952, 947, 937, 921, 915, 902, 899, 891, 889, 886, 863, 863, 862, 856, 841, 837, 819, 808, 791, 760, 755, 754, 739, 736, 732, 685, 663, 638, 628, 623, 622, 612, 594, 569, 562, 552, 532, 531, 528, 527, 523, 492, 475, 468, 461, 452, 451, 444, 438, 431, 413, 405, 401, 375, 370, 358, 354, 350, 350, 347, 339, 325, 290, 286, 246, 227, 220, 215, 188, 185, 182, 168, 161, 149, 142, 141, 141, 139, 135, 115, 114, 112, 101, 96, 94, 94, 85, 84, 84, 80, 78, 70, 18, 13, 11]

>>>

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!

Answer 4

Question

Chapter 13, Problem 4PE

Program Plan Intro

Maximum of list

Program plan:

Import the package.

Define the “Max()” function,

Make simultaneous assignment to initialize the variables.

Assign the values return from “len()”.

Execute while loop when both “lst_1” and “lst_2” have more items,

Check whether top of “lst_1” is larger,

If it is “True”, copy that top value into current location in “lst_3”.

Increment “s1” by “1”.

Otherwise,

Copy the top of “lst_2” into the current location in “lst_3”.

Increment “s2” by “1”.

Increment “s3” by “1” when element is added to “lst_3”.

Execute the “while” loop to copy remaining elements from “lst_1”,

Copy the element.

Increment “s1” by “1”.

Increment “s3” by “1”.

Execute the "while" loop to copy remaining elements from “lst_2”,

Copy the element.

Increment “s2” by “1”.

Increment “s3” by “1”.

Define the function “merge_Sort()”,

Assign the initial values for the variable.

Check whether the number element is greater than 1,

Split the list into two sub lists.

Make simultaneous assignment to assign two sub lists using slicing.

Make recursive calls to sort each sub list.

Merge the sorted sub list into original list.

Create empty list.

Create for loop to iterate “100” times.

Append the random value to the end of the list.

Call the “merge_Sort()” function.

Print the list.

Expert Solution & Answer

Program Description Answer

This Python program is to demonstrate a recursive function “Max()” to find the largest number in a list where the largest number is the larger of the first item and the maximum of all the other items.

Explanation of Solution

Program:

File name: “conference.py”

#Import the package

from random import randrange

#Define the function

def Max(lst_1, lst_2, lst_3):

#Make simultaneous assignment

s1, s2, s3 = 0, 0 , 0

#Assign the values return from len()

n1, n2 = len(lst_1), len(lst_2)

'''Execute while loop when both lst_1 and lst_2 have more items'''

while s1 < n1 and s2 < n2:

#Check whether top of lst_1 is larger

if lst_1[s1] > lst_2[s2]:

'''Copy that top value into current location in lst_3'''

lst_3[s3] = lst_1[s1]

#Increment by "1"

s1 = s1 + 1

#Otherwise

else:

'''Copy the top of lst_2 into the current location in lst_3'''

lst_3[s3] = lst_2[s2]

#Increment by "1"

s2 = s2 + 1

#Increment by "1" when element added into lst_3

s3 = s3 + 1

'''Execute the "while" loop to copy remaining elements from lst_1'''

while s1 < n1:

#Copy the element

lst_3[s3] = lst_1[s1]

#Increment by "1"

s1 = s1 + 1

#Increment by "1"

s3 = s3 + 1

'''Execute the "while" loop to copy remaining elements from lst1_2'''

while s2 < n2:

#Copy the element

lst_3[s3] = lst_2[s2]

#Increment by "1"

s2 = s2 + 1

#Increment by "1"

s3 = s3 + 1

#Define the function

def merge_Sort(num):

#Assign the value

n = len(num)

'''Check whether the number element is greater than 1'''

if n > 1:

#Split the list into two sub lists

v = n // 2

'''Make simultaneous assignment to assign two sub lists using slicing'''

nums_1, nums_2 = num[:v], num[v:]

#Make recursive calls to sort each sub list

merge_Sort(nums_1)

merge_Sort(nums_2)

#Merge the sorted sub list into original list

Max(nums_1, nums_2, num)

#Create empty list

lst = []

#Create for loop

for n in range(100):

#Append the random value to the end of the list

lst.append(randrange(1, 1000))

#Call the function

merge_Sort(lst)

#Print the list

print(lst)

Sample Output

Output:

[996, 992, 975, 974, 956, 952, 947, 937, 921, 915, 902, 899, 891, 889, 886, 863, 863, 862, 856, 841, 837, 819, 808, 791, 760, 755, 754, 739, 736, 732, 685, 663, 638, 628, 623, 622, 612, 594, 569, 562, 552, 532, 531, 528, 527, 523, 492, 475, 468, 461, 452, 451, 444, 438, 431, 413, 405, 401, 375, 370, 358, 354, 350, 350, 347, 339, 325, 290, 286, 246, 227, 220, 215, 188, 185, 182, 168, 161, 149, 142, 141, 141, 139, 135, 115, 114, 112, 101, 96, 94, 94, 85, 84, 84, 80, 78, 70, 18, 13, 11]

>>>

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!

Answer 5

Chapter 13, Problem 4PE

Program Plan Intro

Maximum of list

Program plan:

Import the package.

Define the “Max()” function,

Make simultaneous assignment to initialize the variables.

Assign the values return from “len()”.

Execute while loop when both “lst_1” and “lst_2” have more items,

Check whether top of “lst_1” is larger,

If it is “True”, copy that top value into current location in “lst_3”.

Increment “s1” by “1”.

Otherwise,

Copy the top of “lst_2” into the current location in “lst_3”.

Increment “s2” by “1”.

Increment “s3” by “1” when element is added to “lst_3”.

Execute the “while” loop to copy remaining elements from “lst_1”,

Copy the element.

Increment “s1” by “1”.

Increment “s3” by “1”.

Execute the "while" loop to copy remaining elements from “lst_2”,

Copy the element.

Increment “s2” by “1”.

Increment “s3” by “1”.

Define the function “merge_Sort()”,

Assign the initial values for the variable.

Check whether the number element is greater than 1,

Split the list into two sub lists.

Make simultaneous assignment to assign two sub lists using slicing.

Make recursive calls to sort each sub list.

Merge the sorted sub list into original list.

Create empty list.

Create for loop to iterate “100” times.

Append the random value to the end of the list.

Call the “merge_Sort()” function.

Print the list.

Expert Solution & Answer

Program Description Answer

This Python program is to demonstrate a recursive function “Max()” to find the largest number in a list where the largest number is the larger of the first item and the maximum of all the other items.

Explanation of Solution

Program:

File name: “conference.py”

#Import the package

from random import randrange

#Define the function

def Max(lst_1, lst_2, lst_3):

#Make simultaneous assignment

s1, s2, s3 = 0, 0 , 0

#Assign the values return from len()

n1, n2 = len(lst_1), len(lst_2)

'''Execute while loop when both lst_1 and lst_2 have more items'''

while s1 < n1 and s2 < n2:

#Check whether top of lst_1 is larger

if lst_1[s1] > lst_2[s2]:

'''Copy that top value into current location in lst_3'''

lst_3[s3] = lst_1[s1]

#Increment by "1"

s1 = s1 + 1

#Otherwise

else:

'''Copy the top of lst_2 into the current location in lst_3'''

lst_3[s3] = lst_2[s2]

#Increment by "1"

s2 = s2 + 1

#Increment by "1" when element added into lst_3

s3 = s3 + 1

'''Execute the "while" loop to copy remaining elements from lst_1'''

while s1 < n1:

#Copy the element

lst_3[s3] = lst_1[s1]

#Increment by "1"

s1 = s1 + 1

#Increment by "1"

s3 = s3 + 1

'''Execute the "while" loop to copy remaining elements from lst1_2'''

while s2 < n2:

#Copy the element

lst_3[s3] = lst_2[s2]

#Increment by "1"

s2 = s2 + 1

#Increment by "1"

s3 = s3 + 1

#Define the function

def merge_Sort(num):

#Assign the value

n = len(num)

'''Check whether the number element is greater than 1'''

if n > 1:

#Split the list into two sub lists

v = n // 2

'''Make simultaneous assignment to assign two sub lists using slicing'''

nums_1, nums_2 = num[:v], num[v:]

#Make recursive calls to sort each sub list

merge_Sort(nums_1)

merge_Sort(nums_2)

#Merge the sorted sub list into original list

Max(nums_1, nums_2, num)

#Create empty list

lst = []

#Create for loop

for n in range(100):

#Append the random value to the end of the list

lst.append(randrange(1, 1000))

#Call the function

merge_Sort(lst)

#Print the list

print(lst)

Sample Output

Output:

[996, 992, 975, 974, 956, 952, 947, 937, 921, 915, 902, 899, 891, 889, 886, 863, 863, 862, 856, 841, 837, 819, 808, 791, 760, 755, 754, 739, 736, 732, 685, 663, 638, 628, 623, 622, 612, 594, 569, 562, 552, 532, 531, 528, 527, 523, 492, 475, 468, 461, 452, 451, 444, 438, 431, 413, 405, 401, 375, 370, 358, 354, 350, 350, 347, 339, 325, 290, 286, 246, 227, 220, 215, 188, 185, 182, 168, 161, 149, 142, 141, 141, 139, 135, 115, 114, 112, 101, 96, 94, 94, 85, 84, 84, 80, 78, 70, 18, 13, 11]

>>>

Answer 6

Chapter 13, Problem 4PE

Program Plan Intro

Maximum of list

Program plan:

Import the package.

Define the “Max()” function,

Make simultaneous assignment to initialize the variables.

Assign the values return from “len()”.

Execute while loop when both “lst_1” and “lst_2” have more items,

Check whether top of “lst_1” is larger,

If it is “True”, copy that top value into current location in “lst_3”.

Increment “s1” by “1”.

Otherwise,

Copy the top of “lst_2” into the current location in “lst_3”.

Increment “s2” by “1”.

Increment “s3” by “1” when element is added to “lst_3”.

Execute the “while” loop to copy remaining elements from “lst_1”,

Copy the element.

Increment “s1” by “1”.

Increment “s3” by “1”.

Execute the "while" loop to copy remaining elements from “lst_2”,

Copy the element.

Increment “s2” by “1”.

Increment “s3” by “1”.

Define the function “merge_Sort()”,

Assign the initial values for the variable.

Check whether the number element is greater than 1,

Split the list into two sub lists.

Make simultaneous assignment to assign two sub lists using slicing.

Make recursive calls to sort each sub list.

Merge the sorted sub list into original list.

Create empty list.

Create for loop to iterate “100” times.

Append the random value to the end of the list.

Call the “merge_Sort()” function.

Print the list.

Expert Solution & Answer

Program Description Answer

This Python program is to demonstrate a recursive function “Max()” to find the largest number in a list where the largest number is the larger of the first item and the maximum of all the other items.

Explanation of Solution

Program:

File name: “conference.py”

#Import the package

from random import randrange

#Define the function

def Max(lst_1, lst_2, lst_3):

#Make simultaneous assignment

s1, s2, s3 = 0, 0 , 0

#Assign the values return from len()

n1, n2 = len(lst_1), len(lst_2)

'''Execute while loop when both lst_1 and lst_2 have more items'''

while s1 < n1 and s2 < n2:

#Check whether top of lst_1 is larger

if lst_1[s1] > lst_2[s2]:

'''Copy that top value into current location in lst_3'''

lst_3[s3] = lst_1[s1]

#Increment by "1"

s1 = s1 + 1

#Otherwise

else:

'''Copy the top of lst_2 into the current location in lst_3'''

lst_3[s3] = lst_2[s2]

#Increment by "1"

s2 = s2 + 1

#Increment by "1" when element added into lst_3

s3 = s3 + 1

'''Execute the "while" loop to copy remaining elements from lst_1'''

while s1 < n1:

#Copy the element

lst_3[s3] = lst_1[s1]

#Increment by "1"

s1 = s1 + 1

#Increment by "1"

s3 = s3 + 1

'''Execute the "while" loop to copy remaining elements from lst1_2'''

while s2 < n2:

#Copy the element

lst_3[s3] = lst_2[s2]

#Increment by "1"

s2 = s2 + 1

#Increment by "1"

s3 = s3 + 1

#Define the function

def merge_Sort(num):

#Assign the value

n = len(num)

'''Check whether the number element is greater than 1'''

if n > 1:

#Split the list into two sub lists

v = n // 2

'''Make simultaneous assignment to assign two sub lists using slicing'''

nums_1, nums_2 = num[:v], num[v:]

#Make recursive calls to sort each sub list

merge_Sort(nums_1)

merge_Sort(nums_2)

#Merge the sorted sub list into original list

Max(nums_1, nums_2, num)

#Create empty list

lst = []

#Create for loop

for n in range(100):

#Append the random value to the end of the list

lst.append(randrange(1, 1000))

#Call the function

merge_Sort(lst)

#Print the list

print(lst)

Sample Output

Output:

[996, 992, 975, 974, 956, 952, 947, 937, 921, 915, 902, 899, 891, 889, 886, 863, 863, 862, 856, 841, 837, 819, 808, 791, 760, 755, 754, 739, 736, 732, 685, 663, 638, 628, 623, 622, 612, 594, 569, 562, 552, 532, 531, 528, 527, 523, 492, 475, 468, 461, 452, 451, 444, 438, 431, 413, 405, 401, 375, 370, 358, 354, 350, 350, 347, 339, 325, 290, 286, 246, 227, 220, 215, 188, 185, 182, 168, 161, 149, 142, 141, 141, 139, 135, 115, 114, 112, 101, 96, 94, 94, 85, 84, 84, 80, 78, 70, 18, 13, 11]

>>>

Answer 7

Chapter 13, Problem 4PE

Program Plan Intro

Maximum of list

Program plan:

Import the package.

Define the “Max()” function,

Make simultaneous assignment to initialize the variables.

Assign the values return from “len()”.

Execute while loop when both “lst_1” and “lst_2” have more items,

Check whether top of “lst_1” is larger,

If it is “True”, copy that top value into current location in “lst_3”.

Increment “s1” by “1”.

Otherwise,

Copy the top of “lst_2” into the current location in “lst_3”.

Increment “s2” by “1”.

Increment “s3” by “1” when element is added to “lst_3”.

Execute the “while” loop to copy remaining elements from “lst_1”,

Copy the element.

Increment “s1” by “1”.

Increment “s3” by “1”.

Execute the "while" loop to copy remaining elements from “lst_2”,

Copy the element.

Increment “s2” by “1”.

Increment “s3” by “1”.

Define the function “merge_Sort()”,

Assign the initial values for the variable.

Check whether the number element is greater than 1,

Split the list into two sub lists.

Make simultaneous assignment to assign two sub lists using slicing.

Make recursive calls to sort each sub list.

Merge the sorted sub list into original list.

Create empty list.

Create for loop to iterate “100” times.

Append the random value to the end of the list.

Call the “merge_Sort()” function.

Print the list.

Answer 8

Expert Solution & Answer

Program Description Answer

This Python program is to demonstrate a recursive function “Max()” to find the largest number in a list where the largest number is the larger of the first item and the maximum of all the other items.

Answer 9

Expert Solution & Answer

Answer 10

Expert Solution & Answer

Answer 11

Explanation of Solution

Program:

File name: “conference.py”

#Import the package

from random import randrange

#Define the function

def Max(lst_1, lst_2, lst_3):

#Make simultaneous assignment

s1, s2, s3 = 0, 0 , 0

#Assign the values return from len()

n1, n2 = len(lst_1), len(lst_2)

'''Execute while loop when both lst_1 and lst_2 have more items'''

while s1 < n1 and s2 < n2:

#Check whether top of lst_1 is larger

if lst_1[s1] > lst_2[s2]:

'''Copy that top value into current location in lst_3'''

lst_3[s3] = lst_1[s1]

#Increment by "1"

s1 = s1 + 1

#Otherwise

else:

'''Copy the top of lst_2 into the current location in lst_3'''

lst_3[s3] = lst_2[s2]

#Increment by "1"

s2 = s2 + 1

#Increment by "1" when element added into lst_3

s3 = s3 + 1

'''Execute the "while" loop to copy remaining elements from lst_1'''

while s1 < n1:

#Copy the element

lst_3[s3] = lst_1[s1]

#Increment by "1"

s1 = s1 + 1

#Increment by "1"

s3 = s3 + 1

'''Execute the "while" loop to copy remaining elements from lst1_2'''

while s2 < n2:

#Copy the element

lst_3[s3] = lst_2[s2]

#Increment by "1"

s2 = s2 + 1

#Increment by "1"

s3 = s3 + 1

#Define the function

def merge_Sort(num):

#Assign the value

n = len(num)

'''Check whether the number element is greater than 1'''

if n > 1:

#Split the list into two sub lists

v = n // 2

'''Make simultaneous assignment to assign two sub lists using slicing'''

nums_1, nums_2 = num[:v], num[v:]

#Make recursive calls to sort each sub list

merge_Sort(nums_1)

merge_Sort(nums_2)

#Merge the sorted sub list into original list

Max(nums_1, nums_2, num)

#Create empty list

lst = []

#Create for loop

for n in range(100):

#Append the random value to the end of the list

lst.append(randrange(1, 1000))

#Call the function

merge_Sort(lst)

#Print the list

print(lst)

Answer 12

Sample Output

Output:

[996, 992, 975, 974, 956, 952, 947, 937, 921, 915, 902, 899, 891, 889, 886, 863, 863, 862, 856, 841, 837, 819, 808, 791, 760, 755, 754, 739, 736, 732, 685, 663, 638, 628, 623, 622, 612, 594, 569, 562, 552, 532, 531, 528, 527, 523, 492, 475, 468, 461, 452, 451, 444, 438, 431, 413, 405, 401, 375, 370, 358, 354, 350, 350, 347, 339, 325, 290, 286, 246, 227, 220, 215, 188, 185, 182, 168, 161, 149, 142, 141, 141, 139, 135, 115, 114, 112, 101, 96, 94, 94, 85, 84, 84, 80, 78, 70, 18, 13, 11]

>>>

Answer 13

Ch. 13 - Prob. 1TF Ch. 13 - Prob. 2TF Ch. 13 - Prob. 3TF Ch. 13 - Prob. 4TF Ch. 13 - Prob. 5TF Ch. 13 - Prob. 6TF Ch. 13 - Prob. 7TF Ch. 13 - Prob. 8TF Ch. 13 - Prob. 9TF Ch. 13 - Prob. 10TF

Concept explainers

Explanation of Solution

Want to see more full solutions like this?

Chapter 13 Solutions