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 nilamd
User nilamd
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User nilamd
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
answer
1
f(n)=log n! ,g(n)=n logn what is the relationship between them?
asked
Jan 31, 2016
in
DS

482
views
asymptoticnotations
+5
votes
6
answers
2
What is the time complexity to construct binary search tree when inorder and postorder traversal of tree is given?
asked
Jan 19, 2016
in
DS

1.6k
views
datastructures
bst
+2
votes
1
answer
3
Verify whether 4311 code is self complementing or nt?
Please provide codes for 09 decimal using 4311 code..i am little bit confused in it..I know the property that addition 9 makes it self complemetory..but how m nt understanding..plz help..
asked
Jan 12, 2016
in
Digital Logic

474
views
numberrepresentation
+3
votes
2
answers
4
Limits
Please give the answer with full solution.
asked
Jan 5, 2016
in
Calculus

253
views
calculus
limits
+2
votes
0
answers
5
For a length of string n,how many transactions will be there for acceptance of the string?
asked
Dec 24, 2015
in
Theory of Computation

126
views
theoryofcomputation
finiteautomata
+15
votes
1
answer
6
How many recoverable schedules are possible from T1 and T2?
Consider the following Two Transactions. A) How many recoverable schedules can be formed over $T_{1}$ & $T_{2}$ ? $51$ $52$ $55$ $56$ B) How many cascadeless recoverable schedules can be formed over $T_{1}$ & $T_{2}$ ? $41$ $42$ $45$ $50$
asked
Dec 21, 2015
in
Databases

1.6k
views
transactions
databases
50,737
questions
57,324
answers
198,408
comments
105,173
users