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 smsubham
User smsubham
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User smsubham
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
answer
1
Self Doubt
From a group of 5 woman and 7 man we have to select a committee consisting of 2 woman and 3 men. Find the total number of ways to select such committed if (1 and 2 are a separate question) 1. Four man refuse to be in the same committee 2. 2 woman refuse to be in the same committee.
asked
Feb 8, 2019
in
Combinatory

81
views
counting
permutationandcombination
discretemathematic
discretemathematics
0
votes
0
answers
2
MadeEasy Test Series: Digital Logic  Prime Implicants
asked
Jan 8, 2019
in
Digital Logic

119
views
madeeasytestseries
digitallogic
primeimplicants
kmap
0
votes
0
answers
3
No of Minimal Expression
How many minimal expressions are possible?
asked
Jan 8, 2019
in
Digital Logic

44
views
digitallogic
primeimplicants
0
votes
0
answers
4
Avoiding pipeline Hazards
Please Confirm.
asked
Dec 27, 2018
in
CO and Architecture

125
views
pipelining
hazards
coandarchitecture
datahazards
datadependences
0
votes
0
answers
5
Conversion of multitape TM to single tape TM
asked
Dec 26, 2018
in
Theory of Computation

66
views
theoryofcomputation
turingmachine
0
votes
1
answer
6
S and L attributed Grammar
asked
Dec 26, 2018
in
Compiler Design

271
views
compilerdesign
syntaxdirectedtranslation
+2
votes
0
answers
7
Compiler Question
Which of the following is correct?
asked
Dec 15, 2018
in
Compiler Design

82
views
compilerdesign
syntaxdirectedtranslation
+1
vote
1
answer
8
Probability Question
Source: https://www.facebook.com/photo.php?fbid=10156888790977640&set=gm.2199432896992966&type=3&theater
asked
Dec 10, 2018
in
Probability

126
views
probability
engineeringmathematics
0
votes
0
answers
9
Test Series Question
What should be the answer?
asked
Dec 8, 2018
in
Operating System

65
views
operatingsystem
deadlock
0
votes
0
answers
10
Errors Detected in Semantic Phase with Examples
What are the Errors Detected in the Semantic Phase explain with Examples? Some I know is type checking (incorrect variable type), non existent variables. array subscripts out of range, what else?
asked
Dec 4, 2018
in
Operating System

51
views
compilerdesign
semanticanalysis
0
votes
1
answer
11
Ace Test Series: Operating System  Semaphores
Is this correct? Counting Semaphore can be implemented using a binary semaphore and normal machine instructions.
asked
Dec 3, 2018
in
Operating System

161
views
operatingsystem
processsynchronization
acetestseries
0
votes
0
answers
12
Serializable
asked
Nov 13, 2018
in
Databases

111
views
databases
transactions
view_serializable
conflictserializable
0
votes
1
answer
13
Regular Language and Ambiguity
For every regular grammar, we can always have an unambigious grammar?
asked
Oct 29, 2018
in
Theory of Computation

104
views
theoryofcomputation
finiteautomata
regularlanguages
inherentlyambiguous
0
votes
0
answers
14
ER Diagram Minimum Tables Needed
asked
Sep 19, 2018
in
Databases

132
views
databases
ertorelational
erdiagram
+2
votes
1
answer
15
Countable and Uncountable Self Doubt 2
Which of the following is always correct? A. Cross product of two countable set is countable B. Cross product of two countable set is uncountable C. Cross product of two uncountable set is countable D. Cross product of uncountable ... E. Cross product of uncountable and countable set is countable F. Cross product of uncountable and countable set is uncountable
asked
Sep 11, 2018
in
Set Theory & Algebra

119
views
theoryofcomputation
countableuncountableset
settheory&algebra
+2
votes
0
answers
16
Countable and uncountable Self Doubt 1
which of the following is always correct? A. Union of two uncountable set is uncountable B. The intersection of two uncountable set is uncountable C. Union of two uncountable set is countable D. The intersection of two uncountable set is ... is countable I. The complement of a countable set is countable. J. The complement of a countable set is uncountable.
asked
Sep 11, 2018
in
Set Theory & Algebra

61
views
countableuncountableset
theoryofcomputation
settheory&algebra
0
votes
1
answer
17
minimum number of NOR gates
What is the minimum number of NOR gates required to implement this boolean function? A'B + A'CDB + AC'B + ABC Also how many NAND gates required? Confirm answer am getting zero.
asked
Sep 8, 2018
in
Digital Logic

