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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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.
Recent activity 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
5
answers
1
GATE201238
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to $15$ $30$ $90$ $360$
retagged
2 hours
ago
in
Graph Theory

6.2k
views
gate2012
graphtheory
normal
markstoall
counting
3
answers
2
GATE2012XE
Ten chocolates are distributed randomly among three children standing in a row. The probability that the first child receives exactly three chocolates is $\frac{5 \times 2^{11}}{3^9}$ $\frac{5 \times 2^{10}}{3^9}$ $\frac{1}{3^9}$ $\frac{1}{3}$
answer edited
5 hours
ago
in
Probability

145
views
gate2012xe
probability
engineeringmathematics
generalaptitude
numericalability
4
answers
3
GATE19976.5
Which one of the following is not decidable? Given a Turing machine $M$, a string $s$ and an integer $k$, $M$ accepts $s$ within $k$ steps Equivalence of two given Turing machines Language accepted by a given finite state machine is not empty Language generated by a context free grammar is nonempty
commented
5 hours
ago
in
Theory of Computation

1.4k
views
gate1997
theoryofcomputation
decidability
easy
3
answers
4
ISIMTECHCSE2018
The number of common terms in the two sequences $\{ 3,7,11, \ldots , 407\}$ and $\{2,9,16,\ldots ,709\}$ is $13$ $14$ $15$ $16$
answer selected
6 hours
ago
in
Numerical Ability

111
views
isi2018
arithmeticprogression
numericalability
2
answers
5
ISI201714
Let $(v_n)$ be a sequence defined by $v_1 = 1$ and $v_{n+1} = \sqrt{v_n^2 +\left(\dfrac{1}{5}\right)^n}$ for $n\geq1$. Then $\displaystyle{\lim_{n \rightarrow \infty}v_n}$ is $\sqrt{5/3}$ $\sqrt{5/4}$ $1$ $\text{nonexistent}$
answer selected
6 hours
ago
in
Calculus

