Skip to main content

Cloudmoyo Off Campus Drive 2020/2021 | BE/BTech/ME/MTech

Cloudmoyo Off Campus Drive 2020/2021 | BE/BTech/ME/MTech


CloudMoyo is the partner of choice for solutions at the intersection of cloud, analytics, and AI. As a leading cloud and analytics partner for Microsoft, we bring together powerful business intelligence (BI) capabilities using the Azure data platform to help modern enterprises define their path to the cloud, transform complex data into actionable insights, and modernize their data landscape. Headquartered in Bellevue, WA, with an innovation center in Pune, India, and a presence in Kansas City, CloudMoyo is poised to help intelligent enterprises build innovative solutions and stay ahead in the disruption cycle. Our proven track record includes developing enterprise solutions for Fortune 1000 companies such as Microsoft and Kansas City Southern. 


Job Description :

ROLE : Associate Software Analyst

JOB TYPE : Full Time

CTC :INR 3.6 to 4.25  LPA

ELIGIBILITY CRITERIA:  2020 and 2021 Batch; BE/BTech/ME/MTech(Computer Science) with 60% above in 10th ,12th and Graduation

LOCATION: Pune( BANER)

SERVICE BOND : No


Skills Required:

  • C#/ASP.NET/.Net Core/Javascript/Angular guru with the ability to understand complex domain problems and churn out a PoC quickly
  • A great communicator of ideas and solutions and a lateral thinker when faced with complex performance or production issues

Selection Process:

  • Online Test 
  • Technical Interview
  • HR Discussion

Apply Link: 👇
Job Link 👈
Important Guidlines:
  • Online test will be sent to the registered candidates who meet the eligible criteria
  • After test, shortlisted candidates must be available for a further online interview process
  • Candidates should be available for immediate joining

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