Placement Preparationan HCL GUVI product
Capgemini Sample Placement Paper & Questions
Preparing for the Capgemini online assessment, a standardized recruitment test conducted by Capgemini, requires a clear understanding of the exam pattern, frequently asked question types, and an effective preparation strategy.
Scroll down to practice the latest Capgemini Placement Paper and Questions.
Capgemini Placement Questions - Sample Question Paper
1.
1. Consider an array of double elements. What is the difference between the memory addresses of the 2nd and 6th elements, if each double occupies 8 bytes?
16 bytes
32 bytes
24 bytes
8 bytes
2.
2. Which of the following statements is/are true for an AVL Tree?
1.The height difference between the left and right subtrees of any node is at most 1.
2.Every binary search tree is an AVL tree.
3.An AVL tree guarantees O(log n) search time.
Only 1 and 3
Only 1 and 2
Only 2 and 3
All of the above
3.
3. Which data structure would best suit this operation if elements are to be processed in the same order as they appear?
Stack
Queue
Array
Priority Queue
4.
4. Consider the array A = {5, 9, 14, 19, 23, 30, 45, 50} and the key = 23.
How many comparisons are needed to find the key element using binary search?
4
3
2
1
5.
5. If you are using Breadth-First Search (BFS) for traversing a weighted graph, then which of the following statements are true?
1.It guarantees the shortest path only for unweighted graphs.
2.It cannot find the shortest path in weighted graphs where edge weights are not uniform.
Only 1 is true
Only 2 is true
Both 1 and 2 are true
Both 1 and 2 are false
6.
6. What will be the output of the following pseudocode?
Integer a, b, i
Set a = 2, b = 3
While(a > 0)
For(i from 1 to b)
Print i
End For
Print new line
a = a - 2
End While
Infinite loop
No output
1 2 3
1 2 2003
7.
7. What will be the output of the following pseudocode?
Integer a, b
Set a = 12, b = 4
While(a > 2)
For(i from 2 to b+2)
Print i * 2
End For
Print new line
a = a / 3
End While
4 6 8 10 4 6 8 10
4 6 8 10
Infinite loop
2 4 6 8
8.
8. What will be the output of the following pseudocode?
Integer n, a, b, c
Set n = 8
a = n << 2
b = n >> 1
c = n << 3
Print a, b, c
16 4 32
32 4 64
8 4 8
Cannot be determined
9.
9. What will be the output of the following pseudocode?
Integer x, arr[]
Set arr = {2, 4, 6, 8}
x = *arr + 1
++*arr
Print x, *arr
3 2
3 3 2 3
Compilation error
10.
10. What will be the output of the following pseudocode?
Integer a[]
Set a = {5, 10, 15, 20}
a[0]++;
++a[1];
a[2] = a[1] + a[0];
Print a[0], a[1], a[2]
6 11 17
5 10 15
6 11 16
Compilation error
11.
11. What will be the output of the following pseudocode?
Integer temp, num
Set temp = 2, num = 12
While(num greater than 0)
num = num >> temp++
Print "Hello "
End while
Infinite
Hello Hello Hello
Hello Hello
Hello
12.
12. What will be the output of the following pseudocode?
Integer temp, num, count, i, j, k
Set temp = 2, num = 4, count = 0
for (each i from 0 to num - 1)
for (j from num + temp to 3 * num incrementing by 2)
for (k from 1 to temp incrementing by 3)
count++
end for
end for
end for
Print count
8
10
12
16
13.
13. What will be the output of the following pseudocode?
Integer temp, num, count, i, j, k, s
Set temp = 1, num = 4, count = 0
for (each i from 0 to num - 1)
for (j from num to 3 * num incrementing by 2)
for (k from 1 to temp incrementing by 3)
s = i + j + k
6
8
10
12
14.
14. What will be the output of the following pseudocode?
Integer temp, num, count, i, j, k
Set temp = 3, num = 8, count = 0
for (each i from 0 to num - 1)
for (j from num to 3 * num incrementing by 2)
for (k from 1 to temp incrementing by 3)
if (j % 2 == 1)
count++
end if
end for
end for
end for
Print count
0
8
12
16
15.
15. What will be the output of the following pseudocode?
Integer a = 0, b = 0
// Line 1
while(a less than 3)
a++ // Line 2
while(b less than 2)
print a
goto line 2
end while
end while
1 2
1 2 3
2 3
3 3
Frequently Asked QuestionsFAQ
Are the provided sample questions from previous Capgemini exams?
The provided sample questions are designed based on analysis of previous Capgemini exams, candidate experiences, and official assessment patterns. While not exact replicas, they closely reflect the structure, difficulty level, and topic distribution of the actual test.
How similar are the sample questions to the actual questions in the Capgemini hiring test?
The sample questions closely resemble the actual Capgemini hiring test in terms of question format, topic coverage, and difficulty. Practicing these questions helps candidates understand the exam pattern and build confidence for the real assessment.
How regularly are Capgemini sample question papers updated to align with the current exam pattern?
Capgemini sample question papers are updated periodically based on the latest recruitment guidelines, candidate feedback, and changes in assessment structure, ensuring alignment with the current exam pattern and evolving hiring requirements.
What is the difficulty level of the Capgemini exam?
The difficulty level of the Capgemini exam ranges from easy to moderate in aptitude and English sections, while technical and coding sections are generally moderate to high, testing both conceptual understanding and problem-solving abilities.
Is switching allowed between questions in a particular section?
In most Capgemini online assessments, candidates are allowed to navigate between questions within a section. However, section-wise navigation rules may vary depending on the assessment platform and proctoring guidelines.
Is there a negative marking in the Capgemini exam?
No, there is no negative marking in the Capgemini online assessment. Candidates are encouraged to attempt all questions, as incorrect answers do not result in score deductions.
What will be the mode of the Capgemini exam?
The Capgemini exam is conducted in an online, AI-proctored mode. Candidates must have a stable internet connection, a functional webcam, and a distraction-free environment to successfully complete the assessment.
How many coding questions are there in the Capgemini exam?
The Capgemini exam typically includes two coding questions in the final coding round. These questions are of medium to great difficulty and are evaluated based on correctness, test cases passed, and code efficiency.