Question 1

Question 1Assertion (A): The major implementation of using a data structure is to manage the storage of data in the memory efficiently.Reasoning (R): Data structure refers to the way memory is allocated for holding data using minimum space. It leads to faster data access during the execution of the program.Both A and R are true and R is the correct explanation of A.Both A and R are true but R is not the correct explanation of A.A is true but R is false.A is false but R is true.

Accepted Answer

Both A and R are true and R is the correct explanation of A.ExplanationData structures play a crucial role in efficiently managing data in memory. A data structure refers to the method of allocating memory to hold data using minimal space, which ensures faster data access during program execution.

Question 2

Question 2Assertion (A): While working with Stacks, the program should check for Overflow condition before executing push operation and, similarly, check for Underflow before executing pop operation.Reasoning (R): In Stack, Underflow means there is no element available to remove and Overflow means no further element can be added to it.Both A and R are true and R is the correct explanation of A.Both A and R are true but R is not the correct explanation of A.A is true but R is false.A is false but R is true.

Accepted Answer

Both A and R are true and R is the correct explanation of A.ExplanationTo use a Stack efficiently, it's crucial to check its status by examining overflow conditions before executing a push operation and underflow conditions before executing a pop operation. In a stack, underflow occurs when there are no elements available to remove (e.g., trying to pop from an empty stack), while overflow happens when there's no more space to add elements (e.g., trying to push onto a full stack).

Question 3

Question 5Assertion (A): Stack and Queue are linear data structures.Reasoning (R): List, tuples and dictionaries are Python built-in linear data structures.Both A and R are true and R is the correct explanation of A.Both A and R are true but R is not the correct explanation of A.A is true but R is false.A is false but R is true.

Accepted Answer

A is true but R is false.ExplanationStacks and queues are linear data structures because they organize data elements in a linear order, allowing elements to be accessed in a sequential manner. Python provides built-in data structures like lists, tuples, and dictionaries. Lists and tuples are examples of linear data structures as they store elements in a specific linear order, while dictionaries are non-linear data structures because they do not maintain a specific linear order, and elements are accessed based on their keys rather than indices.

Question 4

Question 3Write applications of Stack.

Accepted Answer

The applications of Stack include:Reversing a Word/Line — This can be accomplished by pushing each character on to a Stack as it is read. When the line is finished, characters are popped off the Stack and they will come off in the reverse order.Evaluation of Arithmetic Expressions — Stack is used to evaluate these arithmetic expressions on the basis of operator precedence.Processing Function Calls — The compilers use Stacks to store the previous state of a program when a function is called or during recursion.Backtracking — Backtracking is a form of recursion which involves choosing only one option out of the possibilities. Backtracking is used in a large number of puzzles like Sudoku and in optimization problems such as Knapsack.Undo Mechanism in Text Editors — This operation is accomplished by keeping all text changes in a Stack.

Question 5

Question 6Write an algorithm to pop an element from the Stack.

Accepted Answer

An algorithm to pop an element from the Stack is as follows:STARTSt_len = len(Stack) #Count the total number of elements in the Stack and checks whether the Stack is empty or notif St_len == []: or if not Stack: or If not len(Stack):print("Stack is empty")go to step 6element = Stack.pop() #Removing last element from top of the Stackprint(element)END

Question 6

Question 7Write an interactive menu-driven program implementing Stack using list. The list is storing numeric data.Solutiondef push(num):
    h = int(input("Enter a number: "))
    num.append(h)

def pop(num):
    if len(num) == 0:
        print("No number to delete")
    else:
        print("Deleted number is:", num.pop())

def display(num):
    print(num)

num = []
while True:
    print("1. Add number")
    print("2. Delete number")
    print("3. Display numbers")
    print("4. Exit")
    op = int(input("Enter the Choice: "))
    if op == 1:
        push(num)
    elif op == 2:
        pop(num)
    elif op == 3:
        display(num)
    elif op == 4:
        print("Exiting program.")
        break
    else:
        print("Invalid choice. Please enter a number between 1 and 4.")Output1. Add number
