The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by Manis
User Manis
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Manis
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
answers
1
Test series
If possible , plz explain with state diagram..
commented
Feb 2, 2018
in
Theory of Computation

94
views
1
answer
2
Test series
Plz explain ? How to solve such que. As I have solved this type of que earlier but when I am doing revision I am not able to do it. So plz provide some good explanation..
commented
Feb 1, 2018
in
Mathematical Logic

78
views
1
answer
3
Test series
Plz explain ??
commented
Feb 1, 2018
in
Graph Theory

59
views
0
answers
4
Test series
my doubt is why 14 has been subtracted ??
commented
Feb 1, 2018
in
Graph Theory

49
views
0
answers
5
test series
hello.everyone i am preparing for gate 2018 and i am getting around 45 marks and rank is around 500 to 800 in test series(made easy ) . in two three full test mi rank was 250 also. but i am unable to cross 50marks ...i am obc student . is there any chance for me to iit...plz advice me
commented
Jan 30, 2018
in
Others

236
views
general
testseries
0
answers
6
Ace Test Series: CO & Architecture  Cache Memory Tag
commented
Jan 28, 2018
in
CO and Architecture

83
views
acetestseries
coandarchitecture
cachememory
3
answers
7
GATE2016204
Consider the system, each consisting of $m$ linear equations in $n$ variables. If $m < n$, then all such systems have a solution. If $m > n$, then none of these systems has a solution. If $m = n$, then there exists a system which has a solution. Which one of the ... is CORRECT? $I, II$ and $III$ are true. Only $II$ and $III$ are true. Only $III$ is true. None of them is true.
answered
Jan 24, 2018
in
Linear Algebra

4.6k
views
gate20162
linearalgebra
systemofequations
normal
1
answer
8
Set theory
Let $f: A \to B$ be a function and $S$ and $T$ be subsets of $B$. Consider the following statements about image (range) : $S1:\quad f^{1}(S \cup T) = f^{1}(S) \cup f^{1}(T)$ $S2:\quad f^{1}(S \cap T) = f^{1}(S) \cap f^{1}(T)$ Which of the following is correct? A) only S1 is true B) only S2 is true C) Both S1 and S2 is true D) Neither S1 nor S2 is true
commented
Jan 15, 2018
in
Set Theory & Algebra

149
views
discretemathematics
settheory&algebra
sets
engineeringmathematics
1
answer
9
DBMS ERDiagram (No of Relations)
Options was: 4,5,6,7
commented
Jan 11, 2018
in
Databases

134
views
databases
erdiagram
1
answer
10
static variable programming Q
Question:
answer edited
Jan 6, 2018
in
Programming

89
views
3
answers
11
COMPILER DESIGN
Check whether this grammar is LL(1) or not?
answered
Jan 5, 2018
in
Compiler Design

174
views
compilerdesign
parser
11
answers
12
GATE2016250
A file system uses an inmemory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is $1$ ms and to read a block from the disk is $10$ ms. Assume that the cost of checking ... are in multiples of $10$ MB. The smallest cache size required to ensure an average read latency of less than $6$ ms is _________ MB.
commented
Jan 4, 2018
in
CO and Architecture

5.2k
views
gate20162
coandarchitecture
cachememory
normal
numericalanswers
6
answers
13
GATE20142GA10
At what time between $6$ a. m. and $7$ a. m. will the minute hand and hour hand of a clock make an angle closest to $60°$? $6: 22$ a.m. $6: 27$ a.m. $6: 38$ a.m. $6: 45$ a.m.
commented
Dec 27, 2017
in
Numerical Ability

3k
views
gate20142
numericalability
normal
clocktime
2
answers
14
Decoder
Which of following statement is true ? S1. Any boolean function can be realized using decoder s2. One multiplexer can realize 1 function at a time a) S1 is true b) S2 is true 3) Both are true d) none of them
commented
Dec 8, 2017
in
Digital Logic

526
views
2
answers
15
MUX
How many 4*1 mux required to implement 8*1 Mux ?
answered
Dec 7, 2017
in
Digital Logic

451
views
multiplexer
5
answers
16
GATE2007IT21
Which one of these firstorder logic formulae is valid? $\forall x\left(P\left(x\right) \implies Q\left(x\right)\right) \implies \left(∀xP\left(x\right)\implies \forall xQ\left(x\right)\right)$ ... $\forall x \exists y P\left(x, y\right)\implies \exists y \forall x P\left(x, y\right)$
commented
Dec 2, 2017
in
Mathematical Logic

