Homework Answers

: Facing in any direction and given enough turns, it can move from any square on the board to any other square. If you want to know the simplest way your knight can move from one square (or node) to another in a two-dimensional setup, you will first have to build a function like the one below. knight plays ([0,0], [1,2]) == [[0,0], [1,2]] knight plays ([0,0], [3,3]) == [[0,0], [1,2], [3,3]] knight plays ([3,3], [0,0]) == [[3,3], [1,2], [0,0]] You are required to do the following: 1. Explain how you can ensure that any move do not go off the board. 2. Choosing a search algorithm for finding the shortest path for the knight’s travails.3. Create a diagrammatical tree structure, to illustrate all possible moves of the knight as children in the tree structure. In this task, you need to understand two algorithms which can be helpful, the Breadth-First Search which utilizes the Queue data structure to find the shortest path and the Depth-First Search which can traverse a Stack data structures.

You have been contracted by Toyota Zambia to design a system that can make the Toyota Mark X a smart vehicle. The company has proposed to install four infrared radars on the car, just below each light set, to use as sensors. Each sensor has a range of 20m. The company wants the car to be able to avoid collisions at the rear, and the front, and to be able to auto accelerate to a recommended spend if the course is clear or when collision is eminent at the rare and the front is clear, and to be able to overtake a vehicle on the road without causing any accident. The sensors can pick human body heat at a distance of 15m, and a vehicle body heat at 20m.

the car to be able to avoid collisions at the rear, and the front, and to be able to auto accelerate to a recommended spend if the course is clear or when collision is eminent at the rare and the front is clear, and to be able to overtake a vehicle on the road without causing any accident.

Write C++ statement to do the following

a.make a point to the node containing info 23.

b.make a list point to the node containing 26.

c.make b point to the last node in the list

d.make list point to an empty list

e.set the value of the node containing 25 to 35.

f.create and insert the node with info 10 after the node pointed to by A.

g.delete the node with info 23,also deal locate the memory occupied by this node.

2. Write an application that contains an array of 10 multiple-choice quiz questions related to

your favorite hobby. Each question contains three answer choices. Also create an array

that holds the correct answer to each question—A, B, or C. Display each question and

verify that the user enters only A, B, or C as the answer—if not, keep prompting the user

until a valid response is entered. If the user responds to a question correctly, display

Correct; otherwise, display the correct answer is and the letter of the correct answer. After

the user answers all the questions, display the number of correct and incorrect answers.

Save the file as Quiz.java.