2. Delete number
3. Display numbers
4. Exit
Enter the Choice: 1
Enter a number: 2
1. Add number
2. Delete number
3. Display numbers
4. Exit
Enter the Choice: 1
Enter a number: 4
1. Add number
2. Delete number
3. Display numbers
4. Exit
Enter the Choice: 1
Enter a number: 6
1. Add number
2. Delete number
3. Display numbers
4. Exit
Enter the Choice: 1
Enter a number: 8
1. Add number
2. Delete number
3. Display numbers
4. Exit
Enter the Choice: 3
[2, 4, 6, 8]
1. Add number
2. Delete number
3. Display numbers
4. Exit
Enter the Choice: 2
Deleted number is: 8
1. Add number
2. Delete number
3. Display numbers
4. Exit
Enter the Choice: 3
[2, 4, 6]
1. Add number
2. Delete number
3. Display numbers
4. Exit
Enter the Choice: 4
Exiting program.

Accepted Answer

defpush(num):h=int(input("Enter a number: "))num.append(h)defpop(num):iflen(num)==0:print("No number to delete")else:print("Deleted number is:",num.pop())defdisplay(num):print(num)num=[]whileTrue:print("1. Add number")print("2. Delete number")print("3. Display numbers")print("4. Exit")op=int(input("Enter the Choice: "))ifop==1:push(num)elifop==2:pop(num)elifop==3:display(num)elifop==4:print("Exiting program.")breakelse:print("Invalid choice. Please enter a number between 1 and 4.")Output1. Add number2. Delete number3. Display numbers4. ExitEnter the Choice: 1Enter a number: 21. Add number2. Delete number3. Display numbers4. ExitEnter the Choice: 1Enter a number: 41. Add number2. Delete number3. Display numbers4. ExitEnter the Choice: 1Enter a number: 61. Add number2. Delete number3. Display numbers4. ExitEnter the Choice: 1Enter a number: 81. Add number2. Delete number3. Display numbers4. ExitEnter the Choice: 3[2, 4, 6, 8]1. Add number2. Delete number3. Display numbers4. ExitEnter the Choice: 2Deleted number is: 81. Add number2. Delete number3. Display numbers4. ExitEnter the Choice: 3[2, 4, 6]1. Add number2. Delete number3. Display numbers4. ExitEnter the Choice: 4Exiting program.

Question 7

Question 8Write an interactive menu-driven program to implement Stack using list. The list contains the names of students.Solutiondef push(student):
    h = input("Enter a name: ")
    student.append(h)

def pop(student):
    if len(student) == 0:
        print("No name to delete")
    else:
        print("Deleted name is:", student.pop())

def display(student):
    print(student)

student = []
while True:
    print("1. Add name")
    print("2. Delete name")
    print("3. Display names")
    print("4. Exit")
    op = int(input("Enter the Choice: "))
    if op == 1:
        push(student)
    elif op == 2:
        pop(student)
    elif op == 3:
        display(student)
    elif op == 4:
        print("Exiting program.")
        break
    else:
        print("Invalid choice. Please enter a number between 1 and 4.")Output1. Add name
2. Delete name
3. Display names
4. Exit
Enter the Choice: 1
Enter a name: Prajwal
1. Add name
2. Delete name
3. Display names
4. Exit
Enter the Choice: 1
Enter a name: Amrita
1. Add name
2. Delete name
3. Display names
4. Exit
Enter the Choice: 1
Enter a name: Kavya
1. Add name
2. Delete name
3. Display names
4. Exit
Enter the Choice: 1
Enter a name: Drishti
1. Add name
2. Delete name
3. Display names
4. Exit
Enter the Choice: 3
['Prajwal', 'Amrita', 'Kavya', 'Drishti']
1. Add name
2. Delete name
3. Display names
4. Exit
Enter the Choice: 2
Deleted name is: Drishti
1. Add name
2. Delete name
3. Display names
4. Exit
Enter the Choice: 3
['Prajwal', 'Amrita', 'Kavya']
1. Add name
2. Delete name
3. Display names
4. Exit
Enter the Choice: 4
Exiting program.

Accepted Answer

