Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
dhingrak
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by dhingrak
0
votes
2
answers
1
Index
S1 is true and S3 is False as secondary index is dense...Please explain whether S2 is true or false
S1 is true and S3 is False as secondary index is dense...Please explain whether S2 is true or false
446
views
asked
Jan 27, 2015
1
votes
1
answer
2
Direct Mapped Cache
893
views
asked
Jan 27, 2015
0
votes
2
answers
3
C Programming
352
views
asked
Jan 25, 2015
0
votes
1
answer
4
Thomas Write Rule
2.9k
views
asked
Jan 23, 2015
0
votes
2
answers
5
Disk Scheduling algorithm
Which scheduling algorithm is optimum among the following disk scheduling algorithm in most of cases? a)FCFS b)SSTF c)SCAN d)LOOK Also please give reason
Which scheduling algorithm is optimum among the following disk scheduling algorithm in most of cases?a)FCFSb)SSTFc)SCANd)LOOKAlso please give reason
2.6k
views
asked
Jan 22, 2015
0
votes
2
answers
6
Semaphore
What is value of binary semaphore "S" after executing 10 P (Wait) operations and 14 V (Signal) operations if the initial value of "S" is 1 ?
What is value of binary semaphore "S" after executing 10 P (Wait) operations and 14 V (Signal) operations if the initial value of "S" is 1 ?
2.2k
views
asked
Jan 22, 2015
0
votes
1
answer
7
Transactions
To check whether a given schedule is serializable or not , do we need to check only for conflict serializability or both conflict serializability and view serializability ..?
To check whether a given schedule is serializable or not , do we need to check only for conflict serializability or both conflict serializability and view serializabil...
2.0k
views
asked
Jan 21, 2015
0
votes
3
answers
8
Master Theorem
When do we say that 2 functions are polynomially comparable for applying master theorem...? We can apply the theorem for T(n)=3T(n/4)+nlgn but cant apply it for T(n)=2T(n/2)+nlgn ...please explain..?
When do we say that 2 functions are polynomially comparable for applying master theorem...? We can apply the theorem for T(n)=3T(n/4)+nlgn but cant apply it for T(n)=2T(n...
849
views
asked
Jan 18, 2015
Algorithms
algorithms
master-theorem
recurrence-relation
time-complexity
+
–
0
votes
1
answer
9
Level 1 cache and level 2 cache
S1 is false ....but can any one plz explain about S2..?
S1 is false ....but can any one plz explain about S2..?
336
views
asked
Jan 16, 2015
0
votes
1
answer
10
DFA
Please explain..
Please explain..
323
views
asked
Jan 16, 2015
0
votes
1
answer
11
First order predicate logic
1.3k
views
asked
Jan 15, 2015
1
votes
1
answer
12
Pipelining
A 5 stage pipeline with the stages taking 1, 1, 3, 1, 1 units of time has throughput of (A) 1/3 (B) 1/7 (C) 1/5 (D) 1/6 Also please explain the answer
A 5 stage pipeline with the stages taking 1, 1, 3, 1, 1 units of time has throughput of(A) 1/3 (B) 1/7 (C) 1/5 (D) 1/6Also please explain the answer
5.2k
views
asked
Jan 15, 2015
0
votes
1
answer
13
Semaphore
314
views
asked
Jan 14, 2015
1
votes
2
answers
14
functions
Let $f:A\to B$ and $E$ and $F$ be subsets of $A$. Is below statement true or false? $S:f(E \cap F)= f(E) \cap f(F)$
Let $f:A\to B$ and $E$ and $F$ be subsets of $A$. Is below statement true or false?$S:f(E \cap F)= f(E) \cap f(F)$
551
views
asked
Jan 9, 2015
Set Theory & Algebra
functions
+
–
0
votes
1
answer
15
Pumping lemma
To check L={02i |i is an integer} is regular or not ....i applied pumping lemma as below...Can anyone please explain why i am not getting it as regular ? Let Z=02n= 0n-1 0n 01 Take u= 0n-1 , v=0n, w=01 So, u (v)i w can be written as 0n-1 (0n)i 0 ...Take i=0, we get 0n-1.0=0n but 0n dont belong to language as n may be odd.So i am not getting it as regular...
To check L={02i |i is an integer} is regular or not ....i applied pumping lemma as below...Can anyone please explain why i am not getting it as regular ?Let Z=02n= 0n-1 0...
2.4k
views
asked
Jan 7, 2015
Theory of Computation
theory-of-computation
pumping-lemma
+
–
0
votes
0
answers
16
Determinant
Let D denote the determinant of n*n matrix. If any line of the determinant is passed over m parallel lines which is true? a) The resultant determinant will change its sign. b) The resultant determinant will not change its sign. c) Data insufficient d) none Plz explain...
Let D denote the determinant of n*n matrix. If any line of the determinant is passed over m parallel lines which is true?a) The resultant determinant will change its sign...
434
views
asked
Jan 6, 2015
1
votes
2
answers
17
Prim's Algorithm
Which one of following statement is false about prim's algorithm? a) It use a running time of O(Elog2V) using binary heap b) It may use a binomial max-heap to represent the priority queue. c) A fibonacci heap imlementation require O(E+V log2V) d) Initially all keys of nodes in priority queue are set to infinity . The root's key is set to 0.
Which one of following statement is false about prim's algorithm?a) It use a running time of O(Elog2V) using binary heapb) It may use a binomial max-heap to represent the...
2.1k
views
asked
Jan 5, 2015
Algorithms
prims-algorithm
binary-heap
time-complexity
+
–
2
votes
2
answers
18
Lossless and dependency preserving decomposition
Consider relation R(A,B,C,D) and F={A->B, B->C, C->D, D->A} The decomposition of R into R1(AB), R2(BC) and R3(CD) is a) Lossless and dependency preserving b) Lossy but dependency ... d) Lossless but dependencies are not preserved. I am getting Lossless by applying algorithm but is this decomposition dependency preserving...?Plz explain
Consider relation R(A,B,C,D) and F={A->B, B->C, C->D, D->A}The decomposition of R into R1(AB), R2(BC) and R3(CD) isa) Lossless and dependency preservingb) Lossy but depen...
2.8k
views
asked
Jan 2, 2015
0
votes
2
answers
19
Number of candidate keys
Let R(ABCDE) be a relational schema and F={AB->CD, ABC->E,C->A}. The number of candidate keys are a) 1 b) 2 c) 3 d) 4 Is there some standard way to solve such problem.. or we have to consider each Functional Dependency...?Please explain...
Let R(ABCDE) be a relational schema and F={AB->CD, ABC->E,C->A}. The number of candidate keys are a) 1b) 2c) 3d) 4Is there some standard way to solve such problem.. or we...
3.3k
views
asked
Jan 2, 2015
0
votes
1
answer
20
fork() system call
Also please explain how many times "PROCESS" will be printed when we don't use fflush()...?
Also please explain how many times "PROCESS" will be printed when we don't use fflush()...?
1.8k
views
asked
Jan 1, 2015
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register