Recent questions tagged ace-test-series

1
1 vote
2
R(A,B,C) is a relation.Which of the following don't have dependency preserving BCNF decomposition? A->B, B->C A->B,B->C,C->A AB->C,C->A None of these
3
4
How many $2$ state DFA’s with the designated initial state can be constructed over the alphabet over the alphabet $\sum = \{a, b\}$ that accept universal language? $4$ $16$ $20$ $24$
5
Given the following schema: employees(emp-id, first-name, last-name, hire-date, dept-id, salary) departments(dept-id, dept-name, manager-id, location-id) You want to display the last names and hire dates of all latest hires in their respective departments in the ... of a pairwise comparison. $3.$It executes but does not give the correct result. $4.$It executes and gives the correct result.
6
Consider the following ORACLE relations: One (x, y) = {<2, 5>, <1, 6>, <1, 6>, <1, 6>, <4, 8>, <4, 8>} Two (x, y) = {<2, 55>, <1, 1>, <4, 4>, <1, 6>, <4, 8>, <4, 8>, <9, 9>, <1, 6>} Consider the following two ... SQ2: SELECT * FROM One EXCEPT ALL (SELECT * FROM Two); For each of the SQL queries, what is the cardinality (number of rows) of the result obtained when applied to the instances above ?
7
Consider two relations R1 , R2 with N1 and N2 tuples where N2 > N1 > 0, what are the minimum and maximum rows for the RA expression R2/R1 ?
8
Consider a system having $10$ IO bound jobs and $1$ CPU bound job.. If IO bound job issue an IO request once for every ms of CPU computation and that each IO request takes $10$ ms. If context switch overhead is $0.1$ ms.Using round -robin scheduling with a time quantum of $10$ ms. , the CPU efficiency is __________________
9
Let $A=\left \{ 1,2,3 \right \}$. Number of relation on $A$ which are neither reflexive, nor irreflexive but symmetric is ___________ Ans given 48 but I got 8 Please verify
10
Consider a disk with an average seek time of $4$ ms. Motor speed 15000RPM 512B sector 500 sector per track A file occupies all of the sectors on $5$ tracks Each track reading requires average seek time and average rotational delay What will be transfer time of $1$ track?
1 vote
11
void find(int x){ static int i=10,y=0; y=y+i; for(i;i>0;i=i-10){ if(x!=0) find(x-1); else{ printf("%d",y); } } } What will be output printed for find(4)?
12
1 vote
13
14
1 vote
15
Time complexity of Prim's algorithm for computing minimum cost spanning tree for a complete graph with n vertices and e edges using Heap data structure is- 1. (n+e)*log^2n 2. n^2 3. n^2*logn 4. n*logn
16
1 vote
17
1 vote
18
1 vote
19
1 vote
20
21
1 vote
22
1 vote
23
24
25
1 vote
26
Consider the following CFG. S → aSa|bSb|a|b Number of conflicts in LR(0) State Diagram? 2 8 10 4
1 vote