Skip to main content

Eurofins Off Campus Drive

 

Eurofins Off Campus Drive 2020/2021

About Eurofins IT Solutions India

Eurofins IT Solutions India, EITSI is a fully owned subsidiary of Eurofins and functions as a Global Software Delivery Center exclusively catering to Eurofins Global IT business needs. The code we ship out of EITSI impacts the global network of Eurofins labs and services.

The primary focus at EITSI is to develop the next generation LIMS (Lab Information Management system), Customer portals, e-commerce solutions, ERP/CRM system, Mobile Apps & other B2B

platforms for various Eurofins Laboratories worldwide.


Job Description
POSITION TITLE:                  Associate Software Engineer                
REPORTING LOCATION:     Bangalore / Chennai
WORKING LOCATION:         Bangalore / Chennai
Inviting aspirants to join our team as Associate Software Engineer.
If your excited to be part of a winning team, Eurofins is a great place to grow your career. You’ll be glad you made the right choice to join us.

Skills required to contribute: -
  • Should have good communication and interpersonal skills.
  • Portray strong analytical and problem solving skills.
  • Must be good in one of the programing language like C, C++, C#, Java, or Python.
  • Willingness to work in collaboration with team.
  • Demonstrate the ability to multitask and drive efforts in an agile way.
  • Focus Customer centric approach.
  • Knowledge to latest technology’s like Mobile development / Web development / MSSQL or any RDBMS would be an added advantage.

Experience:

  • 0 – 1 Year of experience

Qualifications

  • BE (CS/IT/IS/EC), B.Tech, BSc (CS/IT), M. Tech, MSC - CS/IT/IS, MCA,  Diploma in Computers ( Graduated in 2020/2021     & Marks Eligibility is 65% or CGPA – equivalent of 65% )

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

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