Define a mutable structure in Racket programme for a library (remember: you can choose sets or lists, it is your choice, they are both acceptable for what you need to do next).

please complete the following in JAVA Implement the graph ADT using the adjacency list structure. thanks! also posting a similar question for adjacency matrix. have a good day!

For C++ How do you use a linked list to construct a Queue?

1. fast please in c++

What makes the restricted implementation of the stack different from the unbounded implementation of the stack?

Explore the stack's capabilities when allowed to be itself.

write in c++ Given a class declaration for a list implemented using a linked list (like NumberList) implement some of the functions (like the constructor, the destructor, append a node to the end, remove the last node, remove the node in position i, etc).

Simple JAVA queue code implementation please help for any part, please be clear, thank you Given an interface for Queue- Without using the java collections interface (ie do not import java.util.List,LinkedList, Stack, Queue...)- Create an implementation of Queue interface provided- For the implementation create a tester to verify the implementation of thatdata structure performs as expected Wait in line – Queue (fifo)- Implement the provided Queue interface ( fill out the implementation shell)- Put your implementation through its paces by exercising each of the methods ina test harness- Add to your ‘BusClient’ the following functionality using your Queue-o Create (enqueue) 6 riders by name§ Iterate over the queue, print all riderso Peek at the queue / print the resulto Remove (dequeue) the head of the queue§ Iterate over the queue, print all riderso Add two more riders to the queueo Peek at the queue & print the resulto Remove the head & print the result§ Iterate over the…

Use Python for this question. Also please comment what each line of code means for this question as well: Inheritance (based on 8.38) You MUST use inheritance for this problem. A stack is a sequence container type that, like a queue, supports very restrictive access methods: all insertions and removals are from one end of the stack, typically referred to as the top of the stack.  A stack is often referred to as a last-in first-out (LIFO) container because the last item inserted is the first removed.  Implement a Stack class using Note that this means you may be able to inherit some of the methods below.  Which ones?  (Try not writing those and see if it works!) Constructor/_init__ - Can construct either an empty stack, or initialized with a list of items, the first item is at the bottom, the last is at the top. push() – take an item as input and push it on the top of the stack pop() – remove and return the item at the top of the stack isEmpty() – returns True if the stack is empty,…

What makes the restricted implementation of the stack different from the unbounded implementation of the stack?