search
Log In

Recent posts in Interview Experience

1
Lets follow our checklist one by one to see what property this algebraic structure follows. Closure -yes ($m*n=\max(m,n)$) Output is either $m$ or $n$ whichever is maximum and since $m,n$ belongs to $Z$, the result of the binary operation also belongs ... has an identity Group - Monoid with inverse Abelian group- Group with commutative property. Hence, this is just a semigroup- D option. Ans D)
posted May 14 in Interview Experience Subham Das 227 views
3
SQL query will be SELECT cno FROM Completed, Pre-Req WHERE student_no = '2310' GROUP BY cno HAVING pre-Cno IN ( SELECT C.cno FROM Completed AS C WHERE C.student_no = '2310'; )
posted Mar 18 in Interview Experience soujanyareddy13 100 views
4
Refer to the similar thread below to get answer for this question https://gateoverflow.in/4273/char-pointer-to-access-an-int
posted Mar 18 in Interview Experience soujanyareddy13 48 views
5

 

2011 Other Interview Experience Links.

College Name Interview Experience Blog Link Program Specialization IIT Delhi https://harishiyer57.wordpress.com/2011/05/31/iit-delhi-interview-experience/   CSE IIT Kanpur
posted Mar 18 in Interview Experience soujanyareddy13 60 views
6
sir that we do in dijkstra as well , there also we chose initially one vertex as source vertex , but there are only V passes .
posted Mar 17 in Interview Experience soujanyareddy13 67 views
7
8
Sir, How is the loop nested when we have semicolon at the end of both for loops? Am i missing something ?
posted Mar 17 in Interview Experience soujanyareddy13 33 views
9

 

2015 GATE Overflow Interview Experience Links.

College  Name Interview Experience Blog Link Program Specialization IIT Kanpur https://gatecse.in/a-journey-to-iit-kanpur/ M.Tech. CSE IISc Banglore
posted Mar 17 in Interview Experience soujanyareddy13 37 views
10
i am not sure , i just give a try on this : { p | (&exist;q)(&exist;r) works(p q r) and ( (&forall;y) (works(x y z )^( y = small bank co-operation)) -> (&exist;z) (z<r) )}
posted Mar 17 in Interview Experience soujanyareddy13
edited Mar 17 by soujanyareddy13
63 views
11
in bellman ford algo v-1 times will give you the shortest path but if there is any -ve edge cycle to check you have to perform 1 more cycle . Why V-1times ? simple , a vertices is connected to atmost V-1 vertices to check them you need V-1 times ( there is no -ve edge cycle ) .
posted Mar 17 in Interview Experience soujanyareddy13
edited Mar 17 by soujanyareddy13
83 views
12
Consider a 8 million word main memory and 256 block cache.Both partitioned into 64 words block.What is the size of additional memory for tags? Size of the cache? consider direct mapping is used and word size 1 byte.
posted Mar 15 in Interview Experience soujanyareddy13 226 views
13

 

2019 GATE Overflow Interview Experience Links.

 

College Name Interview Experience Blog Link Program Specialization IIIT Hyderabad https://gateoverflow.in/blog/8243/iiit-h-interview-experience-2019 MS CSE IIIT Hyderabad
posted Mar 15 in Interview Experience soujanyareddy13 552 views
14
A. Encapsulation http://stackoverflow.com/questions/24626/abstraction-vs-information-hiding-vs-encapsulation
posted Mar 13 in Interview Experience soujanyareddy13
edited Mar 15 by soujanyareddy13
740 views
15
lg *n, (Inverse Ackermann function) is the number of times we can take log repeatedly until we get 1. This function can almost be considered constant for all practical purposes. There shouldn't be any confusion regarding options C and D as n! is asymptotically larger than lg n. A) lg (lg * n) B) lg * ... can write B as lg * (lg n) = lg * n - 1. So, A is asymptotically lower than B. A < B < D < C.
posted Mar 13 in Interview Experience soujanyareddy13 139 views
16
Surely a misprint in question, but don't follow that book for GATE.
posted Mar 13 in Interview Experience soujanyareddy13 85 views
17
In topological sort, in the inner loop we consider only "adjacent vertex". So, the complexity at max can be O(|V|2) which happens when |E| = |V|2. In Bellman Ford algorithm, the inner loop is run for each and every edge.
posted Mar 13 in Interview Experience soujanyareddy13 103 views
18
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 choose the best neighbour and include that in the shortest path. Doing like this in end, we get the ... many cases and longest path one is just an example. A simple example can be shown as follows. Consider shortest path from a-c
posted Mar 13 in Interview Experience soujanyareddy13 97 views
19
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 made by experts. http://gate.iitm.ac.in/gateqps/2008/cs.pdf
posted Mar 13 in Interview Experience soujanyareddy13 102 views
...