Tip 1 : Practice Dsa problem from topics like tree, Linkedlist, bit masking, Hasing.
Tip 2 : Understand topics like ipc, semaphores, Deadlock, osi model, tcp/ip protocol, routing protocol
Tip 3 : must have good understanding of memory management as well.
Tip 1 : prepare your resume based on the job description.
Tip 2 : Put major projects with attractive and short description. Remove unwanted thing from resume. You can put the rank of coding contests.
Test started around 5 pm. 3 coding questions were there.



1. Text form of ‘IPAddress’ must be ‘a.b.c.d’
2. The values of a,b,c and d can vary from ‘0’ to ‘255’ and both ‘0’ and ‘255’ are inclusive.
Used bit manipulation approach to identify whether the given string is a valid ip address or not.
The condition was if 1 ia coming at any point after 0 then it is not a valid ip addeess
Asked questions related to operating system. Also aksed two coding question
Asked question from fork system call.
Tip 1 : fork system call used to create a child process of the current process



nodes, where the nodes have integer values.
For the given binary tree:

The Inorder traversal will be [5, 3, 2, 1, 7, 4, 6].
The Preorder traversal will be [1, 3, 5, 2, 4, 7, 6].
The Postorder traversal will be [5, 2, 3, 7, 6, 4, 1].
I used the recursion approach to solve this problem.
Asked question related to linked list and some theory question from transport layer



In the given linked list, there is a cycle, hence we return true.

Tried two pointer approach to identify loop. I
Question were aksed from routing protocol. And 1 coding question.
Routing protocol. How link state routing and distance vector routing works.
Questions were from my project related to gene-gene network analysis
Tip 1 : Should have good knowledge about the projects.
Are you comfortable to Bangalore location.
Expected ctc.
Tip 1 : answer these questions honestly

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?