Register

Recent questions tagged ace-test-series

1 votes
1 answer
304
Ace Test Series: Databases - Conflict Serializable
conflict serialization or not? $R1(A), R2(A),W2(A),commit_2,W1(A) ,commit_1$
conflict serialization or not?$R1(A), R2(A),W2(A),commit_2,W1(A) ,commit_1$
User Avatar
4 votes
1 answer
305
AceTest Series: Algorithms - Time Complexity
for (i=n ; i>0 ; i--) { for ( j=1;j<n ; j=j*2) { for ( k=0;k<j ;k++) { } } } time complexity ?? how to find of inner and innermost loop?
for (i=n ; i>0 ; i ) { for ( j=1;j<n ; j=j*2) { for ( k=0;k<j ;k++) { } } }time complexity ??how to find of inner and innermost loop?
User Avatar
2 votes
2 answers
306
Ace Test Series: Programming & DS - Programming
what will be the output: (a) 3 5 8 8 3 (b) 3 5 7 8 8 (c) compilation error
what will be the output:(a) 3 5 8 8 3 (b) 3 5 7 8 8 (c) compilation error
User Avatar
4 votes
4 answers
307
Ace Test Series: Algorithms - Sorting
Consider bottom-up merge sort working on 'n' elements. Assume 'n' is a power of 2. The minimum number of comparisons in order to get sorted list is (A) (n log n) / 2 (B) n lon n - n + 1 (C) n log n (D) n log n + n
Consider bottom-up merge sort working on 'n' elements. Assume 'n' is a power of 2. The minimum number of comparisons in order to get sorted list is(A) (n log n) / 2(B) n ...
User Avatar
0 votes
1 answer
309
Parsing_LR(1)Items
User Avatar
0 votes
1 answer
310
ace test
What is best time complexity to search element in sorted doubly linkedlist?? O(n) O(nlogn) O(log n) O(n2)
What is best time complexity to search element in sorted doubly linkedlist??O(n) O(nlogn) O(log n) O(n2)
User Avatar
2 votes
2 answers
311
ace test
The keys 7,3,11,13 are inserted into avl tree .what will be the the root once 12 is inserted into above AVL tree.
The keys 7,3,11,13 are inserted into avl tree .what will be the the root once 12 is inserted into above AVL tree.
User Avatar
0 votes
1 answer
312
ace test
is ans is D or C???
is ans is D or C???
User Avatar
1 votes
1 answer
313
ace test
What is cost of shortest path from S to T ? is any difference between when greedy method is used
What is cost of shortest path from S to T ?is any difference between when greedy method is used
User Avatar
0 votes
0 answers
315
which of the following is not in pcb?
state page table files open process id ..?
statepage tablefiles openprocess id ..?
User Avatar
2 votes
1 answer
316
digital logic 3
in a 6 bit ripple counter, the MOD of UP couting is 14 , the MOD of down counting is........?
in a 6 bit ripple counter, the MOD of UP couting is 14 , the MOD of down counting is........?
User Avatar
0 votes
1 answer
317
Ace Test Series: Compiler Design - Parsing
S -> Aa A -> Ab A -> c Which of the following item is present in LR(1) item with S' -> .S, $\$ ? A) A -> .Ab, $\$ B) A -> .c, $\$ C) A -> .Ab, a/b D) None
S - AaA - AbA - cWhich of the following item is present in LR(1) item with S' - .S, $\$$ ?A) A - .Ab, $\$$B) A - .c, $\$$C) A - .Ab, a/bD) None
User Avatar
2 votes
1 answer
321
LR(zero)
Options are as:- (a) i and ii (b) i and iii (c) ii and iii (d) none of the above
Options are as:-(a) i and ii (b) i and iii(c) ii and iii (d) none of the above
User Avatar
2 votes
2 answers
322
Ace Test Series: Databases - Functional Dependencies
Find what FD is violated by the Relation R = { } i.e. empty relation a. All FD b. Does not violate FD's c. Cannot say d. None of the Above
Find what FD is violated by the Relation R = { } i.e. empty relationa. All FDb. Does not violate FD'sc. Cannot sayd. None of the Above
User Avatar
0 votes
1 answer
324
Ace Test Series: Algorithms - Sorting
The tightest lower bound on the number of comparisons, in worst case for comparison based sorting is of the order of ? (A)$n$ (B)$n^2$ (C)$nlogn$ (D)$n \space{log\space n}^2$
The tightest lower bound on the number of comparisons, in worst case for comparison based sorting is of the order of ?(A)$n$(B)$n^2$(C)$nlogn$(D)$n \space{log\space n}^2$...
User Avatar
0 votes
0 answers
327
ACE test
How can this be true...? I guess answer is b
How can this be true...? I guess answer is b
User Avatar
0 votes
1 answer
328
Ace Test Series: Computer Networks - Ipv4
HEADER LENGTH SCALING FACTOR IS 4 .. SO WHY IS IT TAKING 5 AS A SCALING FACTOR..??
HEADER LENGTH SCALING FACTOR IS 4 .. SO WHY IS IT TAKING 5 AS A SCALING FACTOR..??
User Avatar
0 votes
1 answer
329
Ace Test Series: Programming & DS - Programming In C
#include<stdio.h> int main() { char *p; p = "%d\n"; p++; p++; printf(p-2, 400); return 0; } Output : 400 I ran this program and got 400 as output. But I don't understand why it is so?
#include<stdio.h>int main() { char *p; p = "%d\n"; p++; p++; printf(p-2, 400); return 0;}Output : 400I ran this program and got 400 as output. But I don...
User Avatar
Page: