Infosys Specialist Programmer & Digital Specialist Engineer Roles | Selection Process, Exam Pattern

Infosys Specialist Programmer & Digital Specialist Engineer Roles | Selection Process, Exam Pattern

Company :- Infosys

Job Roles :- Specialist Programmer, Digital Specialist Engineer

Salary :- SP(specialist programmer): 9.5LPA ,DSE(digital specialist engineer): 6.25LPA

Selection Process :-

1. Online Test / Written Test / Online Exam

2. TR + HR Round

3. ONBOARDING

Exam Pattern / Online Test Pattern :-

Test usually contains 3 questions that will have to be attempted in 3 hours

Test will have a sectional cut-off as well as a total cut-off 

Each question will belong to different difficulty level :-

Easy – Simple questions that can be solved by basic application of aptitude, algorithm and data structures 

Medium – Usually a question based on Greedy algorithm

Hard – Usually a question based on Dynamic Programming

Note :- Code can be written for each question using one of the programming language from  C/C++/Java/Python/JavaScript 

1st Question :- Easy Question

Simple questions that can be solved by basic application of aptitude, algorithm and data structures 

2nd Question :- Medium Level Question

Usually a question based on Greedy algorithm.

A Greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage Types of Greedy algorithm:

1. Pure greedy algorithms
2. Orthogonal greedy algorithms
3. Relaxed greedy algorithms

3rd Question :- Hard / Difficult Question

Usually a question based on Dynamic Programming

Dynamic Programming (DP) is an algorithmic technique for solving an optimization problem by breaking it down into simpler subproblems and utilizing the fact that the optimal solution to the overall problem depends upon the optimal solution to its subproblems.

Principles of Dynamic Programming :-

• Breaking the problem down into subproblems and calculating their values. Next time, upon encountering the same subproblem, the value can be reused instead of recalculation
• Avoid repeated work by remembering partial results, a common approach for performance enhancement

Dynamic Programming methods :- 

There are two different ways to store values for an overlapping subproblem so that the values can be reused:

Top-down with Memorization :- 

To solve a bigger problem, in this approach we recursively find the solution to the smaller sub-problems and its result is cached. So next time the same sub-problem is tried to solve, the cached memorized result is returned. 

Bottom-up with Tabulation :-

In this approach, we solve the problem “bottoms-up” i.e., by filling up an n-dimensional table. Based on the results in the table, the solution to the top/original problem is then computed.

Some examples of Dynamic Programming :-

1. Knapsack problem
2. Fibonacci Numbers
3. Palindromic Subsequence
4. Longest Common Substring
5. Dijkstra's algorithm

After Clearing Online Written Test Infosys Call for Interviews Who are selected in the exams.

Interview Process / Structure :-

Total duration of the interview will be around 1 hour

You might be asked to solve a puzzle/problem using programming language of your choice

Students from CS/IT branch might be tested on: Algorithms, Data structures, Automata theory, Compiler, Computer Network, Computer Organization, Operating Systems, Digital Signal Processing and Object-oriented programming.

Students from other branches might be tested on: Algorithms, Data structures, Computer Network, Digital Electronics, Digital Signal Processing, Mathematics, Object-oriented programming and Control system

After Cleaning interview selected candidates will get mails with in 2 to 3 weeks further process Deatils.