Infosys SP DSE Placement Papers 2026

Last Updated: March 2026

Truth check — what actually matters for Infosys 2026

Last verified by Aditya Sharma · cross-checked against PapersAdda Hiring Pulse and verified candidate threads. Skip this if you only want question banks; read it if you want to spend prep time on what actually moves the offer.

Infosys is the service-IT incumbent that has visibly tightened its 2026 fresher funnel. SP (Specialist Programmer) and DSE (Digital Specialist Engineer) bands now matter more than the entry-level System Engineer band, and the difference is roughly 2-3x in starting LPA, with much of the gap surviving through the first appraisal.

The 2026 snapshot: ~2,200 active roles tracked. That is steady-state hiring, not a surge. SP/DSE-band positions are a small fraction of that, single-digit percentage. The competition for the upper bands is sharp, and the test selectivity reflects that.

What standard guides get wrong: the basic mathematical/logical reasoning section is not the filter. The pumice section ("Verbal Ability and Reading Comprehension") is. Engineering candidates routinely overprepare arithmetic and underprepare reading comprehension under timed pressure. Reading speed at 250+ wpm with comprehension intact is the most underrated prep target for Infosys.

For SP / DSE specifically, the advanced programming round uses 1-2 hard DSA problems. Topics that show up disproportionately: dynamic programming variants, graph traversal with weighted edges, string-pattern matching. Standard tree problems are not the focus.

The HR round is unusually conversational. It rarely tests technical depth; it tests whether you sound coachable. The candidates we tracked who got ghosted post-final round had nothing wrong with their answers, they had a defensive tone.

If you have 2 weeks for Infosys SP / DSE only: 5 days of advanced DSA on Striver-A2Z, 5 days of timed reading comprehension and verbal, 2 days of pseudo-code-MCQ practice, 2 days of mock HR with a recorder.

Infosys SP (Specialist Programmer) and DSE (Digital Specialist Engineer) are premium hiring tracks at Infosys, offering significantly higher packages than the standard role. These tracks are designed for candidates with exceptional technical and problem-solving abilities.

Infosys SP & DSE Program Overview

Eligibility Criteria

Infosys SP

• Academic: Minimum 70% throughout (10th, 12th, Graduation)
• Degree: BE/B.Tech/ME/M.Tech (CS/IT/ECE/EEE preferred)
• Backlogs: No active backlogs
• Skills: Strong coding and problem-solving skills

Infosys DSE

• Academic: Minimum 65% throughout
• Degree: BE/B.Tech/ME/M.Tech/MCA/M.Sc
• Backlogs: No active backlogs
• Skills: Good technical knowledge and aptitude

Exam Pattern Comparison

15 Sample Questions with Solutions

Advanced Aptitude (Questions 1-4)

Q1. A train passes a platform in 30 seconds and a man standing on the platform in 15 seconds. If the speed of the train is 54 km/hr, what is the length of the platform?

• a) 200m
• b) 225m
• c) 250m
• d) 300m

Solution: Speed = 54 × (5/18) = 15 m/s. Train length = 15 × 15 = 225m. Platform + Train = 15 × 30 = 450m. Platform = 450 - 225 = 225m.

Q2. In how many ways can the letters of the word 'LEADING' be arranged so that the vowels always come together?

• a) 480
• b) 720
• c) 5040
• d) 1440

Solution: Treat vowels EAI as one unit. We have LNDG + (EAI) = 5 units. Arrangements = 5! × 3! = 120 × 6 = 720.

Q3. A and B invest in a business in the ratio 3:2. If 5% of the total profit goes to charity and A's share is ₹855, what is the total profit?

• a) ₹1400
• b) ₹1500
• c) ₹1600
• d) ₹1700

Solution: Let total profit = P. After charity: 0.95P. A's share = (3/5) × 0.95P = 855. So P = 855 × 5 / (3 × 0.95) = 1500.

Q4. The compound interest on a sum for 2 years at 10% per annum is ₹840. What would be the simple interest for the same period?

• a) ₹700
• b) ₹750
• c) ₹800
• d) ₹850

Solution: CI = P[(1.1)² - 1] = 0.21P = 840, so P = 4000. SI = 4000 × 0.10 × 2 = 800.

Logical Reasoning (Questions 5-7)

Q5. Statement: All engineers are intelligent. Some intelligent people are creative. Conclusions: I. All engineers are creative II. Some creative people are engineers

• a) Only I follows
• b) Only II follows
• c) Both follow
• d) Neither follows

