About

This is Vivek Vikram Singh. Currently pursuing Master Of Engineering in Computer Science stream from BITS, Pilani. I strongly believe in contribution-based education and helping out fellow/upcoming graduates with the experience I have. I have shared my written and interview experience in various known institutes/ PSUs for my M.Tech. admission in 2014 Find me on my blog at: https://vivekvsingh14.wordpress.com/

Role

Alma Mater:

Master of Engineering
Birla Institute of Technology and Science, Pilani
2014 to 2016
Bachelor of Engineering
Bansal Institute of Science and Technology, Bhopal
2009 to 2013

Experience:

Intern
EMC Corporation
2016
ASE
EMC Corporation
2016
TudLead
Example text
1 year 10 months ago

A = O(nlogn), B= O(n)

It is very trivial if you know the complexity concepts.

n=O(nlogn)

moreless
TudLead
Answer
1 year 10 months ago

#include #include int main() { int i; for (i=0; i<3; i++) { pid_t pid = fork(); if (pid == 0) printf("parent:[%d] current:[%d] i=%d\n", getppid(), getpid(), i); else printf("FORK Failed for current: %d\n", getpid()); printf("*\n"); } printf("HI \n"); return 0; }

moreless
TudLead
Answer
1 year 10 months ago

Tricky problem.

Please search for Fork() bomb.

moreless
narayanapot's picture
Lakshminarayana Potukuchi
virtualgate's picture
Virtual GATE
priyesh's picture
Priyesh Priyatam
ranita's picture
Ranita Biswas
pritam's picture
Pritam Prasun
pritam's picture
Pritam Prasun
905
Rajeev
914
priyesh's picture
Priyesh Priyatam
923
Himanshi
976
mnlcht's picture
jhilik
979
pshall's picture
shailendra joshi
998
maheshkumars's picture
Mahesh Kumar
1017
chandanchawda's picture
Chandan Chawda
1019
kaushalmaurya's picture
kaushal
1022
shabinmuhammed's picture
Shabin Muhammed
1065
tar_gate's picture
TarGate
1165
vineetkumar's picture
vineet
1238
rahulkumar's picture
Rahul Kumar
1246
kalpishsinghal's picture
Kalpish Singhal
1474
targetgate's picture
Target Gate
1518

Pages

Discrete Maths by Kenneth Rosen is good for understanding the concepts because there are lot of problems given alongwith solutions. If you are done with it, then you can go for Douglas West book on Graph Theory. It is the book dedicated to graph theory and considered very good book.The size constraint on uploading book is restricting me to upload the book here. but the link is here :

http://www.scribd.com/doc/73969226/Graph-Theory-Douglas-B-West-2-Ed

I will be uploading the solution manual for the same.

 

more less

It is done for a special case, when all the stations are idle.If you are studying the token ring protocol, you must be aware of the fact that each station introduces 1 bit delay becuase of copying bit by bit from input interface to output interface with help of Bit buffer.So this way token ring have sufficient delay in terms of bits. But when any of the station is idle, then 1-bit delay is omitted.this wasy,imagine the case of all stations being down. This case is kept in mind while designing the Token ring and  Moniter introduces extra Artificial delay bits to keep working of Ring smooth. 

In question of solving numericals, we will be explaining how to approach Token Ring protocol problems as soon as possible. 

 

more less

Yeah ,there is one. The Name is : Computer Networks, a System Approach By Peterson And Davie 

I am uploading the E-book here.

for Transport layer problems and theory, I suggest Tanenbaum problems and Theory too.its a standard book and good collection of problems too. DO NOT forget to solve TCP/UDP problems from IT GATE papers. I am uploading them too and this is the link.

Keep doing good. 

more less

Pages