Recent posts tagged interview-experience

31
Longest simple path cannot be computed like this. To understand why you need to know that Dijikstra's algorithm works using Greedy principle. That is, at each vertex we c...
32
Yes. But you can't complain so in GATE. GATE takers are expected to apply logic to correct the questions since GATE 2013. Never say "mistake" in question paper- they are ...
35
Cross Edge(a,b) is defined as an edge between two non-ancestor nodes in DFS , so my query is that how is this stmt true :arrival[b] <departure[b] <arrival[a] <departure[a...
36
Following statement is true or false?If we make following changes to Dijkstra, then it can be used to find the longest simple path, assume that the graph is acyclic.1) In...
37
A) Do following for every vertex u in topological order.………..Do following for every adjacent vertex v of u………………if (dist[v] dist[u] + weight(u, v))…�...
38
A) 4000due to the restrictions imposed by the functional dependencies we can vary values like:keep B and C value as constant and loop through all values of A, this gives ...
40
In multinomial expansion of $(1+x^5+x^9)^{100}$, every term will be of form: $C(100 ; m, n, p) \times 1^m \times (x^5)^n \times (x^9)^p$, where m + n + p =100.So, for the...
41
LG(n!) is LG (1*2*3*4*....*n) that is O(LG(n^n)) O(nlogn) LG*n is lglglg(any number of times)LG n
42
here what is the different between this ? lg(n!) and lg*(n!)
43
In computer science, the iterated logarithm of n, written log* n (usually read "log star"), is the number of times the logarithm function must be iteratively applied befo...
44
For substitution, you should use 2-3 values and not just 1. Then only you can know the growth rate.
45
J,M causes collision..Hash table (0-9) ={T,K,J,M,C,N,Y,P,R,S}
47
Favourable outcomes: The point should be nearer to center than from circumference, it means the point could be anywhere within the radius $r/2, = \pi \times (r/2)^2$.Tota...
51
lg means log ? and * means what ; i mean lg(n!) and lg*(n!) here * means mult??
52
Let $G (V, E)$ be a directed graph with $n$ vertices.A path from $v_i$ to $v_j$ in $G$ is sequence of vertices $(v_i, v_{i+1}, \ldots, v_j)$ such that $(v_k, v_{k+1}) \in...
53
For option 'a', just giving a more explanatory proof, considerLet be any other function such that . Now and Hence , hence stands as identity element.For inverse, it ...
55
But as suggested by @laser second will not give those hotels which were not booked at all
58
Can you please give any source which contain r(*)=r*.Previous year question book gave answer band their b is (r*s*)*=(r+s)*
59
i think the language would be L= 00(0000)*if L= 00 + (0000)* then 0000 cant reaches the final state .
60
Yeah why not you have found a solution it cab be one of the option but always choose the best one