Q8. Consider the Stack ADT implemented using a Python list (called items) such that push() and pop() are defined as follows: def push(self, item): self.items.insert(0, item) def pop(self): return self.items.pop(0) What is the big-O complexity of push() and pop()? (A) both push() and pop() are O(n) (B) pop() is O(1) but push() is O(n) (C) push() is O(1) but pop() is O(n) (D) both push0 and pop() are O(n)

Consider a (literal) plate stack. If the stack becomes too tall, it may collapse.In practise, we would most likely create a new stack when the preceding stack reaches a certain threshold. Create a data structure SetOfStacks that is similar to this. SetOfStacks should be made up of many stacks and should build a new stack when the preceding one reaches its capacity.SetOfStacks. Push() and SetOfStacks are both functions. pop() should operate exactly like a single stack (that is, it should return the same values as if there were just one stack).COMPLETE THE FORMULACreate a popAt(int index) method that executes a pop operation on a given substack.

Implement a nonrecursive version of quicksort basedon a main loop where a subarray is popped from a stack to be partitioned, and the resulting subarrays are pushed onto the stack. Note : Push the larger of the subarrays ontothe stack first, which guarantees that the stack will have at most lg N entries.

The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.

A palindrome is a sequence of characters whose reversal gives the same sequence.Examples are “radar” and “noon”. Using a stack and a queue, write an algorithm thatreads a string, and determines if the string contains a palindrome/s. Display thepalindrome/s found. Implement your algorithm in Java or C++. Note:➢ convert your string to lowercase➢ do not use strings or arrays except when implementing the stack and the queueand for storage of your input string➢ do not use any built-in method to determine if a word is a palindrome Sample runs:1. Input : madamOutput : palindrome/s in the string : madam 2. input : I love madam ABBA Output : palindrome/s in the string : madam abba ("i" shoud not be included as palindrome) 3. input : the quick brown foxOutput : palindrome/s in the string : no palindrome

write a pseudocode

Write a Java program that: • Defines a linked list data structure to represent a collection of integers. • Populates the linked list with random integers. • Implements three different operations on the linked list: Finding the maximum element Finding the minimum element Calculating the sum of all elements • Tests these operations and ensures their correctness. Provide a big-Oh characterization, in terms of n, of the time complexity for each of the implemented operations on the linked list. Improve the linked list implementation to have a method for removing duplicates in O(N) time complexity.

JAVA CODE

Implement in Python a double-ended queue (deque): A double-ended queue is a data structure (ordered collection of items) similar to a traditional queue. It has two ends, front and end, but it is not restricted to adding or removing items. New items can be added on the front or on the end. Existing items can be removed from either end. The image graphically shows how the structure is. - Implement the requested structure using a single linked list, which implements the following functions: enterFront, enterEnd, removeFront, removeEnd- The data to be entered are animal-type objects; name, type of animal, age- Create a Main function with the available operations

Write a program SentenceReverser that reverses the words in a sentence by reading words into a Stack until you find a period.  Your program should then pop off the words from the stack.  Begin your reverse sentence with a capital letter and end it with a period.   Your program should be able to handle multiple sentences.  Use while (scan.hasNext()) to capture your input.    Mary had a little lamb.  His fleece was as white as snow. Becomes:   Lamb little a had mary. Snow as white as was fleece his.   Note: Your test input should include multiple sentences as shown above.  There should NOT be a space before your periods.