GATE CSE
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
Chat
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 Prashant.
User Prashant.
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Prashant.
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
combinatorics
In how many ways 8 different shirts can be distributed to 4 different people so that each will get 2 shirts?
comment edited
3 hours
ago
in
Combinatory

39
views
discretemathematics
#combinations
4
answers
2
GATE2017102
Consider the firstorder logic sentence $F:\forall x(\exists yR(x,y))$. Assuming nonempty logical domains, which of the sentences below are implied by $F$? $\exists y(\exists xR(x,y))$ $\exists y(\forall xR(x,y))$ $\forall y(\exists xR(x,y))$ $¬\exists x(\forall y¬R(x,y))$ (A) $IV$ only (B) $I$ and $IV$ only (C) $II$ only (D) $II$ and $III$ only
answer edited
4 hours
ago
in
Mathematical Logic

913
views
gate20171
mathematicallogic
firstorderlogic
6
answers
3
GATE2017104
Consider the following functions from positive integers to real numbers: $10$, $\sqrt{n}$, $n$, $\log_{2}n$, $\frac{100}{n}$. The CORRECT arrangement of the above functions in increasing order of asymptotic complexity is: (A) $\log_{2}n$, $\frac{100}{n}$, $10$, $\sqrt ... $\sqrt{n}$, $\log_{2}n$, $n$ (D) $\frac{100}{n}$, $\log_{2}n$, $10$, $\sqrt{n}$, $n$
answer edited
5 hours
ago
in
Algorithms

885
views
gate20171
algorithms
asymptoticnotations
normal
5
answers
4
GATE2017125
Consider a twolevel cache hierarchy with $L1$ and $L2$ caches. An application incurs $1.4$ memory accesses per instruction on average. For this application, the miss rate of $L1$ cache is $0.1$; the $L2$ cache experiences, on average, $7$ misses per $1000$ instructions. The miss rate of $L2$ expressed correct to two decimal places is ________.
commented
1 day
ago
in
CO & Architecture

966
views
gate20171
co&architecture
cachememory
0
answers
5
C programming
What does the following program print? #include < stdio.h > void f (int *p, int * g) { p = q; *p = 2; } int i = 0, j = 1; int main ( ){ f(&i, & j); printf ("%d %d \ n", i, j); return 0; }
commented
1 day
ago
in
Programming

25
views
1
answer
6
peter linz excercise
Which of the following languages are regular 1)L= wwR v : v,w belongs to {a,b}+ 2)L=uwwR v : u,v,w belongs to {a,b}+ 3)L=uwwR v : u,v,w belongs to {a,b}+ .u >= v
commented
2 days
ago
in
Theory of Computation

20
views
0
answers
7
UGC Net Query
The query may sound trivial but (my bad) I have no knowledge about such exam. I am not much aware about UGCNET exam for Computer Science and came to come about such an exam recently. I wanted to know, What is the eligibility of this ... career prospects ? What is the score validity? What is the max age limit ? Anything else that would be useful to know.
commented
2 days
ago
in
CBSE/UGC NET

18
views
netexam
1
answer
8
Made Easy test series
"A" sort a particular dataset of size n using merge sort in 640 msec, "B" uses the same algorithm on dataset of size 16, it takes 256 msec to sort them. what is size of data set used by "A" A. 32 B. 64 C. 128 D. None of above
commented
3 days
ago
in
Algorithms

48
views
0
answers
9
peter linz excercise
commented
3 days
ago
in
Theory of Computation

39
views
0
answers
10
decomposition is lossy or lossless
commented
3 days
ago
in
Databases

72
views
1
answer
11
time complexity
Arrange in increasing order of rate of growth: 2n nlogn n(logn) n(3/2)
edited
4 days
ago
in
Algorithms

28
views
timecomplexity
2
answers
12
why this program give "Invalid memory reference" error explain it?
commented
5 days
ago
in
Programming

62
views
programminginc
1
answer
13
tokens
find number of tokens? 1 .abc*def+xyz=5 2. abc*+
commented
5 days
ago
in
Compiler Design

