menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
User nilamd
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Interview experience at IIT Tirupati for MS program winter admission
IITH CSE interview M Tech RA Winter admission 2021
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.4k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.3k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent Blog Comments
Hi, could you please update us about the Mock...
Hi, just curious if there are any updates...
thanks himanshu2021. But I am asking for the page...
But IISc hasn't mentioned TCS as one of their...
@kiioo https://gateoverflow.in/blog/11426/jest-20...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Questions by nilamd
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
856
views
asymptotic-notations
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
3.1k
views
data-structures
binary-search-tree
2
votes
1
answer
3
Verify whether 4-3-1-1 code is self complementing or nt?
Please provide codes for 0-9 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..
Please provide codes for 0-9 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
726
views
number-representation
3
votes
2
answers
4
Limits
Please give the answer with full solution.
Please give the answer with full solution.
asked
Jan 5, 2016
in
Calculus
304
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?
For a length of string n,how many transactions will be there for acceptance of the string? O(n) O(n^2) O(nlogn) O(n^3)
asked
Dec 24, 2015
in
Theory of Computation
154
views
theory-of-computation
finite-automata
16
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$
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
2.2k
views
transactions
databases
...