Recent posts tagged interview-experience

1,096
1,096 views
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...
963
963 views
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...
1,053
1,053 views
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))………………………dist[v] = dis...
873
873 views
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 ...
2,048
2,048 views
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...
703
703 views
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
863
863 views
here what is the different between this ? lg(n!) and lg*(n!)
2,352
2,352 views
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...
888
888 views
For substitution, you should use 2-3 values and not just 1. Then only you can know the growth rate.
2,772
2,772 views
J,M causes collision..Hash table (0-9) ={T,K,J,M,C,N,Y,P,R,S}
3,940
3,940 views
1,478
1,478 views
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...
10,613
10,613 views
4,487
4,487 views
24,845
24,845 views
5,969
5,969 views
lg means log ? and * means what ; i mean lg(n!) and lg*(n!) here * means mult??
2,092
2,092 views
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...
5,748
5,748 views
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 ...
14,385
14,385 views
But as suggested by @laser second will not give those hotels which were not booked at all
4,488
4,488 views
5,366
5,366 views
Can you please give any source which contain r(*)=r*.Previous year question book gave answer band their b is (r*s*)*=(r+s)*
5,424
5,424 views
i think the language would be L= 00(0000)*if L= 00 + (0000)* then 0000 cant reaches the final state .
3,064
3,064 views
Yeah why not you have found a solution it cab be one of the option but always choose the best one
4,006
4,006 views
No.$$\begin{array}{|c|c|c|} \hline \text {A} & \text {B} & \text {C} \\\hline\text {1} & \text {5} & \text {6} \\\hline\text {2} & \text {4} & \text {7}\\\hline \text {3...
1,662
1,662 views
R1,R2 has common attribute B. B is key in R2.so R1(AB) R2(BC) composed into R12(ABC)Between R12(ABC) and R3(CD) common attribute is C and C is key in R3. Hence the decomp...
4,400
4,400 views
Why we have considered without replacement here?Can't this be like ......1/3 * (4/12 * 3/12) / [1/3 * (4/12 * 3/12 ) + 1/3 * (2/4 * 1/4 ) + 1/3 * (1/6 * 3/6 )] ?