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
Consider 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 AnswerIn the following question, the first and the last sentence of the passage are in order and numbered 1 and 6. The rest of the passage is split into 4 parts and numbered as 2,3,4, and 5. These 4 parts are not arranged in proper order. -GATE EC 20151 AnswerExplain the concepts of soundness of propositional logic.1 AnswerExplain the completeness of propositional logic?1 AnswerWhat is semantics propositional logic?1 AnswerExplain the terms horn clauses and satisfiability in terms of logic in computer science.1 AnswerConsider the following rooted tree with the vertex labelled P as the root: (-Gate Computer Science 2014)1 AnswerExplain the propositional logic as a formal language.1 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 AnswerConsider the Karnaugh map given below, where x represents “don’t care” and blank represents 0. GATE-Computer-Science-Engineering-20171 AnswerAssuming P NP, ≠ which of the following is TRUE? -gate-computer science-20121 AnswerQ.46) In a database system, unique time stamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the time stamps of transactions T1 and T2 respectively. Besides, T1 holds a lock on the resource R, and T2 has requested a conflicting lock on the same resource R. The following algorithm is used to prevent deadlocks in the database assuming that a killed transaction is restarted with the same timestamp. -gate computer science 20171 AnswerQ.50) Consider a 2-way set associative cache with 256 blocks and uses LRU replacement, Initially the cache is empty. Conflict misses are those misses which occur due the contention of multiple blocks for the same cache set. -gate computer science 20171 Answer How many different non-isomorphic Abelian groups of order 4 are there? -computer science-gate-20071 AnswerWhat are the four major domains of the earth? (CBSE SOCIAL SCIENCE CLASS 6) 1 AnswerConsider the following grammar p --> xQRS Q --> yz|z R --> w|∈ S -> y Which is FOLLOW(Q)? -gate computer science 20171 AnswerQ.8) The expression [(x + y)-|x - y|]/2 is equal to : -gate computer science 20171 AnswerThe probability that a k-digit number does NOT contain the digits 0, 5 or 9 is -gate computer science 20171 AnswerThe statement (¬ p) → (¬ q) is logically equivalent to which of the statements below? I. p → q II. q → p III. (¬ q) ∨ p IV. (¬ p) ∨ q -gate computer science 20171 AnswerSuppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. -gate-cse-20121 Answer