Module 6.2.1 BSS Algorithm Causal Ordering of Messages 

U r a king sir. Tomorrow is my exam you saved my ass.

Finally got a nice video🤗

Thanks for the video....example was really helpful....only if you can do some video editing to remove the 'ahhhh'.....Thanks!

Awesome Explanation....

Nice explanation sir, its just difficult to put this explanation into words.

What if process A sends a transaction between when another process B sends a transaction and the A receives the transaction? Then process A will have a vector timestamp of upon receival of the timestamp from process B, which also has a timestamp of , which won't have the vector difference of 1. Edit: I just understood it - if B is sending a process, its new timestamp will be not !

Wonderful explanation sir. Thank you so much.

how u compare when ever 2 nd process send a msg to 1 process i.e (011) .how do u said this msg is buffered .........(in BSS )

Thanks, sir :)

sir plz send the ppt ...that you explain in a video

Good, but much irritating.......

Arey sir...kitta pkate ho! Ek he chiz ko 4-4 bar alg alg trh se bol k bta rhe..... Or aapkaa.... Ummmmmmmm kuch jyada he lmba ni h video me Btw thank you! Smjh aa gya bdi muskil se