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
Questions by Abhisek Tiwari 4
User Abhisek Tiwari 4
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Abhisek Tiwari 4
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
–1
vote
0
answers
1
GradeUp COA
If a processor has 64 address lines and 8 data lines. Then find maximum number of opcodes generated by processor. a)6 b)9 c)3 d)8
asked
Feb 24, 2019
in
CO and Architecture

157
views
coandarchitecture
badquestion
0
votes
0
answers
2
DataStructureDeQueue
Suppose a dequeue is stored in a circular array with N memory cells. At which of the following condition is the dequeue is full? (i) LEFT = N and RIGHT = 1 (ii) LEFT = RIGHT + 1 (iii) LEFT = 1 and RIGHT = N (iv) LEFT = RIGHT  1 + N (i) and (iii) (iii) and (iv) (ii) and (iii) (i) and (iv)
asked
Feb 24, 2019
in
DS

531
views
–1
vote
0
answers
3
ME_FLT
Mod X counter then X=? Nothing mentioned about J0,K0,J1,K1 ,J2,K2 how should i approach such Q? considering all 0?
asked
Jan 25, 2019
in
Digital Logic

39
views
0
votes
0
answers
4
MadeEasyFLT
Ouput please explain 2nd and 3rd Output.
asked
Jan 25, 2019
in
Programming

61
views
0
votes
0
answers
5
MadeEasyFLT
In ipv4 and Ipv6 fragmented Datagrams are reassembled only at Destination. is it False?
asked
Jan 25, 2019
in
Computer Networks

39
views
0
votes
0
answers
6
SelfDoubt
A graph with each vertex has even degree contain Hamiltonian Cycle. True/False plz explain how to ensure Hamiltonian Cycle.
asked
Jan 25, 2019
in
Graph Theory

58
views
0
votes
0
answers
7
TocSelfDoubt
L={ XWX^r  x belongs to (0,1)+ ,W belongs to (0,1)*} it will be regular i.e can be reduced to form start and end with same symbol. but if domain of x==(0,1)* will still be regular?? i think no it will be DCFL
asked
Jan 24, 2019
in
Theory of Computation

28
views
0
votes
0
answers
8
COA_Doubt
can anyone plz provide ref for delay in Direct Mapping,Set Associative and Associative mapping in terms of mux and comparator delay!
asked
Jan 23, 2019
in
CO and Architecture

23
views
0
votes
1
answer
9
MadeEasy
A cyclic group O(G)=200 g be its generator O(g^x)=100 for some x.what is value of x? a.1 b.2 c.3 d.4 1 and 3 cant be possible as [order of generator equal to order of group] how to choose bw 2 and 4???
asked
Jan 21, 2019
in
Set Theory & Algebra

36
views
0
votes
1
answer
10
SelfDoubt
True/False SJF and SRTF both suffer from Convoy effect. please tell reason.
asked
Jan 21, 2019
in
Operating System

85
views
0
votes
0
answers
11
SelfDoubt
Checking for Euler Path i.A graph has Euler path if exactly two vertices is of odd degree. if a graph have euler circuit=>all vertices even degree=>euler circuit which already cover euler path. am i correct? i is necessary and sufficient condition? So for ... check either 1.Euler Circuit or 2.Exactly two odd degree then it will have euler path but not euler circuit. is it correct?
asked
Jan 20, 2019
in
Graph Theory

46
views
0
votes
0
answers
12
Self DoubtDb2
1.Rigorous 2PL avoid cascading rollback but suffer from deadlock. 2.Strict,Rigorous,Conservative all are Conflict Serilizable. True?
asked
Jan 19, 2019
in
Databases

26
views
0
votes
0
answers
13
self doubt
Lost Update Problem: Ti W(A) then no read on A(there might be other operation) then Tj W(A) =====>lost update(WW) am i correct? or if consecutive two write on same data by Ti then Tj.???
asked
Jan 19, 2019
in
Databases

14
views
0
votes
0
answers
14
MathsDoubt
1.”Maximal and Minimal element is unique in case of Bounded Lattice” [This is necessary condition not sufficient.] i.e Upper bound =Maximal and Lower bound =Minimal for Bounded lattice. 2.Upper bound and lower bound in Bounded lattice is unique. am i correct???
asked
Jan 17, 2019
in
Set Theory & Algebra

