Capgemini Exceller Technical Interview Questions for Analyst

Capgemini Exceller Technical Interview Questions 2023

We have listed the latest Capgemini Exceller Technical Interview Questions on this page. Go through this page to prepare for your Capgemini Exceller Technical Interview.

Page Highlights:-

  • Capgemini Exceller Test Pattern
  • Capgemini Exceller Technical Interview Questions

Capgemini Exceller Test Pattern

Capgemini has introduced its new Capgemini Excceller Campus Hiring Process. Through this, they are hiring for three profiles:-

  1. Analyst
  2. Analyst Star
  3. Senior Analyst

Capgemini will hire you for one of the above roles depending on your performance in the online assessment and interviews.

Capgemini Exceller Test Pattern includes:-

  • Technical Assessment Pseudo Code
  • English Communication Test
  • Game-Based Aptitude
  • Behavioral Competency

You can read more about Capgemini Exceller Hiring Process at :- Capgemini Exceller Drive Hiring Process

Capgemini Exceller Technical Interview Questions

1. What does SQL stand for? Give some advantages of Query.

Answer:-

SQL stands for Structural Query Language. One of the most crucial features of a query is that it provides a convenient way to save a number of fields. A query does not really save data; it just links to data. A query is not a duplicate of the data when it is saved. Combine data from many sources.

2. Write a program for Octal to Decimal conversion.

Answer:-

3. What is meant by bit masking?

Answer:-

Bit masking is the process of limiting the number of bits that may be set in a byte or bytes. A byte is bitwise “ANDed” with a mask, which is a number made up exclusively of the relevant bits, to investigate some of its bits.

4. What are the methods available for storing sequential files?

Answer:-

  • Straight merging
  • Natural merging
  • Polyphase sort
  • Distribution of Initial runs

5. What is the purpose of finalization?

Answer:-

Finalization serves as an opportunity for an unreachable object to complete any cleaning processes before the object is garbage collected.

6. Write a C Program to check if the number is a Harshad number or not.

#include <stdio.h>

int checkHarshad(int num){
    
    int sum = 0;
    int temp = num;
    
    while(temp != 0){
        sum = sum + temp % 10;
        temp /= 10;
    }
    
    // will return 1 if num is divisible by sum, else 0
    return num % sum == 0;
}

int main ()
{
    int num = 153;
    
    if(checkHarshad(num))
        printf("%d is Harshad's Number", num);
    else
        printf("%d is not Harshad's Number", num);

    return 0;
}
// Time complexity: O(N)
// Space complexity: O(1)
#include <iostream>
using namespace std;

int checkHarshad(int num){
    
    int sum = 0;
    int temp = num;
    
    while(temp != 0){
        sum = sum + temp % 10;
        temp /= 10;
    }
    
    // will return 1 if num is divisible by sum, else 0
    return num % sum == 0;
}

int main ()
{
    int n = 153;
    
    if(checkHarshad(n))
        cout << n << " is a Harshad's number";
    else
        cout << n << " is not a Harshad's number";

    return 0;
}
// Time complexity: O(N)
// Space complexity: O(1)
// Where N is the number of digits in number
public class Main {
    public static void main(String[] args)
	{
		//make a copy of original number
		int n = 47;
		//declare a variable to store sum of digits
		int result = 0;
		//perform logic for calculating sum of digits of a number
		while(n != 0)
		{
			int pick_last = n % 10;
			result = result + pick_last;
			n = n / 10;
		}
		/*use condition to check whether the number entered by  
		user is completely divisible by its sum of digits or not*/
      if(n % result == 0)
      System.out.println("Harshad Number");
          else
        System.out.println("Not a Harshad Number");
}
}
n = 21
p=n
l=[]
sum1=0
while(n>0):
    x=n%10
    l.append(x)
    n=n//10
sum1=sum(l)
if(p%sum1==0):
    print("Harshad number")
else:
    print("Not harshad number")

7. What are the three types of data migration tools?

Answer:-

The three types of data migration tools:

  • On-premise data migration tools
  • Cloud-based data migration tools
  • Open-source data migration tools

8. What are a few of the applications that make use of Multilinked Structures?

Answer:-

  • Sparse matrix
  • Index generation

9. Why do we always need to import java.lang package?

Answer:-

No. By default, the JVM loads it internally.

10. Is the main keyword in Java?

Answer:-

No. main is not a keyword in Java.

11. What is a point-point link?

Answer:-

A point-point link is one where the physical connections are restricted to two nodes.

12. Which is the simplest file structure?

Answer:-

Sequential is the simplest file structure.

13. What are the different validators in ASP.NET?

Answer:-

The different validators in ASP.NET are

  • RequiredFieldValidator.
  • RangeValidator.
  • CompareValidator.
  • RegularExpressionValidator.
  • CustomValidator.
  • ValidationSummary.

14. What types of modifiers may be used on methods in an interface?

Answer:-

Methods in interfaces can only have public and abstract modifiers.

15. How are arithmetic expressions evaluated using the prefix and postfix forms notations?

Answer:-

Polish and Reverse Polish notations

16. Write a program to find prime factors of a number.

Answer:-

17. What method are all threads need to implement?

Answer:-

All tasks, whether they are Thread subclasses or implement the Runnable interface, must implement the run() function.

18. What is a node?

Answer:-

A network can be made up of two or more computers that are physically linked together, such as through an optical fiber or coaxial cable. These physical connections are known as Links, and the machines they link are known as Nodes.

19. Describe the places where data structures are widely used.

Answer:-

  • Operating System
  • Database Management System
  • Compiler Design
  • Graphics
  • Artificial Intelligence
  • Statistical analysis package
  • Numerical Analysis
  • Simulation

20. Write a program to find the Fibonacci series up to n.

#include<stdio.h>

int main()
{
    int n = 10;
    int a = 0, b = 1;
    
    // printing the 0th and 1st term
    printf("%d, %d",a,b);
    
    int nextTerm;
    
    // printing the rest of the terms here
    for(int i = 2; i < n; i++){
        nextTerm = a + b;
        a = b;
        b = nextTerm;
        
        printf("%d, ",nextTerm);
    }

    return 0;
}
//Fibonacci Series using Recursion
#include<bits/stdc++.h>
using namespace std;
 
int F(int N)
{
    if (N <= 1)
       {
        return N;
       }
       
    return F(N-1) + F(N-2);
}
 
int main ()
{
    int N = 5;
    cout << F(N);
    return 0;
}
public class Main
 {
   public static void main (String[]args)
   {

     int num = 15;
     int a = 0, b = 1;

     // Here we are printing 0th and 1st terms
       System.out.print (a + " , " + b + " , ");

     int nextTerm;

     // printing the rest of the terms here
     for (int i = 2; i < num; i++)
       {
      nextTerm = a + b;
      a = b;
          b = nextTerm;
          System.out.print (nextTerm + " , ");
       }


   }
 }
num = 10
n1, n2 = 0, 1
print("Fibonacci Series:", n1, n2, end=" ")
for i in range(2, num):
    n3 = n1 + n2
    n1 = n2
    n2 = n3
    print(n3, end=" ")

print()
 

Get over 200+ course One Subscription

Courses like AI/ML, Cloud Computing, Ethical Hacking, C, C++, Java, Python, DSA (All Languages), Competitive Coding (All Languages), TCS, Infosys, Wipro, Amazon, DBMS, SQL and others

Checkout list of all the video courses in PrepInsta Prime Subscription

Checkout list of all the video courses in PrepInsta Prime Subscription