The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
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
Recent activity by Shashi Shekhar 1
User Shashi Shekhar 1
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Shashi Shekhar 1
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
3
answers
1
GATE201947
Suppose $Y$ is distributed uniformly in the open interval $(1,6)$. The probability that the polynomial $3x^2 +6xY+3Y+6$ has only real roots is (rounded off to $1$ decimal place) _______
commented
Dec 14, 2019
in
Probability

3.8k
views
gate2019
numericalanswers
engineeringmathematics
probability
uniformdistribution
2
answers
2
C PROGRAM
answered
Jul 24, 2019
in
Programming

47
views
0
answers
3
Admission query
Hii , can anyone tell me what specialization to choose between CSE and MATHEMATICS AND COMPUTING? which is best keeping in mind the government jobs like ISRO,AAI,BHSPCL ETC.
asked
Feb 28, 2019
in
GATE Application

63
views
10
answers
4
GATE201950
What is the minimum number of $2$input NOR gates required to implement a $4$ variable function expressed in sumofminterms form as $f=\Sigma(0,2,5,7, 8, 10, 13, 15)?$ Assume that all the inputs and their complements are available. Answer: _______
commented
Feb 22, 2019
in
Digital Logic

6.7k
views
gate2019
numericalanswers
digitallogic
canonicalnormalform
2
answers
5
NIELIT 201885
Evaluation of the given postfix expression $10 \: 10 + 60 \: 6/^*8$ is $192$ $190$ $110$ $92$
answered
Feb 15, 2019
in
Others

53
views
nielit2018
3
answers
6
Uniform probability distribution
X is uniformly distributed random variable that takes values between 0 and 1.The value of E(X^3) will be
answered
Feb 12, 2019
in
Probability

917
views
randomvariable
expectation
1
answer
7
#ComplierDesign #DragonsBook
For any contextfree grammar there is a parser that takes at most O (n$^3$ ) time to parse a string of n terminals. True or False?
commented
Feb 9, 2019
in
Compiler Design

102
views
compilerdesign
theoryofcomputation
3
answers
8
Ambiguous and unambiguous grammar
If a grammar( $CFG$ ) has more than one Right most derivation, Can it be called ambiguous ? Or we say a grammar is ambiguous only when it has more than one left most derivation ?
answered
Feb 9, 2019
in
Compiler Design

286
views
theoryofcomputation
contextfreelanguages
compilerdesign
4
answers
9
GATE2019GA2PI
answered
Feb 9, 2019
in
Verbal Ability

300
views
generalaptitude
verbalability
usergate2019
usermod
3
answers
10
GATE2004IT81
In a sliding window $ARQ$ scheme, the transmitter's window size is $N$ and the receiver's window size is $M$. The minimum number of distinct sequence numbers required to ensure correct operation of the $ARQ$ scheme is $min (M, N)$ $max (M, N)$ $M + N$ $MN$
answered
Feb 5, 2019
in
Computer Networks

2.9k
views
gate2004it
computernetworks
slidingwindow
normal
4
answers
11
GATE201951
A relational database contains two tables Student and Performance as shown below: ... Student S, Performance P WHERE P.Marks >84 GROUP BY S.Student_name; The number of rows returned by the above SQL query is ________
commented
Feb 4, 2019
in
Databases

4.7k
views
gate2019
numericalanswers
databases
sql
2
answers
12
Gate 2019
What is the for the question where two statements were given as: S1: matrix A is invertible S2:A=0?
answered
Feb 4, 2019
in
Set Theory & Algebra

307
views
0
answers
13
GO2019FLT140
You are working on a laptop connected to a $100 \text{Mbps}$ Ethernet LAN. You need a $2 \text{GB}$ file that is on the server in the same LAN. The entire file is also on your pen drive but you have left the pen drive in another ... to go and bring the pen drive, before the transfer on the LAN completes. Assume continuous data transmission on the LAN(no packetization required)).
commented
Jan 6, 2019
in
Computer Networks

320
views
go2019flt1
numericalanswers
ethernet
computernetworks
3
answers
14
UPPCL AE 2018:16
answered
Jan 6, 2019
in
Digital Logic

