Consider a block stacking robot with the following actions: 1 Stack(x, y) • Preconditions: Clear(y), Holding(x) • Effects: armEmpty, On(x, y), ¬Clear(y), ¬Holding(x) 1 Unstack(x, y) • Preconditions: Clear(x), On(x, y), armEmpty Effects: narmEmpty, ¬On(x, y), Clear(y), Holding(x) 1 Pickup(x) • Preconditions: Clear(x), On(x, TABLE), armEmpty • Effects: narmEmpty, ¬On(x, TABLE), Holding(x) • Putdown(x) • Preconditions: Holding(x) • Effects: armEmpty, On(x, TABLE), ¬Holding(x) Create a plan for each of the initial state/goal pairs below Assume armEmpty is in initial state and the table has infinite space A Initial state: B A Goal state: В a. A В Initial state: В Goal state: A b. A C B Initial state: A В Goal state: C C.

Multi-layered perceptrons (MLP) represent an abstraction of neuronal networks in brains. a) Describe how MLPs process an input to produce an output.b) Backpropagation is often used to learn the weights of an MLP. Give a very brief description of how it works.

Implement a queue Q with two stacks S1 and S2, so that the stacks that operate together as a queue may perform the operations ENQUEUE(Q, X) and DEQUEUE(Q, Y), where Q appears to be a queue and X is the element to be inserted into Q and Y is the element to be removed from Q. Assume that the ADT operations PUSH, POP, and EMPTYSTACK are only available for stacks.Show how your technique works on a list a, b, c, which will be utilised as a queue by the stacks S1 and S2.

Data structure and algorithm in java

Implement a stack algorithm (write pseudocode) assuming there is a bound, in any state of the execution, on the total difference between the number of pushes and pops to the stack.

Implement a stack S using two queues Q1 and Q2 so that operations PUSH (S,X) and POP(S, Y), where S is supposedly a stack and X is the element to be insertedinto S and Y the element deleted from S, are worked upon by the queues that operatetogether as a stack. Assume that the ADT operations of ENQUEUE, DEQUEUE andEMPTYQUEUE are only available for the queues.Demonstrate the working of your method on a list {a, b, c}, which is to beoperated upon as a stack by the queues Q1 and Q2.

Two stacks of positive integers are needed, one containing elements withvalues less than or equal to 1,000 and the other containing elements with values larger than 1,000.The total number of elements in the small-value stack and the large-value stack combined are notmore than 200 at any time, but we cannot predict how many are in each stack. (All of the elements2could be in the small-value stack, they could be evenly divided, both stacks could be empty, andso on.).   Implement the push operation; it should store the new item into the correct stack accordingto its value (compared to 1,000).

Answer the following two questions correctly. This is in Python. Explain your reasoning.

The following figure is a diagram of a small convolutional neural network that converts a 16x16 image into 4 output values (16x16 - 4x12x12 → 4x6x6 6x1). The network has the following layers/operations from input to output: convolution with 4 filters, max pooling, ReLu (after pooling), and finally a fully-connected layer (with no hidden layer). For this network we will not be using any bias/offset parameters. Please answer the following questions about this network. 16x16 Convolution 4 filters 5x5 Stride 1 4@12x12 max pooling 2x2 Stride 2 4@6x6 6x1 fully- connected