2.8k
views
gate2007it
mathematicallogic
normal
firstorderlogic
8
answers
17
GATE2005IT36
Let $P(x)$ and $Q(x)$ ...
commented
Dec 2, 2017
in
Mathematical Logic

4.6k
views
gate2005it
mathematicallogic
firstorderlogic
normal
3
answers
18
GATE2015323
Suppose $U$ is the power set of the set $S = \{1, 2, 3, 4, 5, 6\}$. For any $T \in U$, let $T$ denote the number of elements in $T$ and $T'$ denote the complement of $T$. For any $T, R \in U \text{ let } T \backslash R$ be the set of all elements in $T$ which ... $X \backslash Y = \phi)$ $\forall X \in U, \forall Y \in U, (X \backslash Y = Y' \backslash X')$
commented
Dec 1, 2017
in
Set Theory & Algebra

3.9k
views
gate20153
settheory&algebra
sets
normal
2
answers
19
GATE2015255
Which one of the following wellformed formulae is a tautology? $\forall x \, \exists y \, R(x,y) \, \leftrightarrow \, \exists y \, \forall x \, R(x, y)$ ... $\forall x \, \forall y \, P(x,y) \, \rightarrow \, \forall x \, \forall y \, P(y, x)$
commented
Dec 1, 2017
in
Mathematical Logic

6.5k
views
gate20152
mathematicallogic
normal
firstorderlogic
4
answers
20
GATE20002.7
Let $a, b, c, d$ be propositions. Assume that the equivalence $a ⇔ ( b \vee \neg b)$ and $b ⇔c$ hold. Then the truthvalue of the formula $(a ∧ b) → (a ∧ c) ∨ d$ is always True False Same as the truthvalue of $b$ Same as the truthvalue of $d$
commented
Nov 30, 2017
in
Mathematical Logic

2.7k
views
gate2000
mathematicallogic
normal
propositionallogic
0
answers
21
GATE200371
Consider the following logic program P $\begin{align*} A(x) &\gets B(x,y), C(y) \\ &\gets B(x,x) \end{align*}$ ... $(\forall x) [(\forall y) [B(x,y) \land C(y)] \Rightarrow A(x)] \land (\exists x)[B(x,x)]$
commented
Nov 30, 2017
in
Programming

1.6k
views
gate2003
programming
logicprogramming
outofsyllabusnow
3
answers
22
GATE200332
Which of the following is a valid first order formula? (Here \(\alpha\) and \(\beta\) are first order formulae with $x$ as their only free variable) $((∀x)[α] ⇒ (∀x)[β]) ⇒ (∀x)[α ⇒ β]$ $(∀x)[α] ⇒ (∃x)[α ∧ β]$ $((∀x)[α ∨ β] ⇒ (∃x)[α]) ⇒ (∀x)[α]$ $(∀x)[α ⇒ β] ⇒ (((∀x)[α]) ⇒ (∀x)[β])$
commented
Nov 30, 2017
in
Mathematical Logic

6k
views
gate2003
mathematicallogic
firstorderlogic
normal
4
answers
23
GATE201218
Let $W(n) $ and $A(n)$ denote respectively, the worst case and average case running time of an algorithm executed on an input of size $n$. Which of the following is ALWAYS TRUE? $A(n) = \Omega (W(n))$ $A(n) = \Theta (W(n))$ $A(n) = \text{O} (W(n))$ $A(n) = \text{o} (W(n))$
answered
Nov 27, 2017
in
Algorithms

3.7k
views
gate2012
algorithms
easy
asymptoticnotations
1
answer
24
Sorting Techniques
What is the best sorting algorithm to use for the elements in array are more than 1 million in general? A Merge sort. B Bubble sort. C Quick sort. D Insertion sort. Ans:C Source: http://quiz.geeksforgeeks.org/algorithmsinsertionsortquestion ... B Source: http://quiz.geeksforgeeks.org/algorithmssearchingandsortingquestion16/ Kindly explain on why the answers are different?
commented
Nov 27, 2017
in
Algorithms

711
views
algorithms
sorting
timecomplexity
1
answer
25
geeksforgeeks
In a modified merge sort, the input array is splitted at a position onethird of the length(N) of the array. What is the worst case time complexity of this merge sort? A N(logN base 3) B N(logN base 2/3) C N(logN base 1/3) D N(logN base 3/2)
commented
Nov 26, 2017
in
Algorithms

938
views
6
answers
26
GATE200318
In a bottomup evaluation of a syntax directed definition, inherited attributes can always be evaluated be evaluated only if the definition is Lattributed be evaluated only if the definition has synthesized attributes never be evaluated
commented
Nov 23, 2017
in
Compiler Design

