Write and test the following function:
def array_to_stack(stack, source):
"""
-------------------------------------------------------
Pushes contents of source onto stack. At finish, source is empty.
Last value in source is at bottom of stack,
first value in source is on top of stack.
Use: array_to_stack(stack, source)
-------------------------------------------------------
Parameters:
stack - a Stack object (Stack)
source - a Python list (list)
Returns:
None
-------------------------------------------------------
"""
Ans:-
Code:
def array_to_stack(stack,source):
print(source)#print initial list source
for i in range(len(source)-1,-1,-1):#use for loop
for(start,stop,step) start from last index in reverse step pf
-1
stack.append(source.pop(i)) #pop the element from source in reverse
order and push into stack
print(stack) #print final value of stack
print(source) #print final list
source=[1,3,5,6,8]
stack=[]
array_to_stack(stack,source)
Output for testing:-

The first row of output is the initial list
The second row of output is final stack
Third row of output corresponds to the final list
Please like the answer if it is helpful to you.
Write and test the following function: def array_to_stack(stack, source): """ ------------------------------------------------------- Pushes contents of source onto...
PYTHON - Write and test the following program that meets the following conditions ------------------------------------------------------- write a program that Tests the methods of stack for empty and non-empty stacks using the data in is_empty, push, pop, peek *Testing pop and peek while empty throws exception ------------------------------------------------------- CONDITIONS source - list of data (list of ?) RETURNS None ------------------------------------------------------- CODE FOR : Empty, Push, Pop & Peek def is_empty(self): result = True if len(self._values) > 0: result = False return result...
ii. (30) A Stack is a container commonly used to provide a way to keep organized so that the last one pushed' onto the top of the stack is thth one 'popped (removed)- so stacks are called "last-in-first-out". on top of the stack is visible, but after removing the top item, t pushed item is visible, since it is back on top. The following Python co is a recursive definition of the class Stack. Read the code, and answer te...
C++ Please Write a function to copy one stack to another stack and leave the first stack unchanged. Only use the stack member functions: push pop top empty Your program should: create a stack prompt the user for a list of names and add them to the stack create a second stack call a function to copy the contents of the first stack to the second stack (leaving the first stack unchanged) empty the contents of the first stack (displaying...
PYTHON. Write the following functions without using any predefined functions unless specified. def min (dataList) : #returns the smallest value of the data values in dataList def max (dataList): #returns the largest value def getRange (dataList) def mean (dataList) : #returns the average of data values def median (dataList): #returns the middle value of an ordered list #note: to sort the list first, may use the predefined sort function Then write a test1 function to test the above functions using...
11.2 Problem Set 2: PostScript Stack Commands (in python please) For this assignment you are to implement a PostScript command interpreter using a Stack. You must implement the stack using a singly-linked list. Solutions that use a data structure other than a singly-linked list will received no credit. The interpreter must read and execute a string of PostScript commands based on the following definitions: 1. = objn objn-1 … obj1 = : objn-1 … obj1 This command removes the topmost...
help finish Queue, don't think
I have the right thing.
# 1. After studying the Stack class and testStack() functions in stack.py # complete the Queue class below (and test it with the testQueue function) # # 2. Afer studying and testing the Circle class in circle.py, # complete the Rectangle class below (and test it with the testRectangle function) # # # 3. SUBMIT THIS ONE FILE, with your updates, TO ICON. # # # NOTE: you may certainly...
Create a C++ program. Include comment, input and output
file.
STACK IMPLEMENTATION USING AN link
list
IMPLEMENT THE FOLLOWING STACK OPERATIONS using a
TEMPLATED CLASS.
WRITE ALL THE FULL-FUNCTION DEFINITIONS NEEDED for the
OPERATIONS.
OUTPUT: PRINT ALL THE ELEMENTS ON THE STACK.
Stack Operations initializestack: Initializes the stack to an empty state. isEmptyStack: Determines whether the stack is empty. If the stack is empty, it returns the value true; otherwise, it returns the value false. isFul1stack: Determines whether the stack...
template <class T> class Stack { public: /** clear * Method to clear out or empty any items on stack, * put stack back to empty state. * Postcondition: Stack is empty. */ virtual void clear() = 0; /** isEmpty * Function to determine whether the stack is empty. Needed * because it is undefined to pop from empty stack. This * function will not change the state of the stack (const). * * @returns bool true if stack is...
Using Python Programming Language:
4. Implement the following function in the PyDev module functions.py and test it from a PyDev module named t04.py: def print_matrix_char(matrix): Prints the contents of a 2D list of strings in a formatted table. Prints row and column headings. Use: print_matrix_char (matrix) Parameters: matrix - a 2D list of strings (2D list) Returns: None. Sample testing: Number of rows: 3 Number of columns: 4 0 1 2 3 i 0 с u r 1 с у...
In c++ Section 1. Stack ADT – Overview Data Items The data items in a stack are of generic DataType. This means use should use templating and your Node class. Structure The stack data items are linearly ordered from the most recently added (the top) to the least recently added (the bottom). This is a LIFO scheme. Data items are inserted onto (pushed) and removed from (popped) the top of the stack. Operations Constructor. Creates an empty stack. Copy constructor....