Q6. In a certain code, COMPUTER is written as RFUVQNPC. How is MEDICINE written in that code?

• a) EOJDJEFM
• b) EOJDEJFM
• c) MFEJDJOE
• d) MFEDJJOE

Explanation: Letters are reversed and each letter is shifted +1.

Q7. Find the odd one out: 3, 9, 27, 81, 243, 728

• a) 9
• b) 27
• c) 243
• d) 728

Explanation: All are powers of 3 except 728 (3⁶ = 729, not 728).

Technical MCQs (Questions 8-10)

Q8. What is the output of the following C code?

int x = 10;
printf("%d %d %d", x, ++x, x++);

• a) 10 11 11
• b) 11 11 10
• c) 12 12 10
• d) Compiler dependent

Explanation: Order of evaluation of function arguments is undefined.

Q9. Which of the following sorting algorithms has the lowest worst-case time complexity?

• a) Quick Sort
• b) Merge Sort
• c) Bubble Sort
• d) Insertion Sort

Explanation: Merge Sort is O(n log n) in all cases.

Q10. In SQL, which command is used to remove all records from a table but keep the table structure?

• a) DELETE
• b) DROP
• c) TRUNCATE
• d) REMOVE

Programming Concepts (Questions 11-12)

Q11. What is the time complexity of inserting an element at the beginning of an array?

• a) O(1)
• b) O(n)
• c) O(log n)
• d) O(n²)

Explanation: All existing elements need to be shifted.

Q12. Which of the following is true about interfaces in Java?

• a) They can have constructors
• b) They can have method implementations
• c) They can have static methods
• d) They can be instantiated

Coding Questions (Questions 13-15)

Q13. Write a program to find the number of occurrences of each character in a string.

Solution:

def char_frequency(s):
    freq = {}
    for char in s:
        if char in freq:
            freq[char] += 1
        else:
            freq[char] = 1
    return freq

s = input()
result = char_frequency(s)
for char, count in sorted(result.items()):
    print(f"{char}: {count}")

Q14. Write a program to check if two strings are anagrams.

Solution:

#include<stdio.h>
#include<string.h>

int areAnagrams(char *s1, char *s2) {
    int count[256] = {0};
    int i;
    
    if(strlen(s1) != strlen(s2))
        return 0;
    
    for(i = 0; s1[i] && s2[i]; i++) {
        count[s1[i]]++;
        count[s2[i]]--;
    }
    
    for(i = 0; i < 256; i++)
        if(count[i] != 0)
            return 0;
    
    return 1;
}

int main() {
    char s1[100], s2[100];
    scanf("%s %s", s1, s2);
    if(areAnagrams(s1, s2))
        printf("Anagrams");
    else
        printf("Not Anagrams");
    return 0;
}

Q15. Write a program to implement binary search.

Solution:

import java.util.Scanner;

public class BinarySearch {
    static int binarySearch(int arr[], int key) {
        int left = 0, right = arr.length - 1;
        while(left <= right) {
            int mid = left + (right - left) / 2;
            if(arr[mid] == key)
                return mid;
            if(arr[mid] < key)
                left = mid + 1;
            else
                right = mid - 1;
        }
        return -1;
    }
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int arr[] = new int[n];
        for(int i = 0; i < n; i++)
            arr[i] = sc.nextInt();
        int key = sc.nextInt();
        int result = binarySearch(arr, key);
        System.out.println(result);
    }
}

Topic-Wise Weightage

Preparation Tips for Infosys SP & DSE

1. Quantitative Aptitude

• Focus on advanced topics
• Practice complex word problems
• Study probability and permutations deeply
• Improve calculation speed

2. Logical Reasoning

• Practice complex puzzles
• Focus on data sufficiency
• Solve syllogism problems
• Practice seating arrangements

3. Technical Preparation

• Master data structures
• Study OOPs concepts thoroughly
• Practice SQL queries
• Learn OS and CN basics

4. Coding Skills

• Practice daily on LeetCode/HackerRank
• Focus on arrays, strings, linked lists
• Learn dynamic programming basics
• Write optimized, clean code

Infosys SP vs DSE - Which to Target?

Recommendation: Apply for both to maximize your chances!

You May Also Like

• Infosys Off Campus 2026

• Infosys Exam Pattern 2026

• Infosys Interview Questions 2026

🎯 Live Mock Test, May 2026 Edition

5 original questions written by Aditya Sharma, calibrated to the Infosys Sp Dse 2026 batch difficulty. Click any option to lock your answer; solutions reveal after.