75
views
uppcl2018
1
answer
15
GO2019FLT135
Consider the following graph. How many paths of length $4$ exist from node $A$ to node $D$? (Note: The path may have repeated vertices. You can think of it as walks in general rather than path)
commented
Jan 6, 2019
in
Others

316
views
go2019flt1
numericalanswers
0
answers
16
Uppcl 2018
what could be the eigen values of a 2*2 Matrix if all its elements are intergers.
commented
Jan 3, 2019
in
Linear Algebra

79
views
1
answer
17
UPPCL 2018AE
Suppose when there is cache “Miss” then memory Access is 30ns and when cache “Hit” then memory access time is 3ns if 80% is cache hit then effective memory access 9ns 8.4ns 3ns 9.10ns
commented
Jan 2, 2019
in
CO and Architecture

137
views
0
answers
18
UPPCL 2018 AE
Which type of hazards mitigate by data forwarding war and waw both war only waw only none of above
commented
Jan 1, 2019
in
CO and Architecture

80
views
3
answers
19
GATE2007IT44, ISRO201534
A hard disk system has the following parameters : Number of tracks $= 500$ Number of sectors/track $= 100$ Number of bytes /sector $= 500$ Time taken by the head to move from one track to adjacent track $= 1 \ ms$ Rotation speed $= 600 \ rpm$. What is the average time taken for transferring $250$ bytes from the disk ? $300.5 \ ms$ $255.5 \ ms$ $255 \ ms$ $300 \ ms$
commented
Dec 24, 2018
in
Operating System

9k
views
gate2007it
operatingsystem
disks
normal
isro2015
6
answers
20
GATE200642
A CPU has a fivestage pipeline and runs at $1$ GHz frequency. Instruction fetch happens in the first stage of the pipeline. A conditional branch instruction computes the target address and evaluates the condition in the third stage of the pipeline. The processor stops fetching new instructions ... is: $\text{1.0 second}$ $\text{1.2 seconds}$ $\text{1.4 seconds}$ $\text{1.6 seconds}$
answered
Dec 22, 2018
in
CO and Architecture

6.9k
views
gate2006
coandarchitecture
pipelining
normal
1
answer
21
VIEW SERIALIZABILITY
As I know that if any schedule is conflict serializable then it must be view serializable but if not conflict serializability then check for blind write if not found then not view serializable if found then check from polygraph or If a schedule S is view ... then we have to make serial schedule by given schedule or what. please help if possible with help of diagram or example.
commented
Dec 20, 2018
in
Databases

824
views
0
answers
22
General query
Is there internal fragmentation in continuous dynamic partitioning ? After the processes have been allocated the partitions according to their size , there is no internal fragmentation , I agree but what if some processes have completed their execution and left leaving behind the ... which has size smaller than the hole , then will it create a new partion of its size from the hole?
asked
Dec 20, 2018
in
Operating System

21
views
4
answers
23
Can anyone explain the below question in a detailed way?
A Binary semaphore variable mutex is initialized to '1' and the various binary semaphore operations like 9P(), 14V(), 6P(), 8V(), 3P(), 2V() are performed, then what is the present(final) value of the binary semaphore mutex?
commented
Dec 18, 2018
in
Operating System

1.1k
views
semaphore
3
answers
24
GATE200354
Define languages $L_0$ and $L_1$ as follows : $L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\} $ $L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts on }w\}$ Here $\langle M, w, i \rangle$ is a triplet, whose first component ... $L'$ is not $L'$ is recursively enumerable, but $ L$ is not Both $L$ and $L'$ are recursive Neither $L$ nor $L'$ is recursively enumerable
commented
Dec 12, 2018
in
Theory of Computation

7.6k
views
theoryofcomputation
turingmachine
gate2003
difficult
0
answers
25
Aai it 2018
Minimum number of 2 input nor gates required for xy+z?
commented
Dec 11, 2018
in
Digital Logic

73
views
1
answer
26
Aai it 2018
Which of the following data structure is most suitable for radix sort? 1 .tree 2 . Linked list 3 . Stack 4 . Binary search tree
commented
Dec 11, 2018
in
Programming