33
views
tokens
2
answers
14
GATE2017151
Consider a $2$way set associative cache with $256$ blocks and uses $LRU$ replacement. Initially the cache is empty. Conflict misses are those misses which occur due to the contention of multiple blocks for the same cache set. Compulsory misses ... ,129 \big \}$ is repeated $10$ times. The number of conflict misses experienced by the cache is _________ .
commented
6 days
ago
in
CO & Architecture

1.8k
views
gate20171
co&architecture
cachememory
conflictmisses
normal
numericalanswers
1
answer
15
related to Pointer in c ,what will be the output of following program ? would this program compile properly ?
edited
6 days
ago
in
Programming

31
views
programminginc
gate
2
answers
16
GATE2006IT78
A pipelined processor uses a 4stage instruction pipeline with the following stages: Instruction fetch (IF), Instruction decode (ID), Execute (EX) and Writeback (WB). The arithmetic operations as well as the load and store operations are carried out in the EX stage. ... in the sequence of instructions are, respectively, 2, 2, 4 3, 2, 3 4, 2, 2 3, 3, 2
commented
6 days
ago
in
CO & Architecture

915
views
gate2006it
co&architecture
pipeline
normal
0
answers
17
theory of computation
Which of the following languages below are NOT recursively enumerable ? L1 = {<M> / M is a TM that accepts all even numbers }. L2 = {<M> / M does not accept all even numbers } L3 = {<M> / M rejects all even numbers } A) Only L1 B) Only L1 and L2 C) Only L1 and L3 D) All of L1,L2 and L3
commented
6 days
ago
in
Theory of Computation

87
views
theoryofcomputation
toc
decidability
recursiverecursivelyenumerable
1
answer
18
algorithmss, Sorting,
Consider the array A containing n distinct elements. Let K = n – $n^{0.75}$. The first ⌊K⌋ elements of A are all in sorted order, but nothing is known about the remaining elements of A. what is the time complexity to sort given array A. A. O($n^{0.75}$) B. O(n) C. O($n^{2}$) D. O(nlogn)
commented
Apr 21
in
Algorithms

54
views
algorithms
sorting
divideandconquer
ravulatestseries
2
answers
19
LL1 parser
commented
Apr 21
in
Compiler Design

123
views
compilerdesign
madeeasy_testseries
2
answers
20
Combinatorics
A bagel shop has onion bagels, poppy seed bagels, egg bagels, salty bagels, pumpernickel bagels, sesame seed bagels, raisin bagels, and plain bagels. How many ways are there to choose a dozen bagels with at least three egg bagels and no more than two salty bagels?
answer edited
Apr 21
in
Combinatory

39
views
combinatorics
discretemathematics
1
answer
21
ISIJRF
A machine M has the following five pipeline stages; their respective time requirements in nanoseconds (ns) are given within parentheses: Fstage  instruction fetch (9 ns), Dstage  instruction decode and register fetch (3 ns), Xstage  ... where every 3rd instruction needs a 1cycle stall before the Xstage. Calculate the CPU time in seconds for completing P.
edited
Apr 20
in
CO & Architecture

31
views
#computerorganisationandarchitecture
pipeline
1
answer
22
DMS  Kenneth Rosen Ex. 1.4 10
Let F (x,y) be the statement such as x can fool y .where the domain consists of all people in world . Express following statement using quantifiers There is exactly one person whom everybody can fool
answer edited
Apr 20
in
Mathematical Logic

23
views
kennethrosen
mathematicallogic
1
answer
23
If memory for the runtime stack is only 150 cells (words) how big can N be in Factorial(N) before encountering Stack overflow?
commented
Apr 19
in
Programming

1.1k
views
1
answer
24
TOC: empty language and epsilon
commented
Apr 19
in
Theory of Computation

39
views
theoryofcomputation
2
answers
25
GATE201250
Consider the following relations A, B and C: A Id Name Age 12 Arun 60 15 Shreya 24 99 Rohit 11 B Id Name Age 15 Shreya 24 25 Hari 40 98 Rohit 20 99 Rohit 11 C Id Phone Area 10 2200 02 99 2100 01 How many tuples does the result of the following relational algebra ... is the same as that of $A$. $$(A\cup B)\bowtie _{A.Id > 40 \vee C.Id < 15} C$$ 7 4 5 9
commented
Apr 19
in
Databases

