P1: What is dynamic programming?

Me: answered

P1: difference between dynamic programming and divide and conquer

Me: answered correctly

P1: how to find height of binary search tree with n nodes?

Me: 2^ (h+1) – 1 = n where n is number of nodes….then we take log on both sides and find h. I am currently unable to derive it.

P1: time complexity of merge sort

Me: O (n log n)

P1: what is the worst time complexity?

Me: O (n^2) and we can make it O (n log n) using priority queue

P2: what is random paging?

Me: in operating system when we select pages at random for processing

P2: difference between micro programming and micro processing

Me: blank

P2: which has better throughput?

Me: blank

P2:  scheduler vs. dispatcher difference

Me: answered correctly

P2:  what is virtual memory?

Me:  the memory that is created and used when there is shortage of memory

P2: what are the different stages of a process in os??

Me: drew the whole thing on paper but at last P2 asked me to say orally….as he could not see anything on webcam….I said: ready – lock – terminate….forgot to say running….but he was in a haste and I doubt he caught that mistake and looked satisfied

P2: how many data types are there in c programming and what are they?

Me: answered correctly

P2: difference between array and structure

Me: answered correctly

P3: what is linear independent of equations?

Me: blank

P3: what is rank of matrix?

Me: answered correctly

P3: what is random variable??

Me: it is a term of statistics. The data values that are taken randomly in a cluster of collected data

P3: you are given probability p1 , p2 , p3,... and random variable x1, x2, x3....what is the expectation???

Me : answered correctly.
posted in Interview Experience May 11