DXC Technology interview experience Real time questions & tips from candidates to crack your interview

Associate Professional

DXC Technology
upvote
share-icon
2 rounds | 8 Coding problems

Interview preparation journey

expand-icon
Journey
I started my preparation by focusing on strengthening my fundamentals in programming, Data Structures, and core subjects like OOPS and DBMS, as I realized that clarity in basics is the foundation for cracking interviews. Initially, problem-solving felt challenging, but with consistent practice and regular revision, I gradually improved my logical thinking and coding confidence. Alongside technical preparation, I worked on improving my communication skills and participated in mock interviews to overcome nervousness. There were a few setbacks during the placement season, but I treated them as learning experiences and kept refining my approach. With persistence, discipline, and confidence in my preparation, I was able to successfully crack the interview and secure the role.
Application story
I applied for the Associate Professional role at DXC Technology through my college’s on-campus placement drive after attending the Pre-Placement Talk. The eligibility criteria and job description were clearly explained beforehand, which helped me understand the expectations. After applying, I appeared for the online assessment, and shortlisted candidates were then invited for the interview round conducted over the next few working days. The entire process was smooth and well-structured, with timely communication from the placement cell and the company regarding each stage of shortlisting and interview scheduling.
Why selected/rejected for the role?
I believe I was selected for this role because I demonstrated strong clarity in fundamentals, a structured problem-solving approach, and good communication skills during the interview process. I focused on explaining my thought process clearly rather than rushing to answers, which reflected my conceptual understanding and logical thinking. Additionally, I showed a positive attitude, willingness to learn, and flexibility regarding roles and locations, which aligned well with the company’s expectations for an Associate Professional. Overall, consistent preparation, confidence, and the ability to stay calm under pressure played a key role in my selection.
Preparation
Duration: 3 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip
Tip

Tip 1: Focus on strengthening your fundamentals in Data Structures, OOPS, DBMS, and basic programming concepts before moving to advanced topics.
Tip 2: Practice coding regularly and participate in mock interviews to improve problem-solving speed, confidence, and communication skills.

Application process
Where: Campus
Eligibility: 60% in 10th 12th & graduation, (Salary Package: 4.2 LPA)
Resume Tip
Resume tip

Tip 1: Keep your resume concise (preferably one page) and highlight relevant technical skills, projects, and internships that align with the job description.
Tip 2: Be honest about the skills you mention and ensure you can confidently explain every project, technology, or achievement listed on your resume.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date13 Jul 2022
Coding problem5

Timing: Conducted during regular working hours (not late night).
Environment: Smooth and well-organized process; professional and comfortable atmosphere.
Significant Activity: Online assessment followed by interview shortlisting; timely communication from the placement cell.
Interviewer: Friendly and professional; focused on understanding concepts and thought process rather than just final answers.

1. DBMS

  • Identify the normal form of a given table and detect redundancy. (Learn)
  • Predict output of a query using INNER JOIN and LEFT JOIN. (Learn)
Problem approach

Revise 1NF, 2NF, 3NF concepts and functional dependency basics.

Understand difference between INNER, LEFT, RIGHT joins and NULL handling.

2. Operating System

  • What are the conditions required for deadlock to occur? (Learn)
  • Calculate waiting time using SJF scheduling. (Learn)
Problem approach

Remember Coffman conditions – Mutual Exclusion, Hold & Wait, No Preemption, Circular Wait.

Practice basic scheduling numericals and formula for waiting time.

3. OOPS

  • Identify correct example of Polymorphism. (Learn)
  • Predict output of code snippet involving constructors. (Learn)
Problem approach

Revise compile-time vs runtime polymorphism and method overriding.

Understand constructor calling order and object creation flow.

4. Check If The String Is A Palindrome

Easy
10m average time
90% success
0/40
Asked in companies
IntuitSprinklrCIS - Cyber Infrastructure

You are given a string 'S'. Your task is to check whether the string is palindrome or not. For checking palindrome, consider alphabets and numbers only and ignore the symbols and whitespaces.

