Question 1. There is a colony of 8 cells arranged in a straight line where each day ery cell competes with its adjacent cells (neighbor). Each day, for each cell, if its neighbors are both active and both inactive, the cell becomes inactive the next day, otherwise it becomes active the next day. Assumptions: The two cells on the ends have single adjacent cell, so the other adjacent cell can be assumed to be always inactive. Even after updating the cell state. Consider its previous state for updating the state of other cells. Update the cell information of all cells simultaneously. Write a function cell Compete which takes one 8 element array of integer's cells representing the current state of 8 cells and one integer days representing the number of days to simulate. An integer value of 1 represents an active cell and value of 0 represents an inactive cell. Existing Programce-Expertise-Experience int* cellCompete(int* cells.int days) {/ /write your code here } //function signature ends Test Cases TESTCASES 1: INPUT: [1.0.0,0,0,1,0,0],1 EXPECTED RETURN VALUE: [0.1.0.0.1.0.1.0] 30 TESTCASE 2: [1.1.1.0.1.1.1.1.1.2. INPUT: EXPECTED RETURN VALUE: [0,0,0,0,0,1,1,0]

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

 

Question 1. There is a colony of 8 cells arranged in a straight line where each
day ery cell competes with its adjacent cells (neighbor). Each day, for each
cell, if its neighbors are both active and both inactive, the cell becomes
inactive the next day, otherwise it becomes active the next day.

Assumptions: The two cells on the ends have single adjacent cell, so the

other adjacent cell can be assumed to be always inactive.

Even after updating the cell state. Consider its previous state for updating the
state of other cells. Update the cell information of all cells simultaneously.

Write a function cell Compete which takes one 8 element array of integer's cells
representing the current state of 8 cells and one integer days representing the
number of days to simulate.

An integer value of 1 represents an active cell and value of 0 represents an

inactive cell.

Existing Programce-Expertise-Experience
int* cellCompete(int* cells.int days)

{/

/write your code here

}

//function signature ends

Test Cases

TESTCASES 1:

INPUT:

[1.0.0,0,0,1,0,0],1

EXPECTED RETURN VALUE:
[0.1.0.0.1.0.1.0]

30

TESTCASE 2:

[1.1.1.0.1.1.1.1.1.2.

INPUT:
EXPECTED RETURN VALUE:

[0,0,0,0,0,1,1,0]

 

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY