Graphic design python turtle 🐢

By Kajal Vishwakarma -
from turtle import * import colorsys bgcolor('black') pensize(0) tracer(50) h=0 for i in range(300): c=colorsys.hsv_to_rgb(h,1,1) h+=0.9 color(c) forward(300) left(100) fd(i) goto(0,0) down() rt(90) begin_fill() circle(0) end_fill() rt(10) for j in range(5): rt(30) done() Please follow my blog and subscribe my channel for more videos and newly updates 👍👍👍👍👍 import turtle as t import colorsys t.bgcolor('black') t.tracer(100) h=0.4 def draw(ang,n): t.circle(5+n,60) t.left(ang) t.circle(5+n,60) for i in range(200): c=colorsys.hsv_to_rgb(h,1,1) h+=0.005 t.color(c) t.pensize(2) draw(90,i*2) draw(120,i*2.5) draw()
Post a Comment

Explain binary exponential back-off algorithm.

By Kajal Vishwakarma -

Explain binary exponential back-off algorithm.

                                  Or 

Discuss any one algorithm for allocating a multiple access channel.

To ensure that random back-off maintains stability, CSMA/CD uses a technique known as binary exponential back-off. Binary exponential back-off algorithm varies the limit on number of slot times. It works in the following manner-

1) if a stations frame collides for the first time, wait 0 or 1 time slot before trying again.

2) In case of colliding a second time, wait 0, 2 or 3 slot times.

3) If it collides third time, wait anywhere from 0 to 7 slots.

4) After 16 collisions, give up and report an error.

Thus, as congestion increase, stations back-off by larger and larger amounts to reduce the probability of collision. This method clearly attempts to reduce excessive waits by keeping the number of possible time slots small. After all if two stations collide, there is a 50% opportunity they will succeed on the next attempt.

If several stations collide, however, the opportunity are very small that even one will be successful on next attempt. The successful one would have to select either 0 or 1 slot with all the others making the other selections. By raising the number of possible slots after every collision, the opportunity of colliding again decrease exponentially.

Comments

Post a Comment

Popular posts from this blog

Create shape using python turtle 🐢

By Kajal Vishwakarma -
Image
Python turtle 🐢 graphic design shapes using turtle python from turtle import * import colorsys bgcolor('black') tracer(200) pensize(3) j=0 goto(-110,200) for t in range(400): c=colorsys.hsv_to_rgb(j,1,1) fillcolor(c) begin_fill() left(119) circle(50,180) circle(-50,180) circle(20) backward(350- t) j+=0.005 end_fill() done() Youtube Link:- https://youtu.be/8ki4Sk6Z4zE
Read more

Make fire crackers using python turtle 🐢

By Kajal Vishwakarma -
Image
Make fire crackers using python turtle 🐢 //python turtle//graphic design import turtle as t t.bgcolor('black') t.pensize(3) t.tracer(100) t.ht() for i in range(600): color=('red','white','green','blue') t.color(color[i%4]) t.fd(i) t.rt(20) for i in range(6): t.fd(i) t.rt(145) t.bk(i/2) t.lt(180) t.done() Other program you may like it. And please support me guys and please subscribe my youtube channel and also follow my blog. Create one of the best design with python turtle 🐢 it's code is very simple you can easily understood that I hope you enjoy this and please subscribe my youtube channel and don't forget to follow my blog. #2 from turtle import * import colorsys as cs tracer(50) bgcolor('black') h=0.3 pensize(3) for i in range(300): color(cs.hsv_to_rgb(h,1,1)) h+=0.005 rt(20) for j in range(5): fd(i) rt(100) rt(50) rt(118) done() F
Read more

Protocol verification using finite state machine model in computer network

By Kajal Vishwakarma -
Protocol Verification Using Finite State Machine Model:- The finite state machine is a mainly used in several protocol models with this technique, every protocol machine is always in a particular state at every time instant. Variables, including the program counter. From every state, there are zero or more possible transition to other states. When some event happens, transition take place. In case of a protocol machine, a transition might take place if a frame is transmitted, if a frame arrives, if a timer expires, if an interrupt takes place, etc. One particular state is designated as the initial state. This state corresponds to the description of the system when it starts running, or at some convenient starting place shortly thereafter. From the initial state, some, perhaps all, of the other states may be approached by a sequence of transition. this technique is called reachability analysis. This analysis can be helpful in determining whether a protocol is correct. All processes are
Read more