Infosys SP and DSE Exam Starts Soon- Check Exam Pattern 2022
Infosys conducts SP and DSE recruitment Exam for the profiles of Digital Specialist Engineer (DSE) and Specialist Programmer (SP).
Infosys SP and DSE Exam: The Indian tech giant Infosys conducts the annual recruitment for the profiles of Digital Specialist Engineer (DSA) and Specialist Programmer (SP). The deadline to apply for this year’s Infosys DSE and SP job drive was 17 July 2022. Candidates will appear for the exam at the date and time confirmed during registration. The Infosys talent acquisition team will send the candidates a link and one-time password.
The recruitment process consists of 2 phases: the online test and the virtual interview. The online test will consist of 3 questions. The questions will be of varying difficulty: easy, moderate, and hard. The test will have a total cut-off and a sectional cut-off as well. The time allotted for the test will be 3 hours.
Around 2 lac aspirants applied for the test last year, out of which about 1500 got placed. Hence, expect the competition to be very high. The cut-off for last year was 60/100.
Exam Pattern for Infosys SP and DSE Exam
The online test will be a coding test that will measure the candidate’s proficiency in coding and problem solving will be at three levels of difficulty. Programming languages that are allowed to be used are C, C++, Java, Python, and JavaScript. Here are the details and expected question types for each question:
Question 1: Easy – 20 marks (approx.) – 30-35 mins
The question will be of simple type, requiring basic application of aptitude, for example, questions based on geometry and number systems. The question could also be based on an algorithm(ex: binary search, linear search, sorting) or data structures.
All test cases must compulsorily run for this code. For example, last year’s first question was based on arrays and strings.
Question 2: Medium – 30 marks (approx.) – 46-60 mins
This question will likely be based on greedy algorithms, i.e., the problem-solving heuristic of making the locally optimal choice at each stage. The question could be based on one of 3 types: Pure, Orthogonal, and Relaxed Greedy Algorithm.
80% of the test cases should run for this code. Solving this question to an acceptable level gives you a high chance of getting an interview call.
Question 3: Hard – 50 marks (approx.) – 60-75 mins
This question will likely be based on dynamic programming techniques for solving an optimization problem. Solving it will require the problem to be broken down into simpler subproblems. Then, utilize the fact that the optimal solution to the overall problem depends upon the optimal solution to its subproblems.
75% of the test cases should run for this code. Solving this question gives candidates a high chance of getting an interview mail, so this is mainly an attempted question.
Also Read: Female B.Tech Aspirants to Get Scholarships Worth ₹ 2.29 Crore: Saint-Gobain India
Follow GetMyUni for more such content on the Latest Education News.