defpush(student):h=input("Enter a name: ")student.append(h)defpop(student):iflen(student)==0:print("No name to delete")else:print("Deleted name is:",student.pop())defdisplay(student):print(student)student=[]whileTrue:print("1. Add name")print("2. Delete name")print("3. Display names")print("4. Exit")op=int(input("Enter the Choice: "))ifop==1:push(student)elifop==2:pop(student)elifop==3:display(student)elifop==4:print("Exiting program.")breakelse:print("Invalid choice. Please enter a number between 1 and 4.")Output1. Add name2. Delete name3. Display names4. ExitEnter the Choice: 1Enter a name: Prajwal1. Add name2. Delete name3. Display names4. ExitEnter the Choice: 1Enter a name: Amrita1. Add name2. Delete name3. Display names4. ExitEnter the Choice: 1Enter a name: Kavya1. Add name2. Delete name3. Display names4. ExitEnter the Choice: 1Enter a name: Drishti1. Add name2. Delete name3. Display names4. ExitEnter the Choice: 3['Prajwal', 'Amrita', 'Kavya', 'Drishti']1. Add name2. Delete name3. Display names4. ExitEnter the Choice: 2Deleted name is: Drishti1. Add name2. Delete name3. Display names4. ExitEnter the Choice: 3['Prajwal', 'Amrita', 'Kavya']1. Add name2. Delete name3. Display names4. ExitEnter the Choice: 4Exiting program.

Question 8

Question 9How does FIFO describe queue?

Accepted Answer

FIFO, First In First Out, defines a queue because in a queue, elements are retrieved from one end (called the front end) and inserted at another end (rear end). Thus, at any time, in a queue, retrieval gets the oldest element, while always adding to the rear of the queue. Thus, items are processed in first-in, first-out (FIFO) order.

Question 9

Question 10Write a menu-driven Python program using queue to implement movement of shuttlecock in its box.Solutionqueue = []

def display_queue():
    if not queue:
        print("Queue is empty")
    else:
        print("Current queue:", queue)

def enqueue(item):
    queue.append(item)

def dequeue():
    if queue:
        removed = queue.pop(0)
        print("Removed", removed, "from the queue")
    else:
        print("Queue is empty, cannot remove")