Note :

String 'S' is NOT case sensitive.

Example :

Let S = “c1 O$d@eeD o1c”.
If we ignore the special characters, whitespaces and convert all uppercase letters to lowercase, we get S = “c1odeedo1c”, which is a palindrome. Hence, the given string is also a palindrome.
Problem approach

Use two-pointer approach or reverse string and compare. Time complexity O(n).

Try solving now

5. Second Largest Number

Easy
23m average time
78% success
0/40
Asked in companies
SamsungDXC TechnologyCognizant Technology Solutions India Pvt Ltd

You have been given an array ‘a’ of ‘n’ unique non-negative integers.


Find the second largest and second smallest element from the array.


Return the two elements (second largest and second smallest) as another array of size 2.


Example :
Input: ‘n’ = 5, ‘a’ = [1, 2, 3, 4, 5]
Output: [4, 2]

The second largest element after 5 is 4, and the second smallest element after 1 is 2.
Problem approach

Traverse array once while maintaining two variables (largest and second largest). Time complexity O(n).

Try solving now
02
Round
Easy
Video Call
Duration50 minutes
Interview date19 Jul 2022
Coding problem3

Timing: Conducted during normal working hours via scheduled video call (not late night).
Environment: Professional and smooth; the interviewer ensured proper connectivity and made the candidate comfortable before starting.
Significant Activity: Focused on problem-solving approach; asked to explain logic clearly and discuss time & space complexity. Some follow-up questions were based on the optimized approach.
Interviewer: Friendly, patient, and interactive; gave hints when required and mainly evaluated conceptual clarity and structured thinking rather than just the final answer.

1. Operating System

Difference between process and thread. (Learn)

Problem approach

Focus on memory sharing, overhead, and execution context.

2. Day 8 : Second largest element in the array

Easy
15m average time
80% success
0/40
Asked in companies
AdobeSamsungIBM

You have been given an array/list 'ARR' of integers. Your task is to find the second largest element present in the 'ARR'.

Note:
a) Duplicate elements may be present.

b) If no such element is present return -1.
Example:
Input: Given a sequence of five numbers 2, 4, 5, 6, 8.

Output:  6

Explanation:
In the given sequence of numbers, number 8 is the largest element, followed by number 6 which is the second-largest element. Hence we return number 6 which is the second-largest element in the sequence.
Problem approach

Traverse the array once while maintaining two variables (largest and second largest). Update them accordingly without sorting.
Time Complexity: O(N)
Space Complexity: O(1)

Try solving now

3. Majority element

Easy
15m average time
85% success
0/40
Asked in companies
AmazonInfo Edge India (Naukri.com)HCL Technologies

You have been given an array/list 'ARR' consisting of 'N' integers. Your task is to find the majority element in the array. If there is no majority element present, print -1.

Note:
A majority element is an element that occurs more than floor('N' / 2) times in the array.
Problem approach

Use Moore’s Voting Algorithm to find the candidate in O(N) time and O(1) space, then verify if it appears more than N/2 times.

Try solving now

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

How do you remove whitespace from the start of a string?

Choose another skill to practice
Similar interview experiences
Associate Professional
2 rounds | 2 problems
Interviewed by DXC Technology
0 views
0 comments
0 upvotes
Associate Professional
3 rounds | 5 problems
Interviewed by DXC Technology
925 views
0 comments
0 upvotes
Associate Professional
2 rounds | 4 problems
Interviewed by DXC Technology
856 views
0 comments
0 upvotes
Associate Professional
2 rounds | 4 problems
Interviewed by DXC Technology
424 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Associate Professional
3 rounds | 3 problems
Interviewed by CIS - Cyber Infrastructure
529 views
0 comments
0 upvotes
company logo
Associate Professional
4 rounds | 6 problems
Interviewed by CIS - Cyber Infrastructure
0 views
0 comments
0 upvotes
company logo
Associate Professional
3 rounds | 9 problems
Interviewed by CIS - Cyber Infrastructure
502 views
0 comments
0 upvotes