Capgemini Pseudo Code MCQ Test Questions with Answers

Pseudo Code Test Capgemini is a newly introduced Round in Placement Test. Most websites have uploaded random questions for this section, don’t trust them as PrepInsta provides the latest and actual questions and syllabus.

  • Capgemini Pseudo Coding MCQ Questions are from basic C input-output and C++, OOPS. Capgemini Coding Questions also contain some Data Structures Questions.
  • Capgemini Pseudo Coding Papers Section in Test Paper is of high difficulty.
  • Capgemini Pseudo Code Round has 25 Ques:-
  1. Pseudo Code Ques- 1 to 10 ques
  2. Data Structure Ques- 11 to 25 ques
Section No. of questions Suggested Avg. Time
Pseudo Code 25 Questions 25 mins

Read our Post on Detailed Syllabus and Online Test Pattern for Capgemini here, they have just changed their Syllabus in February.

Capgemini Coding MCQ Test Questions with Answers

Medium-High

Topics

5

Time

25 mins

Type of Exam

Adaptive

Negative Marking

No

Capgemini Pseudo Code Round Syllabus

capgemini coding mcq questions

Click here for Detailed Syllabus

Capgemini Syllabus

Capgemini Pseudocode Round Questions And Answers Pattern

In this round, there will be about 25 Questions that need to be answered in 25 mins.

Capgemini Pseudo Code & Data Structures Test

Free Material

Paid Material

Capgemini Practice Coding MCQ Questions

  • No Of Questions: 2-3
  • Difficulty Level: Medium
  • Importance: Moderate
  • Suggested time to solve: 35secs - 50 sec each

 

Paid Materials and Online Classes

Preparation Section

Persistent CMCQ Placement Papers

Click here for Pseudo Code Question

Pseudo Code

Capgemini Pseudo Code Test

Free Material

Paid Material

 

Capgemini Practice Coding MCQ Questions

  • No Of Questions: 2-3
  • Difficulty Level: Medium
  • Importance: Moderate
  • Suggested time to solve: 35secs - 50 sec each

 

 

Time: 00:00:00

Question #1

Consider the following piece of code. What will be the space required for this code?

int sum(int A[], int n)
{
int sum = 0, i;
for(i = 0; i < n; i++)
sum = sum + A[i];
return sum;
}
// sizeof(int) = 2 bytes
A
2n + 8
2n + 8
B
2n + 4
2n + 4
C
2n + 2
2n + 2
D
2n
2n
  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

2n+4

Start

Time: 00:00:00

Question #2

What will be the output of the following pseudo code?

For input a=8 & b=9.
Function(input a,input b)
If(a<b)
return function(b,a)
elseif(b!=0)
return (a+function(a,b-1))
else
return 0
A
56
56
B
88
88
C
72
72
D
65
65
  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Time: 00:00:00

Question #3

What will be the output of the following pseudo code?

Input m=9,n=6
m=m+1
N=n-1
m=m+n
if (m>n)
print m
else
print n
A
6
6
B
5
5
C
10
10
D
15
15
  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

m=9, n=6 m=9+1 =10 N=6-1 =5 m=10+5 =15 if(15>6) print 15 else print 6 so the answer is 15

Start

Time: 00:00:00

Question #4





What will be the output of the following pseudo code?








Input f=6,g=9 and set sum=0
Integer n
if(g>f)
for(n=f;n<g;n=n+1)
sum=sum+n
End for loop
else
print error message
print sum



A
21
21
B
15
15
C
9
9
D
6
6
  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Time: 00:00:00

Question #5

Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved by chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15, 20, 33, 12, 17, 10. The maximum, minimum, and average chain lengths in the hash table, respectively, are
A
3, 0, and 1
3, 0, and 1
B
3, 3, and 3
3, 3, and 3
C
4, 0, and 1
4, 0, and 1
D
3, 0, and 2
3, 0, and 2
  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Time: 00:00:00

Question #6

You have an array of n elements. Suppose you implement a quick sort by always choosing the central element of the array as the pivot. Then the tightest upper bound for the worst case performance is:
A
O(n2)
O(n2)
B
O(nLogn)
O(nLogn)
C
Θ(nLog2)
Θ(nLog2)
D
O(n3)
O(n3)
  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Time: 00:00:00

Question #7

Let G be a graph with n vertices and m edges. What is the tightest upper bound on the running time on Depth First Search of G? Assume that the graph is represented using adjacency matrix.
A
O(n)
O(n)
B
O(m+n)
O(m+n)
C
O(n2)
O(n2)
D
O(mn)
O(mn)
  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Time: 00:00:00

Question #8