131
views
0
answers
27
Aai 2018 it
commented
Dec 10, 2018
in
Graph Theory

93
views
2
answers
28
Aai it 2018
commented
Dec 10, 2018
in
Theory of Computation

93
views
2
answers
29
Aai it 2018
asked
Dec 10, 2018
in
Combinatory

140
views
1
answer
30
Aai it 2018
secondary indexing can not be defined on key attribute values? True or false.
asked
Dec 10, 2018
in
Databases

60
views
3
answers
31
GATE201332
Consider the following languages. $L_1 = \left \{ 0^p1^q0^r \mid p,q,r \geq 0 \right \}$ $L_2 = \left \{ 0^p1^q0^r \mid p,q,r \geq 0, p\neq r \right \}$ Which one of the following statements is FALSE? $L_2$ is contextfree. $L_1\cap L_2$ is contextfree. Complement of $L_2$ is recursive. Complement of $L_1$ is contextfree but not regular.
commented
Dec 9, 2018
in
Theory of Computation

4k
views
gate2013
theoryofcomputation
identifyclasslanguage
normal
1
answer
32
GATE201017
Let $L_1$ be the recursive language. Let $L_2$ and $L_3$ be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true? $L_2  L_1 \:\text{is recursively enumerable.}$ $L_1  L_3 \:\text{is recursively enumerable.}$ $L_2 \cap L_3 \:\text{is recursively enumerable.}$ $L_2 \cup L_3 \:\text{is recursively enumerable.}$
commented
Dec 7, 2018
in
Theory of Computation

4.3k
views
gate2010
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
decidability
normal
6
answers
33
GATE2016229
The value of the expression $13^{99}\pmod{17}$ in the range $0$ to $16$, is ________.
commented
Oct 18, 2018
in
Combinatory

7.1k
views
gate20162
modulararithmetic
normal
numericalanswers
9
answers
34
GATE199819b
Compute the post fix equivalent of the following expression $3^*\log(x+1)\frac{a}{2}$
commented
Sep 25, 2018
in
DS

3.6k
views
gate1998
stack
infixpostfix
2
answers
35
GATE200954
A subsequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences $X[m]$ and $Y[n]$ of lengths $m$ and $n$, respectively with indexes of $X$ and $Y$ starting from $0$. We wish to find the length of the longest ... of $L[M, N]$. $L[p, q]$ needs to be computed before $L[r, s]$ if either $p<r$ or $q < s$.
commented
Sep 17, 2018
in
Algorithms

4.1k
views
gate2009
normal
algorithms
dynamicprogramming
recursion
1
answer
36
Self doubt
minimum mod bimary up counter which counts {0,1,8,64}
commented
Sep 1, 2018
in
Digital Logic

76
views
2
answers
37
Self doubt, Automata theory
Suppose ∑* over {a,b,c} , whether it is regular or not ? If yes then will it contain this language or not { an . bn . cn  n > 0 } ? If yes then how is sigma* regular ? I am in great confusion plz help.
commented
Sep 1, 2018
in
Theory of Computation

44
views
regularlanguages
2
answers
38
GATE199202,xix
02. Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: (xix) Contextfree languages are: closed under union closed under complementation closed under intersection closed under Kleene closure
commented
Aug 30, 2018
in
Theory of Computation

936
views
gate1992
contextfreelanguages
theoryofcomputation
normal
1
answer
39
Gateforum Test Series: Algorithms  Sorting
. In the standard merge sort algorithm on a list of size n, what is the maximum number of times an item can be compared? a)2 b)logn c)n1 d)nlogn
answered
Aug 23, 2018
in
Algorithms

183
views
gateforumtestseries
algorithms
sorting
mergesort
2
answers
40
GATE201250
Consider the following relations $A, B$ and $C:$ ... $A$. $(A\cup B)\bowtie _{A.Id > 40 \vee C.Id < 15} C$ $7$ $4$ $5$ $9$
commented
Aug 21, 2018
in
Databases

7.2k
views
gate2012
databases
joins
normal
50,737
questions
57,275
answers
198,154
comments
104,822
users