Answers by Manis / GATE Overflow for GATE CSE

7 votes

1

GATE CSE 2016 Set 2 | Question: 04
Consider the systems, 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. ... $\text{II}$ and $\text{III}$ are true. Only $\text{III}$ is true. None of them is true.

Consider the systems, 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...

15.9k views

answered Jan 24, 2018

0 votes

2

static variable programming Q
Question:

Question:

1.1k views

answered Jan 6, 2018

1 votes

3

COMPILER DESIGN
Check whether this grammar is LL(1) or not?

Check whether this grammar is LL(1) or not?

1.0k views

answered Jan 5, 2018

2 votes

4

MUX
How many 4*1 mux required to implement 8*1 Mux ?

How many 4*1 mux required to implement 8*1 Mux ?

859 views

answered Dec 7, 2017

17 votes

5

GATE CSE 2012 | Question: 18
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))$

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 ALWA...

14.4k views

answered Nov 27, 2017

1 votes

6

GATE CSE 2003 | Question: 54
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 ... $L'$ is recursively enumerable, but $ L$ is not Both $L$ and $L'$ are recursive Neither $L$ nor $L'$ is recursively enumerable

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 o...

24.2k views

answered Nov 14, 2017

5 votes

7

GATE CSE 2005 | Question: 25
The maximum window size for data transmission using the selective reject protocol with $n\text{-bit}$ frame sequence numbers is: $2^n$ $2^{n-1}$ $2^n-1$ $2^{n-2}$

The maximum window size for data transmission using the selective reject protocol with $n\text{-bit}$ frame sequence numbers is:$2^n$$2^{n-1}$$2^n-1$$2^{n-2}$

38.7k views

answered Nov 5, 2017

1 votes

8

GATE IT 2004 | Question: 29
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

Which of the following objects can be used in expressions and scriplets in JSP (Java Server Pages) without explicitly declaring them?session and request onlyrequest and r...

3.1k views

answered Nov 4, 2017

32 votes

9

GATE CSE 2014 Set 3 | Question: 24
A bit-stuffing based framing protocol uses an $\text{8-bit}$ delimiter pattern of $01111110.$ If the output bit-string after stuffing is $01111100101,$ then the input bit-string is: $0111110100$ $0111110101$ $0111111101$ $0111111111$

A bit-stuffing based framing protocol uses an $\text{8-bit}$ delimiter pattern of $01111110.$ If the output bit-string after stuffing is $01111100101,$ then the input bit...

22.5k views

answered Nov 2, 2017

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true