Question

Write a function in Python PUSH(Arr), where Arr is a list of numbers. From this list push all numbers divisible by 5 into a stack implemented by using a list. Display the stack if it has at least one element, otherwise display appropriate error message.

Answer 1

Here's a Python function that implements the required functionality:

def PUSH(Arr):
    stack = []
    for num in Arr:
        if num % 5 == 0:
            stack.append(num)
    
    if stack:
        print("Stack elements are:")
        for element in stack:
            print(element)
    else:
        print("No elements divisible by 5 found.")

Here's an explanation of how this function works:

1. First, we initialize an empty list called stack which will serve as our stack.
2. Next, we loop through each element in the Arr list using a for loop.
3. Inside the loop, we use the % operator to check if the current number is divisible by 5. If it is, we append it to the stack list.
4. Once we have finished looping through all the elements in Arr, we check if stack has any elements using an if statement. If it does, we print out each element in the stack using another for loop. If it doesn't, we print an appropriate error message.
5. The function doesn't return anything, it simply prints the stack or an error message.

You can call this function with a list of numbers as an argument, like this:

PUSH([10, 20, 25, 30, 35, 40]) 

This will output:

Stack elements are:
10
20
25
30
35
40 

If you call the function with a list that doesn't contain any numbers divisible by 5, you'll get an error message:

PUSH([1, 2, 3, 4, 6, 7]) 

This will output:

No elements divisible by 5 found.

 

Answer 2

Using of any correct code giving the same result is also accepted.

def PUSH(Arr,value): 

s=[]

for x in range(0,len(Arr)): 

if Arr[x]%5==0: 

s.append(Arr[x]) 

if len(s)==0:

print("Empty Stack") 

else: 

print(s)

Answer 3

A stack is an assortment of items that supports quick toward the Last-in-first-out (LIFO) semantics for embeds and erases.

def PUSH(Arr):

s=[]

for i in range(0,len(Arr)):

if Arr[i]%5==0 :

s.append(Arr[x])

if len(s)==0:

print("Empty Stack")

else:

print(s)