In java there must be at least two calls to the function with different arguments and the output must clearly show the task being performed. 1. Develop a function that accepts an array and returns true if the array contains any duplicate values or false if none of the values are repeated. 2. Develop a function that returns true if the elements are in decreasing order and false otherwise. 3. A "peak" is a value in an array that is preceded and followed by a strictly lower value. For example, in the array {2, 12, 9, 8, 5, 7, 3, 9} the values 12 and 7 are peaks. Develop a function that returns the number of peaks in an array of integers. Note tha the first element does not have a preceding element and the last element is not followed by anything, so neither the first nor last elements can be peaks. 4. Develop a function that finds the starting index of the longest subsequence of values that is strictly increasing. For example, given the array {12, 3, 7, 5, 9, 8, 1, 4, 6}, the function would return 6, since the subsequence {1, 4, 6) is the longest that is strictly increasing. 5. Develop a function that takes a string and a single character, then returns a list of the indexes in the string where the character occurs. For example, given the string "bookkeeper" and 'e', the function would return (5, 6, 8} since 'e' occurs at those positions. Return an empty list if the character does not appear in the string even once. 6. Develop a function that takes two lists of integers and returns a list containing any value that appears in both parameter lists.
In java there must be at least two calls to the function with different arguments and the output must clearly show the task being performed. 1. Develop a function that accepts an array and returns true if the array contains any duplicate values or false if none of the values are repeated. 2. Develop a function that returns true if the elements are in decreasing order and false otherwise. 3. A "peak" is a value in an array that is preceded and followed by a strictly lower value. For example, in the array {2, 12, 9, 8, 5, 7, 3, 9} the values 12 and 7 are peaks. Develop a function that returns the number of peaks in an array of integers. Note tha the first element does not have a preceding element and the last element is not followed by anything, so neither the first nor last elements can be peaks. 4. Develop a function that finds the starting index of the longest subsequence of values that is strictly increasing. For example, given the array {12, 3, 7, 5, 9, 8, 1, 4, 6}, the function would return 6, since the subsequence {1, 4, 6) is the longest that is strictly increasing. 5. Develop a function that takes a string and a single character, then returns a list of the indexes in the string where the character occurs. For example, given the string "bookkeeper" and 'e', the function would return (5, 6, 8} since 'e' occurs at those positions. Return an empty list if the character does not appear in the string even once. 6. Develop a function that takes two lists of integers and returns a list containing any value that appears in both parameter lists.
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 with 6 images
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