Question

given code:

import random HALMst N in = int(input('Enter Total Number of Cards: ") NM in NOON A = [] B [] E - [] D = [] E = [] for i in range(1, n+1): A.append(i) D.append(i) E.append(i) for j in range(n): 8.append(random.choice(D)) D.remove(B[5]) C.append(random.choice(E)) E.remove(C[j]) c= 0 for k in range(n): if (Brkl...cikl): C-C+1 print('Original Deck:\n', A) print("After First Draw: \n', B) print("After Second Draw: \n', 5) print("There are', C, Fixed points)

assignment:

use python to extend the given code to create an output similar to the one in the black box

please explain the final code

Answer 1

Python Code:

import random

n = 10 #for n=10
clist = []
cmap = {}
for sim in range(1,1001): #simulating 1000 times
A=[]
B=[]
C=[]
D=[]
E=[]
for i in range(1,n+1):#creating original lists A,D,E
A.append(i)
D.append(i)
E.append(i)

for j in range(n): #creating choice lists B,C
B.append(random.choice(D))
D.remove(B[j])
C.append(random.choice(E))
E.remove(C[j])
c=0 #to store fixed points
for k in range(n):
if B[k] == C[k]:
c = c+1
clist.append(c) #storing the fixed points in clist

for item in clist: #getting the count of each fixed point and storing it in a map
if(item in cmap):
cmap[item] = cmap[item]+1
else:
cmap[item] = 1
sortedkeys = sorted(cmap.keys()) #soting the map
sortedmap = {}
for item in sortedkeys:
sortedmap[item] = cmap[item]
print(f'Deck of {n} cards...1000 different selections') #printing the results
print('Fixed Pts\tPercentge\tQuantity')
index = 0
for item in sortedmap.keys():
size = sortedmap[item]
print(f'{item}\t\t{size/1000}\t\t{size}')
index+=1

n = 100 #this is for n=100
clist = []
cmap = {}
for sim in range(1,1001):
A=[]
B=[]
C=[]
D=[]
E=[]
for i in range(1,n+1):
A.append(i)
D.append(i)
E.append(i)

for j in range(n):
B.append(random.choice(D))
D.remove(B[j])
C.append(random.choice(E))
E.remove(C[j])
c=0
for k in range(n):
if B[k] == C[k]:
c = c+1
clist.append(c)

for item in clist:
if(item in cmap):
cmap[item] = cmap[item]+1
else:
cmap[item] = 1
sortedkeys = sorted(cmap.keys())
sortedmap = {}
for item in sortedkeys:
sortedmap[item] = cmap[item]
print(f'Deck of {n} cards...1000 different selections')
print('Fixed Pts\tPercentge\tQuantity')
index = 0
for item in sortedmap.keys():
size = sortedmap[item]
print(f'{item}\t\t{size/1000}\t\t{size}')
index+=1

n = 1000 #this is for n=1000
clist = []
cmap = {}
for sim in range(1,1001):
A=[]
B=[]
C=[]
D=[]
E=[]
for i in range(1,n+1):
A.append(i)
D.append(i)
E.append(i)

for j in range(n):
B.append(random.choice(D))
D.remove(B[j])
C.append(random.choice(E))
E.remove(C[j])
c=0
for k in range(n):
if B[k] == C[k]:
c = c+1
clist.append(c)

for item in clist:
if(item in cmap):
cmap[item] = cmap[item]+1
else:
cmap[item] = 1
sortedkeys = sorted(cmap.keys())
sortedmap = {}
for item in sortedkeys:
sortedmap[item] = cmap[item]
print(f'Deck of {n} cards...1000 different selections')
print('Fixed Pts\tPercentge\tQuantity')
index = 0
for item in sortedmap.keys():
size = sortedmap[item]
print(f'{item}\t\t{size/1000}\t\t{size}')
index+=1

n = 10000 #this is for n=10000
clist = []
cmap = {}
for sim in range(1,1001):
A=[]
B=[]
C=[]
D=[]
E=[]
for i in range(1,n+1):
A.append(i)
D.append(i)
E.append(i)

for j in range(n):
B.append(random.choice(D))
D.remove(B[j])
C.append(random.choice(E))
E.remove(C[j])
c=0
for k in range(n):
if B[k] == C[k]:
c = c+1
clist.append(c)

for item in clist:
if(item in cmap):
cmap[item] = cmap[item]+1
else:
cmap[item] = 1
sortedkeys = sorted(cmap.keys())
sortedmap = {}
for item in sortedkeys:
sortedmap[item] = cmap[item]
print(f'Deck of {n} cards...1000 different selections')
print('Fixed Pts\tPercentge\tQuantity')
index = 0
for item in sortedmap.keys():
size = sortedmap[item]
print(f'{item}\t\t{size/1000}\t\t{size}')
index+=1

import random n - 1e sfor n-10 clist - [1 cmap - E for sím in range(1,1881): #simulating 1880 times C-[] D-11 for 1 in range(1, n+1):#creating original lists A,D,E A.append(1) D.append(1) E.append(1) for j in range(n): #creating choice lists B,C B.append(random.choice(D)) D.remove(B[31) C.append(random.choice(E)) E.remove(C(31) c-esto store fixed points for k in range(n): if B[K] -- C[K]: C - C+1 clist.append() #storing the fixed points in clist for iten in clist: #getting the count of each fixed point and storing it in a map if(item in cmap): cmap[iten] - cmap[iten]+1 else: cmap[iten] - 1 sortedkeys - sorted(cmap.Keys() Esoting the map sortedmap - {} for item in sortedkeys: sortedmap[iten] - cmap[iten] print("Deck of {n} cards...1888 different selections') #printing the results print("Fixed Pts\tPercentge\tQuantity) Index - for item in sortedmap.Keys(): size - sortedmap[iten] print(fi{item}\t\t{size/1888}\t\t{size}') index+-1 37

(Change the n value for different blocks code is exactly the same)

Sample Output:

We notice that results get more accurate as we increase the n size

Own' O V AWNE Deck of 10 cards...1000 different selections Fixed Pts Percentge Quantity 0.383 383 0.337 337 0.195 195 0.065 0.016 16 0.003 0.001 Deck of 100 cards...1000 different selections Fixed Pts Percentge Quantity 0.356 356 0.387 387 0.182 182 0.057 0.012 0.005 0.001 Deck of 1000 cards...1000 different selections Fixed Pts Percentge Quantity 0.39 390 0.361 361 0.162 162 0.073 73 0.011 0.003 Press any key to continue ... 12 WN 3