Amdocs 2024 papers
Previous year Amdocs placement papers with questions and solutions
This page is a working set of Amdocs placement papers from 2025: from student reports questions, the 2025 online assessment pattern, and step-by-step solutions. Use it to see what Amdocs actually asked in the latest cycle, how hard the rounds were, and which themes (DSA, system design, aptitude, or role-specific topics) mattered most. Practice the problems below under timed conditions, then cross-check with the interview and preparation guides if you are targeting an upcoming Amdocs drive.
| Section | Questions | Time | Difficulty |
|---|---|---|---|
| Aptitude | 20-25 | 30 min | Medium |
| Technical | 15-20 | 30 min | Medium |
| Coding | 1-2 | 30 min | Medium |
This section contains practice questions styled on Amdocs placement papers 2025 (recent-cycle pattern), with worked solutions. Use them as timed sectional drills - from student reports drives vary by college and role, so treat this as a high-signal practice bank, not an official paper dump.
Solution:
Old sum = 5 × 20 = 100. New sum = 100 − 15 + 25 = 110. New average = 110/5 = 22.
Answer: 22
Solution:
SI = (P × R × T)/100 = (5000 × 8 × 3)/100 = ₹1200.
Answer: ₹1200
Solution:
Let original = 100. After +20% → 120. After −20% → 120 − 24 = 96.
Net change = 100 − 96 = 4. Net % = 4% decrease (always a loss of (20/10)² %).
Answer: 4% decrease
Solution:
Let CP = 100. MP = 150. SP after 20% discount = 120.
Profit % = 120 − 100 = 20%.
Answer: 20%
Solution:
Positions from left: A = 10, B = 40 − 10 + 1 = 31. Students between = 31 − 10 − 1 = 20.
Answer: 20
Solution:
Pattern: Each term ×2
Next term = 80.
Answer: 80
Solution:
‘Neither’ is singular → verb should be has, not have.
Correct: Neither of the boys has submitted his/their assignment.
Answer: have → has
Solution:
In placement verbal sections, ‘Genuine’ is closest in meaning to Authentic among common options.
Answer: Authentic
Problem Statement: Given an array of integers and a target, return indices of two numbers that add up to target.
Example:
Input: nums = [2, 7, 11, 15], target = 9Output: [0, 1]Solution (Java):
public int[] twoSum(int[] nums, int target) { Map<Integer, Integer> map = new HashMap<>(); for (int i = 0; i < nums.length; i++) { int need = target - nums[i]; if (map.containsKey(need)) return new int[]{map.get(need), i}; map.put(nums[i], i); } return new int[]{};}Time Complexity: O(n)
Space Complexity: O(n)
Problem Statement: Return the level-order traversal of a binary tree.
Example:
Input: [3,9,20,null,null,15,7]Output: [[3],[9,20],[15,7]]Solution (Java):
public List<List<Integer>> levelOrder(TreeNode root) { List<List<Integer>> res = new ArrayList<>(); if (root == null) return res; Queue<TreeNode> q = new ArrayDeque<>(); q.add(root); while (!q.isEmpty()) { int sz = q.size(); List<Integer> level = new ArrayList<>(); for (int i = 0; i < sz; i++) { TreeNode n = q.poll(); level.add(n.val); if (n.left != null) q.add(n.left); if (n.right != null) q.add(n.right); } res.add(level); } return res;}Time Complexity: O(n)
Space Complexity: O(n)
Problem Statement: Given a string, return it reversed.
Example:
Input: "placement"Output: "tnemecalp"Solution (Java):
public String reverse(String s) { return new StringBuilder(s).reverse().toString();}Time Complexity: O(n)
Space Complexity: O(n)
Based on recent candidate experiences from 2025 Amdocs interviews:
2025 Interview Process:
2025 Interview Trends:
Common 2025 Interview Topics:
Success Tips:
For detailed interview experiences from 2025, visit Amdocs Interview Experience page.
Amdocs 2024 papers
Previous year Amdocs placement papers with questions and solutions
Amdocs aptitude questions
Complete collection of Amdocs aptitude problems
Amdocs interview experience
Real interview experiences from successful candidates
Amdocs preparation guide
Comprehensive preparation strategy for Amdocs placement
Amdocs main page
Complete Amdocs placement guide with eligibility, process, and salary
Infosys · TCS · Wipro · Accenture · Capgemini · HCL
Practice 2025 papers to stay updated with latest patterns and prepare effectively!