Register

Recent questions tagged ace-test-series

0 votes
1 answer
151
ACE algo test series
Ans given is option-B
Ans given is option-B
User Avatar
1 votes
1 answer
153
Algorithms::Ace academy test series question
Can anyone explain me the answer in detail?
Can anyone explain me the answer in detail?
User Avatar
1 votes
2 answers
154
Ace Test Series: Algorithms - Time Complexity Notation
If t(n) and s(n) denotes the time and space complexity of an algorithm with input size n element then which one of the following is always true? S(n)=O(t(n)) correct How???
If t(n) and s(n) denotes the time and space complexity of an algorithm with input size n element then which one of the following is always true?S(n)=O(t(n)) correct H...
User Avatar
1 votes
0 answers
156
Ace Test Series: Algorithms - Dynamic Programming OBST
Consider an OBST with n=4, p[1..4]={3,3,1,1} q[0..4]={2,3,1,1,1} Cost of OBST=___? Pls give the solution for this question.
Consider an OBST with n=4,p[1..4]={3,3,1,1} q[0..4]={2,3,1,1,1}Cost of OBST=___?Pls give the solution for this question.
User Avatar
0 votes
2 answers
157
Test Series
User Avatar
0 votes
2 answers
160
Ace Test Series: Operating System - General Concept
A ____ can be used to prevent a user program from never returning control to the operating system.
A ____ can be used to prevent a user program from never returning control to the operating system.
User Avatar
1 votes
1 answer
163
ace test series
Consider the following instance of OBST (Optimal Binary Search Tree) Problem. n=4;<a1,a2,a3,a4>=<do,if,int,while> P(1....4)=<3,3,1,1>; Q(0....4)=<2,3,1,1,1> The Cost of OBST(optimal binary search tree) is________
Consider the following instance of OBST (Optimal Binary Search Tree) Problem.n=4;<a1,a2,a3,a4>=<do,if,int,while>P(1....4)=<3,3,1,1>; Q(0....4)=<2,3,1,1,1>The Cost of OBS...
User Avatar
0 votes
1 answer
164
Ace algorithms
What is the time complexity? int i,j,k,x=0; for(i=1;i<=n;i++) for(j=1;j<=i*i;j++) { if (j mod i ==0) for(k=1;k<=j;k++) x=x+10; }
What is the time complexity?int i,j,k,x=0;for(i=1;i<=n;i++)for(j=1;j<=i*i;j++){if (j mod i ==0)for(k=1;k<=j;k++)x=x+10;}
User Avatar
3 votes
2 answers
165
Ace Test Series: Data Structures - Stack
Which of the following permutations can be obtained in the same order using a stack assuming that input is the sequence 5,6,7,8,9 in that order? A ) 7,8,9,5,6 B ) 5,9,6,7,8 C ) 7,8,9,6,5 D ) 9,8,7,5,6
Which of the following permutations can be obtained in the same order using a stack assuming that input is the sequence 5,6,7,8,9 in that order?A ) 7,8,9,5,6B ) 5,9,6,7,8...
User Avatar
1 votes
2 answers
172
Ace Question 10
User Avatar
2 votes
1 answer
175
Ace Test Series: DBMS - Indexing And File Organization
Here the indexing is done on ordered field so which to use Dense or Sparse because both can be done here ?
Here the indexing is done on ordered field so which to use Dense or Sparse because both can be done here ?
User Avatar
1 votes
1 answer
176
Ace Test Series: DBMS - B+ Trees And Indexing
Please Solve this question. I didn't understood the question properly so please Make Me as well :) What is meant by Leaf Page ?
Please Solve this question. I didn't understood the question properly so please Make Me as well :) What is meant by Leaf Page ?
User Avatar
0 votes
1 answer
177
Ace Test Series: DBMS - SQL Query Output
User Avatar
0 votes
1 answer
180
Ace Test Series: Programming & DS - Array
According to me Option D. Because it should be an error because *("INDIA" + 2 ) = 'D' and we are doing 'D' = 'I' which is not valid so Error ??? But answer is C
According to me Option D.Because it should be an error because *("INDIA" + 2 ) = 'D' and we are doing 'D' = 'I' which is not valid so Error ???But answer is C
User Avatar
Page: