Software Engineer Interview Questions

Generates a default constructor, copy constructor and assignment operator.

What M Cox said & also the destructor.

if you know the algorithm itself, then its easy

Was that the exact question? Wow, very specific!

Use c++ atomics types , use built-in assembly atomics, use mutex

If these variables form a critical section then that section must be protected by a lock, use java synchronized, a Lock like ReentrantLock or use a nonblocking algorithm by making use of the Atomic variables. If the variables don't form a critical section, then you don't need locks, if possible use an object from Atomic package or make the variable volatile.

a[0]

*a[0] http://www-ee.eng.hawaii.edu/~tep/EE160/Book/chap7/section2.1.3.html

*a or as pointed above a[0]

They are interested in knowing whether you know well enough what is class and what is object. Try to give real life example

A class is the blueprint from which individual objects are created. For example there might be a class for chairs and every chair created from this class is an object. Every chair object is unique. polymorphism - one interface can be implemented in several ways. For example a list can be implemented using an array or using linked objects. overriding - a method in the subclass with the same signature overrides the method in the super class.

For sql , w3schools tutorial is enough to brush up the things

Second highest number in an array public class SecondHighest { public static int secondhighest(int[] arr){ if (arr == null){ return -1; } if (arr.length ==1){ return -1; } int max = arr[0] > arr[1] ? arr[0] : arr[1]; int max2 = arr[0] max){ max2 = max; max = arr[i]; } else if (arr[i] > max2){ max2 = arr[i]; } } return max2; } public static void main (String[] args){ int[] arr = {1,-2,4,7,-9,45,34,-92}; System.out.println(secondhighest(arr)); } }

They are shared amongst same types.

For each instantiation of the template class the static members are shared only between the objects of that class and are completely independent from static members of other instantiations of the template class. E.g. this program prints "50": #include template class A { public: static int x; }; template int A::x = 0; int main() { A a; A b; a.x = 5; std::cout << a.x << b.x << std::endl; return 0; }

There are a lot of online solutions posted about this.

Graph implemented by matrix: import java.util.LinkedList; import java.util.List; import java.util.Queue; import java.util.Stack; public class GraphMatrix { int[][] mat; public GraphMatrix(int[][] mat){ this.mat = mat; } public int[] bfs(int i){ int[] dis = new int[mat.length]; Queue q = new LinkedList(); int[] couple = {i,0}; q.add(couple); while (!q.isEmpty()){ int[] curr = q.poll(); dis[curr[0]] = curr[1]; for (int j=0; j q = new Stack(); int[] couple = {i,0}; q.add(couple); while (!q.isEmpty()){ int[] curr = q.peek(); dis[curr[0]] = curr[1]; boolean foundNeigh=false; for (int j=0; j<mat.length; ++j){ if (mat[curr[0]][j] == 1 && dis[j]==0){ foundNeigh = true; int[] couple2 = {j,curr[1]+1}; q.add(couple2); break; } } if(!foundNeigh){ q.pop(); } } return dis; } public static void main(String[] args){ int[][] mat = new int[5][5]; mat[0][1]=1; mat[0][2]=1; mat[0][3]=1; mat[1][4] =1; mat[4][2]=1; GraphMatrix gm = new GraphMatrix(mat); System.out.println("BFS"); int[] res =gm.bfs(0); for (int i=0; i<res.length; ++i){ System.out.println("node "+i+" is in distance "+res[i]); } System.out.println("DFS"); res =gm.dfs(0); for (int i=0; i<res.length; ++i){ System.out.println("node "+i+" is in distance "+res[i]); } } }