Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by sanyam53
1
votes
0
answers
1
compiler-design parsing no of states
The number of states in SLR parser for G is _______. for this type of question , Do we consider augmented entry state like S'->S. ????
The number of states in SLR parser for G is _______.for this type of question , Do we consider augmented entry state like S'->S. ????
650
views
asked
Feb 3, 2017
Compiler Design
compiler-design
parsing
+
–
3
votes
2
answers
2
DBMS Normalisation
Consider a schema R(A, B, C, D) and functional dependencies {AB → C, C → D, D→ A}. Then the decomposition of R into R1 (CD), R2 (AC) and R3 (BC) is in a. 1NF but not 2NF b. 2NF but not 3NF c. 3NF but not BCNF d. BCNF
Consider a schema R(A, B, C, D) and functional dependencies {AB → C, C → D, D→ A}. Then the decomposition of R into R1 (CD), R2 (AC) and R3 (BC) is ina. 1NF but not...
896
views
asked
Jan 11, 2017
Databases
databases
decomposition
database-normalization
+
–
0
votes
2
answers
3
OS Semaphore
1.0k
views
asked
Jan 10, 2017
Operating System
operating-system
semaphore
test-series
+
–
1
votes
1
answer
4
Doubt OS - Round Robin- Context Switch
How many time context switch in Round Robin? ( if only one process remain in ready queue at end of scheduling does that count every time, when time slice over or only one time?)
How many time context switch in Round Robin? ( if only one process remain in ready queue at end of scheduling does that count every time, when time slice over or only one...
1.7k
views
asked
Jan 7, 2017
Operating System
context-switch
operating-system
process-scheduling
round-robin-scheduling
+
–
2
votes
1
answer
5
graph theory
Assumed undirected graph G is connected. G has 6vertices and 10 edges. Find the minimum number of edges whose deletion from graph G is always guarantee that it will become disconnected.
Assumed undirected graph G is connected. G has 6vertices and 10 edges. Findthe minimum number of edges whose deletion from graph G is always guaranteethat ...
996
views
asked
Jan 3, 2017
Graph Theory
graph-theory
graph-connectivity
discrete-mathematics
+
–
4
votes
1
answer
6
test series counting
The number of pairs of set (X, Y) are there that satisfy the condition X, Y ⊆ {1, 2, 3, 4, 5, 6} and X ∩ Y = Φ ________.
The number of pairs of set (X, Y) are there that satisfy the condition X, Y ⊆ {1, 2, 3,4, 5, 6} and X ∩ Y = Φ ________.
742
views
asked
Jan 3, 2017
Combinatory
counting
combinatory
+
–
0
votes
1
answer
7
Test series
Can any one answer that ravula test series are good or not? , because made easy is horrible.
Can any one answer that ravula test series are good or not? , because made easy is horrible.
360
views
asked
Jan 3, 2017
Study Resources
test-series
+
–
0
votes
1
answer
8
Made easy #counting
Consider a bitstring of length 10 containing only 0 and 1. The number of string contain 3 consicutive 0’s or 3 consicutive 1’s are ________
Consider a bitstring of length 10 containing only 0 and 1. The number of stringcontain 3 consicutive 0’s or 3 consicutive 1’s are ________
527
views
asked
Jan 3, 2017
Quantitative Aptitude
made-easy-test-series
counting
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register