Cellular Automata • A life simulation (cellular automata) cạn simulate the life of several existing ćells. For every two exisşting old cells, one new cell will appear. So if there are 11 living cells at one time, then in the next generation there will be 16 cells. And in the third generation, there will be 24 cells alive. • If there are 5 initial cells at a time, how many cells are alive in the fifth generation? Create flowchart with input-output for various cases

Python3

MULTIPLE CHOICE -The answer is one of the options below please solve carefully and circle the correct option Please write clear .

Scenario: A robot is sitting in a chair with its arms facing down. Write an algorithm, using pseudocode, to make the robot: stand up walk until it senses a wall turn around walk back to the chair sit back down in the origin starting position Finally, output the total number of steps taken. Commands: In addition to our standard pseudocode commands, you must also use the following robot control commands: sit stand step (one step forward) raise arms (parallel to floor) lower arms (pointing to floor) sense (only if arms are raised) turn (90 degrees right) Immediately after issuing a sense command, you can check if the robot is at a wall.You do this via the boolean conditions "at wall" or "not at wall".The following are examples of this: if at wallif not at wallwhile not at wall AssumptionsYou must assume the following facts: The robot's initial sitting position is directly facing the target wall. There are no obstacles between the robot and the wall. The wall is 1 or more exact steps…

ShowCurrentTime.java an example program in Chapter, gives a program that displays the current time in GMT. Common old news shows would show clocks across many time zones, write a program that modifies ShowCurrent Time and will display the time in prominent business centers. London, Paris, New York was common. Write a program that displays the time in: Berlin, London, New York, Chicago, San Francisco, Tokyo and Hong Kong. ↓ HONG KONG ↓ LONDON L PARIS TOKYO MOSCOW 101 BERLIN DUBAI iStock Credit: Tetlana Muslyaka NEW YORK

Active buzzer project: Write an algorithm for the below code for all steps. Then write a conclusion (test&debug) for the code. Also, write comments for the code explaining each line.

Q2: Secret Courses Dan's recently announced that he's teaching n top-secret courses next semester. Instead of enrolling in them through ACORN, students need to email Dan to express their interests. These courses are numbered from 1 to n in some arbitrary order. In particular, if a student named s is interested in taking a course c, they need to send an email to Dan containing the message c s. Note that if a student is interested in taking multiple courses, they need to send multiple emails, one per course. Upon receiving a message c s, Dan looks at the list of students already enrolled in course c. If there's already a student on the list whose name is too similar to s, Dan assumes s is the same student and ignores the message. Otherwise, he enrolls s in the course. Dan considers two names too similar if and only if they have the same length and differ in at most one letter (note that "a" and "A" are considered the same letter). For example, "Josh" and "Josh" are too similar. "Sam" and…