The Java code below was written to find the last index that x appears in the array A. If x doesn't appear in A, then the function returns -1. int find(int[] A, int x) { int n A.length, i = n -1; while (i = 0) { } } if (A[i] = x) return i; i = 1; == return -1; Homework 3 6 Data Struct. Your task is as follows: 1. Write a precondition and a post-condition for find. Your conditions should be in sync with the invariants and other justification steps you will also make about the code. At the very least, the post-condition should allow us to say that find does find the last index of x as specified above. 2. Specify a loop invariant for the loop that find uses. 3. Fill in the missing Hoare logic justifications so that we have a complete proof that given the precondition, the post-condition holds, thereby find meets the specification.

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
The Java code below was written to find the last index that x appears in the array A. If x doesn't
appear in A, then the function returns -1.
int find(int[] A, int x) {
int n A.length, i = n -1;
while (i = 0) {
}
}
if (A[i] = x)
return i;
i = 1;
==
return -1;
Homework 3
6
Data Struct.
Your task is as follows:
1. Write a precondition and a post-condition for find. Your conditions should be in sync with the
invariants and other justification steps you will also make about the code. At the very least, the
post-condition should allow us to say that find does find the last index of x as specified above.
2. Specify a loop invariant for the loop that find uses.
3. Fill in the missing Hoare logic justifications so that we have a complete proof that given the
precondition, the post-condition holds, thereby find meets the specification.
Transcribed Image Text:The Java code below was written to find the last index that x appears in the array A. If x doesn't appear in A, then the function returns -1. int find(int[] A, int x) { int n A.length, i = n -1; while (i = 0) { } } if (A[i] = x) return i; i = 1; == return -1; Homework 3 6 Data Struct. Your task is as follows: 1. Write a precondition and a post-condition for find. Your conditions should be in sync with the invariants and other justification steps you will also make about the code. At the very least, the post-condition should allow us to say that find does find the last index of x as specified above. 2. Specify a loop invariant for the loop that find uses. 3. Fill in the missing Hoare logic justifications so that we have a complete proof that given the precondition, the post-condition holds, thereby find meets the specification.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Similar questions
  • SEE MORE 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