1. Write a function called hwd_problem1 that takes two inputs: a vector v and a positive integer scalar n. You do NOT need to check these assumptions. The function needs to find the n consecutive elements in v whose sum is the maximum. It needs to return the sum and the index of the first of these elements. If there are multiple such n consecutive elements in v, it returns the first one, i.e, the one with the smallest index. Here is an example run:

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

How do I do number 1

Sure, here's the transcription suitable for an educational website:

---

### 3. Problems

1. **Function - `hw4_problem1`**:
   - **Inputs**: A vector `v` and a positive integer scalar `n`.
   - **Objective**: Identify consecutive elements in `v` such that their sum is maximized.
   - **Outputs**: The sum and the index of the first element in this segment. In case of ties, return the sum and index with the smallest initial index.
   - **Example**:
     ```plaintext
     >> [total ind] = hw4_problem1([1 2 3 4 5 4 3 2 1],3)
     total = 13
     ind = 4
     ```

2. **Function - `hw4_problem2`**:
   - **Inputs**: A vector `v`.
   - **Objective**: Determine if the elements of `v` are monotonically non-decreasing.
   - **Outputs**: A logical true if the condition is satisfied, otherwise false. Indicates false if the input is not a vector.
   
3. **Function - `hw4_problem3`**:
   - **Inputs**: A positive integer scalar `k`.
   - **Objective**: Find the smallest prime number `p` less than 1000 such that `p+k` is also a prime. Return 0 if no such `p` exists.
   - **Hints**: Utilize built-in functions like `primes` and/or `isprime`.

4. **Function - `hw4_problem4`**:
   - **Calculation**: 
     \[
     s = \sum_{k=1}^{n} \frac{1}{k} = 1 + \frac{1}{2} + \frac{1}{3} + \frac{1}{4} + \ldots
     \]
   - **Objective**: Calculate the smallest `n` such that `s` exceeds `limit`. Return `n` and corresponding `s`.
   - **Restriction**: Do not use for loops.
   - **Examples**:
     ```plaintext
     >> [n s] = hw4_problem4(1)
     n = 2
     s = 1.50000000000000
     
     >> [n s] = hw4_problem4(2
Transcribed Image Text:Sure, here's the transcription suitable for an educational website: --- ### 3. Problems 1. **Function - `hw4_problem1`**: - **Inputs**: A vector `v` and a positive integer scalar `n`. - **Objective**: Identify consecutive elements in `v` such that their sum is maximized. - **Outputs**: The sum and the index of the first element in this segment. In case of ties, return the sum and index with the smallest initial index. - **Example**: ```plaintext >> [total ind] = hw4_problem1([1 2 3 4 5 4 3 2 1],3) total = 13 ind = 4 ``` 2. **Function - `hw4_problem2`**: - **Inputs**: A vector `v`. - **Objective**: Determine if the elements of `v` are monotonically non-decreasing. - **Outputs**: A logical true if the condition is satisfied, otherwise false. Indicates false if the input is not a vector. 3. **Function - `hw4_problem3`**: - **Inputs**: A positive integer scalar `k`. - **Objective**: Find the smallest prime number `p` less than 1000 such that `p+k` is also a prime. Return 0 if no such `p` exists. - **Hints**: Utilize built-in functions like `primes` and/or `isprime`. 4. **Function - `hw4_problem4`**: - **Calculation**: \[ s = \sum_{k=1}^{n} \frac{1}{k} = 1 + \frac{1}{2} + \frac{1}{3} + \frac{1}{4} + \ldots \] - **Objective**: Calculate the smallest `n` such that `s` exceeds `limit`. Return `n` and corresponding `s`. - **Restriction**: Do not use for loops. - **Examples**: ```plaintext >> [n s] = hw4_problem4(1) n = 2 s = 1.50000000000000 >> [n s] = hw4_problem4(2
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Arrays
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
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