Let P be a Quick Sort Program to sort numbers in ascending order using the first element as a pivot. Let t1 and t2 be the number of comparisons made by P for the inputs {1, 2, 3, 4, 5} and {4, 1, 5, 3, 2} respectively. Which one of the following holds?
A
t1 = 5
t1 = 5
B
t1 < t2
t1 < t2
C
t1 > t2
t1 > t2
D
t1 = t2
t1 = t2
  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Time: 00:00:00

Question #9

What does the following piece of code do?

public void func(Tree root)
{
func(root.left());
func(root.right());
System.out.println(root.data());
}
A
Preorder traversal
Preorder traversal
B
Inorder traversal
Inorder traversal
C
Postorder traversal
Postorder traversal
D
Level order traversal
Level order traversal
  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Post order Traversal : LEFT> RIGHT >ROOT

Start

Time: 00:00:00

Question #10

How will you find the minimum element in a binary search tree?

a) public void min(Tree root)
{
while(root.left() != null)
{
root = root.left();
}
System.out.println(root.data());
}

b) public void min(Tree root)
{
while(root != null)
{
root = root.left();
}
System.out.println(root.data());
}

c) public void min(Tree root)
{
while(root.right() != null)
{
root = root.right();
}
System.out.println(root.data());
}

d) public void min(Tree root)
{
while(root != null)
{
root = root.right();
}
System.out.println(root.data());
}
A
a
a
B
b
b
C
c
c
D
d
d
  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

["0","40","60","80","100"]
["Need more practice!","Keep trying!","Not bad!","Good work!","Perfect!"]
×

Please login to report

Capgemini Pseudo Code Topics Analytics 2020

C

  • Number of Questions: 3 - 4 Ques
  • Difficulty Level: Medium-High
  • Importance: Moderate
  • Suggested time to solve: 40secs - 50 sec each

C++

  • Number of Questions: 4 - 5 Ques
  • Difficulty Level: High
  • Importance: Moderate
  • Suggested time to solve: 40secs - 50 sec each

OOPS

  • Number of Questions: 2 -3 ques
  • Difficulty Level: High
  • Importance: Medium
  • Suggested time to solve: 35secs - 60 sec each

Data Structures

  • Number of Questions:4 - 5Ques
  • Difficulty Level: High
  • Importance: Moderate
  • Suggested time to solve: 25secs - 55 sec each

Pseudo Code

  • Number of Questions:3 - 6 ques
  • Difficulty Level: Easy - High
  • Importance: Moderate
  • Suggested time to solve: 40secs -1min 20sec

Overall Analytics

Persistent Placement Papers

  • Total Number of Questions: 25
  • Time: 25 mins
  • Suggested time to solve:- 40sec - 1min 30sec
  • Importance:- High
  • Difficulty Level:- Moderate-High

Pseudo Code

Cut Off

Difficulty

Importance

Capgemini Pseudo Code Questions based FAQ’s

Topics No. of questions in the test Suggested Avg. Time Difficulty
C 4 - 5 Low High
C++ Classes 3 Med Medium
OOPS 3 High Medium
DSA 4 Med High
Misc 2 High Low

Capgemini Pseudo Code Test Questions Specific FAQ’s

Ques. How many Questions are there in Capgemini Pseudo Code MCQ’s?

Ans. There are 25 Questions that need to be solved within 25 mins.

Ques. What is the level of difficulty for capgemini pseudo code test questions?

Ans. Capgemini pseudo code test questions are of moderate difficulty but you need to score atleast 85%ile in this section to get to the next round necessarily.

Ques. What is the Syllabus for capgemini pseudocode round questions and capgemini pseudocode questions and answers pdf?

Ans. There is no such Syllabus for Capgemini pseudocode questions and answers but from what we have observed it has basic C input-output questions and basic C Syllabus that was there in first and we have given chapter wise questions above please check them Capgemini Pseudocode Round Questions.

If you may have any questions related to Capgemini Please ask them in the comments below. We will try to answer them for Capgemini pseudo code test questions within 24 hours.

Reviews

infosys referral

Nandini Dey

Capgemini

This is the best site you can ever find for preparation. You can find every single piece of information related to the company or placement paper on this website. They provide the best-paid material which helps in Online test paper.

Summary
Review Date
Reviewed Item
Capgemini Pseudo Code Round Test Questions and Answers
Author Rating
51star1star1star1star1star

Comments

Please Login/Signup to comment

2 comments on “Capgemini Pseudo Code Round Test Questions”


  • Ananya Pillay

    thankyou for all coding questions. very helpful. I hav studied all of them for my exam. I want to buy pseudo code paid questions

    0
    1

Your Percentile (0%)

You can check your score after Login/Signup

Your Global Capgemini Ranking

-

Your Capgemini- Pseudo Code Ranking

-

The percentile data will be refreshed at 11:59 PM everyday

Trending