56
views
0
votes
0
answers
15
Virtual Gate
if a language is recognized by Non deterministic Polynomial time TM then L is recognized by Deterministic polynomial time TM
asked
Jan 17, 2019
in
Theory of Computation

29
views
0
votes
1
answer
16
DFA_VG
Number of state in DFA accepting a language L={anbn,1<= n <=3 } over {a,b} ……..
asked
Jan 17, 2019
in
Theory of Computation

38
views
0
votes
0
answers
17
selfDoubt
1. 0(000)*0(000)* == 00(000)* is it equal how?
asked
Jan 17, 2019
in
Theory of Computation

28
views
0
votes
1
answer
18
MadeEasyTest
6 stage pipeline without any branch prediction pipeline cycle time is 4ns used to execute program segment with 20 instruction (i1 to i20) i5 is unconditional TOC instruction which transfer the control to i18.Pipeline target address is available in 4th stage then Program execution time is …..
asked
Jan 16, 2019
in
CO and Architecture

54
views
0
votes
0
answers
19
SelfDoubtDl
True/False and plz exp A cyclic K Map have exactly two minimal expression.
asked
Jan 14, 2019
in
Digital Logic

37
views
0
votes
0
answers
20
Self Doubt::Covering Function
A func of n variable having k minterms total no of covering Function?? f covers g >>i.e for all time when g=1 ,f is also 1 Expression f>g or gf ?
asked
Jan 14, 2019
in
Digital Logic

34
views
0
votes
0
answers
21
Digital Logic
which of the following expression represent the overflow condition in signed airithmetic? 1.XYZ+X’Y’Z’ 2.X’YZ’+XYZ’ 3.X’Y’Z+XYZ’ 4.XY’Z’ +X’Y’Z
asked
Jan 14, 2019
in
Digital Logic

91
views
0
votes
0
answers
22
programming
Ouput #include<Stdio.h> int main() { int a=10; a=a+ ~a; printf(“%d”,a); } PS:i m getting 15 but 15 is nt ans.
asked
Jan 14, 2019
in
Programming

67
views
0
votes
0
answers
23
Computer Architec
True or False! Tag field is ratio of Main memory to cache memory. i.e MM size =2^m unit and Cache size =2^n unit the tag field will be of (mn) size.
asked
Jan 14, 2019
in
CO and Architecture

19
views
0
votes
0
answers
24
virtual gate
https://gateoverflow.in/285669/testseries?show=292883#c292883
asked
Jan 11, 2019
in
Algorithms

38
views
0
votes
0
answers
25
Time complexity1
Insertion sort using binary search instead of linear serach 1.Worst case Time O(n*n) 2.Best Case Time O(n) 3.Average case O(n*n) am i correct?
asked
Jan 11, 2019
in
Algorithms

26
views
+1
vote
1
answer
26
ME TOC
$L={ [(0)^n)]^m  n<m;n>=1}$ 1.Regular 2.DCFL 3.CFL 4.CSL
asked
Jan 7, 2019
in
Theory of Computation

73
views
0
votes
0
answers
27
Self DoubtOS
How to ensure Starvation There exist atleast one possible case when Starvation may occur >» Starvation or There does not exist a single case which is deadlock free>>>Starvation. I think First one is Correct way to check???
asked
Jan 5, 2019
in
Operating System

21
views
0
votes
0
answers
28
MEasy
R is real no(does not contain 1) ,S is subset of R then (S,*) 1.not group but monoid 2.not abelian group but group 3.Abelian Group 4.not semigroup but groupid
asked
Jan 5, 2019
in
Set Theory & Algebra

21
views
0
votes
0
answers
29
ME!logic
A.Tautology B.Satisfiable C.Contradiction D.None after simplification i m getting Vz[T] =There exist z[F] what can conclude from this in above option please verify
asked
Jan 5, 2019
in
Mathematical Logic

18
views
0
votes
0
answers
30
Computer Org and A1
Total: n instruction Total conditional statement probability :p and True condition probability:q i)Branch is known at end of t satge Effective CPI = [npq*(t+1) + (nnpq)*1)]/n OR ii) Penality is t stall cycle same i.e Effective CPI = [npq*(t+1) + (nnpq)*1)]/n OR iii) Effective CPI= 1+ stall freq*stall penality =1+pq*t am i correct???
asked
Jan 5, 2019
in
CO and Architecture

18
views
Page:
1
2
3
next »
50,741
questions
57,245
answers
198,020
comments
104,614
users