Search
X
Off
AutoSave
Assignment_3 (1) - Compatibility Mode
tomiwaolanrewaju1@gmail.com
Share
Comments
File
Editing
Home Insert Draw Design Layout References Mailings Review View Help
Find
A^
A
Aa
10.5
Consolas
Normal
Replace
No Spacing
Heading 2
Heading 1
Editor
Add-ins
Sensitivity
Dictate
Paste
B
I
A
U
ab
v
X2
Select v
Font
Editor
[V
Add-ins
r
Voice
rs
Clipboard
Paragraph
Styles
Editing
Sensitivity
Problem 1.
Mr. Charles purchased some mutual funds and created a stack named Original by the ticker symbols
of those funds as shown below. Some of those mutual funds are from Fidelity investments. The ticker
symbols of only the Fidelity funds start with the letter 'F'. Write a python code to
i) put all the ticker symbols of Fidelity funds of the Original stack in a stack called Fidelity in the
same order in which they appeared in the Original stack (FSMEX at the top and FSELX at the
bottom) and
ii) put all the other ticker symbols in the Original stack in the same order in which they appeared in
the Original stack (CPOAX at the top and JAMFX at the bottom)
iii) Do everything using loop structure.
from array stack import ArrayStack as AS
Original = AS()
Fidelity = AS()
Helper = AS()
originat.push('JAMFX')
Original.push( 'FSELX')
Original.push 'FOCPX')
Original.push( 'AFOIX')
Original.push( 'TEFQX')
Original.push 'FSRPX')
Original.push ('MSSMX')
Original.push( FSCSX')
Original.push FSPTX')
Original.push( FCPGX')
Original.push 'MACGX' )
BE
Text Predictions: On
100
Focus
172 words
Accessibility: Good to go
Page of 2
2:56 AM
Q
III
Search
+
3/3/2024

Question

Accepted Answer

```python # Import the ArrayStack class from array_stack import ArrayStack as AS # Define a function to sort the ticker symbols def sort_ticker_symbols(original_stack): # Create two stacks for Fidelity and other funds fidelity_stack = AS() other_stack = AS() helper_stack = AS() # Loop through the original stack and distribute ticker symbols while not original_stack.is_empty(): # Pop the top ticker symbol from the original stack ticker = original_stack.pop() # If the ticker symbol starts with 'F', push it to the Fidelity stack if ticker.startswith('F'): helper_stack.push(ticker) else: # Otherwise, push it to the other funds stack other_stack.push(ticker) # Reverse the order of the Fidelity stack to maintain the original order while not helper_stack.is_empty(): fidelity_stack.push(helper_stack.pop()) # Return the sorted stacks return fidelity_stack, other_stack ``` ```python # Main function to test the sort_ticker_symbols function def main(): # Create an original stack and push ticker symbols original = AS() original.push('JAMFX') original.push('FSELX') original.push('FOCPX') original.push('AFOIX') original.push('TEFQX') original.push('FSRPX') original.push('MSSMX') original.push('FSCSX') original.push('FSPTX') original.push('FCPGX') original.push('MACGX') # Sort the ticker symbols fidelity, other = sort_ticker_symbols(original) # Use case 1: Check the top of the Fidelity stack assert fidelity.peek() == 'FSMEX', "Top of Fidelity stack should be FSMEX" # Use case 2: Check the top of the other funds stack assert other.peek() == 'CPOAX', "Top of other funds stack should be CPOAX" # Call the main function to perform the tests main() ``` ∻Explanation∻ ⚹The provided Python code defines a function to sort mutual fund ticker symbols into two stacks: one for Fidelity funds and one for other funds. The code also includes a main function to test the sorting operation with two use cases.⚹ ∻Step-by-step Instruction∻ ‖ ▪ ⋮ Import the ArrayStack class from the array_stack module. ‖ ‖ ▪ ⋮ Define the sort_ticker_symbols function that takes an original stack as an argument. ‖ ‖ ▪ ⋮ Inside the function, create two empty stacks for Fidelity and other funds, and a helper stack for reversing the order. ‖ ‖ ▪ ⋮ Loop through the original stack, pop each ticker symbol, and push it to the appropriate stack based on whether it starts with 'F'. ‖ ‖ ▪ ⋮ Reverse the Fidelity stack using the helper stack to maintain the original order. ‖ ‖ ▪ ⋮ Return the two sorted stacks from the function. ‖ ‖ ▪ ⋮ Define the main function to create an original stack with given ticker symbols and call the sorting function. ‖ ‖ ▪ ⋮ Define two use cases to test the sorting function: checking the top elements of both Fidelity and other funds stacks. ‖ ‖ ▪ ⋮ Call the main function to run the tests. ‖ ∻Time Complexity∻ ⚹The time complexity of the sorting function is O(n), where n is the number of ticker symbols in the original stack, because each symbol is processed once.⚹ ∻Space Complexity∻ ⚹The space complexity is O(n), as we store all ticker symbols in two separate stacks in addition to the original stack.⚹

Sia