Dark Mode

Recent questions tagged ace-test-series

0 votes

1 answer

61

ace test series
number of 3 state dfa with designated initial stat can be constructed over the alphabet {0,1,2} with exactly 2 final states is a)3^8 b)3^9 c)3^10 d)3^11

Vivo asked in Theory of Computation Oct 5, 2021

by Vivo

327 views

1 vote

1 answer

62

ACE Test series: Database

ushamya asked in Databases Jun 7, 2019

961 views

1 vote

3 answers

63

ACE Test Series : dependency preserving
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

ushamya asked in Databases Jun 3, 2019

929 views

3 votes

1 answer

64

ace academy test series toc turing machine

hitesh159 asked in Theory of Computation May 28, 2019

869 views

3 votes

3 answers

65

Ace Test Series: Theory Of Computation - Finite Automata
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$

Hirak asked in Theory of Computation May 22, 2019

by Hirak

1.4k views

1 vote

1 answer

66

Ace Test Series: Databases-Sql Query
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 ... pairwise comparison. $3.$It executes but does not give the correct result. $4.$It executes and gives the correct result.

Priyansh Singh asked in Databases Mar 29, 2019

by Priyansh Singh

698 views

1 vote

1 answer

67

DBMS, Test Series
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, ... 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 ?

Priyansh Singh asked in Databases Mar 28, 2019

by Priyansh Singh

383 views

0 votes

2 answers

68

Dbms, relational algebra.
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 ?

Priyansh Singh asked in Databases Mar 27, 2019

by Priyansh Singh

1.6k views

2 votes

1 answer

69

Ace Test Series: Operating System - CPU Scheduling
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 __________________

srestha asked in Operating System Mar 11, 2019

784 views

0 votes

1 answer

70

Ace Test Series: Set Theory & Algebra - Relations
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

srestha asked in Set Theory & Algebra Mar 7, 2019

867 views

0 votes

1 answer

71

Ace Test Series: Operating System - Disks
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?

srestha asked in Operating System Mar 7, 2019

567 views

1 vote

0 answers

72

ACE test Series: Programming and DS-Programming
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)?

srestha asked in Programming in C Mar 6, 2019

788 views

0 votes

1 answer

73

Ace Subject Test : Computer Networks - Fragmentation

Na462 asked in Computer Networks Feb 2, 2019

by Na462

711 views

3 votes

1 answer

74

Ace Test Series: Operating System - Fork()

Na462 asked in Operating System Feb 2, 2019

by Na462

2.3k views

0 votes

1 answer

75

Ace Test Series: Probability - Uniform Distribution

Na462 asked in Probability Feb 2, 2019

by Na462

923 views

1 vote

0 answers

76

Ace Test Series: Algorithms - Prims Algorithm Time Complexity
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

Psnjit asked in Algorithms Jan 29, 2019

by Psnjit

334 views

0 votes

1 answer

77

Ace Test Series: CO & Architecture - Secondary Memory
Consider a disk containing 10 equidistance tracks, the inner track capacity is 20 MB and diameter is 1 cm;

chirudeepnamini asked in CO and Architecture Jan 28, 2019

by chirudeepnamini

466 views

3 votes

1 answer

78

Ace Test Series: DBMS - File Indexing

Na462 asked in Databases Jan 26, 2019

by Na462

1.9k views

1 vote

1 answer

79

Ace Test Series: Compilers - Parsers

Na462 asked in Compiler Design Jan 26, 2019

by Na462

1.4k views

1 vote

1 answer

80

Ace Test Series: Compilers - Parser

Na462 asked in Compiler Design Jan 26, 2019

by Na462

387 views

0 votes

3 answers

81

Ace test series question on number of spanning trees possible

Shankar Kakde asked in Algorithms Jan 24, 2019

by Shankar Kakde

970 views

0 votes

1 answer

82

ACE Test series Question on CFG

Shankar Kakde asked in Compiler Design Jan 24, 2019

by Shankar Kakde

640 views

1 vote

2 answers

83

Ace Test Series: Digital Logic - Combinational Circuit & Minimization

Shankar Kakde asked in Digital Logic Jan 24, 2019

by Shankar Kakde

657 views

0 votes

1 answer

84

naveen bhatt asked in Compiler Design Jan 24, 2019

by naveen bhatt

449 views

0 votes

1 answer

85

Ace Test Series: Theory Of Computation - Decidablity

Shankar Kakde asked in Theory of Computation Jan 23, 2019

by Shankar Kakde

401 views

0 votes

1 answer

86

Ace Test Series: Compiler Design - Left Recursion Elimination

Shankar Kakde asked in Compiler Design Jan 23, 2019

by Shankar Kakde

1.6k views

3 votes

1 answer

87

Ace Test Series: Operating System - Deadlock

Na462 asked in Operating System Jan 21, 2019

by Na462

689 views

0 votes

2 answers

88

Ace Test Series: Operating System - TLB Effective Access Time

Na462 asked in Operating System Jan 21, 2019

by Na462

1.1k views

3 votes

4 answers

89

Ace Test Series: Operating System - Reader Writer Problem

Na462 asked in Operating System Jan 21, 2019

by Na462

1.9k views

1 vote

0 answers

90

Ace Test Series: Compiler - Parser Conflicts
Consider the following CFG. S → aSa|bSb|a|b Number of conflicts in LR(0) State Diagram? 2 8 10 4

Na462 asked in Compiler Design Jan 21, 2019

by Na462

1.1k views

Page:

« prev
1
2
3
4
5
6
7
8
...
16
next »

Recent questions tagged ace-test-series