1.6k
views
gate2012
databases
sql
relationalcalculus
normal
0
answers
26
DMS  Rosen Exercise 1.4  8
Let Q(x, y) be the statement student x has been a contestant on quiz show y. Express sentences in terms of Q(x, y), quantifiers, and logical connectives, where the domain for x consists of all students at your ... for y consists of all quiz shows on television. * At least two students from your school have been contestants on Jeopardy.
commented
Apr 19
in
Mathematical Logic

21
views
kennethrosen
mathematicallogic
2
answers
27
Indexing
Primary index vs Secondary Index Primary index is done on the primary key of the database.Secondary indexing is done on the candidate key..and clusterd index on non key field. Which indexing required dense and sparse indexing and why ? WHy cant secondary indices be done based on sparse indexing as it is order on candidate key and which also orders the file?
commented
Apr 19
in
Databases

459
views
0
answers
28
Kenneth Rosen  Mathematical logic
commented
Apr 19
in
Mathematical Logic

23
views
mathematicallogic
discretemathematics
kennethrosen
0
answers
29
Kenneth Rosen Mathematical logic
closed
Apr 19
in
Mathematical Logic

31
views
mathematicallogic
kennethrosen
discretemathematics
0
answers
30
rtmnu be IT 4thsem w14 quetion 7a
closed
Apr 19
in
Algorithms

29
views
1
answer
31
pointer question
void foo(int*); int main() { int i = 10; foo((&i)++); } void foo(int *p) { printf("%d\n", *p); } It gives compile time error but how? which particular statement is cause of this error in program?
edited
Apr 18
in
Programming

59
views
2
answers
32
Check for Regular Language
Check whether given language is Regular or not? WXWR / W,X∈(0,1)+
commented
Apr 18
in
Theory of Computation

46
views
theoryofcomputation
regularlanguage
0
answers
33
pointer question
int main() { int i = 10; int *p = &i; foo(&p); printf("%d ", *p); printf("%d ", *p); } void foo(int **const p) { int j = 11; *p = &j; printf("%d ", **p); } Output is 11 11 undefined value How?
commented
Apr 18
in
Programming

55
views
1
answer
34
pointer
Which of the following declaration throw runtime error? A. int **c = &c; B. int **c = &*c; C. int **c = **c; D. None of the mentioned. I think C is correct but mentioned correct ans is D how?
commented
Apr 18
in
Programming

31
views
0
answers
35
Chapter 1: Kenneth Rosen , page: 17;eg:2
commented
Apr 18
in
Mathematical Logic

48
views
kennethrosen
propositionallogic
mathematicallogic
2
answers
36
T(n)=16T(n/4)+n! using the Master Theorem
answered
Apr 18
in
Algorithms

200
views
algorithms
mastertheorem
1
answer
37
MadeEasy TestSeries
True Or False.....? Explain...?
commented
Apr 18
in
Programming

77
views
madeeasy_testseries
testseries
programminginc
hashing
4
answers
38
GATE200519
Which one of the following is true for a CPU having a single interrupt request line and a single interrupt grant line? Neither vectored interrupt nor multiple interrupting devices are possible Vectored interrupts are not ... and multiple interrupting devices are both possible Vectored interrupts are possible but multiple interrupting devices are not possible
answer edited
Apr 17
in
Operating System

1.1k
views
gate2005
operatingsystem
iohandling
normal
0
answers
39
gate 2017 admission
I had applied for Mtech(res) in IISC in CSA with a gate rank of 797 and score 689. However, i still havent received an interview call letter. Is there any chance that il still receive a call letter gor interview? Also, has anyone else who has applied for mtech iisc in research received a call letter yet?
retagged
Apr 17
in
IISc/IITs

96
views
gate2017addmission
gettingtoiits
admissiongate2017
0
answers
40
Normalisation
Relation R is decomposed using a set of functional dependency F, and relation S is decomposed using another set of functional dependencies G. One decomposition is definitely BCNF, the other is definitely 3NF, but is not known to make a guaranteed ... and (B) D. 3NF definition I think D should be most appropriate answer but answer key has given it B.
closed
Apr 17
in
Databases

33
views
databasenormalization
functionaldependencies
22,147
questions
28,138
answers
63,516
comments
24,290
users