See Our team
Wondering how we keep quality?
Got unsolved questions? Ask Questions
Engineering GATE CBSE NCERT Psychology English Computer Constitution Astrology Yoga Economics Physics Biology Electronics Microprocessor Career Interview Anatomy Botany
Never Miss an Update
Subscribe to eduladder news letter Today
How many different non-isomorphic Abelian groups of order 4 are there? -computer science-gate-20071 AnswerConsider the following rooted tree with the vertex labelled P as the root: (-Gate Computer Science 2014)1 AnswerWhy are Microprocessors called The brain of the computer ?CBSE Computer Science Class V-20071 AnswerConsider the first-order logic sentence F: ∀ x (∃ y R(x,y)). Assuming non-empty logical domains, which of the sentences below are implied by F? -gate computer science 20171 AnswerWhich one of the following is a top-down parser? -computer science-gate-20071 AnswerWhich of the following graphs is isomorphic to -gate-cse-20121 AnswerWhich one of the following uses UDP as the transport protocol? -computer science-gate-20071 AnswerLet S be a sample space and two mutually exclusive events A and B be such that AÈB = S. If P(.) denotes the probability of the event, the maximum value of P(A)P(B) is? - Gate Computer Science 20141 AnswerConsider the following functions from positives integers to real numbers 10, √n, n, log2n, 100/n. The CORRECT arrangement of the above functions in increasing order of asymptotic complexity is: -gate computer science 20171 AnswerWhich of the following graphs has an Eulerian circuit? -computer science-gate-20071 AnswerLet G be a group with 15 elements. Let L be a subgroup of G. It is known that L (not equal to) G and that the size of L is at least 4. The size of L is _______. - Gate Computer Science 20141 AnswerIf (𝑧 + 1/𝑧)^2 = 98, compute (𝑧^2 + 1/𝑧^2). - Gate Computer Science 20141 AnswerWhich of the following problems is undecidable? -computer science-gate-20071 AnswerWhich of the following problems is undecidable? -computer science-gate-20071 AnswerAn index is clustered, if -gate-computer science-20131 AnswerA system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks never arise is _________. (Gate Computer Science 2014)1 AnswerWhich of the following sorting algorithms has the lowest worst-case complexity? -computer science-gate-20071 AnswerThe maximum number of binary trees that can be formed with three unlabeled nodes IS: -computer science-gate-20071 AnswerIn Ethernet when Manchester encoding is used, the bit rate is: -computer science-gate-20071 AnswerConsider the C function given below. Assume that the array listA contains n (> 0) elements, sored in ascending order. - Gate Computer Science 20141 Answer