Skip to main content

Capegemini Off Campus Drive 2021 Batch Engineering/MCA Freshers

 Capgemini is a global leader in partnering with companies to transform and manage their business by harnessing the power of technology. The Group is guided everyday by its purpose of unleashing human energy through technology for an inclusive and sustainable future.

Capgemini in India comprises over 150,000 team members working across 13 locations. We create opportunities for our colleagues to work on new-age technologies, along with the opportunity to travel internationally and work with the world’s leading brands. Our +50-year growth story is built upon the workforce of the future, and we enable our talent to excel in their careers by focusing on continuous learning and up-skilling.

Last date to register October 15, 2021

Test Assessment for registered students will begin from 2nd week of October 2021

Eligibility Criteria:

Referred candidates MUST meet ALL of the following criteria:

  • Candidates graduating in 2021/graduated in 2021
  • Qualification – MCA, BE/BTech (open for all branches for both BE and BTech)
  • ME/MTech students must be only from Information Technology, Information Science, Computer Science
  • Scored 50% and above in Diploma, Graduation (aggregate of 7 semesters) and MCA (aggregate of 5 semesters)/ME/MTech
  • Should be open to sign Service Level Agreement bond
  • Must be open to relocate to any Capgemini location, work across technology, domain, role and should be ready to work in shifts if required
  • Candidate should not have more than 1 year of gap between academic milestone stages
  • The academic milestone stages considered are X, XII, Degree and Post-Graduation
  • Candidate should not have any gap within an academic milestone
    • Candidate appeared for XII twice, will be considered provided both the marksheets are available
    • Candidate should not take more than 4 years to complete BE / BTech
    • Candidate choosing Degree after Diploma should not have any gaps between Diploma and Degree
  • Candidate should not have any backlog at the time of appearing for the process
  • Only shortlisted candidates will be invited for the test assessment/selection process
  • Entire selection process from test to interview will be done in virtual mode
  • Candidates will be responsible for arranging required infrastructure for appearing for the selection process which will be conducted online

Dates to register: October 5, 2021 to October 15, 2021

Test Assessment for registered students will begin from 2nd week of October 2021






*Only those candidates who have cleared test assessment (Step 1 to Step 3) will be invited for the interview.

The Behavioral Profiling module is for understanding the innate profile of the candidate, for which we will share a workstyle report with the students who complete the Behavioral Profiling module.

*Please note that receiving the workstyle report does not confirm the clearance of test assessment

Post registration in the tool you need to apply for the job profile to participate in the event.

Apply Link:👇

Job Link 👈

Popular posts from this blog

Check whether a number is Seed of another number

 A number P is said to be the seed of another number Q if multiplying P with its digits equates to Q. Ex:-  123 is seed of 738 as    123 * 1 * 2 * 3 = 738  Java 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 public class Seed{ public static void main (String[] args){ int num1 = 123 , num2 = 738 ; num1 = Math. min (num1,num2); num2 = Math. max (num1,num2); System. out . println (checkSeed(num1, num2)); } public static boolean checkSeed ( int num1, int num2){ int seed = num1; while (num1> 0 ){ seed = seed * (num1% 10 ); num1 = num1 / 10 ; } if (seed==num2) return true ; else return false ; } } Python def checkSeed(num1,num2): seed = num1 while num1 > 0 : seed = seed * (num1 % 10 ) num1 = num1 // 10 if seed == n
Read more

Program to sort the first half of an array in ascending and second half in descending order

Ex:-  [2, 4, 3, 10, 5, 8] [2, 4, 3]  and [10, 5, 8] ====>  [2, 3, 4] ascending                                                              [10, 8, 5] descending [ 2, 3, 4, 10, 8, 5] is the required answer.  Java 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 public class ArraySort{ public static void main (String[] args){ int [] arr = { 2 , 4 , 3 , 10 , 5 , 8 }; //sorting first half in ascending order for ( int i= 0 ; i<(arr. length / 2 ); i++){ for ( int j=i+ 1 ; j<(arr. length / 2 ); j++){ if (arr[i]>arr[j]){ int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } } } //sorting second half in descending order for ( int i=(arr. length / 2 ); i<arr. length ; i++){ for ( int j=i+ 1 ; j<arr. length ; j++)
Read more

Write a method to move hyphens to the left and characters to the right in a string

 Ex:-     code--heist--   ==>     ----codeheist Note:-  Return null or None if str is empty. Java 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 public static String moveHyphens (String str) { if (str. length ()== 0 ) return null ; else { String result = "" ; for ( int i= 0 ; i<str. length (); i++){ char ch = str. charAt (i); if (ch== '-' ) result = ch + result; else result += ch; } return result; } } Python def moveHyphens (str): if len(str)== 0 : return None else : result = "" for char in str: if char== '-' : result = char + result; else : result += char return result
Read more