Skip to main content

IBM OFF CAMPUS DRIVE FOR FRESHERS 2018 2019 2020 BE BTECH MTECH MSC MCA

 



IBM Off Campus drive recruitment hiring freshers as Associate Systems Engineer job across India. Candidates in BE/ BTech/ MTech having from 2018, 2019 & 2020 batch can apply for this role. For more details for eligibility criteria, selection process, apply the link read below.




Company NameIBM India
Job RoleAssociate Systems Engineer
QualificationBE/ BTech/ MTech
Job LocationBangalore
SalaryBest In Market
ExperienceFreshers

Eligibility Criteria:

  • Degree Courses: Graduation and Post-Graduation – B.E/ B.Tech/ M.E./ M.Tech /M.Sc /MCA – 60% or 6.0 CGPA.(Calculation of qualifying marks=Sum total of marks obtained divided by Sum total of maximum marks obtainable. All subjects will be considered including elective/optional subjects)
  • Course Completion Year: 2018/ 2019/ 2020 only with less than 2 years experience.
  • No current backlogs
Eligible Branches:
  • Computer Science and Engineering
  • Information Technology
  • Information Science
  • Software Engineering
  • Electronics & Communication Engineer
  • Electrical & Electronics Engineering
  • Applied Electronics & Instrumentation
  • Electrical Engineering
  • Electronics & Instrumentation Engineering
  • Electronics Telecommunication Engineering
  • Electronics Engineering
  • Electronics & Instrumentation
  • Control Instrumentation

For more information and To Apply click below 👇.

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

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++)

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