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
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 Tahoora
User Tahoora
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Tahoora
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
GATE2006IT36
The majority function is a Boolean function $f(x, y, z)$ that takes the value 1 whenever a majority of the variables $x, y, z$ are 1. In the circuit diagram for the majority function shown below, the logic gates for the boxes labeled P and Q are, respectively, XOR, AND XOR, XOR OR, OR OR, AND
commented
6 hours
ago
in
Digital Logic

522
views
gate2006it
digitallogic
circuitoutput
normal
1
answer
2
virtualgate2015 OS
I don't think any of the options is right. What will be the answer?
commented
3 days
ago
in
Operating System

35
views
virtualgate
testseries
operatingsystem
processschedule
mutex
1
answer
3
virtualgate2015 OS
This is a numerical question so no options are given. What will be the answer?
commented
3 days
ago
in
Operating System

28
views
virtualgate
testseries
operatingsystem
processschedule
sjf
0
answers
4
virtualgate2015 OS
I think C is a more valid answer compared to A. Answer given is A. But the main purpose for User and Super User mode is so that User cannot access all memory/processor hence protection. Dualmode operation forms the basis for ... run in Kernal mode, but this will not provide protection, hence dual mode is used. As far my understanding goes.
asked
3 days
ago
in
Operating System

20
views
virtualgate
testseries
operatingsystem
1
answer
5
DFS based question
How many times 8 is pushed into stack ? a detail answer will be welcomed.
commented
4 days
ago
in
Programming

165
views
stack
graphtheory
dfs
0
answers
6
virtualgate2015 DS
What is the correct answer?
commented
4 days
ago
in
DS

25
views
virtualgate
testseries
datastructure
binarytree
trees
0
answers
7
virtualgate 2015 toc
Why is the answer D? How to solve it in simple way other than learning Rice Theorem? Does anyone know Rice thm in short?
asked
4 days
ago
in
Theory of Computation

14
views
virtualgate
testseries
decidability
regularlanguage
turingmachine
0
answers
8
virtualgate2015
Answe is B, but why is L2 not regular? How to solve it? For L2, y=x1/n I am not understanding why is this not right?
asked
4 days
ago
in
Theory of Computation

12
views
virtualgate
testseries
toc
regularlanguage
grammar
0
answers
9
virtualgate2015 toc
How can L(G) be regular? If we derive bSb > bAcAb, now we have Ab>b but we do not have the production bA since G is all production except last. So there is no production for A or bA. How can we go further?
asked
4 days
ago
in
Theory of Computation

12
views
virtualgate
testseries
contextsensitive
grammar
1
answer
10
geeksmocks2017
Four different pens (1, 2, 3, 4) are to be distributed at random in four pen stands marked as 1, 2, 3, 4. What is the probability that none of the pen occupies the place corresponding to its number ? a. 17/18 b. 3/8 c. 1/2 d. 5/8 How will we use the formula for derangements here? Using the direct formula of !n is giving wrong answer.
answer selected
5 days
ago
in
Numerical Ability

58
views
testseries
geekmock2017
probability
1
answer
11
GATE 2017
Are pnp problems in the syllabus for GATE 2017 ?
answered
5 days
ago
in
GATE

28
views
3
answers
12
GATE2011_21
Consider a hypothetical processor with an instruction of type $\text{LW R1 , 20(R2)}$, which during execution reads a 32bit word from memory and stores it in a 32bit register $\text{R1}$. The effective address of the ... operand in memory? (A) Immediate addressing (B) Register addressing (C) Register Indirect Scaled Addressing (D) Base Indexed Addressing
commented
5 days
ago
in
CO & Architecture

636
views
gate2011
co&architecture
addressingmodes
easy
1
answer
13
virtualgate2015 algorithm
I think all options are wrong
asked
5 days
ago
in
Algorithms

35
views
virtualgate
testseries
spanningtree
minimumspanningtrees
primsalgorithm
1
answer
14
virtualgate2015
*var2++=*var3++; How will this get evaluated? In general will *var be evaluated first, or will var++ be evaluated? The answer is A, I have run it on IDE but how is it evaluated?
answer selected
5 days
ago
in
Programming

45
views
virtualgate
programminginc
testseries
1
answer
15
Programming
answered
6 days
ago
in
Programming

48
views
0
answers
16
virtualgate2015
asked
6 days
ago
in
Programming

14
views
virtualgate
programminginc
testseries
1
answer
17
virtualgate2015
Number of records per block=512/50=10. Number of blocks for 3000 records will be 300. So 2ndary index will have 300 entries and entry size is 15B. So total size of 2ndary index=300*15=4500B. Total records in 1 block=512/15=34. So for 300 entries we have 300/34=9 blocks. Is this the right approch? I am not getting 89. How to solve this then?
answer selected
6 days
ago
in
Databases

28
views
virtualgate
indexing
#dbms#indexes
0
answers
18
c programming doubt virtualgate2015
asked
6 days
ago
in
Programming

20
views
virtualgate
programminginc
2
answers
19
GATE1993_12
The following Pascal program segments finds the largest number in a twodimensional integer array $A[0\dots n1, 0\dots n1]$ using a single loop. Fill up the boxes to complete the program and write against $\fbox{A}, \fbox{B}, \fbox{C} \text{ and } \fbox{D}$ in your ... i, j]>max then max:=A[i, j]; if C then j:=j+1; else begin j:=0; i:=D end end end
commented
Jan 9
in
Algorithms

179
views
gate1993
algorithms
arrays
normal
1
answer
20
GATE1997_17
An array A contains $n \geq 1$ positive integers in the locations $A[1], A[2], \dots A[n]$. The following program fragment prints the length of a shortest sequence of consecutive elements of $A$, $A[i], A[i+1], \dots,A[j]$ such that the sum of their values is $\ ... if(ji) < min then min:=ji; sum:=sum –A[i]; i:=i+1; end writeln (min +1); end.
commented
Jan 9
in
Algorithms

250
views
gate1997
algorithms
arrays
normal
0
answers
21
virtualgate
select * from R where B=R1.A this will select 3 rows (2,1) (3,2) and (4,2) right? If not these what will this query select? As far I know correlated queries work like nested for loop, so how will this work?
asked
Jan 9
in
Databases

13
views
virtualgate
sql
nestedquerywithcorrelation
2
answers
22
GATE200121
Consider a relation examinee (regno, name, score), where regno is the primary key to score is a real number. Write a relational algebra using $( \Pi, \sigma, \rho, \times)$ to find the list of names which appear more than ... specifies the center where an examinee appears. Write an SQL query to list the centr_code having an examinee of score greater than 80.
commented
Jan 9
in
Databases

222
views
gate2001
databases
sql
normal
descriptive
1
answer
23
GATE1998_1.10
Which of the following set can be recognized by a Deterministic Finite state Automaton? The numbers $1, 2, 4, 8, \dots 2^n, \dots$ written in binary The numbers $1, 2, 4, 8,\dots 2^n, \dots$ written in unary The set of binary string in which the number of zeros is the same as the number of ones. The set $\{1, 101, 11011, 1110111, \dots\}$
commented
Jan 8
in
Theory of Computation

336
views
gate1998
theoryofcomputation
finiteautomata
normal
2
answers
24
acetestseries
According to my understanding, there should be men and women both in the team. So we can do: 3M and 1W or 2M and 2W or 1M and 3W. So it will be: C(5,3)*C(5,1)+C(5,2)*C(5,2)+C(5,1)*C(5,3). But the answer given is 600. How is it possible?
answer selected
Jan 8
in
Probability

41
views
acetestseries
testseries
engineeringmathematics
combinatorics
counting
1
answer
25
acetestseries subjecttest
After taking A=0, I am getting x3+1=0 and not x31=0. Is it x3+1=0 or x31=0?
answer selected
Jan 7
in
Mathematical Logic

45
views
acetestseries
testseries
engineeringmathematics
linearalgebra
2
answers
26
TIFR2012A13
The maximum value of the function. $f\left(x, y, z\right)= \left(x  1 / 3\right)^{2}+ \left(y  1 / 3\right)^{2}+ \left(z  1 / 3\right)^{2}$ Subject to the constraints $x + y + z=1, x \geq 0, y \geq 0, z \geq 0$ is $1 / 3$ $2 / 3$ $1$ $4 / 3$ $4 / 9$
commented
Jan 2
in
Calculus

112
views
tifr2012
calculus
maximaminima
1
answer
27
TIFR2011A4
Consider the problem of maximizing $x^{2}2x+5$ such that $0< x< 2$. The value of $x$ at which the maximum is achieved is: 0.5 1 1.5 1.75 None of the above.
commented
Jan 2
in
Calculus

139
views
tifr2011
calculus
maximaminima
2
answers
28
GATE1991_03,viii
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: Consider the following Pascal function: Function X(M:integer):integer; Var i:integer; Begin i := 0; while i*i < M do i:= i+1 X := i end The function ... rfloor +1$ (c). $\lceil \sqrt N \rceil$ (d). $\lceil \sqrt N \rceil +1$ (e). None of the above
commented
Dec 15, 2016
in
Algorithms

254
views
gate1991
algorithms
easy
1
answer
29
ace operating system
Answer given is B, but I think it should be D. Stack will pop the least recently used page from the top. How can having most recently used page on top help in LRU implementation?
answer selected
Nov 30, 2016
in
Operating System

63
views
operatingsystem
paging
lru
pagereplacement
0
answers
30
ace database test series
Answer given is 4 tables: (Employee), (Monitors), (Project, Sponsors) and (Department). Is this answer right?
asked
Nov 24, 2016
in
Databases

39
views
testseries
acetestseries
databases
datadependencies
1
answer
31
ace database
What are the steps to be followed? I decomposed it as: (A,B,C), (A,I), (H,J), (B,D, E, F) and (A,D,G,H). In this too I don't think there is any violation of 3NF. But the answer is C, ie 6 tables. How is it 6? What steps will give me 6?
asked
Nov 24, 2016
in
Databases

34
views
databases
acetestseries
testseries
decomposition
0
answers
32
ace database
How to solve this? Do we have to make all possible super keys and then count the unique keys(I did it that way and I am getting 15)? In the solution set it is given: 23 + 23 + 23  22  21  22 +21. How did this come from?
asked
Nov 24, 2016
in
Databases

21
views
databases
acetestseries
testseries
candidatekeys
decomposition
1
answer
33
ace computer network
1st seq number is 1093, 2ns seq is 1094, ... 1460th seq number will be 2552. So the ack number sent by the reciever will be 2552+1=2553. Is this right? Answer in solution given is 2554.
commented
Nov 24, 2016
in
Computer Networks

59
views
acetestseries
computernetworks
tcp
1
answer
34
Sorting
Which of the following sorting algorithm can sort at runtime? 1). Heapsort 2). Merge sort 3). Insertion Sort 4). Selection Sort This is a self made question. So many options many be correct.
commented
Nov 23, 2016
in
Algorithms

89
views
algorithms
sorting
0
answers
35
ace computer network
From Wikipedia: Reno: If three duplicate ACKs are received, Reno will perform a fast retransmit and skip the slow start phase by instead halving the congestion window (instead of setting it to 1 MSS like Tahoe), ... Recovery. https://en.wikipedia.org/wiki/TCP_congestion_control#TCP_Tahoe_and_Reno So with respect to this what should be the answer?
asked
Nov 23, 2016
in
Computer Networks

30
views
acetestseries
3
answers
36
GATE2007IT8
The following circuit implements a twoinput AND gate using two 21 multiplexers. What are the values of X1, X2, X3? X1 = b, X2 = 0, X3 = a X1 = b, X2 = 1, X3 = b X1 = a, X2 = b, X3 = 1 X1 = a, X2 = 0, X3 = b
commented
Nov 21, 2016
in
Digital Logic

296
views
gate2007it
digitallogic
normal
2
answers
37
GATE2011_43
An 8KB directmapped writeback cache is organized as multiple blocks, each size of 32bytes. The processor generates 32bit addresses. The cache controller contains the tag information for each cache block comprising of the following. 1 valid bit 1 modified bit As ... metadata (tags) for the cache? (A) 4864 bits (B) 6144 bits (C) 6656 bits (D) 5376 bits
commented
Nov 13, 2016
in
CO & Architecture

498
views
gate2011
co&architecture
cachememory
normal
2
answers
38
TIFR2011B26
Consider the following two scenarios in the dining philosophers problem: First a philosopher has to enter a room with the table that restricts the number of philosophers to four. There is no restriction on the number of philosophers entering the room. ... . Starvation is possible in (i). Deadlock is not possible in (ii). Starvation is not possible in (ii)
commented
Nov 9, 2016
in
Operating System

291
views
tifr2011
operatingsystem
processsynchronization
diningphilosopher
1
answer
39
GATE200735
In a lookahead carry generator, the carry generate function $G_i$ and the carry propagate function $P_i$ for inputs $A_i$ and $B_i$ are given by: $$P_i = A_i \oplus B_i \text{ and }G_i = A_iB_i$$ The expressions for the sum bit $S_i$ and the carry bit $C_{i ... adder with $S_3, S_2, S_1, S_0$ and $C_4$ as its outputs are respectively: 6, 3 10, 4 6, 4 10, 5
commented
Oct 27, 2016
in
Digital Logic

533
views
gate2007
digitallogic
normal
1
answer
40
What is the last date for filling online forms for IITB RA course?
asked
Mar 12, 2016
in
Others

135
views
iitbombay
researchassistant
18,813
questions
23,785
answers
51,449
comments
20,130
users