Log In

Recent posts in 2017

It will be D.
posted Jan 12, 2018 in 2017 Ajinkya Naik 1 2,174 views
Wanted Temporary, Part-time persons for the post of Field Interviewer to conduct personal interviews to collect and collate economic data. Requirements: High School-pass, must be available for Day, Evening and Saturday work. Transportation paid, ... the best inference from the above advertisement? Gender-discriminatory Xenophobic Not designed to make the post attractive Not gender-discriminatory
posted Jul 28, 2017 in 2017 Neeraj Singh 2,853 views
Hi, this is Shravani Joshi, AIR 70. GATE Overflow helped me understand all the tricky questions in all the subjects! I would like to thank Arjun sir and all the members on this community, for their active discussion and detailed explanations which helped all of us understand concepts better. Also GATE Overflow is by far the best platform where ALL the previous years' GATE questions with accurate answers are available, this helped me confirm my answers from time to time :D Also the tests made freely available as the exam neared helped me uncover my weak areas and taught time management as well. I strongly recommend GATE Overflow to all future GATE CS aspirants!
posted May 16, 2017 in 2017 shravani 1,750 views
Station $A$ needs to send a message consisting of $9$ packets to Station $B$ using a sliding window (window size $3$) and go-back-n error control strategy. All packets are ready and immediately available for transmission. If every 5th packet that $A$ transmits gets lost (but no acks ... , then what is the number of packets that $A$ will transmit for sending the message to $B$? $12$ $14$ $16$ $18$
posted May 6, 2017 in 2017 venkat_sirvisetti
edited May 6, 2017 by venkat_sirvisetti
For comparison-based sorting the asymptotically tight bound for worst case is given by $\Theta (n \log n)$, which means it is the tightest upper bound (big O) as well as the tightest lower bound (big omega). So, answer is $n \log n$. Tightest lower ... case. Worst case is defined for the algorithm and it is always the input which causes the algorithm the maximum complexity. Correct Answer: $C$
posted Apr 13, 2017 in 2017 rajesh170293 1,406 views
A. Specificity. This is asking for opposites. Specificity Diffuseness Direct, to the point, purposeful in relating Precise, blunt, definitive and transparent Principles and consistent moral stands independent of the person being addressed Indirect, circuitous ... forms of relating Evasive, tactful, ambiguous, even opaque Highly situational morality depending upon the person and context encountered
posted Apr 12, 2017 in 2017 yg92 1,998 views
Consider a random variable $X$ that takes values $+1$ and $−1$ with probability $0.5$ each. The values of the cumulative distribution function $F(x)$ at $x = −1$ and $+1$ are $0$ and $0.5$ $0$ and $1$ $0.5$ and $1$ $0.25$ and $0.75$
posted Apr 6, 2017 in 2017 AmitPatil 1,427 views
Complete the sentence: Universalism is to particularism as diffuseness is to _______________. specificity neutrality generality adaptation
posted Apr 3, 2017 in 2017 Sumit Gupta 2 3,346 views
Consider a B-tree with degree $m$, that is, the number of children, $c$, of any internal node (except the root) is such that $m \leq c \leq 2m-1$. Derive the maximum and minimum number of records in the leaf nodes for such a B-tree with height $h, h \geq 1$. (Assume that the root of a tree is at height 0).
posted Apr 1, 2017 in 2017 mcjoshi 2,246 views
Given that $A$ is regular and $(A \cup B)$ is regular, does it follow that $B$ is necessarily regular? Justify your answer. Given two finite automata $M1, M2$, outline an algorithm to decide if $L(M1) \subset L(M2)$. (note: strict subset)
posted Apr 1, 2017 in 2017 dd
edited Apr 1, 2017 by dd
Given the programming constructs assignment for loops where the loop parameter cannot be changed within the loop if-then-else forward go to arbitrary go to non-recursive procedure call recursive procedure/function call repeat loop, which constructs will you not include in a programming language such that it should be ... $\text{(vi), (vii), (viii)}$ $\text{(iii), (vii), (viii)}$
posted Mar 31, 2017 in 2017 Prasanta Roy 1,369 views
Which of the following is correct? B-trees are for storing data on disk and B$^+$ trees are for main memory. Range queries are faster on B$^+$ trees. B-trees are for primary indexes and B$^+$ trees are for secondary indexes. The height of a B$^+$ tree is independent of the number of records.
posted Mar 31, 2017 in 2017 Samujjal Das
recategorized Apr 4, 2017 by Samujjal Das
A sorting technique is called stable if it takes $O (n \log n)$ time it maintains the relative order of occurrence of non-distinct elements it uses divide and conquer paradigm it takes $O(n)$ space
posted Mar 31, 2017 in 2017 Harsh181996 3,413 views
The number of binary strings of $n$ zeros and $k$ ones in which no two ones are adjacent is $^{n-1}C_k$ $^nC_k$ $^nC_{k+1}$ None of the above
posted Mar 31, 2017 in 2017 vijaycs 3,533 views
The number of binary relations on a set with $n$ elements is: $n^2$ $2^n$ $2^{n^2}$ None of the above
posted Mar 31, 2017 in 2017 Pankaj Joshi
edited Mar 31, 2017 by Pankaj Joshi
I found b,c,d as correct. which is the most appropriate?
posted Mar 30, 2017 in 2017 Kantikumar 4,014 views
GATE CSE is an exam where the more you learn and relate things, the more questions your mind develops, and only a healthy discussion can help firm your understanding of such concepts. GateOverflow community helped me exactly that way. Each and everyone here has a thing or two to teach you and the answers by veterans and mentors simply put all doubts to rest. You don't need any coaching if you know how to use GO. Saying that, if you are interested, here's a little advice from me : Don't just check the best answer to a question, grasp it and move on; read all the comments (especially if they are by veterans) and other solutions and develop a coherent understanding as to why...
posted Mar 30, 2017 in 2017 Ishita Gupta 933 views
Correct Option: A Irrespective of the input, merge sort always have a time complexity of $\Theta(n \log n)$.
posted Mar 30, 2017 in 2017 Sanket_ 1,304 views
Time complexity of Bellman-Ford algorithm is $\Theta(|V||E|)$ where $|V|$ is number of vertices and $|E|$ is number of edges. If the graph is complete, the value of $|E|$ becomes $\Theta\left(|V|^2\right)$. So overall time complexity becomes $\Theta\left(|V|^3\right)$. And given here is $n$ vertices. So, the answer ends up to be $\Theta\left(n^3\right)$. Correct Answer: $C$
posted Mar 30, 2017 in 2017 KISHALAY DAS 1,520 views
In a $k$-way set associative cache, the cache is divided into $v$ sets, each of which consists of $k$ lines. The lines of a set are placed in sequence one after another. The lines in set $s$ are sequenced before the lines in set $(s+1)$. The main memory blocks are numbered 0 onwards. The main memory block ... $(j \text{ mod } k) * v \text{ to } (j \text{ mod } k) * v + (v-1) $
posted Mar 30, 2017 in 2017 Kai 975 views