The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
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
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Answers by Arjun
User Arjun
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Arjun
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+4
votes
1
P and np doubt
Are p and np languages all recursive? Because p and np both correspond to languages which have algorithms and algorithms means that there is a halting turning machine(either ntm or dtm). So np and p both should be recursive. Am i right here? Please answer
answered
5 days
ago
in
Theory of Computation

53
views
+1
vote
2
GO pdf hard copy
Pre booking for GO pdf hardcopy available?
answered
Apr 14
in
Study Resources

27
views
+3
votes
3
#arrays
i write this program, during initialization of array i given the size as 11 means the number of elements stored in an array is 11. as we know array is not assigned a value of index 12 and above. but in in the program array a is initialized of index from 0 to 19,my question is how the array is ... i=0;i<20;i++) { a[i]=i+1; } for(i=0;i<20;i++) { printf("%d\n",a[i]); } }
answered
Apr 7
in
Programming

64
views
programminginc
programming
arrays
array
memoryallocation
+4
votes
4
self doubt
difference between empty language and empty string
answered
Apr 6
in
Theory of Computation

39
views
theoryofcomputation
+4
votes
5
#gate2020
Hello!! all the respected members of gate overflow.. I am a gate 2020 aspirant Our paper is going to be made by IIT Delhi as per i got the information Can u all please guide me how to prepare and what topics I must focus on more ...What will be my strategy and all..& if i get a timetable I would be greatful to u all Thank you
answered
Mar 19
in
GATE

82
views
+1
vote
6
Set Theory Self Doubt
Is the subset of a countably infinite set countable?
answered
Mar 19
in
Set Theory & Algebra

27
views
+1
vote
7
Peter Linz Edition 5 Exercise 11.1 Question 12 (Page No. 284)
Let $L_1$ be recursive and $L_2$ recursively enumerable. Show that $L_2L_1$ is necessarily recursively enumerable.
answered
Mar 16
in
Computer Networks

10
views
peterlinz
theoryofcomputation
proof
turingmachine
recursiveandrecursivelyenumerablelanguages
+1
vote
8
TIFR2019A12
Let $f$ be a function with both input and output in the set $\{0,1,2, ..9\}$, and let the function $g$ defined as $g(x) = f(9x)$. The function $f$ is nondecreasing, so that $f(x)$ $\geq$ $f(y)$. Consider the following statements: There exists $x$ $\in$ ... must be TRUE form ALL such functions $f$ and $g$ ? Only $(i)$ Only $(i)$ and $(ii)$ Only $(iii)$ None of them All of them
answered
Mar 14
in
Set Theory & Algebra

387
views
tifr2019
engineeringmathematics
discretemathematics
settheory&algebra
functions
+2
votes
9
GATE201948
Let $\Sigma$ be the set of all bijections from $\{1, \dots , 5\}$ to $\{1, \dots , 5 \}$, where $id$ denotes the identify function, i.e. $id(j)=j, \forall j$. Let $\circ$ ... $L=\{x \in \Sigma^* \mid \pi (x) =id\}$. The minimum number of states in any DFA accepting $L$ is _______
answered
Feb 20
in
Theory of Computation

2.5k
views
gate2019
numericalanswers
theoryofcomputation
finiteautomata
+2
votes
10
GATE19 Admission [Rank  631/28326 Marks  61.67]
Is the rank of 631/28326 a good rank? What college I must apply to? or any advice/suggestion will be helpful and r welcome. Marks – 61.67 Accuracy – 98%+ (Only 1 ve in Tag bit question) Category – SC but ok with OPEN too. Thank You in Advance (^_^)
answered
Feb 14
in
IISc/IITs

353
views
usergate2019
usermod
admissions
+1
vote
11
gate overflow rank prediction 2019
Is this gate overflow rank prediction 2019 working fine because it seem more marks are needed for good rank as compare to previous years
answered
Feb 14
in
Others

4.2k
views
0
votes
12
Gate 2019
When you are going to create Gate 2019 mark calculator for chemical engineering...?
answered
Feb 10
in
GATE

802
views
+9
votes
13
Test Series For Gate 2020
Which are the best TestSeries for gate 2020.In terms of quality of question and for practice purposes. Just solving PYQ’s is it enough?
answered
Feb 9
in
GATE

849
views
gatepreparation
+3
votes
14
#General #GO
How can I bookmark questions on GO?
answered
Feb 9
in
Others

59
views
#general
+2
votes
15
Qualifying marks for general candidates gate cse 2019?
I heard that the qualifying marks may increase from 25 marks for the general candidates since the gate paper was comparatively easy this time. Please tell me how much it may increase as I am a bit scared.
answered
Feb 9
in
Others

765
views
qualifyingmarks
+17
votes
16
GATE201946
Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at random. The expected value of the distance between $a$ and $b$ in $T$ (ie., the number of edges in the unique path between $a$ and $b$) is (rounded off to $2$ decimal places) _________.
answered
Feb 8
in
DS

4.4k
views
gate2019
numericalanswers
datastructure
binarytree
+7
votes
17
GATE201945
A certain processor deploys a singlelevel cache. The cache block size is $8$ words and the word size is $4$ bytes. The memory system uses a $60$MHz clock. To service a cache miss, the memory controller first takes $1$ cycle to accept the ... bandwidth for the memory system when the program running on the processor issues a series of road operations is ______$\times 10^6$ bytes/sec
answered
Feb 7
in
CO & Architecture

2k
views
gate2019
numericalanswers
coandarchitecture
cachememory
+5
votes
18
Less than equal to 40 In OBC ,branch CSE
Will I get any IITs under 40 marks in gate 2018 in OBC category ?
answered
Jan 26
in
IISc/IITs

