You are an investor who receives daily price quotes for a stock. The span of a stock's price on a given day is the number of consecutive days, from the given day going backwards, on which its price was less than or equal to its price on the day we are considering. Thus, the Stock Span Problem is as follows: Given a series of daily price quotes for a stock, find the span of the stock on each day of the series. Assume you are given seven daily stock quotes: 3, 10, 4, 7, 9, 6, and 8. Assume further that these stock quotes are stored in the array quotes. Show a step-by-step, manual desk-check execution of the algorithm below showing the values of all variables and arrays for each step in each cycle of each loop, as demonstrated in clase

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
You are an investor who receives daily price quotes for a stock. The span of a stock's price on a given day
is the number of consecutive days, from the given day going backwards, on which its price was less than
or equal to its price on the day we are considering. Thus, the Stock Span Problem is as follows: Given a
series of daily price quotes for a stock, find the span of the stock on each day of the series.
Assume you are given seven daily stock quotes: 3, 10, 4, 7, 9, 6, and 8.
Assume further that these stock quotes are stored in the array quotes. Show a step-by-step, manual
desk-check execution of the algorithm below showing the values of all variables and arrays for each
step in each cycle of each loop, as demonstrated in clase
Algorithm: A Simple Stock Span Algorithm
SimpleStockSpan (quotes) → spans
Input: quotes, an array with n stock price quotes
Output: spans, an array with n stock price spans
2
3
4
5
6
7
8
10
11
spans CreateArray (n)
←
for i0 to n do
k 1
span_end FALSE
while i- k ≥ 0 and not span_end do
if quotes[ik] ≤ quotes[i] then
k+k+1
else
span_end TRUE
spans[i]+ k
return spans
Transcribed Image Text:You are an investor who receives daily price quotes for a stock. The span of a stock's price on a given day is the number of consecutive days, from the given day going backwards, on which its price was less than or equal to its price on the day we are considering. Thus, the Stock Span Problem is as follows: Given a series of daily price quotes for a stock, find the span of the stock on each day of the series. Assume you are given seven daily stock quotes: 3, 10, 4, 7, 9, 6, and 8. Assume further that these stock quotes are stored in the array quotes. Show a step-by-step, manual desk-check execution of the algorithm below showing the values of all variables and arrays for each step in each cycle of each loop, as demonstrated in clase Algorithm: A Simple Stock Span Algorithm SimpleStockSpan (quotes) → spans Input: quotes, an array with n stock price quotes Output: spans, an array with n stock price spans 2 3 4 5 6 7 8 10 11 spans CreateArray (n) ← for i0 to n do k 1 span_end FALSE while i- k ≥ 0 and not span_end do if quotes[ik] ≤ quotes[i] then k+k+1 else span_end TRUE spans[i]+ k return spans
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Probability Problems
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.
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