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 abhishek1995_cse
User abhishek1995_cse
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User abhishek1995_cse
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
0
answers
1
DataStructure
is hashing there in gate 2019 syllabus?
asked
Dec 9, 2018
in
DS

72
views
datastructure
hashing
0
votes
0
answers
2
Gate previous years
Q1. https://gateoverflow.in/3375/gate2008it64 Q2. https://gateoverflow.in/8481/gate2015328 In Q1 the rtt is doubled while calculating but in Q2 rtt is not doubled. why ? .
asked
Dec 3, 2018
in
Computer Networks

156
views
#cn
0
votes
0
answers
3
Ace Book
asked
Oct 28, 2018
in
Theory of Computation

73
views
contextfreelanguage
regularlanguages
theoryofcomputation
turingmachine
0
votes
1
answer
4
Ace book
The minimal finite automata accepting the set of all strings over {0,1} starting with a 1 that interpreted as the binary representation of an integer are congruent to 0 modulo 5 has ______ states. The ans is 7 but according to me modulo n has 5 states .?
asked
Oct 22, 2018
in
Theory of Computation

116
views
contextfreelanguage
regularlanguages
theoryofcomputation
0
votes
1
answer
5
Acebook
The minimal finite automata accepting the strings in r=0*1* has ________ states? for DFA its 3 states and for NFA its 2 states which one should i go with?
asked
Oct 21, 2018
in
Theory of Computation

70
views
finiteautomata
regularexpressions
0
votes
0
answers
6
Ace Book
The complement of the language L containing an equal number of a's , b's and c's is a)regular b)context free c)context sensitive but not context free d)recursive and not a CFL
asked
Oct 21, 2018
in
Theory of Computation

49
views
contextfreelanguage
pushdownautomata
contextsensitive
0
votes
1
answer
7
Acebook
Consider the following code: cobeginend X=2; co begin X=X+3; X=X+1; co end The final possible values of 'X' are: a)3,5 b)3,4,5 c)3,5,6 d)5,3,2
asked
Oct 18, 2018
in
Operating System

62
views
processsynchronization
0
votes
1
answer
8
AceBook
Consider the machine with 64 MB Physical Memory and a 34 bit Virtual Address Space. If the page size is 4KB, the appropriate sizes of conventional and inverted page table sizes are: a) 4M, 4K b)4K, 4M c)4M, 16K d)16K, 4M. soln: is Option C. but my ans is (7MB, 28KB)
asked
Oct 16, 2018
in
Operating System

113
views
memorymanagement
paging
virtualmemory
0
votes
0
answers
9
MadeEasy Test Series: Computer Networks  Distance Vector Routing
asked
Oct 16, 2018
in
Computer Networks

83
views
computernetworks
distancevectorrouting
madeeasytestseries
0
votes
1
answer
10
Test Series
asked
Oct 16, 2018
in
Computer Networks

40
views
0
votes
0
answers
11
Acebook
For a page size of 200 words, what is the page number and offset for a logical address of 1142. a)5,142 b)2,142 c)6,142 d)7,140
asked
Oct 12, 2018
in
Operating System

44
views
memorymanagement
0
votes
1
answer
12
Ace bookFILESYSTEM
The UNIX Inode contains 8direct disk block addresses, a single indirect and a double indirect entry for a disk block of size 2KB and 16 bit disk block addresses, the maximum file size supported will be: a) 2.0 G b)2.01 M c)2.018 M d) 2.018 G
asked
Oct 9, 2018
in
Operating System

69
views
operatingsystem
filesystem
+1
vote
1
answer
13
Process Management
Q.Consider the processes P1, P2, P3, P4 whose arrival times are 0, 1, 2, 3 and Burst times are 5, 2, 13, 7. If the Context Switching time is 1 unit (ms), what is the average waiting time if Shortest Job Next scheduling algorithm is used? (a) 7.5 (b) 6.25 (c) 6.5 (d) None
asked
Oct 5, 2018
in
Operating System

89
views
operatingsystem
contextswitch
memorymanagement
0
votes
0
answers
14
Dekkers Algorithm
Is Dekkers Algorithm in syllabus?
asked
Oct 3, 2018
in
Operating System

42
views
0
votes
1
answer
15
MadeEasy Test Series: Computer Networks  Congestion Control
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 1 MSS and the threshold at the start is 1st transmission is 16 MSS. Assume TCP use over a lossy link i.e. ... is the congestion window size at the end of 14 RTT (in MSS)? A) 9 B) 11 C) 12 D) 14
asked
Sep 29, 2018
in
Computer Networks

99
views
computernetworks
congestioncontrol
madeeasytestseries
+1
vote
0
answers
16
Computer Network
In IPV6 what are the Headers i need to learn. And do i have to remember the fields present in Unicast, Multicast, Geography unicast addess?
asked
Sep 20, 2018
in
Computer Networks

47
views
ipv6
0
votes
0
answers
17
ACE BITS AND BYTES
asked
Aug 25, 2018
in
Mathematical Logic

104
views
0
votes
0
answers
18
ACE BITS AND BYTES
asked
Aug 25, 2018
in
Mathematical Logic

27
views
0
votes
1
answer
19
Is Fork ,System calls and Threads are there in syllabus?
asked
Aug 23, 2018
in
Operating System

115
views
0
votes
1
answer
20
ACE Bits and bYtes
Minimum no of edges necessary in a simple graph with 10 vertices to ensure connectivity is_______.
asked
Jul 24, 2018
in
Graph Theory

191
views
graphtheory
graphconnectivity
+1
vote
1
answer
21
ACE Bits And Bytes
Number of perfect matching in Wn (n>=4 and n is even) _________.
asked
Jul 24, 2018
in
Graph Theory

109
views
graphtheory
graphmatching
gate2019
50,650
questions
56,192
answers
193,988
comments
94,862
users