200
views
0
votes
19
GOCompiler1: Parsing5
Which of the following statements regarding $LR(0)$ parser is FALSE? A $LR(0)$ configurating set cannot have multiple reduce items A $LR(0)$ configurating set cannot have both shift as well as reduce items If a reduce item is present in a $LR(0)$ configurating set it cannot have any other item A $LR(0)$ parser can parse any regular grammar
answered
Jan 26
in
Compiler Design

114
views
go2019cd1
parsing
lrparser
+2
votes
20
GOCompiler1: Parsing6
Which of the following sentences is CORRECT? A topdown parse produces a leftmost derivation of a sentence A bottomup parse produces a rightmost derivation of a sentence A topdown parse produces a rightmost derivation of a sentence A bottomup parse produces a leftmost derivation of a sentence
answered
Jan 26
in
Compiler Design

98
views
go2019cd1
+2
votes
21
GATEBOOK2019 Mock Test161
$S\rightarrow aS\mid b$ ... Which of the following stack contents causes the parser to reduce by some production? $a$ $aa$ $bb$ $aaS$
answered
Jan 23
in
Compiler Design

150
views
gb2019mock1
parsing
+6
votes
22
GATEBOOK2019 Mock Test120
Assume the distribution of instructions that run on a processor as follows: $50 \%$: ALU $25 \%$: BEQ $15 \%$: Load Word $10 \%$: Store Word Assuming there are no stalls or hazards, what is the utilization of the register block’s write port? (Utilization in percentage of clock cycles used) $45 \%$ $55 \%$ $65 \%$ $75 \%$
answered
Jan 20
in
CO & Architecture

275
views
gb2019mock1
instructionexecution
coandarchitecture
+2
votes
23
GATEBOOK2019 Mock Test115
Let I denote the formula: $(q\to p) \to (p\to q).$ Let II denote the formula $(p\to q)\wedge q.$ Which of the following is TRUE? I is not a tautology and II is not satisfiable. I is not a tautology and II is satisfiable. I is satisfiable and II is not satisfiable. I is a tautology and II is satisfiable.
answered
Jan 19
in
Mathematical Logic

100
views
gb2019mock1
propositionallogic
+8
votes
24
GATEBOOK2019 Grand Test CN16
In a communication link out of $\text{p packets}$ one packet will be lost. If stop and wait protocol is used then expected number of retransmissions for a packet? $\dfrac{p}{p1}$ $p$ $\dfrac{1}{p1}$ $\dfrac{1}{p}$
answered
Jan 15
in
Computer Networks

189
views
gb2019gtcn
probability
+1
vote
25
Computer net  York University
Consider a TCP connection between two machines (A and B) in an environment with 0% packet loss. Assume the round trip time (RTT) between the two machines is 4 [seconds], and the segment size is 3 [Kbytes]. The bandwidth of ... the sender before the first ack arrives back.) ? https://www.eecs.yorku.ca/course_archive/201011/W/3214/CSE3214_Final_Winter2010_solutions.pdf
answered
Jan 15
in
Computer Networks

51
views
tcp
+1
vote
26
Paging and virtual memory
If there is 2 or more level paging for processes, is it possible to have more than 1 page fault while accessing any single addressable unit(byte or word) ?
answered
Jan 10
in
Operating System

158
views
operatingsystem
virtualmemory
memorymanagement
paging
0
votes
27
MadeEasy Full Length Test 2019: General Aptitude  Probability
A packet of 20 batteries is known to include 4 batteries that are defective. If 8 batteries are randomly chosen and tested, the probability that finding among them not more than 1 defective is Ans: 0.5033 Solution provided: How can we apply Binomial distribution ...
answered
Jan 10
in
Numerical Ability

200
views
generalaptitude
numericalability
probability
madeeasytestseries2019
madeeasytestseries
+3
votes
28
GATEBOOK2019Compilers115
Consider the grammar $S\rightarrow ACB \mid cbB \mid Ba$ $A\rightarrow da \mid BC$ $B\rightarrow b\mid g \mid \epsilon $ $C \rightarrow h \mid \epsilon $ $FIRST (A)$ will be $\{b, d, g, h, \epsilon\}$ $\{d, g, h, b \}$ $\{d, h, g, \epsilon\}$ $\{g, h, a, \epsilon \}$
answered
Jan 9
in
Compiler Design

59
views
gb2019cd1
firstfollow
+2
votes
29
GATEBOOK2019 Grand Test CN24
Consider an instance of TCP's $\text{Additive Increase Multiplicative Decrease (AIMD)}$ algorithm where the window size at the start of the slow start phase is $\text{1 MSS}$ and the threshold at the start of the first transmission is $\text{8 MSS}$. Assume that a timeout ... $\text{10 MSS}$ $\text{6 MSS}$ $\text{5 MSS}$ $\text{7 MSS}$
answered
Jan 7
in
Computer Networks

83
views
gb2019gtcn
congestioncontrol
+1
vote
30
GATEBOOK2019CN120
What is the fraction of the bandwidth that is wasted on overhead (headers and retransmissions) for selectiverepeat on a heavily loaded $50$kbps satellite channel with data frames consisting of $40$ header and $3960$ data bits? Assume that the signal propagation time from the earth ... frames is negligible. The sequence numbers are $8$ bits. $2.99$% $1.99$% $3.99$% $4.99$%
answered
Jan 5
in
Computer Networks

139
views
gb2019cn1
computernetworks
selectiverepeat
datalinklayer
Page:
1
2
3
4
5
6
...
44
next »
50,121
questions
53,242
answers
184,708
comments
70,481
users