All categories

2 years ago

Provide five strategies to stimulate brainstorming. (according to PLTW)

Engineering

1 answer:

qaws [65]2 years ago

7 0

Answer:

Doing associative brainstorming

Allow all members who have an opinion or comment to contribute

You cannot criticize someone or there judgment on a topic

Always encourage someone if they need help with something and give input

Let everyone talk and share there solutions

Explanation:

Overall it’s good to do the things I have listed above because it can help you in planning.

You might be interested in

The Ethernet (CSMA/CD) alternates between contention intervals and successful transmissions. Assume a 100 Mbps Ethernet over 1 k

Vesnalui [34]

<h3><u>CSMA/CD Protocol: </u></h3>

Carrier sensing can transmit the data at anytime only the condition is before sending the data sense carrier if the carrier is free then send the data.

But the problem is the standing at one end of channel, we can’t send the entire carrier. Because of this 2 stations can transmit the data (use the channel) at the same time resulting in collisions.

There are no acknowledgement to detect collisions, It's stations responsibility to detect whether its data is falling into collisions or not.

<u>Example: </u>

$T_{P}=1 H r$ , at time t = 10.00 AM, A starts, 10:59:59 AM B starts at time 11:00 AM collision starts.

12:00 AM A will see collisions

Pocket Size to detect the collision.

$\begin{aligned}&T_{t} \geq 2 T_{P}\\&\frac{L}{B} \geq 2 T_{P}\\&L \geq 2 \times T_{P} \times B\end{aligned}$

CSMA/CD is widely used in Ethernet.

<u>Efficiency of CSMA/CD:</u>

In the previous example we have seen that in worst case $2 T_{P}$ time require to detect a collision.

There could be many collisions may happen before a successful completion of transmission of a packet.

We are given number of collisions (contentions slots)=4.

$\text { Propagation day }=\frac{\text {distance}}{\text {speed}}$

Distance = 1km = 1000m

$\begin{aligned}&\text { Speed }=2 \times 10^{8} \mathrm{m} / \mathrm{sec}\\ &T_{P}=\frac{1000}{2 \times 10^{8}}=(0.5) \times 10^{-5}=5 \times 10^{-6}\\ &T_{t}=5 \mu \mathrm{sec}\end{aligned}$

7 0

3 years ago

) In a disk test performed on a specimen 32-mm in diameter and 7 mm thick, the specimen fractures at a stress of 680 MPa. What w

Radda [10]

Answer:

Sorry it doesnt tall me anythikng

Explanation:

6 0

2 years ago

True/False

sweet [91]

Answer:

false jdbebheuwowjwjsisidhhdd

7 0

3 years ago

In this exercise, you will write a Point structure that represents a space in two-dimensional space. This Point should have both

Afina-wow [57]

Answer:

Check the explanation

Explanation:

Points to consider:

We need to take the input from the user

We need to find the manhatan distance and euclidian using the formula

(x1, y1) and (x2, y2) are the two points

Manhattan:

$|x_1 - x_2| + |y_1 - y_2|$

Euclidian Distance:

$\sqrt{(x1 - yl)^2 + (x2 - y2)^2)}$

Code

#include<stdio.h>

#include<math.h>

struct Point{

int x, y;

};

int manhattan(Point A, Point B){

return abs(A.x - B.x) + abs(A.y- B.y);

}

float euclidean(Point A, Point B){

return sqrt(pow(A.x - B.x, 2) + pow(A.y - B.y, 2));

}

int main(){

struct Point A, B;

printf("Enter x and Y for first point: ");

int x, y;

scanf("%d%d", &x, &y);

A.x = x;

A.y = y;

printf("Enter x and Y for second point: ");

scanf("%d%d", &x, &y);

B.x = x;

B.y = y;

printf("Manhattan Distance: %d\n", manhattan(A, B));

printf("Euclidian Distance: %f\n", euclidean(A, B));

}

Sample output

8 0

3 years ago

TEA [102]

Answer:

true

Explanation:

4 0

3 years ago