9.5k
views
gate2003
compilerdesign
syntaxdirectedtranslation
normal
3
answers
27
GATE20022.12
A weightbalanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the furthest leaf) of such ... by which of the following? $\log_2 n$ $\log_{\frac{4}{3}} n$ $\log_3 n$ $\log_{\frac{3}{2}} n$
commented
Nov 19, 2017
in
DS

7.1k
views
gate2002
datastructures
binarytree
normal
4
answers
28
GATE200354
Define languages $L_0$ and $L_1$ as follows : $L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\} $ $L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts on }w\}$ Here $\langle M, w, i \rangle$ is a triplet, whose first component ... $L'$ is not $L'$ is recursively enumerable, but $ L$ is not Both $L$ and $L'$ are recursive Neither $L$ nor $L'$ is recursively enumerable
commented
Nov 18, 2017
in
Theory of Computation

7.7k
views
theoryofcomputation
turingmachine
gate2003
difficult
4
answers
29
GATE201246
Consider the set of strings on $\{0,1\}$ in which, every substring of $3$ symbols has at most two zeros. For example, $001110$ and $011001$ are in the language, but $100010$ is not. All strings of length less than $3$ are also in the language. A partially completed DFA that ...
commented
Nov 10, 2017
in
Theory of Computation

3.7k
views
gate2012
theoryofcomputation
finiteautomata
normal
7
answers
30
GATE2015119
Suppose two hosts use a TCP connection to transfer a large file . Which of the following statements is/are FALSE with respect to the TCP connection? If the sequence number of a segment is m, then the sequence number of the subsequent segment is always m+1. If the ... sender is always less than or equal to the advertised window. III only I and III only I and IV only II and IV only
commented
Nov 5, 2017
in
Computer Networks

4.7k
views
gate20151
computernetworks
tcp
normal
4
answers
31
GATE200525
The maximum window size for data transmission using the selective reject protocol with $n\text{bit}$ frame sequence numbers is: $2^n$ $2^{n1}$ $2^n1$ $2^{n2}$
answered
Nov 5, 2017
in
Computer Networks

3.9k
views
gate2005
computernetworks
slidingwindow
easy
3
answers
32
GATE2004IT29
Which of the following objects can be used in expressions and scriplets in JSP (Java Server Pages) without explicitly declaring them? session and request only request and response only response and session only session, request and response
answered
Nov 4, 2017
in
Web Technologies

709
views
gate2004it
webtechnologies
normal
outofsyllabusnow
3
answers
33
GATE201152
Consider a network with five nodes, $N1$ to $N5$, as shown as below. The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distance vectors at different nodes are as follows. N1: $(0, 1, 7, 8, 4)$ N2: $(1, 0, 6, 7, 3)$ N3: $(7, 6, 0, 2, 6)$ ... node, $N3$? $(3, 2, 0, 2, 5)$ $(3, 2, 0, 2, 6)$ $(7, 2, 0, 2, 5)$ $(7, 2, 0, 2, 6)$
commented
Nov 3, 2017
in
Computer Networks

6.1k
views
gate2011
computernetworks
routing
distancevectorrouting
normal
3
answers
34
GATE2004IT22
Which one of the following statements is FALSE? Packet switching leads to better utilization of bandwidth resources than circuit switching Packet switching results in less variation in delay than circuit switching Packet switching requires more perpacket processing than circuit switching Packet switching can lead to reordering unlike in circuit switching
commented
Nov 3, 2017
in
Computer Networks

3.8k
views
gate2004it
computernetworks
networkswitching
normal
8
answers
35
GATE2014324
A bitstuffing based framing protocol uses an $\text{8bit}$ delimiter pattern of $01111110.$ If the output bitstring after stuffing is $01111100101,$ then the input bitstring is: $0111110100$ $0111110101$ $0111111101$ $0111111111$
answered
Nov 2, 2017
in
Computer Networks

5.6k
views
gate20143
computernetworks
bitstuffing
5
answers
36
GATE200948
Let $G(x)$ be the generator polynomial used for CRC checking. What is the condition that should be satisfied by $G(x)$ to detect odd number of bits in error? $G(x)$ contains more than two terms $G(x)$ does not divide $1+x^k$, for any $k$ not exceeding the frame length $1+x$ is a factor of $G(x)$ $G(x)$ has an odd number of terms.
commented
Nov 1, 2017
in
Computer Networks

8.2k
views
gate2009
computernetworks
errordetection
normal
50,737
questions
57,324
answers
198,408
comments
105,173
users