65
views
isi2017
limits
4
answers
6
TIFR2010A1
A box contains $731$ black balls and $2000$ white balls. The following process is to be repeated as long as possible. Arbitrarily select two balls from the box. If they are of the same color, throw them out and put a black ball into the box ( enough extra ... the box The process will stop with a single black ball in the box The process will stop with the box empty None of the above
answer edited
6 hours
ago
in
Numerical Ability

374
views
tifr2010
numericalability
1
answer
7
IISC interview related query
I got interview call from IISC for M.Tech Research in CDS. In the call letter, it is stated that it's on 23rd May in the morning session (9 a.m). Nothing is mentioned explicitly when will the written test take place and when will be the interview. Can someone tell what can be the procedure? @arjun sir please help. PS: I've booked return tickets for 24th May (6 a.m.).
answered
May 13
in
IISc/IITs

75
views
0
answers
8
decidability
Let L(R) be the language represented by regular expression R. Let L(G) be the language generated by a context free grammar G. Which of the following decision problems are decidable? I. Whether L(G) is deterministic context free language? II.Whether L(G1)∩L(G2) is a context free language, where G1 and G2 are deterministic grammar?
commented
May 12
in
Theory of Computation

66
views
5
answers
9
GATE200940
Let $L = L_1 \cap L_2 $, where $L_1$ and $L_2$ are languages as defined below: $L_1= \left \{ a^m b^mca^nb^n \mid m,n \geq 0 \right \}$ $L_2=\left \{ a^i b^j c^k \mid i,j,k \geq 0 \right \}$ Then $L$ is Not recursive Regular Context free but not regular Recursively enumerable but not context free.
answer edited
May 10
in
Theory of Computation

1.9k
views
gate2009
theoryofcomputation
easy
identifyclasslanguage
1
answer
10
ISI 2014
Read the C code given below. What would be the output of the following program? Justify your answer. #include <stdio.h> int myrecurse(int a, int b){ return (b == 1 ? a: myrecurse(a, b1) + a); } main() { int a[]= {2,3,4,5,6 ... Give an $O(n log n)$ algorithm to determine whether the given sequence $S$ has a subsequence whose sum is zero, and justify the correctness of the algorithm.
answer selected
May 10
in
Written Exam

142
views
isi2014
programminginc
algorithms
1
answer
11
What is the probability of seat available
commented
May 8
in
Probability

371
views
1
answer
12
lattice
What is difference between finite lattice and bounded lattice? plz give informal definition
answer selected
May 5
in
Mathematical Logic

62
views
4
answers
13
GATE2007IT25
What is the largest integer m such that every simple connected graph with n vertices and n edges contains at least m different spanning trees ? 1 2 3 n
commented
May 4
in
Graph Theory

3.1k
views
gate2007it
graphtheory
spanningtree
normal
1
answer
14
Made Easy
Consider the following message: The number of bits required for huffman encoding of the above message are __________? My Strategy: But the answer given is 52bits i used standard Algorithem Made Easy Solution :
retagged
May 2
in
Algorithms

50
views
madeeasytestseries
huffmancode
0
answers
15
ISI PCB 2017
Consider the following relations: STD CHOICES (Student ID, Course ID, Semester) and COURSE ASSIGN (Teacher ID, Course ID, Semester). The former indicates the choice of courses for students and the latter indicates the courses assigned to teachers for different ... ID for all the students who have not been taught by the same teacher in more than one course across all semesters.
retagged
May 2
in
Databases

25
views
sql
0
answers
16
ISI 2017 PCB C3 (B)
Consider the following relations: STD CHOICES (Student ID, Course ID, Semester) and COURSE ASSIGN (Teacher ID, Course ID, Semester). The former indicates the choice of courses for students and the latter indicates the courses assigned to teachers for different ... ID for all the students who have not been taught by the same teacher in more than one course across all semesters.
retagged
May 2
in
Databases

31
views
sql
0
answers
17
OS Doubt
Which segment in the process memory structure are the addresses of Dynamic Link Libraries (DLL) stored?
retagged
May 2
in
Operating System

36
views
linking
1
answer
18
Data structure
What is the running time of the function? Int function(int n) { If(n<=1)return; For(int i=1;i<n;i++); For(int j=0;j<3;j++); Function (n1);
retagged
May 2
in
Programming

37
views
timecomplexity
1
answer
19
GATE 2013
Its GATE 2013 question Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter. MultiDequeue(Q){ m = k while (Q is not empty) and (m > 0) { Dequeue(Q) m = m  1 } } What is the worst case time complexity of a ... performed on nonempty or full queue?? Due to this change will the answer remain same?? Θ(n) Θ(n + k) Θ(nk) Θ(n2)
retagged
May 2
in
DS

56
views
queues
0
answers
20
IISC DESE Admissions Interview
Please guide me if i should consider DESE course in IISC Bangalore, instead of going for IIT Kanpur CSE. (since the interview dates are clashing). I'm from CSE background. I would also like to know the type of questions asked in the DESE written and interview from CSE students.
retagged
May 2
in
Written Exam

98
views
interview
0
answers
21
General Doubts
Which book i should read for networks tanenbaum or forouzen.I have completed all the gate previous question of networks and i also have a very good understanding of all topics and now i am starting to refer books.The thing is some topics are given better in forouzen(like : DVR,Reverse DNS) and some are better in tanenbaum(like: Berkeley sockets) so which one should i prefer?
retagged
May 2
in
Others

37
views
computernetworks
studyresources
2
answers
22
TOC regular language
L={a^n b^n :n>=1} and R = (a+b)^* L union R is going to be regular or not regular plzz give reason L is not regular if N leads to infinity then how it can be regular ..........
retagged
May 2
in
Theory of Computation

59
views
regularlanguages
1
answer
23
TOC question on Regular expresstion
Find length of string of minimum length on {0,1}* not in the language corressponding to the given RE 0^*(01^*)^* options are 1 2 3 None of these Is it asking to find the minimum length string and then length of it if yes then minimum length can be ... ans is 1 plzz rectify me if I have not understand the question properly second RE 1^*(0+10)^* options are 2 3 4 5
retagged
May 2
in
Theory of Computation

29
views
regularexpressions
1
answer
24
Proper subset and subset
Please solve this question along with explanation.
retagged
May 2
in
Mathematical Logic

66
views
sets
1
answer
25
Function
Determine whether f is a function from the set of all bit strings to the set of integers if f(S) is the smallest integer i such that the ith bit of S is 1 and f(S)=0 when S is the empty string ,the string with no bits.
retagged
May 2
in
Mathematical Logic

31
views
functions
4
answers
26
c programming
#include<stdio.h> int main() { if(*"abc" ==*"abcdef") printf("strings are equal"); else printf("not equal"); return; } Can someone please explain this program as output is strings are equal?
retagged
May 2
in
Programming

112
views
programminginc
0
answers
27
Domain of a function
What is the domain of the function log(log(sinx))?
retagged
May 2
in
Mathematical Logic

46
views
functions
0
answers
28
Test Series
What is the output.My doubt is : What is meant by call by copy restore ? is it same as call by reference or there is some difference ?
retagged
May 2
in
Programming

41
views
programminginc
parameterpassing
1
answer
29
Gate 2018
Consider instruction pipeline with five stages $\text{instruction fetch (IF), Instruction Decode (ID), Operand Fetch (OF)}$, $\text{perform operation (PO), and write back (WB)}$. There are $100$ instructions, perform operation stage (PO) takes $3$ ... $40, 25, 35, $ instruction respectively other stages takes one clock for each. Number of clocks is needed for this pipeline________.
closed
May 2
in
CO & Architecture

593
views
coandarchitecture
pipelining
0
answers
30
C programming
Consider a part of program: int i=4,t; t=i++ + i++ + i++; printf("%d",t); Why the value of t comes out to be 15(in codeblocks)? Since we have post increment so first value of i must be used Therefore ans must be 12. Secondly, int i=4,t; t=++i + i++ + i++; printf("%d",t); Its output must be 5+5+5=15 but it comes out to be 17 Why?
closed
May 2
in
Programming

29
views
3
answers
31
ISRO201877
What is one advantage of setting up a $DMZ$ (Demilitarized Zone) with two firewalls? You can control where traffic goes in the three networks You can do statefull packet filtering You can do load balancing Improve network performance
answer selected
May 1
in
Computer Networks

409
views
isro2018
computernetworks
networksecurity
firewalls
5
answers
32
GATE200615
Consider the following Cprogram fragment in which $i$, $j$ and $n$ are integer variables. for( i = n, j = 0; i > 0; i /= 2, j +=i ); Let $val(j)$ denote the value stored in the variable $j$ after termination of the for loop. Which one of the following is true? $val(j)=\Theta(\log n)$ $val(j)=\Theta (\sqrt{n})$ $val(j)=\Theta( n)$ $val(j)=\Theta (n\log n)$
answer edited
May 1
in
Algorithms

2.8k
views
gate2006
algorithms
normal
timecomplexity
2
answers
33
C programming
reopened
May 1
in
Programming

61
views
programminginc
pointers
2
answers
34
ISRO201868
In multiprogrammed systems, it is advantageous if some programs such as editors anf compilers can be shared by several users. Which of the following must be true of multiprogrammed systems in order that a single copy of a program can be shared by several users? The program is a macro The program is recursive The program is reentrant I only II only III only I, II and III
answer selected
Apr 30
in
Others

416
views
isro2018
1
answer
35
IIT Guwahati Counselling call letter  Worth attending with less Gate score (considering the travel expense)
commented
Apr 29
in
IISc/IITs

1.2k
views
mtech
admissiongate2017
admissions
iitguwahati
0
answers
36
IISc Research Interview
Who all going to IISc. Research interviews? Just comment below if going.
commented
Apr 29
in
IISc/IITs

500
views
iisc
gate2016admission
interview
2
answers
37
c programming
#include<stdio.h> int main() { char s1[10]="ABC"; char s2[10]="ABC"; if(s1==s2) printf("Equal"); else printf("Not equal"); } Here output is $\text{Not equal}$ please explain the output
answer selected
Apr 28
in
Programming

57
views
programminginc
2
answers
38
NIELIT ScientistB Dec 2017_35
Which one is the correct translation of the following statement into mathematical logic ? "None of my friends are perfect" (A) $¬\exists x (p(x)∧q(x))$ (B) $\exists x (¬p(x)∧q(x))$ (C) $\exists x (¬p(x)∧¬q(x))$ (D) $\exists x (p(x)∧¬q(x))$
answer selected
Apr 28
in
Mathematical Logic

156
views
1
answer
39
M.tech admission
Rank = 744 Score = 683 category = OBCNCL what are my chances for IITG, IITR, IITM, IITKGP M.tech admission ? should I apply for NITs ?
answered
Apr 27
in
IISc/IITs

150
views
admission
gate2018
cutoffs
1
answer
40
pointers and arrays
Why is it illegal initialization? #include<stdio.h> #include<string.h> main() { char *s[]={"Lakshya","cquest","brainq","cidol"}; char **ss[]={(s+3),(s+2),(s+1),(s+0)}; char ***sss=ss; printf("%s",**++sss); printf("%s",**++sss+3); printf("%s",sss[1][1]+1); }
commented
Apr 27
in
Programming

92
views
pointers
arrays
programming
arrayofpointers
programminginc
35,519
questions
42,844
answers
121,780
comments
42,191
users