622
views
digitallogic
booleanalgebra
minnogates
0
votes
0
answers
18
Notation Meaning
This is $(\ log \ n) ^{2} ?$ = (log(n))×(log(n)) What about this? $\log ^{2} n ?$ Is it same as $\log log \ n ?$
asked
Aug 15, 2018
in
Algorithms

41
views
+1
vote
1
answer
19
EPI Question
asked
Aug 11, 2018
in
Digital Logic

201
views
digitallogic
0
votes
3
answers
20
Time Complexity
What is the time complexity of the following? for(i=0; i < n *n ; i = i *i) print("*");
asked
Aug 9, 2018
in
Algorithms

107
views
timecomplexity
algorithms
asymptoticnotations
+1
vote
1
answer
21
Self Doubt
Which if the following are correct? (Multiple Possible) A ExNOR (BC) = (A ExNOR B) (A ExNOR C) A ExOR (B + C) = (A ExOR B) + (A ExOR C) A ExNOR (B + C) = (A ExNOR B) + (A ExNOR C) None of These
asked
Aug 8, 2018
in
Digital Logic

113
views
digitallogic
booleanalgebra
+1
vote
1
answer
22
Number of States in FA
Can number of states in minimized DFA be less than number of states than minimal NFA from which it is converted?
asked
Apr 8, 2018
in
Theory of Computation

212
views
theoryofcomputation
minimalstateautomata
finiteautomata
numberofstates
+1
vote
0
answers
23
Worst Case in NFA to DFA Conversion
Can you give an example of NFA which has n states and its corresponding DFA has 2^n states?
asked
Apr 8, 2018
in
Theory of Computation

196
views
theoryofcomputation
nfadfa
finiteautomata
numberofstates
+1
vote
0
answers
24
Number System Interconversion
Can all the values in decimal be finitely represented in binary, hexadecimal and octal system and vice versa? I know 0.2 cannot be converted to the binary form which has a finite representation. Any other such number which cannot be converted from one of the number systems to other?
asked
Apr 5, 2018
in
Digital Logic

161
views
numberrepresentation
digitallogic
0
votes
1
answer
25
Attribute Grammar
Can someone explain these terms clearly these terms with examples? Attribute Grammar Synthesized attributes Inherited attributes L and S Attributes
asked
Apr 5, 2018
in
Compiler Design

101
views
compilerdesign
grammar
0
votes
0
answers
26
compiler
If we increase the number of lookahead in LL, LR, SLR,LALR, CLR grammar will its expressive power increase and what is the reason for that?
asked
Apr 4, 2018
in
Compiler Design

128
views
compilerdesign
parsing
ll1parser
0
votes
1
answer
27
LL(n)
LL(1) parser cannot accept nondeterministic grammar at we have only single lookahead and there can be no predictable parsing in this case. Suppose we have LL(n) and we are given that maximum length of nondeterminism in a production is n  1. Can we use this grammar for LL(n) predictive parsing?
asked
Apr 4, 2018
in
Compiler Design

282
views
compilerdesign
ll1
parsing
lrparser
grammar
0
votes
0
answers
28
Recurrence
When T(n) = a T(n/b) + f(n) If on solving we get g(n) as upper bound solution for the recurrence. Is f(n) = O( g(n) ) always correct?
asked
Apr 3, 2018
in
Algorithms

121
views
recurrence
timecomplexity
algorithms
asymptoticnotations
+2
votes
1
answer
29
Programming in C
How many asterisks (*) in terms of k will be printed by the following C function, when called as count(m) where m = 3k? Justify your answer. Assume that 4 bytes are used to store an integer in C and k is such that 3k can be stored in 4 bytes. void count(int n) { printf("*"); if(n>1) { count(n/3); count(n/3); count(n/3); } }
asked
Feb 13, 2018
in
Programming

88
views
programminginc
isipcb2015sample
+3
votes
2
answers
30
MADE EASY TEST SERIES
Assume that X and Y are the only two stations on an Ethernet. Each has a steady queue of frames to send. Both X and Y attempt to transmit a frame, they wait to get the control of channel using binary exponential algorithm. The probability that both ... fifth round of the algorithm (assuming every time both X and Y will collide in backoff race till 4th round) is ________.
asked
Jan 25, 2018
in
Computer Networks

169
views
csmacd
ethernet
computernetworks
Page:
1
2
next »
50,737
questions
57,275
answers
198,154
comments
104,819
users