Question 1: Using static analysis study the following code snippets to determine the developer error, a fault/bug in the code, and a test case that can cause a failure. A. This code snippet is used to find the maximum number in an array, if the input is invalid the program will through a null pointer exception: int findMax(int arr[]){ int max = 0; for(int i = 0; i < arr.length; i++){ if(arr[i] > max) max = arr[i]; } return max; B. This code snippet is used to copy one integer array into another in reverse order, if the input is invalid the program will return null pointer exception: void copy_int_arr_inreverse(int from[], int to[]){ int counter = 0; for(int i = from. length -1; i >= 0; i--) { to [counter] from[i]; counter++; } C. This code snippet counts how many times a character is repeated in a string, if the input is invalid the program will return -1: int count_letter (String str, if(str == null ) return -1; int count; for(int i = 0; i < str.length(); i++){ if(str.charAt(i) ch) count++; char ch) { } return count;
Question 1: Using static analysis study the following code snippets to determine the developer error, a fault/bug in the code, and a test case that can cause a failure. A. This code snippet is used to find the maximum number in an array, if the input is invalid the program will through a null pointer exception: int findMax(int arr[]){ int max = 0; for(int i = 0; i < arr.length; i++){ if(arr[i] > max) max = arr[i]; } return max; B. This code snippet is used to copy one integer array into another in reverse order, if the input is invalid the program will return null pointer exception: void copy_int_arr_inreverse(int from[], int to[]){ int counter = 0; for(int i = from. length -1; i >= 0; i--) { to [counter] from[i]; counter++; } C. This code snippet counts how many times a character is repeated in a string, if the input is invalid the program will return -1: int count_letter (String str, if(str == null ) return -1; int count; for(int i = 0; i < str.length(); i++){ if(str.charAt(i) ch) count++; char ch) { } return count;
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
Related questions
Question
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps
Knowledge Booster
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education