Arrange the codes

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Arrange the codes

#Sum of secondary diagonal (Hint: uses index j)
Time le
result2 = 0
#Test the equality of sum_list
main()
Drag and drop statements from the following selection:
for i in range(1, len(sum_list)):
sum_list.append(total)
for row in my_matrix:
total=total+row[col]
m = read_matrix()
horizontalSum.append(sum(lines)
def read_matrix():
for lines in my_matrix:
if sum_list[0] != sum_list[i]:
result1 +=my_matrix[i][i]
return True
result2 +=my_matrix[j][iSize-1-j]
print(magic_square_test(m))
def magic_square_test(my_matrix):
sum_list.append(result1)
for j in range(0,iSize):
return False
sum_list.append(result2)
for i in range(0,iSize):
result1 = 0
for col in range(iSize):
sum_list.extend(horizontalSum)
total=0
magic = True
Transcribed Image Text:#Sum of secondary diagonal (Hint: uses index j) Time le result2 = 0 #Test the equality of sum_list main() Drag and drop statements from the following selection: for i in range(1, len(sum_list)): sum_list.append(total) for row in my_matrix: total=total+row[col] m = read_matrix() horizontalSum.append(sum(lines) def read_matrix(): for lines in my_matrix: if sum_list[0] != sum_list[i]: result1 +=my_matrix[i][i] return True result2 +=my_matrix[j][iSize-1-j] print(magic_square_test(m)) def magic_square_test(my_matrix): sum_list.append(result1) for j in range(0,iSize): return False sum_list.append(result2) for i in range(0,iSize): result1 = 0 for col in range(iSize): sum_list.extend(horizontalSum) total=0 magic = True
Insert your code here:
def main():
#Function to test the magic square
#@params my_matrix (table)
#@return True if the matrix is a magic square, and return False otherwise
iSize = len(my_matrix[0])
%3D
sum_list = []
horizontalSum = []
#Horizontal Part: Sum of the lines
#Vertical Part: Sum of the columns
#Sum of main diagonal (Hint: uses index i)
Transcribed Image Text:Insert your code here: def main(): #Function to test the magic square #@params my_matrix (table) #@return True if the matrix is a magic square, and return False otherwise iSize = len(my_matrix[0]) %3D sum_list = [] horizontalSum = [] #Horizontal Part: Sum of the lines #Vertical Part: Sum of the columns #Sum of main diagonal (Hint: uses index i)
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY