Software engineer internship Interview Questions

I answered them that I have no idea. (lolz)

BTW,what's the content roughly of 1:1 basics coding exercise.

If you ask ROUGHLY, it's like a list of incomplete small programs you need to complete/solve. Like a in-class CA. The purpose of this is to understand how you solve problem (logical thinking stuffs).

read cpu register-1 context switch-2 read from main memory-3 disk seek-4

context switch - 3

1 CPU 2 Memory 3 Context switching 4 Disk

Oh guys this was so easy I was able to provide six seven ways and provided with complexcity analysis as well , which he was happy with .. but I dont know what was the expectation ...i think I just wasted 2 weeks of my precious job hunting time ...

I don't get it. Why did they not move forward?

I know that is too easy, and probably this thread was closed, but I'm very thankful, if any one could validate the code below about this question. =================== @Test public void test() { String[] sortedArray = {"a","b","c","d","e","1"}; String[] unsortedArray = {"a","2","c","3","1","4"}; int number = 0; for(int i=0;i

Implemented with a stack.

Leetcode: simply path

def cipher(string) string.chars.each_with_index do |char, index| string[index] = (char.ord + 13).chr end end

Doesn't wrap around. I think what you're looking for is: def cipher(string) a = 'a'.ord string.chars.each_with_index do |char, index| string[index] = ((char.ord - a + 13) % (26) + a).chr end end

mainly around the security

Stored procedures give us many advantages over using sql scripts and SQL ... to use Stored Procedures to enable our web and windows applications to ... Our application code that creates a dynamic SQL string might look something like: ... Let us now see why you should use a Stored Procedure rather than in-line SQL

A basic implementation of ML clustering algorithm

K-Means / K-Medoid/ Fuzzy K-Means should work depending on the type of clustering solution i.e Exclusive clustering etc. Basic fundamental is to maximize the inter-cluster distance and minimizing intra-cluster distance. The distance again can be different like euclidian, Manhattan, etc