menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
User Abhisek Tiwari 4
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
IIT Interview Experiences (Patna, Jodhpur and Hyd)
IIT Madras Direct PhD Interview Experience-July 2020
IIT Hyderabad M.Tech RA CSE Interview Experience-July 2020
IIT Hyderabad AI M.tech RA Interview Experience-July 2020
GATE 2021 BROCHURE
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.3k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.4k)
Theory of Computation
(6.2k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.5k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.4k)
Admissions
(595)
Exam Queries
(562)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1k)
Recent Blog Comments
it'll be automatic.
@gatecse Suppose if someone is the top user of...
Thanks for the clarification.
"Weekly Top User": It is only one person per...
gatecse Even my name is showing in the list of...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Questions by Abhisek Tiwari 4
–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
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
231
views
co-and-architecture
bad-question
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)
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
1.2k
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?
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
45
views
0
votes
0
answers
4
MadeEasyFLT
Ouput please explain 2nd and 3rd Output.
Ouput please explain 2nd and 3rd Output.
asked
Jan 25, 2019
in
Programming
82
views
0
votes
0
answers
5
MadeEasyFLT
In ipv4 and Ipv6 fragmented Datagrams are reassembled only at Destination. is it False?
In ipv4 and Ipv6 fragmented Datagrams are reassembled only at Destination. is it False?
asked
Jan 25, 2019
in
Computer Networks
49
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.
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
81
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
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
38
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!
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
40
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???
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
51
views
0
votes
1
answer
10
SelfDoubt
True/False SJF and SRTF both suffer from Convoy effect. please tell reason.
True/False SJF and SRTF both suffer from Convoy effect. please tell reason.
asked
Jan 21, 2019
in
Operating System
104
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?
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 checking Euler ... 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
71
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?
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
38
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.???
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
21
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???
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
84
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
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
67
views
0
votes
1
answer
16
DFA_VG
Number of state in DFA accepting a language L={anbn,1<= n <=3 } over {a,b} ……..
Number of state in DFA accepting a language L={anbn,1<= n <=3 } over {a,b} ……..
asked
Jan 17, 2019
in
Theory of Computation
57
views
0
votes
0
answers
17
selfDoubt
1. 0(000)*0(000)* == 00(000)* is it equal how?
1. 0(000)*0(000)* == 00(000)* is it equal how?
asked
Jan 17, 2019
in
Theory of Computation
33
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 (i-1 to i-20) i5 is unconditional TOC instruction which transfer the control to i-18.Pipeline target address is available in 4th stage then Program execution time is …..
6 stage pipeline without any branch prediction pipeline cycle time is 4ns used to execute program segment with 20 instruction (i-1 to i-20) i5 is unconditional TOC instruction which transfer the control to i-18.Pipeline target address is available in 4th stage then Program execution time is …..
asked
Jan 16, 2019
in
CO and Architecture
80
views
0
votes
0
answers
19
SelfDoubtDl
True/False and plz exp A cyclic K Map have exactly two minimal expression.
True/False and plz exp A cyclic K Map have exactly two minimal expression.
asked
Jan 14, 2019
in
Digital Logic
53
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 g----f ?
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 g----f ?
asked
Jan 14, 2019
in
Digital Logic
43
views
Page:
1
2
3
4
next »
...