Informatica Placement Papers 2026
Informatica Placement Papers 2026 - Questions and Solutions
Last Updated: March 2026
Company Overview
Informatica is an enterprise cloud data management leader, powering data-driven digital transformations for thousands of enterprises worldwide. The company provides data integration, data quality, master data management, and data governance solutions.
Selection Process
| Stage | Description | Duration |
|---|---|---|
| Online Assessment | Aptitude, Technical MCQ, Coding | 90 minutes |
| Technical Interview | DSA, DBMS, SQL | 45-60 minutes |
| HR Interview | Behavioral, Culture fit | 30 minutes |
Eligibility:
- 60% in 10th, 12th, Graduation
- No active backlogs
- CS/IT/MCA preferred
Exam Pattern
| Section | Questions | Time | Topics |
|---|---|---|---|
| Aptitude | 20 | 25 min | Quant, Logical |
| Technical MCQ | 25 | 25 min | SQL, DBMS, Networks |
| Coding | 2 | 40 min | Algorithms |
Aptitude Questions
1. If 12 men can reap 120 acres in 36 days, how many acres can 54 men reap in 54 days?
Solution: Using M1×D1/W1 = M2×D2/W2 12×36/120 = 54×54/W2 W2 = 54×54×120/(12×36) = 810 acres
2. Find the sum: 1 + 2 + 3 + ... + 50
Solution: Sum = n(n+1)/2 = 50×51/2 = 1275
3. A sum amounts to ₹6050 in 2 years and ₹6655 in 3 years at CI. Find rate.
Solution: Interest in 1 year = 6655 - 6050 = ₹605 Rate = 605/6050 × 100 = 10%
4. A and B together complete work in 12 days. A alone in 20 days. How long for B alone?
Solution: 1/A + 1/B = 1/12 1/20 + 1/B = 1/12 1/B = 1/12 - 1/20 = (5-3)/60 = 2/60 = 1/30 B = 30 days
5. Find next: 1, 4, 9, 16, 25, ?
Solution: Perfect squares: 1², 2², 3², 4², 5² Next = 6² = 36
6. Average of 5 numbers is 20. If one number excluded, average becomes 18. Find excluded number.
Solution: Sum of 5 = 20 × 5 = 100 Sum of 4 = 18 × 4 = 72 Excluded = 100 - 72 = 28
7. Ratio of present ages of A and B is 4:5. After 5 years, ratio becomes 5:6. Find B's present age.
Solution: Let ages be 4x and 5x (4x+5)/(5x+5) = 5/6 24x + 30 = 25x + 25 x = 5 B's age = 5 × 5 = 25 years
8. A boat covers 16 km downstream in 2 hours and same distance upstream in 4 hours. Find stream speed.
Solution: Downstream speed = 16/2 = 8 km/hr Upstream speed = 16/4 = 4 km/hr Stream speed = (8-4)/2 = 2 km/hr
9. Probability of getting at least one head when 3 coins are tossed.
Solution: P(at least 1 head) = 1 - P(all tails) = 1 - (1/2)³ = 1 - 1/8 = 7/8
10. How many factors does 72 have?
Solution: 72 = 2³ × 3² Number of factors = (3+1)(2+1) = 4×3 = 12
Technical Questions
1. Difference between WHERE and HAVING in SQL
- WHERE: Filters rows before grouping
- HAVING: Filters groups after GROUP BY
2. What is normalization?
- 1NF: Atomic values
- 2NF: No partial dependency
- 3NF: No transitive dependency
3. Explain ACID properties
- Atomicity: All or nothing
- Consistency: Valid state transition
- Isolation: Concurrent transactions don't interfere
- Durability: Committed changes persist
4. What is indexing?
5. Difference between INNER JOIN and LEFT JOIN
- INNER JOIN: Returns matching rows from both tables
- LEFT JOIN: Returns all rows from left table, matching from right
6. What is a deadlock?
7. Explain OSI model layers
- Physical, 2. Data Link, 3. Network, 4. Transport, 5. Session, 6. Presentation, 7. Application
8. What is the difference between TCP and UDP?
- TCP: Connection-oriented, reliable, ordered
- UDP: Connectionless, unreliable, faster
9. What is a primary key?
10. Explain different types of SQL commands
- DDL: CREATE, ALTER, DROP
- DML: SELECT, INSERT, UPDATE, DELETE
- DCL: GRANT, REVOKE
- TCL: COMMIT, ROLLBACK
Coding Questions
1. Find the second largest element in array.
def second_largest(arr):
if len(arr) < 2:
return None
first = second = float('-inf')
for num in arr:
if num > first:
second = first
first = num
elif num > second and num != first:
second = num
return second if second != float('-inf') else None
# Test
print(second_largest([10, 20, 4, 45, 99])) # 45
2. Check if two strings are anagrams.
def are_anagrams(s1, s2):
return sorted(s1) == sorted(s2)
# Or using Counter
from collections import Counter
def are_anagrams_counter(s1, s2):
return Counter(s1) == Counter(s2)
# Test
print(are_anagrams("listen", "silent")) # True
3. Implement binary search.
def binary_search(arr, target):
left, right = 0, len(arr) - 1
while left <= right:
mid = (left + right) // 2
if arr[mid] == target:
return mid
elif arr[mid] < target:
left = mid + 1
else:
right = mid - 1
return -1
# Test
print(binary_search([1, 3, 5, 7, 9], 5)) # 2
4. Find all pairs in array with given sum.
def find_pairs(arr, target):
seen = set()
pairs = []
for num in arr:
complement = target - num
if complement in seen:
pairs.append((complement, num))
seen.add(num)
return pairs
# Test
print(find_pairs([1, 5, 7, -1, 5], 6)) # [(1, 5), (7, -1), (1, 5)]
5. Reverse words in a string.
def reverse_words(s):
words = s.split()
return ' '.join(reversed(words))
# Test
print(reverse_words("Hello World")) # "World Hello"
Interview Tips
- Focus on SQL and database concepts
- Practice data integration scenarios
- Understand ETL basics
- Practice coding in Python/Java
- Learn data quality concepts
- Research Informatica products
- Practice problem-solving under time pressure
Best of luck with your Informatica placement!