Top 5 Highest Paying Software companies & Hiring Process

Top 5 Highest Paying Software Companies & Hiring Process




 1) GOOGLE

Google Hires Off-campus as well as on-campus.


Process of Hiring :
For off-campus you have to apply online by visiting https://careers.google.com Then after a month you get a confirmation call or messages .
And, you have to face 3 Rounds of Telephonic interviews.

Round 1:-

You will get a call from a Recruiter.They will simply ask some simple & short-questions on Programming languages.If you clear 1st  Round you will be forwarded for 2nd Round ,Otherwise Bye-Bye .

Round 2:-

This Round mainly consists of 1 coding Question and Allocated time is 45 minutes .They Want to see your Right approach toward's problem .No Matter your solution is Right or Wrong But He likes To see Your Right Approach.If you Convince Him by your Right approach you will be forwarded In next Round .Otherwise ☹️😶

Round 3:-

In this Round also He (Other Interviewer) will give you a problem and want to see your problem solving approach & the Allocated time is 45 minutes.
You have to clear all these Rounds to get into Google.

Now, If you Get Offer Your CTC (Cost To Company) will be 25 lakh in India & $1,50,000 in USA.

2)Facebook

Facebook also Hire from off-campus as well as on campus.

Process of Hiring:
For off-campus you have to apply online by visiting https://m.facebook.com/careers/ Then You have to fill a Digital Form and if Your Form is eye catching then hopefully you will get a dream call.

  Now,You have to Clear 2 Telephonic interviews and 1 on-site Interview.

Round 1 (Telephonic interview):-

This Round is fully Technical and based on Your programming skills and Work-experience elaboration and how you fixed bugs and all these stuffs.

Round 2:-

This is also Technical and mainly focused on Coding Skills.

On-site Interviews:-

This is the toughest part and you have to face 4-5 interviews on an average in a couple of days.3 Interviews will be Technical,1 will be System design & soft skills & 1 Is HR Interview.

 If you Cleared all these Then They will submit their feedback to Head office if they found your feedback Fruitful They will Offer you Via Mail or Call.

Now,Your CTC will be $1,50,000-$1,80,000 in USA. 

3)Microsoft

Microsoft also Hire from off-campus as well as on campus.

Process of Hiring:


On campus Hiring process:

i) online Round 

(where you get some objective questions & puzzles).

ii) Written Round 

(Where 3 coding questions are given to you ,you have to solve it in 75 Minutes)

iii)Technical Interview 

(There are 3 Technical interview rounds all are based on coding & some Algorithm puzzles)

iv) HR Interview 

Mainly Based on Your CV ,Your Likes & Dislikes.

Off Campus Hiring process:

Apply directly at https://careers.Microsoft.com/
 Here you have to face Written Round, Technical interview & HR interview.

They offers a CTC of 20-24 lakh in India & $1,30,000-$1,50,000 in Redmond.


4) Uber

Uber Hires From On-campus as well as Off-campus.

In On-campus & off campus They have same Rules of selection & same Rounds of interview.
Process of Hiring:
There are 4 Rounds :

i) Coding Round

Three coding questions are asked and you have to solve it in 90 minutes and Coding Question are not very Tough.

ii) On site Round

This Round is taken Mainly By Hiring Manager Topic is your Past projects & Your Achievements .

iii) Technical Round

2 High-Level Coding Problems.

iv) Technical Round 2

Here you have to face some designing Problems & Coding problems.

Off Campus Hiring Process:

Apply Through  https://www.uber.com/en-IN/careers/

If you clear All Rounds Successfully They will offer a CTC of 20-25 lakh in India & $1,75,000 in USA.

5) IBM

IBM (International Business Machine ) is a US based Multinational Firm & This is counted in Top Multinational Company.

IBM also Hires from On campus & Off campus.

Process Of Hiring:

On campus Hiring Process consists of Three Rounds:

i) Written Round

This is Objective Round.It consists of two parts namely Number Series and General Aptitude Test and English Assessment Test. For Number Series and General Aptitude Test.

ii)Technical Interview

Stick to Basic to clear this Round and Keep Ready your Algorithm & Data structures,Networking,Operating System,DBMS & Most important Any Programming language in which you are proficient because Most of the questions are from this part.

iii)HR Interview

Mainly Based on CV (Curriculum vitae), your work experience ,your Interests & Hobby.

Off campus Hiring Process:

Visit  http://www-03.ibm.com/employment/in/index.shtml 
Here also you have to face 3 Rounds.

If you clear all these Rounds your CTC will be 12-18 lakhs in India.







.............................................BEST OF LUCK FOR YOUR FUTURE..........................................

Comments

Post a Comment

Popular posts from this blog

Show that number of pendant vertices in a binary tree is (n+1)/2 ,where n is the number of vertices in the tree.

Image
The number of vertices of odd degree in an undirected graph is even,(N-1) is even.  Therefore, n is odd. Let p be the number of pendant vertices. 2+p+3(n- p-1) = 2(n-1) or, 3n-2n-3+4 = 2p or, 2p = n+1 or, P = (n+1)/2 Hence, the number of pendant vertices is (n+1)/2. Also, see : 1.)  Graph Theory and Tree 2.)  The Reflection about line yx is.......... 3.)  Prove that a simple graph with n vertices and k components can have at most 1/2(n-k)(n-k-1) edges. 4.)  Show for what condition rotation and scaling are commutative. 5.) Vector in R space 6.) Prove that every tree has at most one perfect matching. 7.)  Prove that every tree with 2 or more vertices is 2-chromatic. 8.)  Show that every Bi-partite graph is 2 chromatic. 9.) Prove that the number of circular permutations of n different objects is (n-1)! . 10.)  State the "Pigeon Hole Principle" and the " Generalised pigeon Hole principle".
Read more

Prove that every tree with 2 or more vertices is 2-chromatic.

Image
Since a tree is connected and has no cycle if one starts coloring any one vertex with a specific color and keeps on coloring every alternate vertex with another color, the entire graph can be colored with only two colors and since there is one and only one path between any two vertices in a tree, no two vertices will have the same color. Hence every Tree with 2 or more vertices is 2-Chromatic.    [Proved]                                                                 FIG (I)                                                                  FIG (II)
Read more

Top 5 websites to learn coding Online

Image
Now, A Days Technology became our Daily Life partner. Sometimes we people are wondering how this page, website, Blog ,Game works .Then,Our Mind  starts searching for Real phenomenon .How this site works ,why this website is different from others,How the widget is different from others ,How e-commerce website works. So, The answer of all of the above is "CODING". Being a programmer ,i think without Coding Digital Word is Nothing. So, you need to learn Coding if you are interested in Digital world. Myths about coding is that It is Hard to Understand & Hard to Write.There is nothing like this.Just you have to do some basic Homework daily and continuation in learning.Learn Coding like a Interesting Puzzle and solve like a "SUDUKO" Game. Let's Start: Kids Section: For kids Go for  Tynker   (Android/IOS) and  Hopscotch   (IPAD) .These sites are the best tutor of kids ,they teach coding in the form of Games & Puzzles.
Read more