Latest placement question papers for Capgemini

Statements:
For over three decades Company X has been totally involved in energy conservation, its efficient use and management.

Conclusions:
I. The Company has yet to learn and acquire basic things in this area.
II. It is dedication that is more important than knowledge and expertise

The data given by the U.S. Labour Ministry indicate that till the year 2000, there will be a shortage of 1,00,000 programmers. A spokesman from the industry said, "We should understand this thoroughly America needs Indian programmers. This is not only the question of investment but also of the talent with which the Indian programmers are equipped".

Statements:
Playing football daily for 1 hour can increase a person's life span by one year.
Conclusion:
I. Moderate level of physical exercise is necessary for leading a healthy life.
II. All people who do desk-bound jobs definitely suffer medical issues.

Statement:
Lalita scored 90 % marks in the 12th standard. He got highest marks in Science and English.

Conclusion:
I. Lalita is a very bright student.
II. Lalita did not get highest marks in other subjects except Science and English.

What is the difference between a normal(naive) array and a sparse array?

Choose the appropriate code that counts the number of non-zero(non-null) elements in the sparse array.

I. public int count()
{
int count = 1;
for (List cur = this.next; (cur != null); cur = cur.next.next)
{
count++;
}
return count;
}

II. public int count()
{
int count = 0;
for (List cur = this.next; (cur != null); cur = cur.next)
{
count++;
}
return count;
}

III. public int count()
{
int count = 0;
for (List cur = this; (cur != null); cur = cur.next)
{
count++;
}
return count;
}

IV. public int count()
{
int count = 1;
for (List cur = this.next; (cur != null); cur = cur.next)
{
count++;
}
return count;
}

Choose the correct function from the following which determines the number of inversions in an array?

<b>I.</b> int InvCount(int arr[], int n) 
{ 
 int count = 0; 
 for (int i = 0; i < n - 1; i++) 
  for (int j = i + 1; j < n; j++) 
   if (arr[i] < arr[j]) 
    count++; 
 
 return count + 1; 
}

<b>II.</b> int InvCount(int arr[], int n) 
{ 
 int count = 0; 
 for (int i = 0; i < n - 1; i++) 
  for (int j = i ; j < n; j++) 
   if (arr[i] >= arr[j]) 
    count++; 
 
 return count; 
}

<b>III.</b> int InvCount(int arr[], int n) 
{ 
 int count = 0; 
 for (int i = 0; i < n - 1; i++) 
  for (int j = i + 1; j < n; j++) 
   if (arr[i] > arr[j]) 
    count++; 
 
 return count; 
}

<b>IV.</b> int InvCount(int arr[], int n) 
{ 
 int count = 0; 
 for (int i = 0; i < n - 1; i++) 
  for (int j = i + 1; j < n; j++) 
   if (arr[i] > arr[j]) 
    count++; 
 
 return count + 1; 
}

#include <iostream>
using namespace std;
int main()
{   
    int arr[] = {1,2,3,4,5,6};
    int n = sizeof(arr)/sizeof(arr[0]);
    int d=4;
    int temp[10];
 
    for(int i=0;i<d;i++)
    temp[i]=arr[i];
 
    int j=0;
    for(int i=d;i<n;i++,j++)
    arr[j]=arr[i];
 
    int k=0;
    for(int i=n-d;i<n;i++,k++)
    arr[i]=temp[k];
 
    for(int i=0;i<n;i++)
    cout<<arr[i]<<" ";
    return 0;
}

#include <bits/stdc++.h> 
using namespace std; 
 
void func1(int arr[], int n) 
{ 
 int k = arr[0], i; 
 for (i = 0; i < n - 1; i++) 
  arr[i] = arr[i + 1]; 
 
 arr[i] = k; 
} 
 
void func(int arr[], int d, int n) 
{ 
 for (int i = 0; i < d; i++) 
  func1(arr, n); 
} 
 
void printArray(int arr[], int n) 
{ 
 for (int i = 0; i < n; i++) 
  cout << arr[i] << " "; 
} 
 
int main() 
{ 
 int arr[] = { 1, 2, 3, 4, 5}; 
 int n = sizeof(arr) / sizeof(arr[0]); 
 
 
 func(arr, 3, n); 
 printArray(arr, n); 
 
 return 0; 
}

#include <iostream>
using namespace std;
int main()
{   
    int arr[] = {1,2,3,4,5,6};
    int n = sizeof(arr)/sizeof(arr[0]);
    int d=4;
    int temp[10];
 
    for(int i=0;i<d;i++)
    temp[i]=arr[i];
 
    int j=0;
    for(int i=d;i<n;i++,j++)
    arr[j]=arr[i];
 
    int k=0;
    for(int i=n-d;i<n;i++,k++)
    arr[i]=temp[k];
 
    for(int i=0;i<n;i++)
    cout<<arr[i]<<" ";
    return 0;
}