i want to see the solution of largest_at_positon. And also there is a restriction in first image. can ubalso show doctest in solutions?

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
icon
Related questions
Question
i want to see the solution of largest_at_positon. And also there is a restriction in first image. can ubalso show doctest in solutions? Thank you
Morkl le
AR DESTDICTION
lndey
2).py
2.py x
lab3.py x
lab5 (1).py x
lab6 (7).py x e lab7 (2).py X lab6 (5).py x
scratch_3
maximum_length = count
return maximum_length
def largest_at_position(matrix: list[list[int]], row: int, col: int) -> int:
Returns the area of the largest rectangle whose top left corner is at
position <row>, <col> in <matrix>.
You MUST make use of the helper <longest_chain> here as you loop through
each row of the matrix. Do not modify (i.e., mutate) the input matrix.
>>> case1 = [[1, 0, 1, 0, 0],
[1, 0, 1, 1, 1],
[1, 1, 1, 1, 1],
[1, 0, 0, 1, 0]]
>>> largest_at_position(case1, 0, 0)
4
>>> largest_at_position (case1, 2, 0)
>>> largest_at_position (case1, 1, 2)
6
pass
edef largest_in_matrix(matrix: list[list[int]]) -> int:
largest_in_matrix()
Transcribed Image Text:Morkl le AR DESTDICTION lndey 2).py 2.py x lab3.py x lab5 (1).py x lab6 (7).py x e lab7 (2).py X lab6 (5).py x scratch_3 maximum_length = count return maximum_length def largest_at_position(matrix: list[list[int]], row: int, col: int) -> int: Returns the area of the largest rectangle whose top left corner is at position <row>, <col> in <matrix>. You MUST make use of the helper <longest_chain> here as you loop through each row of the matrix. Do not modify (i.e., mutate) the input matrix. >>> case1 = [[1, 0, 1, 0, 0], [1, 0, 1, 1, 1], [1, 1, 1, 1, 1], [1, 0, 0, 1, 0]] >>> largest_at_position(case1, 0, 0) 4 >>> largest_at_position (case1, 2, 0) >>> largest_at_position (case1, 1, 2) 6 pass edef largest_in_matrix(matrix: list[list[int]]) -> int: largest_in_matrix()
Morklle
lodoy
LAR DESTDI
2).py
lab3.py x
lab5 (1).py x
,lab6 (7).py x e lab7 (2).py x
-py X
lab6 (5).py x
scratch_3
LAB RESTRICTIONS, PLEASE READ:
Do not add any imports, the ones that you need will be given to you.
You may not use any dictionaries or dictionary methods.
Do not use try-except statements, you should be able to anticipate
or prevent any errors from happening at all!
def longest_chain(lst: list[int]) -> int:
Your longest_chain function from last week, make sure this works properly
before proceeding with the rest of the lab!
maximum_length = 0
i = 0
count = 0
while i < Len(Lst):
if lst[i] == 1;
Count += 1
else:
if count > maximum_length:
maximum_Length = count
Count = 0
i += 1
if count > maximum_Length:
maximum_Length = count
return maximum_length
largest_in_matrix()
Doctests in lab7 (2) x
坛 三小
« 7 A D ↑
Oms
/usr/local/bin/python3.9 "/Applications/PyCharm CE.a
Tests failed: 4, passed: 2 of 6 tests - 0 ms
O Test Results
> O lab7 (2) Jargest ot neniti
Transcribed Image Text:Morklle lodoy LAR DESTDI 2).py lab3.py x lab5 (1).py x ,lab6 (7).py x e lab7 (2).py x -py X lab6 (5).py x scratch_3 LAB RESTRICTIONS, PLEASE READ: Do not add any imports, the ones that you need will be given to you. You may not use any dictionaries or dictionary methods. Do not use try-except statements, you should be able to anticipate or prevent any errors from happening at all! def longest_chain(lst: list[int]) -> int: Your longest_chain function from last week, make sure this works properly before proceeding with the rest of the lab! maximum_length = 0 i = 0 count = 0 while i < Len(Lst): if lst[i] == 1; Count += 1 else: if count > maximum_length: maximum_Length = count Count = 0 i += 1 if count > maximum_Length: maximum_Length = count return maximum_length largest_in_matrix() Doctests in lab7 (2) x 坛 三小 « 7 A D ↑ Oms /usr/local/bin/python3.9 "/Applications/PyCharm CE.a Tests failed: 4, passed: 2 of 6 tests - 0 ms O Test Results > O lab7 (2) Jargest ot neniti
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Binary numbers
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
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education