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
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
2
answers
1
GATE200112
Consider a $5$stage pipeline  IF (Instruction Fetch), ID (Instruction Decode and register read), EX (Execute), MEM (memory), and WB (Write Back). All (memory or register) reads take place in the second phase of a clock cycle and all ... Show all data dependencies between the four instructions. Identify the data hazards. Can all hazards be avoided by forwarding in this case.
answer edited
6 hours
ago
in
CO & Architecture

3k
views
gate2001
coandarchitecture
pipelining
normal
descriptive
3
answers
2
GATE199913
An instruction pipeline consists of 4 stages  Fetch (F), Decode field (D), Execute (E) and Result Write (W). The 5 instructions in a certain instruction sequence need these stages for the different number of clock cycles as shown by the table below No. of cycles needed ... $1$} & \text{$2$} \\\hline \end{array} Find the number of clock cycles needed to perform the $5$ instructions.
answer edited
7 hours
ago
in
CO & Architecture

1.6k
views
gate1999
coandarchitecture
pipelining
normal
6
answers
3
GATE2004IT35
In how many ways can we distribute $5$ distinct balls, $B_1, B_2, \ldots, B_5$ in $5$ distinct cells, $C_1, C_2, \ldots, C_5$ such that Ball $B_i$ is not in cell $C_i$, $\forall i= 1,2,\ldots 5$ and each cell contains exactly one ball? $44$ $96$ $120$ $3125$
answer edited
9 hours
ago
in
Combinatory

2.4k
views
gate2004it
permutationsandcombinations
normal
0
answers
4
Toc p and np
Are p and np problems both closed under union intersection and concatenation and kleene closure? If yes then how?
commented
11 hours
ago
in
Theory of Computation

17
views
2
answers
5
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
11 hours
ago
in
Theory of Computation

28
views
1
answer
6
Self doubt  Programming
X=2; Y=++x * ++x * ++x ; Printf("%d",Y); In the above question, we have to use the final value of x or it will be evaluated seperately and then multiplied. Ex: Y= 3*4*5; or Y=5*5*5;
commented
11 hours
ago
in
Programming

51
views
selfdoubt
programminginc
output
0
answers
7
M.Tech Admission
Rank: 1092 Score: 674 category: OBCNCL Any chance of getting IIT G/R/H in direct admission?
commented
1 day
ago
in
IISc/IITs

