Algorithm that enables the robots to count the number of rooms when placed anywhere in the room: Step1: Move to the corner of the room with the wall or window on the right side. Step 2: Set the value of the “windowCount” to zero. Step 3: Set the value of the “side_count” to zero. Step 4: While what in the front is not a window or a wall, Step 5: move forward one unit and turn left. Step 6: Loop while what in the front is not a window or a wall, move forward one unit Step 7: while the “side_count < 4” Step 8: Examine the first square of the wall and turn right. Step 9: Set the value of “last_seen= what is in the front of the robot” and turn right. Step 10: Examine every square and the incrementing window when the robot moves from the window to wall that is to the end of the window. Step 11: Loop while what in the front is not a window or a wall, move forward one square and turn left. Step 12: if the “wall is in front AND last_seen =windows” Step 13: Add one to the window count...

Question

Want to see the full answer?

Answer 1

Expert Solution & Answer

Chapter 1, Problem 7PP

Explanation of Solution

Algorithm that enables the robots to count the number of rooms when placed anywhere in the room:

Step1: Move to the corner of the room with the wall or window on the right side.

Step 2: Set the value of the “windowCount” to zero.

Step 3: Set the value of the “side_count” to zero.

Step 4: While what in the front is not a window or a wall,

Step 5: move forward one unit and turn left.

Step 6: Loop while what in the front is not a window or a wall, move forward one unit

Step 7: while the “side_count < 4”

Step 8: Examine the first square of the wall and turn right.

Step 9: Set the value of “last_seen= what is in the front of the robot” and turn right.

Step 10: Examine every square and the incrementing window when the robot moves from the window to wall that is to the end of the window.

Step 11: Loop while what in the front is not a window or a wall, move forward one square and turn left.

Step 12: if the “wall is in front AND last_seen =windows”

Step 13: Add one to the window count...

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

The assignment here is to write an app using a database named CIT321 with a collection named students; we will provide a CSV file of the data. You need to use Vue.js to display 2 pages. You should know that this assignment is similar, all too similar in fact, to the cars4sale2 example in the lecture notes for Vue.js 2. You should study that program first. If you figure out cars4sale2, then program 6 will be extremely straightforward. It is not my intent do drop a ton of new material here in the last few days of class. The database contains 51 documents. The first rows of the CSV file look like this: sid last_name 1 Astaire first_name Humphrey CIT major hrs_attempted gpa_points 10 34 2 Bacall Katharine EET 40 128 3 Bergman Bette EET 42 97 4 Bogart Cary CIT 11 33 5 Brando James WEB 59 183 6 Cagney Marlon CIT 13 40 GPA is calculated as gpa_points divided by hrs_attempted. GPA points would have been arrived at by adding 4 points for each credit hour of A, 3 points for each credit hour of…

I need help to solve the following case, thank you

hi I would like to get help to resolve the following case