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
Answers 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
+4
votes
1
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.5k
views
gate20162
linearalgebra
systemofequations
normal
0
votes
2
static variable programming Q
Question:
answered
Jan 6, 2018
in
Programming

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

172
views
compilerdesign
parser
+1
vote
4
MUX
How many 4*1 mux required to implement 8*1 Mux ?
answered
Dec 7, 2017
in
Digital Logic

450
views
multiplexer
+10
votes
5
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.6k
views
gate2012
algorithms
easy
asymptoticnotations
+1
vote
6
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
answered
Nov 14, 2017
in
Theory of Computation

7.6k
views
theoryofcomputation
turingmachine
gate2003
difficult
+6
votes
7
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.8k
views
gate2005
computernetworks
slidingwindow
easy
–1
vote
8
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

706
views
gate2004it
webtechnologies
normal
outofsyllabusnow
+15
votes
9
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.5k
views
gate20143
computernetworks
bitstuffing
50,741
questions
57,233
answers
197,993
comments
104,580
users