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
Answers by target2017
User target2017
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User target2017
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+7
votes
1
GATE 2017 EC
Q1. Three indian and three chinese split into subgroups having atleast one indian. How many subgroups are possible?
answered
Feb 6, 2017
in
Numerical Ability

3.1k
views
numericalanswers
+5
votes
2
Combinations
How many number of 5 letter words that use letters from the 3 letter set {a,b,c} in which each letter occur atleast once?
answered
Feb 4, 2017
in
Mathematical Logic

617
views
permutationandcombination
+1
vote
3
Testbook
answered
Jan 17, 2017
in
Probability

102
views
+2
votes
4
COMPLEMENT OF CSL
answered
Jan 17, 2017
in
Theory of Computation

220
views
+3
votes
5
2's Comlement
Find the 2's complement pattern for – 113? (1) 0001111 (2) 00001111 (3) 10001111 (4) 1110001 Correct Answer: 3 Status: unattempted
answered
Jan 17, 2017
in
Digital Logic

117
views
+3
votes
6
Huffman Coding
What is the time complexity of Huffman coding using heap tree data structure ? a) O(n) b) O(n log n) c) O(log n) d) O(n2)
answered
Jan 16, 2017
in
Algorithms

809
views
huffmancode
algorithms
+5
votes
7
test book test
46 bit Virtual addressing system uses 3 level paging. The page table entry is 32 bits. Size of Page Table is equal to 1 page. The processor uses 1 MB, 16 way set associative cache with 64 block. What is the size of Page Table? a) 2KB b) 4KB c) 8KB d) 16KB
answered
Jan 15, 2017
in
Operating System

267
views
+1
vote
8
ace mock I
answered
Jan 15, 2017
in
Programming

49
views
0
votes
9
ace mock I
answered
Jan 15, 2017
in
Theory of Computation

42
views
0
votes
10
doubt
answered
Jan 11, 2017
in
Digital Logic

59
views
digitallogic
+4
votes
11
Virtual Gate Test Series: Programming & DS  Output Of The Program
What will be the output$?$ int main() { int varl = 35,*var2,*var3; var2 = &var1; //suppose the address of var1 is 1006 var3 = var2; *var2++ = *var3++; var1++; printf("var1 = %d var2 = %d var3 = %d ",var1,var2,var3); return 0; } 36 1010 1010 38 1006 1006 37 1006 1010 38 1010 1006
answered
Jan 10, 2017
in
Programming

149
views
programminginc
output
virtualgatetestseries
+3
votes
12
Minimum states in DFA
Number of final states in minimal DFA where $\sum = \{ a,b \}$ $L = \{ w n_a(w)mod\ 3 \geq n_b(w)mod\ 2\}$
answered
Jan 10, 2017
in
Theory of Computation

350
views
theoryofcomputation
minimalstateautomata
finiteautomata
0
votes
13
How Q1 and Q2 are Equal ?
Please Explain How Q1 and Q2 are equal using state Minimization Technique State Equivalance Algorithm Table Filling Algorithm a b Q1 Q2 Q1 Q2 Q1 Q2
answered
Jan 9, 2017
in
Theory of Computation

157
views
theoryofcomputation
+2
votes
14
Thomas Write Rule
Consider the following schedule: The possible values of P & Q for which the above schedule is allowed under Thomas write rule but not under basic timestamp ordering protocol if timestamp(T2 )>timestamp(T1 ) W(B),W(C) W(A),W(A) Both (a)&(b) None of these
answered
Jan 9, 2017
in
Databases

712
views
databases
0
votes
15
doubt
answered
Jan 8, 2017
in
Computer Networks

48
views
computernetworks
+1
vote
16
sheet
answered
Jan 8, 2017
in
Digital Logic

89
views
0
votes
17
doubt
Define init (L) = {set of all prefixes of L} Let L = {w  w has equal number of 0’s and 1’s}, Ʃ = {0,1} init (L) is: (a) all binary strings with unequal number of 0’s and 1’s (b) all binary strings with ԑstring (c) all binary strings with exactly 1 more 0’s than the number of 1’s or one more than number of 0’s (d) None of above
answered
Jan 8, 2017
in
Theory of Computation

73
views
theoryofcomputation
+1
vote
18
BCNF Decomposition
answered
Jan 8, 2017
in
Databases

696
views
databasenormalization
databases
bcnfdecomposition
+3
votes
19
doubt
If L is Turingrecognizable. Then (a) L and ̅L must be decidable. (b) L must be decidable but ̅ L need not be. (c) Either L is decidable or ̅ L is not Turing recognizable. (d) None of above.
answered
Jan 8, 2017
in
Theory of Computation

357
views
theoryofcomputation
0
votes
20
de tough ques
How many flip‐flop will be complemented in a 10‐bit binary ripple counter to reach the next count after the following counts? (a) *1001100111
answered
Jan 5, 2017
in
Digital Logic

663
views
+1
vote
21
critical section
getting A) given D)
answered
Jan 5, 2017
in
Operating System

