News: SOTI DAY 2020 (Road Show) & SOTI Campus Connect (Recruitment Drive 2020)
SOTI DAY 2020 (Road Show) & SOTI Campus Connect (Recruitment Drive 2020)
SOTI Inc. is a Business Mobility & IoT Solutions Company Headquartered in Canada. (https://www.soti.net/)
Campus Visit Plan:
SOTI is conducting a Virtual Road Show, for connecting with the students of various colleges, that’s is being planned on August5th, 2020 at 7:00pm IST. (www.soti.net/livestream)
Online coding test:
The online test will be conducted on August 17/18 and the students can attend the same using their laptop /desktop only (Mobile not allowed). The online test will be conducted in 4 slots, based on the college location and they have 4 hours to log in and 2.15hours to complete the test.
Eligibility Criteria and Selection Process:
The eligibility criteria and selection process for the below opportunities at SOTI are detailed below;
Opportunity Type | Final Year Internship (6 Months) | Fresher Hiring |
Qualification | B.E / B.Tech / M.E / M.Tech / M.Sc. / MCA | B.E / B.Tech / M.E / M.Tech / M.Sc. / MCA |
Stream | Computer Science / Electronics & Communication / Information Science / Information Technology | Computer Science / Electronics & Communication/ Information Science/ Information Technology |
Year of Passing | 2021 | 2021 |
Duration | 6 months (Jan-Jun) | NA |
Job Title | Intern | Software Engineer |
Location | Kochi / Delhi (Gurugram) | Kochi / Delhi (Gurugram) |
Stipend | Yes | NA |
Selection /Process | Online Test | Online Test |
Technical Interview | Technical & Scout Interview | |
Final Selection | Final Selection |
Application Process:
Placement officers of the colleges shall submit the details of interested and eligible candidates on or before 10th July 2020.
For More Details:
Sample questions for the online coding test:
πFind 3 largest 9 digit palindrome prime numbers
πFind the third smallest number in an unsorted array without using the sort function. The expected solution is of order O(n).
πWrite a recursive function to find the nth Fibonacci term with Memoization
πWrite a function to find all the pairs in the array whose sums already exist in the array.
[10, 4, 8, 13, 5,4] -> expected output is [(4,4),(8,5)]
References for the online coding test:
πhttps://www.geeksforgeeks.org/
πhttp://Codeabbey.com
πhttps://projecteuler.net/
πSearch Youtube for Google, Microsoft, Amazon Programming Interviews
Comments
Post a Comment