while True:
    print("
MENU:")
    print("1. Add movement to the queue")
    print("2. Remove movement from the queue")
    print("3. Display current queue")
    print("4. Exit")
    
    choice = input("Enter your choice (1-4): ")

if choice == '1':
        movement = input("Enter the movement (up/down): ")
        enqueue(movement)
        print("Added", movement, "to the queue")
    elif choice == '2':
        dequeue()
    elif choice == '3':
        display_queue()
    elif choice == '4':
        print("Exiting program...")
        break
    else:
        print("Invalid choice, please try again")Output
MENU:
1. Add movement to the queue
2. Remove movement from the queue
3. Display current queue
4. Exit
Enter your choice (1-4): 1
Enter the movement (up/down): up
Added up to the queue

MENU:
1. Add movement to the queue
2. Remove movement from the queue
3. Display current queue
4. Exit
Enter your choice (1-4): 1
Enter the movement (up/down): down
Added down to the queue

MENU:
1. Add movement to the queue
2. Remove movement from the queue
3. Display current queue
4. Exit
Enter your choice (1-4): 3
Current queue: ['up', 'down']

MENU:
1. Add movement to the queue
2. Remove movement from the queue
3. Display current queue
4. Exit
Enter your choice (1-4): 2
Removed up from the queue

MENU:
1. Add movement to the queue
2. Remove movement from the queue
3. Display current queue
4. Exit
Enter your choice (1-4): 3
Current queue: ['down']

MENU:
1. Add movement to the queue
2. Remove movement from the queue
3. Display current queue
4. Exit
Enter your choice (1-4): 4
Exiting program...

Accepted Answer

queue=[]defdisplay_queue():ifnotqueue:print("Queue is empty")else:print("Current queue:",queue)defenqueue(item):queue.append(item)defdequeue():ifqueue:removed=queue.pop(0)print("Removed",removed,"from the queue")else:print("Queue is empty, cannot remove")whileTrue:print("
MENU:")print("1. Add movement to the queue")print("2. Remove movement from the queue")print("3. Display current queue")print("4. Exit")choice=input("Enter your choice (1-4): ")ifchoice=='1':movement=input("Enter the movement (up/down): ")enqueue(movement)print("Added",movement,"to the queue")elifchoice=='2':dequeue()elifchoice=='3':display_queue()elifchoice=='4':print("Exiting program...")breakelse:print("Invalid choice, please try again")OutputMENU:1. Add movement to the queue2. Remove movement from the queue3. Display current queue4. ExitEnter your choice (1-4): 1Enter the movement (up/down): upAdded up to the queueMENU:1. Add movement to the queue2. Remove movement from the queue3. Display current queue4. ExitEnter your choice (1-4): 1Enter the movement (up/down): downAdded down to the queueMENU:1. Add movement to the queue2. Remove movement from the queue3. Display current queue4. ExitEnter your choice (1-4): 3Current queue: ['up', 'down']MENU:1. Add movement to the queue2. Remove movement from the queue3. Display current queue4. ExitEnter your choice (1-4): 2Removed up from the queueMENU:1. Add movement to the queue2. Remove movement from the queue3. Display current queue4. ExitEnter your choice (1-4): 3Current queue: ['down']MENU:1. Add movement to the queue2. Remove movement from the queue3. Display current queue4. ExitEnter your choice (1-4): 4Exiting program...

Question 10

Question 11Give the necessary declaration of a list implemented Stack containing float type numbers. Also, write a user-defined function to pop a number from this Stack.Solution# Declaration for list implemented stack
Stack = list()
#Function body to pop a number from the stack
def pop_element(Stack):
    if not Stack:
        print("Stack is empty")
    else:
        Num = Stack.pop() 
        print("Value deleted from stack is", Num)

Stack = [1.5, 2.7, 3.2, 4.9]
print("Initial Stack:", Stack)

pop_element(Stack)
print("Stack after pop operation:", Stack)OutputInitial Stack: [1.5, 2.7, 3.2, 4.9]
Value deleted from stack is 4.9
Stack after pop operation: [1.5, 2.7, 3.2]

Accepted Answer

# Declaration for list implemented stackStack=list()#Function body to pop a number from the stackdefpop_element(Stack):ifnotStack:print("Stack is empty")else:Num=Stack.pop()print("Value deleted from stack is",Num)Stack=[1.5,2.7,3.2,4.9]print("Initial Stack:",Stack)pop_element(Stack)print("Stack after pop operation:",Stack)OutputInitial Stack: [1.5, 2.7, 3.2, 4.9]Value deleted from stack is 4.9Stack after pop operation: [1.5, 2.7, 3.2]

Question 11

Question 12A linear Stack called Directory contains the following information as contacts:— Pin code of city— Name of cityWrite add(Directory) and delete(Directory) methods in Python to add and remove contacts using append() and pop() operations in Stack.Solutiondef add(Directory):
    pincode = int(input("Enter pincode of city: "))
    cityname = input("Enter the city name: ")
    contact = [pincode, cityname]
    Directory.append(contact)

def delete(Directory):
    if (Directory == []):
        print("Directory is empty")
    else:
        print("Deleted contact:", Directory.pop())
        
Directory = []
add(Directory)
add(Directory)
print("Initial Directory Stack:", Directory)

delete(Directory)
print("Directory Stack after deletion:", Directory)OutputEnter pincode of city: 586789
Enter the city name: Bangalore
Enter pincode of city: 567890
Enter the city name: Mysore
Initial Directory Stack: [[586789, 'Bangalore'], [567890, 'Mysore']]
Deleted contact: [567890, 'Mysore']
Directory Stack after deletion: [[586789, 'Bangalore']]

Accepted Answer

defadd(Directory):pincode=int(input("Enter pincode of city: "))cityname=input("Enter the city name: ")contact=[pincode,cityname]Directory.append(contact)defdelete(Directory):if(Directory==[]):print("Directory is empty")else:print("Deleted contact:",Directory.pop())Directory=[]add(Directory)add(Directory)print("Initial Directory Stack:",Directory)delete(Directory)print("Directory Stack after deletion:",Directory)OutputEnter pincode of city: 586789Enter the city name: BangaloreEnter pincode of city: 567890Enter the city name: MysoreInitial Directory Stack: [[586789, 'Bangalore'], [567890, 'Mysore']]Deleted contact: [567890, 'Mysore']Directory Stack after deletion: [[586789, 'Bangalore']]

Question 12

Question 13Write add(Books) and delete(Books) methods in Python to add Books and Remove Books considering them to act as append() and pop() operations in Stack.Solutiondef add(Books):
    bookname = input("Enter the book name: ")
    Books.append(bookname)

def delete(Books):
    if Books == []:
        print("Books is empty")
    else:
        print("Deleted Book", Books.pop())
        
Books = []

add(Books)
add(Books)
add(Books)
print("Initial Books Stack:", Books)

delete(Books)
print("Books Stack after deletion:", Books)OutputEnter the book name: Three thousand stitches
Enter the book name: Wings of fire
Enter the book name: Ignited minds
Initial Books Stack: ['Three thousand stitches', 'Wings of fire', 'Ignited minds']
Deleted Book Ignited minds
Books Stack after deletion: ['Three thousand stitches', 'Wings of fire']

Accepted Answer

defadd(Books):bookname=input("Enter the book name: ")Books.append(bookname)defdelete(Books):ifBooks==[]:print("Books is empty")else:print("Deleted Book",Books.pop())Books=[]add(Books)add(Books)add(Books)print("Initial Books Stack:",Books)delete(Books)print("Books Stack after deletion:",Books)OutputEnter the book name: Three thousand stitchesEnter the book name: Wings of fireEnter the book name: Ignited mindsInitial Books Stack: ['Three thousand stitches', 'Wings of fire', 'Ignited minds']Deleted Book Ignited mindsBooks Stack after deletion: ['Three thousand stitches', 'Wings of fire']

Question 13

Question 14Write AddClient(Client) and DeleteClient(Client) methods in Python to add a new client and delete a client from a list client name, considering them to act as insert and delete operations of the Queue data structure.Solutiondef AddClient(client):
    client_name = input("Enter client name: ")
    client.append(client_name)

def DeleteClient(client):
    if client == []:
        print("Queue is empty")
    else:
        print("Deleted client:", client.pop(0))

client = []

AddClient(client)
AddClient(client)
AddClient(client)
print("Initial Client Queue:", client)

DeleteClient(client)
print("Client Queue after deletion:", client)OutputEnter client name: Rahul
Enter client name: Tanvi
Enter client name: Vidya
Initial Client Queue: ['Rahul', 'Tanvi', 'Vidya']
Deleted client: Rahul
Client Queue after deletion: ['Tanvi', 'Vidya']

Accepted Answer

defAddClient(client):client_name=input("Enter client name: ")client.append(client_name)defDeleteClient(client):ifclient==[]:print("Queue is empty")else:print("Deleted client:",client.pop(0))client=[]AddClient(client)AddClient(client)AddClient(client)print("Initial Client Queue:",client)DeleteClient(client)print("Client Queue after deletion:",client)OutputEnter client name: RahulEnter client name: TanviEnter client name: VidyaInitial Client Queue: ['Rahul', 'Tanvi', 'Vidya']Deleted client: RahulClient Queue after deletion: ['Tanvi', 'Vidya']

Question 14

Question 15Write Addscore(Game) and Delscore(Game) methods in Python to add new Score in the list of score in a game and remove a score from a list of score of a game considering these methods to act as PUSH and POP operation of data structure Stack.Solutiondef Addscore(Game):
    score = int(input("Enter the score to add: "))
    Game.append(score)

def Delscore(Game):
    if Game == []:
        print("Game's score list is empty")
    else: 
        print("Deleted score:", Game.pop())

Game = []

Addscore(Game)
Addscore(Game)
Addscore(Game)
print("Initial Game Stack:", Game)

Delscore(Game)
print("Game Stack after deletion:", Game)OutputEnter the score to add: 10
Enter the score to add: 15
Enter the score to add: 20
Initial Game Stack: [10, 15, 20]
Deleted score: 20
Game Stack after deletion: [10, 15]

Accepted Answer

defAddscore(Game):score=int(input("Enter the score to add: "))Game.append(score)defDelscore(Game):ifGame==[]:print("Game's score list is empty")else:print("Deleted score:",Game.pop())Game=[]Addscore(Game)Addscore(Game)Addscore(Game)print("Initial Game Stack:",Game)Delscore(Game)print("Game Stack after deletion:",Game)OutputEnter the score to add: 10Enter the score to add: 15Enter the score to add: 20Initial Game Stack: [10, 15, 20]Deleted score: 20Game Stack after deletion: [10, 15]

Question 15

Question 16Write a Python program to sort a Stack in ascending order without using an additional Stack.Solutiondef pushSorted(s, num):
	if len(s) == 0 or num > s[-1]:
		s.append(num)
		return
	else:
		t = s.pop()
		pushSorted(s, num)
		s.append(t)

def doSort(s):
	if len(s) != 0:
		t = s.pop()
		doSort(s)
		pushSorted(s, t)

s = []
s.append(12)
s.append(5)
s.append(-3)
s.append(4)
s.append(10)

print("Stack before sorting: ")
print(s)

doSort(s)

print("
Stack after sorting: ")
print(s)OutputStack before sorting: 
[12, 5, -3, 4, 10]

Stack after sorting:
[-3, 4, 5, 10, 12]

Accepted Answer

defpushSorted(s,num):iflen(s)==0ornum>s[-1]:s.append(num)returnelse:t=s.pop()pushSorted(s,num)s.append(t)defdoSort(s):iflen(s)!=0:t=s.pop()doSort(s)pushSorted(s,t)s=[]s.append(12)s.append(5)s.append(-3)s.append(4)s.append(10)print("Stack before sorting: ")print(s)doSort(s)print("
Stack after sorting: ")print(s)OutputStack before sorting: [12, 5, -3, 4, 10]Stack after sorting:[-3, 4, 5, 10, 12]

Question 16

Question 17A Stack STK and Queue QUE is being maintained. Their maximum size is the same:(i) check whether they have the same size, i.e., have the same number of elements.(ii) check for equality of Stack and Queue, i.e.,Retrieve an element from the Stack and one element from the Queue.Compare the two.Stop and report if elements are different.Solutiondef is_empty(stack_or_queue):
    return len(stack_or_queue) == 0

def size(stack_or_queue):
    return len(stack_or_queue)

def check_size_equality(stack, queue):
    return size(stack) == size(queue)

def check_element_equality(stack, queue):
    if check_size_equality(stack, queue) == False:
        print("The size of stack and Queue is not equal.")
        return False
    
    while not is_empty(stack) and not is_empty(queue):
        stack_element = stack.pop()
        queue_element = queue.pop(0)

if stack_element != queue_element:
            return False

return True

STK = [1, 2, 3]
QUE = [3, 2, 1]

print("Size Equality Check:", check_size_equality(STK, QUE))

print("Element Equality Check:", check_element_equality(STK, QUE))OutputSize Equality Check: True
Element Equality Check: True

Accepted Answer

defis_empty(stack_or_queue):returnlen(stack_or_queue)==0defsize(stack_or_queue):returnlen(stack_or_queue)defcheck_size_equality(stack,queue):returnsize(stack)==size(queue)defcheck_element_equality(stack,queue):ifcheck_size_equality(stack,queue)==False:print("The size of stack and Queue is not equal.")returnFalsewhilenotis_empty(stack)andnotis_empty(queue):stack_element=stack.pop()queue_element=queue.pop(0)ifstack_element!=queue_element:returnFalsereturnTrueSTK=[1,2,3]QUE=[3,2,1]print("Size Equality Check:",check_size_equality(STK,QUE))print("Element Equality Check:",check_element_equality(STK,QUE))OutputSize Equality Check: TrueElement Equality Check: True

Question 17

Question 18(i)Write an algorithm to insert element into Stack as a list.

Accepted Answer

An algorithm to insert element into Stack as a list is as follows:STARTStack = list() or Stack = [] #Initialize a Stack using listelement = input("Enter the value to be added in the stack: ")Stack.append(element) #Adding element into listEND

Question 18

Question 18(ii)Write an algorithm to insert element into Queue as a list.

Accepted Answer

An algorithm to insert element into Queue as a list is as follows:STARTQueue = list() or Queue = [] #Initialize a Queue using listelement = input("Enter the element to be added to the Queue: ")Queue.append(element) #Adding element into the list QueueSTOP

Question 19

Question 19Write a program to create a Stack for storing only odd numbers out of all the numbers entered by the user. Display the content of the Stack along with the largest odd number in the Stack.(Hint: Keep popping out the elements from Stack and maintain the largest element retrieved so far in a variable. Repeat till Stack is empty.)Solutiondef push(stack, item):
    stack.append(item)

def pop(stack):
    if stack == []:
        return None
    return stack.pop()

def oddStack(num):
    if num % 2 == 1:
        push(stack, num)

def GetLargest(stack):
    elem = pop(stack)
    large = elem
    while elem != None:
        if large < elem:
            large = elem
        elem = pop(stack)
    return large

n = int(input("How many numbers?"))
stack = []
for i in range(n):
    number = int(input("Enter number:"))
    oddStack(number)
print("Stack created is", stack)
bigNum = GetLargest(stack)
print("Largest number in stack", bigNum)OutputHow many numbers?8
Enter number:1
Enter number:2
Enter number:3
Enter number:4
Enter number:5
Enter number:6
Enter number:7
Enter number:8
Stack created is [1, 3, 5, 7]
Largest number in stack 7

Accepted Answer

defpush(stack,item):stack.append(item)defpop(stack):ifstack==[]:returnNonereturnstack.pop()defoddStack(num):ifnum%2==1:push(stack,num)defGetLargest(stack):elem=pop(stack)large=elemwhileelem!=None:iflargeelem:large=elemelem=pop(stack)returnlargen=int(input("How many numbers?"))stack=[]foriinrange(n):number=int(input("Enter number:"))oddStack(number)print("Stack created is",stack)bigNum=GetLargest(stack)print("Largest number in stack",bigNum)OutputHow many numbers?8Enter number:1Enter number:2Enter number:3Enter number:4Enter number:5Enter number:6Enter number:7Enter number:8Stack created is [1, 3, 5, 7]Largest number in stack 7

Question 20

Question 20Write a program that, depending upon the user's choice, either adds or removes an element from a Stack.Solutiondef add(stack):
    h = input("Enter element: ")
    stack.append(h)

def remove(stack):
    if len(stack) == 0:
        print("No element to delete")
    else:
        print("Deleted element is:", stack.pop())

stack = []
while True:
    print("1. Add element")
    print("2. Delete element")
    print("3. Exit")
    op = int(input("Enter the Choice: "))
    if op == 1:
        add(stack)
    elif op == 2:
        remove(stack)
    elif op == 3:
        print("Exiting program.")
        breakOutput1. Add element
2. Delete element
3. Exit
Enter the Choice: 1
Enter element: 11
1. Add element
2. Delete element
3. Exit
Enter the Choice: 1
Enter element: 33
1. Add element
2. Delete element
3. Exit
Enter the Choice: 1
Enter element: 44
1. Add element
2. Delete element
3. Exit
Enter the Choice: 2
Deleted element is: 44
1. Add element
2. Delete element
3. Exit
Enter the Choice: 1
Enter element: 55
1. Add element
2. Delete element
3. Exit
Enter the Choice: 2
Deleted element is: 55
1. Add element
2. Delete element
3. Exit
Enter the Choice: 3
Exiting program.

Accepted Answer

defadd(stack):h=input("Enter element: ")stack.append(h)defremove(stack):iflen(stack)==0:print("No element to delete")else:print("Deleted element is:",stack.pop())stack=[]whileTrue:print("1. Add element")print("2. Delete element")print("3. Exit")op=int(input("Enter the Choice: "))ifop==1:add(stack)elifop==2:remove(stack)elifop==3:print("Exiting program.")breakOutput1. Add element2. Delete element3. ExitEnter the Choice: 1Enter element: 111. Add element2. Delete element3. ExitEnter the Choice: 1Enter element: 331. Add element2. Delete element3. ExitEnter the Choice: 1Enter element: 441. Add element2. Delete element3. ExitEnter the Choice: 2Deleted element is: 441. Add element2. Delete element3. ExitEnter the Choice: 1Enter element: 551. Add element2. Delete element3. ExitEnter the Choice: 2Deleted element is: 551. Add element2. Delete element3. ExitEnter the Choice: 3Exiting program.

Data Structures in Python

Assertions And Reasons

Solutions To Unsolved Questions

State True Or False