The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
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 Sona Barman
User Sona Barman
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Sona Barman
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
1
answer
1
General Topic Doubt Set Theory & Algebra: Relations
How to check a relation is transitive or not from its matrix representation? Please help me with an example.
asked
Mar 8, 2019
in
Set Theory & Algebra

156
views
settheory&algebra
discretemathematics
relations
generaltopicdoubt
+1
vote
2
answers
2
Gradup topicwise question doubt
Identify the language generated by the following grammar: $S>AB$ $A>aAb\epsilon$ $B>bBb$ (A)$\{a^m b^nn≥m, m>0\}$ (B)$\{a^m b^nn≥m, m≥0\}$ (C)$\{a^m b^nn>m, m>0\}$ (D)$\{a^m b^nn>m, m≥0\}$ I select option C but it is wrong, correct answer is option D. I could not understand Gradup answer explanation.Please help me to rectify my fault.
asked
May 24, 2018
in
Theory of Computation

131
views
theoryofcomputation
language
of
grammar
+3
votes
3
answers
3
Made easy ots dbms 2 for gate2019
$T1:w(A);w(B);R(C);C;$ $T2:w(B);R(B);C$ The number schedule of $T1$ and $T2$ are recoverable ________.
asked
May 23, 2018
in
Databases

699
views
databases
recoverableschedule
+1
vote
2
answers
4
Gradup topicwise question
Consider the vales of bst $11,22,33,44,55,66,77,88$. Which of the following is a valid sequence of preorder traversal? $55,33,11,22,44,77,66,88$ $55,33,22,44,11,66,77,88$ $55,33,11,44,22,66,77,88$ $55,33,11,44,22,66,77,88$ Given answer is option A But how?
asked
May 22, 2018
in
Programming

417
views
datastructures
binarysearchtree
+2
votes
2
answers
5
Grade up topicwise questions
L1={a^n b^n c ^mm>=0 and n>=0} L2={a^m b^ n c^ nn>=0 and m>=0} If L3=L1UL2 then how many of L1,L2,L3 are context free languages? A)1 (B)2 (C)3 (D) none Answer given option C. Please explain?
asked
May 9, 2018
in
Theory of Computation

360
views
theoryofcomputation
contextfreelanguages
+4
votes
1
answer
6
MadeEasy Test Series 2019: Databases  Functional Dependencies
Consider a relation R(A,B,C,D,E) with following functional dependencies: A>BC C>E B>D E>A Total number of super key present in the relation are ______________. Given answer is 28. Please explain how?
asked
Apr 7, 2018
in
Databases

218
views
madeeasytestseries
databases
superkeys
databasenormalization
+3
votes
1
answer
7
LRU page replacement policy
Self doubt: What is the rule or keyb point we should keep in mind while solving problems on LRU page replacement algorithm? Please explain with examples.
asked
Jan 18, 2018
in
Operating System

158
views
operatingsystem
pagereplacement
lru
pagefault
+3
votes
2
answers
8
Calculation of number of states in dfa without drwing dfa
Self doubt: Is there any method to calculate number of states in dfa e.g."x mod y" type of question without drawing dfa? Because in Gate time is vital factor.
asked
Jan 15, 2018
in
Theory of Computation

333
views
theoryofcomputation
finiteautomata
numberofstates
+4
votes
3
answers
9
Total probability and Baye's theorem
When we should use Total probability and Baye's Theorem? Explain with examples.
asked
Jan 11, 2018
in
Probability

313
views
probability
engineeringmathematics
conditionalprobability
+3
votes
0
answers
10
Master theorem and extended Master theorem
I have doubt regarding Master theorem.In which situation we should use Normal Master theorem/extended Master theorem?
asked
Jan 8, 2018
in
Algorithms

791
views
algorithms
mastertheorem
timecomplexity
52,345
questions
60,506
answers
201,910
comments
95,341
users