99
views
+2
votes
22
complexity of function
answered
Dec 31, 2016
in
Algorithms

101
views
badquestion
+3
votes
23
GateForum Test Series.
$L_{1}=\{a^nb^mc^md^n  m,n \geq 1\} \\ L_{2}=\{0^p1^q\ p > q\geq 0\} \cup \{0^p1^q\ q > p\geq 0\} \\ L_{3} = L_1 \cup L_2 \\ L_{4} = L_1L_2 $ Then which of the following is necessarily CFL? $ A. L_{3} \cap L_{4} \\ B. \overline{L_{3} \cap L_{4}} \\ C.\overline L_3 \cap L_4 \\ D. L_3.L_4$
answered
Dec 17, 2016
in
Theory of Computation

303
views
theoryofcomputation
contextfreelanguages
closureproperty
+1
vote
24
Acknowledgement Number
The answer is given as 1060 since they have multiplied '5' by the scaling factor 4. Why to do it in this case? Its given 5B!!
answered
Dec 17, 2016
in
Computer Networks

176
views
+6
votes
25
Number of IPs
For Subnet Mask 255.255.255.192 & IP 200.1.2.3, the number of IP addresses wasted are __________.
answered
Dec 17, 2016
in
Computer Networks

167
views
+1
vote
26
ACE Test Series
answered
Dec 10, 2016
in
Computer Networks

114
views
testseries
computernetworks
0
votes
27
ip address
A network with a subnet mask_____,_____ subnets and in each subnet there are 32766 valid host address? A)255.255.128.0,2 B)255.255.128.0,512 C)255.255.0.0,1 D)A or B I am getting B but ans is A how plz explain?
answered
Dec 10, 2016
in
Computer Networks

188
views
+8
votes
28
Which of the following algorithm leads convoy effect?
Which of the following algorithm leads convoy effect? FCFS SJF Priority scheduling All of the above
answered
Dec 9, 2016
in
Operating System

1.1k
views
operatingsystem
+1
vote
29
find the cpu utilisation
Consider 4 processes P 0 , P 1 , P 2 and P 3 . Each process performs a single computation that requires CPU for T B milliseconds and then initiates a single I/O operation that lasts for T I/O ms.Operating System of the ... is negligible. The processes have following characteristics: Using Round Robin scheduling algorithm with Time quantum 25 ms. Find the % CPU utilization
answered
Dec 7, 2016
in
Operating System

136
views
operatingsystem
+1
vote
30
complement of prefix
answered
Dec 7, 2016
in
Theory of Computation

77
views
0
votes
31
Made easy
Doubt: Please clarify how option b is wrong.
answered
Dec 6, 2016
in
Theory of Computation

73
views
0
votes
32
Turing machine
answered
Dec 6, 2016
in
Theory of Computation

72
views
+1
vote
33
#toc#decidability
Someone explain... L1 ={a^p / p is prime} L2 ={a^p / p is odd} S1 : L1 ∪ L2 is regular S2 : Regular expression of L1 ∪ L2 is a(aa)* A) S1 is decidable(correct) S2 is undecidable(not correct) B) S1,S2 is decidable C) S1 , S2 is undecidable D) None
answered
Dec 6, 2016
in
Theory of Computation

67
views
+2
votes
34
SJF Next burst prediction
Please help me in understanding the followign formulae? Prediction of the Length of the Next CPU Burst Pn+1 = a tn +(1a)Pn This formula defines an exponential average Pn stores the past history tn contents are most recent information the parameter a ... a = 1 then Pn +1 = tn Prediction is last cpu burst I dont want to learn this.Please provide some logical explanation
answered
Dec 6, 2016
in
Operating System

490
views
sjf
cpuscheduling
0
votes
35
find the number of safe sequences
Consider the following system Find the total number of safe sequences?
answered
Dec 6, 2016
in
Operating System

293
views
operatingsystem
Page:
1
2
next »
50,737
questions
57,275
answers
198,154
comments
104,817
users