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

20 May 2016 - 8:58pm

One of the questions with POOR TITLE. I strongly recommend to give proper title to question.

more less

You can watch lectures on Algorithms  and DS videos in their respective sections . These are good videos collected from different sources. Techtud custom videos are expected to be come soon.

more less
6 May 2016 - 3:22pm

I would suggest you to go through this video tutorial and revert if doubt persists.

http://www.techtud.com/video-lecture/process-states-and-multiprogramming

more less
It is Deadlock. P1 will be waiting for B which is held by P2 and vice versa.
more less

A) Reading should not a problem. So NOT privilege.
B) Same as above
C) Changing mode is Privileged instruction.

more less

First of all, I will suggest you to write proper title of the questions. It tells people more about question you are asking. This kind of title will lead to no answer.

This question is quite simplified and most of the information is not given. Generally, "Empty" is inilialized with Size of buffer, which is 2 here and "Full" as 0.

http://www.techtud.com/resource-share/producer-and-consumer-problem-sema...

more less
Please look at this link to get the idea of Inverted page table.
http://www.techtud.com/resource-share/inverted-page-tables-notes-virgini...

In case of conventional paging, there is no search is involved. Just indexing in Page table, few concatenations operations and you are done. Where as in Inverted Page table, you need to look up for page and process id in all frames (n frames in this case).

more less
14 Apr 2016 - 11:22pm
I assume, when "if(head)" condition is false, this function returns NULL. Every function call takes the "head" of the list, create a "new" node and assign "head's" data in "new" node. Argument in each function call is "next" of current node that means we are moving forward from first node to last node of list, assigning each nodes data in "new" node and returning "new" node's address to previous node's "next" pointer. In this way, we are creating a new list same as given linked list.
more less
13 Apr 2016 - 12:52pm
I suggest you draw a linked list on paper and try. You will get the intuition . Note that it is a recursive function.
more less

Pages