Skip to main content

Visual BI Off Campus Drive ( For Freshers )

 




Company                              Visual BI
Job Role                        Product Developer
Experience                               2021
Salary                            Best in Industry
Job Location                            Chennai


Who can apply?

2021 Graduates & Post Graduates from the below mentioned discipline willing to pursue a career in Product Development

BE , ME, MCA, M.Sc (IT/CS)


What opportunities are available?

Product Developer : In this role, you would be building best-in-class BI Products


How to apply?

  • Fill in the application form, attach your resume and answer the questions listed. As we would like to get to know you better through these responses, we encourage you to respond truthfully based on your personality and life experiences.
  • There are no right or wrong answers to these questions – so answer them to your best ability possible

About the application form

  • Tip: The answer fields in the application form can be enlarged by clicking on & dragging the bottom right corner.
  • In the application form, you will see an option saying 'Apply with LinkedIn'. Please ignore this option.


What happens after I submit my application?

  • Our team would go through the applications & will get in touch with the shortlisted applicants for the pre-assessment calls
  • You'll be taking up an assessment to start with & the recruiter will brief you on the same.
  • You'll participate in a series of interviews with us, general & technical. In this process we'll also assess how well you'll fit into our culture. For us right attitude is more important, one can always be trained technically but Attitude is what you already possess & we give prime importance to it.
  • We'll be in touch with you during the entire process & share regular updates with you.Feel free to just pick up the phone or drop an email to us in case you have any question.You should be able to hear the results from us in a week's time after the final interview.


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