Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Part B: Problem 4: Describe specific loop invariant(s) for proving correct- ness for each of the following algorithms. You do not have to prove that the algorithms are correct: (a) def find_min(A): min =A[0] for i in range(1, len(A)): if min > A[i]: min =A[i] return min (b) def find_max (A): for i in range(0, len (A)): isMax = True for j in range(0, len(A)): if A[j] > A[i]: if isMax: isMax = False return A[i] (c) def even numbers (A): E = [] for i in range(0, len (A)): if A[i]%2== 0: return E E.append(A[i]) (d) def double_array(A): for i in range(0, len(A)): A[i] =A[i] + 2 return A (e) def dot product (A, B): sum = 0.0 for i in range(0, min(len(A), len(B))): sum sum +A[i] +B[i] return sum

Part B: Problem 4: Describe specific loop invariant(s) for proving correct- ness for each of the following algorithms. You do not have to prove that the algorithms are correct: (a) def find_min(A): min =A[0] for i in range(1, len(A)): if min > A[i]: min =A[i] return min (b) def find_max (A): for i in range(0, len (A)): isMax = True for j in range(0, len(A)): if A[j] > A[i]: if isMax: isMax = False return A[i] (c) def even numbers (A): E = [] for i in range(0, len (A)): if A[i]%2== 0: return E E.append(A[i]) (d) def double_array(A): for i in range(0, len(A)): A[i] =A[i] + 2 return A (e) def dot product (A, B): sum = 0.0 for i in range(0, min(len(A), len(B))): sum sum +A[i] +B[i] return sum

Database System Concepts
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
icon
Related questions
Question

I need help with this please asap

Part B: Problem 4: Describe specific loop invariant(s) for proving correct- ness for each of the following algorithms. You do not have to prove that the algorithms are correct: (a) def find_min(A): min =A[0] for i in range(1, len(A)): if min > A[i]: min =A[i] return min (b) def find_max (A): for i in range(0, len (A)): isMax = True for j in range(0, len(A)): if A[j] > A[i]: if isMax: isMax = False return A[i] (c) def even numbers (A): E = [] for i in range(0, len (A)): if A[i]%2== 0: return E E.append(A[i]) (d) def double_array(A): for i in range(0, len(A)): A[i] =A[i] + 2 return A (e) def dot product (A, B): sum = 0.0 for i in range(0, min(len(A), len(B))): sum sum +A[i] +B[i] return sum
Transcribed Image Text:Part B: Problem 4: Describe specific loop invariant(s) for proving correct- ness for each of the following algorithms. You do not have to prove that the algorithms are correct: (a) def find_min(A): min =A[0] for i in range(1, len(A)): if min > A[i]: min =A[i] return min (b) def find_max (A): for i in range(0, len (A)): isMax = True for j in range(0, len(A)): if A[j] > A[i]: if isMax: isMax = False return A[i] (c) def even numbers (A): E = [] for i in range(0, len (A)): if A[i]%2== 0: return E E.append(A[i]) (d) def double_array(A): for i in range(0, len(A)): A[i] =A[i] + 2 return A (e) def dot product (A, B): sum = 0.0 for i in range(0, min(len(A), len(B))): sum sum +A[i] +B[i] return sum
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
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
SEE MORE TEXTBOOKS