Tip 1 : For CS basic concept, revise if you have notes or prefer studytonight.com . You can attempt topic vise quizzes.
Tip 2 : Aptitude and Reasoning was of beginner level, prefer Indiabix for this.
Tip 3 : You should have good command on any language of your choice. If you are c++ programmer, make yourself confident in STL. I preferred StudyTonight to revise STL concept because the content is very much organised and precise.
Tip 4 : For algorithm and DS, you can practice topic vise on Hackerearth/Hackerrank etc. Be good in determining time complexity
*Everything was of beginner/Intermediate level for DXC. Above tips are also useful in many companies which offers <=6LPA
Tip 1 : DON'T mention anything in resume that you're not confident about. Be honest there. If you're mentioning your any strength there, you should have a story for convincing the interviewer.
Tip 2 : Keep the resume of 1 page only. Interviewer won't look in resumes for minutes.
Tip 3 : Mention extra-Curriculum activities too, mention any achievement you got.
Tip 4 : Be very precise in your career objective.
-Had to give the test between 9AM - 5PM.
-Environment was virtual and Camera was on.
-The round was divided into multiple sections Logical, aptitude, English comprehensive writing and error finding, each section was time bounded.
Given binary tree :
Boundary Nodes :
Root : 2
Leftmost : 35
Rightmost : 10
Leaf nodes : 2,3,5,2
Sum : 59
It was an interview held at 12:30PM..
Interviewer was very friendly. He was very polite throughout the process..
I was asked my hobbies, achievements, my strength and weaknesses, long term goals, about dxc and its services, DS, c++ concept and about STL. about my mentioned projects.
Merge Sort Algorithm -
Merge sort is a Divide and Conquer based Algorithm. It divides the input array into two-parts, until the size of the input array is not ‘1’. In the return part, it will merge two sorted arrays a return a whole merged sorted array.
The above illustrates shows how merge sort works.
It is compulsory to use the ‘Merge Sort’ algorithm.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you write a single-line comment in C++?