Question

Question 9 0 / 10 points Describe the basic operations that can be performed on a stack. Write an algorithm (using bullet points or a description, not Java or C) which shows how to remove an item from a stack that is implemented as an array. No text entered - This question has not been graded. The correct answer is not displayed for Written Response type questions. Question 10 0 / 10 points What are the main characteristics of a generic linked list? Describe how elements can be added to, and deleted from, such a list. No text entered - This question has not been graded. The correct answer is not displayed for Written Response type questions. Done

Answer 1

1. Basic operations that can be performed on the Stack:
POP: is uded to remove the top element of the statck
PUSH: to add a new element on the top of the Stack
PEEK: is uesd to get the top element of the stack not removed.
isEmpty: to query if the stack is empty or no element

Element can be removed from the top of the stack as:
let i points to the last element of the array
a: removedElement = Array[i]
b: Array[i] = null or some other clearing data as 0
c: i-- i.e. decrement index

Characteristic to generic linked list
a linked llist is a data structure that is used to store data into non contagious memory spaces and these space or nodes are interlinked by containg the reference to the next or previous nodes.
A generic Linklist is used to store a data of any type may be Integer, Double, or some userdefined Objects

Element can be added to generric LL using
linkedlist add method which has two version as
ll.add(Object o)
ll.add(int index, Object o)

also elements can be added to first and last of the linkedlist using
ll.addLast(Object o)
ll.addFirst(Object o)

and can be removed using
ll.remove(Object o)
ll.remove(int index, Object o)
ll.removeFirst()
ll.removeLast()