34
views
admissions
1
answer
8
Made Easy Test Series : TOC Turing Machine
Consider $\left \langle M \right \rangle$ be the encoding of a turing machine as a string over alphabet $\Sigma =\left \{ 0,1 \right \}$. Consider $D=${$\left \langle M \right \rangle$ $M$ is TM that halt on all ... NonRecursive $(C)$ Recursively enumerable $(D)$ Not Recursively enumerable My question is Is it not a Halting Problem they are asking for?
commented
2 days
ago
in
Theory of Computation

145
views
theoryofcomputation
turingmachine
testseries
1
answer
9
GO pdf hard copy
Pre booking for GO pdf hardcopy available?
answered
4 days
ago
in
Study Resources

23
views
0
answers
10
GATE 1992
How is option (a) correct? Isn’t Universal quantifier not distributive over union/disjunction. Source: https://cse.buffalo.edu/~rapaport/191/distqfroverandor.html
closed
4 days
ago
in
Mathematical Logic

17
views
discretemathematics
firstorderlogic
5
answers
11
GATE200335
Consider the following recurrence relation $T(1)=1$ $T(n+1) = T(n)+\lfloor \sqrt{n+1} \rfloor$ for all $n \geq 1$ The value of $T(m^2)$ for $m \geq 1$ is $\frac{m}{6}\left(21m39\right)+4$ $\frac{m}{6}\left(4m^23m+5\right)$ $\frac{m}{2}\left(3m^{2.5}11m+20\right)5$ $\frac{m}{6}\left(5m^334m^2+137m104\right)+\frac{5}{6}$
answer edited
6 days
ago
in
Algorithms

3.3k
views
gate2003
algorithms
timecomplexity
recurrence
difficult
2
answers
12
Raghuramkrishnan Exercise 4.1 Relational Algebra
Given two relations R1 and R2, where R1 contains N1 tuples, R2 contains N2 tuples, and N2>N1> 0, give the minimum and maximum possible sizes (in tuples) for the result relation produced by each of the following relational algebra expressions. In each ... $σa=5(R1)$ (selection) $\pi a(R1)$ (projection) $R1/R2$ (division)
commented
Apr 12
in
Databases

83
views
databases
relationalalgebra
relationalcalculus
relations
3
answers
13
GATE200878
Let $x_n$ denote the number of binary strings of length $n$ that contain no consecutive 0s. Which of the following recurrences does $x_n$ satisfy? $x_n = 2x_{n1}$ $x_n = x_{\lfloor n/2 \rfloor} + 1$ $x_n = x_{\lfloor n/2 \rfloor} + n$ $x_n = x_{n1} + x_{n2}$
commented
Apr 11
in
Algorithms

1.9k
views
gate2008
algorithms
recurrence
normal
4
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 occur due to first ... $10$ times. The number of conflict misses experienced by the cache is _________ .
answer edited
Apr 11
in
CO & Architecture

10.7k
views
gate20171
coandarchitecture
cachememory
conflictmisses
normal
numericalanswers
5
answers
15
GATE199311
In the threelevel memory hierarchy shown in the following table, $p_i$ denotes the probability that an access request will refer to $M_i$. \begin{array}{cccc} \hline \textbf {Hierarchy Level } & \textbf{Access Time}& \textbf{Probability of ... such a page swap is $T_i$. Calculate the average time $t_A$ required for a processor to read one word from this memory system.
edited
Apr 11
in
CO & Architecture

2.4k
views
gate1993
coandarchitecture
cachememory
normal
6
answers
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) _________.
commented
Apr 10
in
DS

4.4k
views
gate2019
numericalanswers
datastructure
binarytree
0
answers
17
book name is" test ur c aptitude"
plzzz explain how this code is executed
commented
Apr 9
in
Programming

47
views
badquestion
4
answers
18
GATE200663, UGCNETJune2012III45
A computer system supports $32$bit virtual addresses as well as $32$bit physical addresses. Since the virtual address space is of the same size as the physical address space, the operating system designers decide to get rid of ... made more efficient now Hardware support for memory management is no longer needed CPU scheduling can be made more efficient now
commented
Apr 8
in
Operating System

5.8k
views
gate2006
operatingsystem
virtualmemory
normal
ugcnetjune2012iii
1
answer
19
#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

57
views
programminginc
programming
arrays
array
memoryallocation
3
answers
20
GATE201419
A machine has a $32bit$ architecture, with $1word$ long instructions. It has $64$ registers, each of which is $32$ bits long. It needs to support $45$ instructions, which have an immediate operand in addition to two register operands. Assuming that the immediate operand is an unsigned integer, the maximum value of the immediate operand is ____________
commented
Apr 7
in
CO & Architecture

4.9k
views
gate20141
coandarchitecture
machineinstructions
instructionformat
numericalanswers
normal
2
answers
21
GATE199115,b
(b) Consider the following first order formula: ... Does it have finite models? Is it satisfiable? If so, give a countable model for it.
commented
Apr 7
in
Mathematical Logic

1.4k
views
gate1991
firstorderlogic
descriptive
2
answers
22
self doubt
difference between empty language and empty string
answered
Apr 6
in
Theory of Computation

38
views
theoryofcomputation
0
answers
23
DDA Direct Recruitment 2019  Asst. System Director
Which of the following gives the predicate logic representation of the sentence Ram was a man ? Ram $\rightarrow$ man $\forall x:$ Ram (x) $\rightarrow$ man (x) Man (Ram) Man $\rightarrow$ Ram I have marked option ... I want to raise an objection to this answer. Kindly provide a reliable source which confirms the correct answer for this question.
commented
Apr 5
in
Mathematical Logic

60
views
propositionallogic
discretemathematics
1
answer
24
Memory Access Doubt
How many memory accesses are there in this code? LOAD R1, a(RO)
commented
Apr 4
in
CO & Architecture

58
views
effectivememoryaccess
coandarchitecture
0
answers
25
GATE 2019 Admission
@arjunsir @pragyAgrawal Is the career suggestion link in gate college predictor working? I haven't received any mail regarding the same. I have 64.33/100 marks and 737/1000 score. My rank is 498 in General category. Please suggest which colleges I should focus on. How do I gauge which colleges I can get?
commented
Mar 30
in
Written Exam

256
views
admissions
gettingtoiits
usergate2019
usermod
iit
iisc
1
answer
26
gate admission
What should i prefer for mtech? iiitb or iit hyd?
commented
Mar 27
in
IISc/IITs

108
views
admissions
iit
iiit
gettingtoiits
0
answers
27
Gate2020
Can anyone please suggest me what is the best youtube video lecture series on C programming for gate.
commented
Mar 24
in
GATE Application

85
views
#selfdoubt
3
answers
28
GATE19991.1
Suppose that the expectation of a random variable $X$ is $5$. Which of the following statements is true? There is a sample point at which $X$ has the value $5$. There is a sample point at which $X$ has value greater than $5$. There is a sample point at which $X$ has a value greater than equal to $5$. None of the above
commented
Mar 23
in
Probability

2.1k
views
gate1999
probability
expectation
easy
0
answers
29
Good questions on operating system
I have solved previous year questions of gate. Various test series have ill formed questions related to memory management . I am looking for some good questions on the operating system ( especially memory management) For example Some foreign university assignment questions, nptel questions .etc
commented
Mar 23
in
Operating System

54
views
operatingsystem
2
answers
30
GATE20012.18
Consider the following three C functions: $[P1]$ int *g(void) { int x = 10; return (&x); } $[P2]$ int *g(void) { int *px; *px = 10; return px; } $[P3]$ int *g(void) { int *px; px = (int*) malloc (sizeof(int)); *px = 10; return px; } Which of the above three functions are likely to cause problems with pointers? Only $P3$ Only $P1$ and $P3$ Only $P1$ and $P2$ $P1, P2$ and $P3$
commented
Mar 23
in
Programming

4.7k
views
gate2001
programming
programminginc
normal
2
answers
31
GATE201920
An array of $25$ distinct elements is to be sorted using quicksort. Assume that the pivot element is chosen uniformly at random. The probability that the pivot element gets placed in the worst possible location in the first round of partitioning (rounded off to $2$ decimal places) is ________
commented
Mar 19
in
Algorithms

2.6k
views
gate2019
numericalanswers
algorithms
quicksort
probability
2
answers
32
Which one of the following statements is correct regarding the elements and subsets of the set
answer selected
Mar 19
in
Linear Algebra

573
views
linearalgebra
0
answers
33
I want to buy go pdf hardcopy for gate 2020,how can i get that
commented
Mar 19
in
Others

62
views
1
answer
34
#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

79
views
1
answer
35
Set Theory Self Doubt
Is the subset of a countably infinite set countable?
answered
Mar 19
in
Set Theory & Algebra

27
views
0
answers
36
Self thought
We know that Regular languages are decidable under membership property and lets say $L$ is such a regular language. From Chomsky hierarchy we know that $\text{Regular languages}$ $\subset$ $\text{Recursively Enumerable Languages}$. Lets say there are two persons $A$ ... how can we conclude that $M$ will halt after processing $L$ or will not halt at all. Please explain with reason?
commented
Mar 17
in
Theory of Computation

35
views
theoryofcomputation
6
answers
37
GATE20191
A certain processor uses a fully associative cache of size $16$ kB, The cache block size is $16$ bytes. Assume that the main memory is byte addressable and uses a $32$bit address. How many bits are required for the Tag and the Index fields respectively in the addresses generated by the processor? $24$ bits and $0$ bits $28$ bits and $4$ bits $24$ bits and $4$ bits $28$ bits and $0$ bits
answer edited
Mar 17
in
CO & Architecture

3.1k
views
gate2019
coandarchitecture
cachememory
0
answers
38
Preparation help for GATE 2020
I'm in MCA 2nd year want to preparing for GATE 2020 ,but I've to attend classes and in the side of programming i don't know any technology or competitive programming i also want to pursue these two things too(In case I'll fail in GATE, as a ... for job) should i pursue CP or learn new technologies or leave them for GATE.? Please help me I'm in dilemma. Thank You.
commented
Mar 17
in
GATE

57
views
preparation
gatepreparation
examstress
college
2
answers
39
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
0
answers
40
Andrew S. Tanenbaum Edition 5th Exercise 5 Question 6 (Page No. 490)
Consider the network of Figure. Distance vector routing is used, and the following vectors have just come in to router C: from B: (5, 0, 8, 12, 6, 2); from D: (16, 12, 6, 0, 9, 10); and from E: (7, 6, 3, 9, 0 ... , and E, are 6, 3, and 5, respectively. What is C's new routing table? Give both the outgoing line to use and the cost.
reopened
Mar 16
in
Computer Networks

20
views
computernetworks
tanenbaum
datalinklayer
distancevectorrouting
50,049
questions
53,194
answers
184,531
comments
70,402
users