IN C LANGUAGE True or False: You can not store multiple linked lists in a contiguous block of memory, even if there is space available for new nodes.

QueueArray.java This file implements QueueInterface.java This file has * attributes of an array holding queue elements. An integer represents front * index, an integer for rear index, and an integer to keep track number of * elements in the queue. An overloaded constructor accepts an integer for * initializing the queue size, e.g. array size. An enqueue method receives an * object and place the object into the queue. The enqueue method will throw * exception with message "Overflow" when the queue is full. A dequeue method * returns and removes an object from front of the queue. The dequeue method * will throw exception with message "Underflow" when the queue is empty. A size * method returns number of elements in the queue. A toString method returns a * String showing size and all elements in the queue.

What are the operations that can be performed on a stack?

BankCustomerQueueADT Implement in C++ a BankCustomer QueueADT that does the following: 1. gets the input about a customer (first name, last name, Bank Account Number, Money to be withdrawn/deposited, etc.) from the user (from the keyboard) 2. inserts (enqueues) the Customer as a record into the BankCustomerQueueADT (your Queue ADT must be able to have a maximum of 20 customer records) 3. removes (dequeues) the Customer record from the BankCustomerQueueADT 4. your BankCustomerQueueADT must also have the behavior of retrieving and displaying the Queue info on the screen after each event (either entry of a Bank Customer into the queue, OR leaving of the Bank customer from the queue). NOTE: Please make sure you debug, run, test and see the program working correctly before submitting. Make sure all the code statements are commented. Make sure your program is indented properly.

Q10 Please explain your answers

def__init__(self): """ ------------------------------------------------------- Initializes an empty Queue. Data is stored in a Python list. Use: source = Queue() ------------------------------------------------------- Returns‌​‌​​​​‌​​‌‌​​​‌​​​​‌‌​‌​‌‌‌: a new Queue object (Queue) ------------------------------------------------------- """ self._values = []   defis_empty(self): """ ------------------------------------------------------- Determines if source is empty. Use: b = source.is_empty() ------------------------------------------------------- Returns‌​‌​​​​‌​​‌‌​​​‌​​​​‌‌​‌​‌‌‌: True if source is empty, False otherwise. ------------------------------------------------------- """ return len(self._values) == 0   def__len__(self): """ ------------------------------------------------------- Returns the length of source. Use: n = len(source) ------------------------------------------------------- Returns‌​‌​​​​‌​​‌‌​​​‌​​​​‌‌​‌​‌‌‌: the number of values in source (int >= 0)…

In C++, develop an algorithm that adds the value val to a queue object Q. The queue is represented using an array data of size s. The algorithm should assume that the queue is not full. The most recently added item is at index r (rear), and the least recently added item is at index f (front). If the queue is empty, r = f = -1.

A(n) array can be used in an array implementation of a queue to avoid an overflow error at the rear of the queue when the queue is not full.

Stack: Stacks are a type of container with LIFO (Last In First Out) type of working, where a new element is added at one end and (top) an element is removed from that end only. Your Stack should not be of the fixed sized. It should be able to grow itself. bool empty() : Returns whether the Stack is empty or not. Time Complexity should be: O(1) bool full() : Returns whether the Stack is full or not. Time Complexity should be: O(1)int size() : Returns the current size of the Stack. Time Complexity should be: O(1)Type top () : Returns the last element of the Stack. Time Complexity should be: O(1) void push(Type) : Adds the element of type Type at the top of the stack. Time Complexity    should be: O(1) Type pop() : Deletes the top most element of the stack and returns it. Time Complexity    should be: O(1) Write non-parameterized constructor for the above class. Write Copy constructor for the above class. Write Destructor for the above class. Now write a global function show stack which…

None