Data Structures and Algorithm (C Programming) You applied to Google for an internship and they wanted to test your abilities to come up with novel data structures. The company is currently developing tiny robots that has very limited memory and computational resources. They are in need of data structures to be used in embedded system implementation of the robot. Since it is easier to handle and process arrays than linked lists, the company want the data structures to be array based, which will be desirable for a limited system. Answer the questions below accordingly. (a) You are being asked to design a new stack that Google wants to name as Amphisbaena. Amphisbaena will actually be two stacks on a single array of size n, without the two overflowing each other unless there are n elements in total among both stacks. In plain English, explain a data structure that will dynamically and efficiently hold two stacks together in a single structure. (b) You need to design a queue, weirdly enough named as Ourobors, to be used in the robot’s operating system. Since, the runtime of dequeue operation of a standard queue would be inefficient for the robot, Ouroboros should support a constant time dequeue operation. In plain English, suggest and explain such a queue structure.

*Data Structures and Algorithm (C Programming)

You applied to Google for an internship and they wanted to test your abilities to come up with novel data structures. The company is currently developing tiny robots that has very limited memory and computational resources. They are in need of data structures to be used in embedded system implementation of the robot. Since it is easier to handle and process arrays than linked lists, the company want the data structures to be array based, which will be desirable for a limited system. Answer the questions below accordingly.

(a) You are being asked to design a new stack that Google wants to name as Amphisbaena. Amphisbaena will actually be two stacks on a single array of size n, without the two overflowing each other unless there are n elements in total among both stacks. In plain English, explain a data structure that will dynamically and efficiently hold two stacks together in a single structure.

(b) You need to design a queue, weirdly enough named as Ourobors, to be used in the robot’s operating system. Since, the runtime of dequeue operation of a standard queue would be inefficient for the robot, Ouroboros should support a constant time dequeue operation. In plain English, suggest and explain such a queue structure.