Skip to main content

Ebizon Off Campus Drive 2020/2021

 Roles and Responsibilities

Proficiency in CS concepts such as Data Structures, Algorithms and Operating systems.
Strong hands-on knowledge in one Object-Oriented Language (either of C++/Java) and a server-side scripting language such as Ruby, Python, PHP.
Knowledge of MVC frameworks like Rails, Django, Yii is preferred.
A good understanding of web technologies like Javascript, HTML5, CSS is required.
Sound understanding of relational databases like MySQL, PostgreSQL.
A good understanding of version control tools like Git, Subversion is required.
Prior exposure to web frameworks like Bootstrap, AngularJS is good to have.
Good communication skills.

Desired Candidate Profile

B.Tech 2020/2021 pass out with 70% throughout overall academics.
Immediate joiners.
Strong coding skills.
Strong analytical skills.
Good communication, ability to perform in a team

Thinking why EbizON!!!
 

  • Saturday & Sunday fixed week offs
  • Competitive salary and timely increments
  • Potential Career Growth to Lead role for high performers
  • Team & Individual Learning and Development is part of our culture
  • Vibrant community and regular team outs Corporate Offsite
  • Great team members & energy filled work environment
  • Plush Office Campus

About Ebizon

Ebizon is a Mobile Commerce Technology Consulting Company. We have been into the business since 2007 and are growing as open-source web development and consulting organization. Headquartered in Noida, we have a strong team of mobile & web-developers, having extensive experience in open source technologies and mobile technologies. Technical & domain expertise in the verticals of E-Commerce, Education, Non-Profits & Publishing. Our mobile commerce platform is being used by some of the largest e-commerce retailers in the world. It is being used in over 30+ countries and has over 200+ deployments with the major market in North America.
Ebizon is founded by IIT Bombay graduate, Sudeep Goyal and have IIT alumni on its board and in the leadership team. We do whatever it takes to ensure the quality of service to our clients is unmatched anywhere. We love challenging work and that motivates us. If you want to learn, grow and have fun doing it, we are the place to be.

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