Register
Filter

Questions by ankitgupta.1729

1 votes
1 answer
61
Normal Forms
0 votes
1 answer
62
ER Diagram
0 votes
1 answer
64
Referential Integrity
Consider the join of a relation R with a relation S. If R has 100 tuples and S has 9 tuples then the maximum and minimum sizes of the join respectively under referential integrity constraint:- (A) 9 and 0 (B) 9 and 9 (C) 9+100 and 0 (D) 9*100 and 9
Consider the join of a relation R with a relation S. If R has 100 tuples and S has 9 tuples then the maximum and minimum sizes of the join respectively under referential ...
0 votes
0 answers
65
Relational Algebra
3 votes
1 answer
66
Deadlock
0 votes
1 answer
67
Thrashing
Which of the following mechanism will helpful to reduce thrashing? a)Decreasing the degree of multiprogramming. b)Increasing the RAM size
Which of the following mechanism will helpful to reduce thrashing?a)Decreasing the degree of multiprogramming.b)Increasing the RAM size
0 votes
1 answer
68
Page Replacement
Consider a page reference string for a process with m frames. The length of the page reference string is p with n distinct page numbers occurring in it. For any page replacement algorithms, What is lower and upper bound on the number of page faults? (A) m, n (B) p, m (C) n, p
Consider a page reference string for a process with m frames. The length of the page reference string is p with n distinct page numbers occurring in it. For any page repl...
0 votes
0 answers
70
Process Synchronisation
Consider the following program: Const int n= 20 int Count= 0 Void GATE( ) { int i; for(i= 1 to n) Count= Count + 1; } Main ( ) { Par begin GATE( ); GATE( ); GATE( ); Par end } What is the minimum and maximum possible value of count after the completion of the program?
Consider the following program:Const int n= 20int Count= 0Void GATE( ){int i; for(i= 1 to n)Count= Count + 1;}Main ( ){Par beginGATE( );GATE( );GATE( );Par end}What is th...
2 votes
4 answers
71
fork()
1)Consider the following pseudo code: for(i=1;i<=4;i++) { fork(); printf("X"); } How many times “X” is printed? 2) Consider the following pseudo code: void main() { fork(); fork(); fork(); fork(); printf("X"); } How many times “X” is printed?
1)Consider the following pseudo code:for(i=1;i<=4;i++){fork();printf("X");}How many times “X” is printed?2) Consider the following pseudo code:void main(){fork();fork...
1 votes
4 answers
72
Threads
The primary difference between process and thread ? (A) The number of I/O requests mode. (B) The amount of overhead associated with creation and context switching . (C) The amount of memory allocation (D) The average number of instructions executed
The primary difference between process and thread ?(A) The number of I/O requests mode.(B) The amount of overhead associated with creation and context switching .(C) The ...
1 votes
0 answers
73
Eigen Vectors
0 votes
1 answer
74
Variance
There are two data sets,each of size 5. The variances of those sets are 4 and 5; means are 2 and 4 respectively. If the sets are combined, what would be variance of combined data? (A) 10/11 (B) 11/13 (C) 11/2 (D) 13/11
There are two data sets,each of size 5. The variances of those sets are 4 and 5; means are 2 and 4 respectively. If the sets are combined, what would be variance of combi...
0 votes
1 answer
75
Memory Access
In Numerical answer type questions, when we have to consider simultaneous memory access and when we have to use hierarchical memory access model? How to know it?
In Numerical answer type questions, when we have to consider simultaneous memory access and when we have to use hierarchical memory access model? How to know it?
1 votes
1 answer
76
Cyclic Group
Find all the subgroups of a cyclic group of order 12. (A) {e},(a6),(a4),(a3),(a2),(a) (B) (a12),(a6),(a4),(a3),(a2),(a) (C) (a12),(a6),(a4),(a2),(a) (D) (a12),(a6),(a4),(a3),(a2),(a),{e}
Find all the subgroups of a cyclic group of order 12.(A) {e},(a6),(a4),(a3),(a2),(a)(B) (a12),(a6),(a4),(a3),(a2),(a)(C) (a12),(a6),(a4),(a2),(a)(D) (a12),(a6),(a4),(a3),...
0 votes
0 answers
77
Non Abelian Group
Let G be a non-abelian group, order of G can be ? (A) 24 (B) 44 (C) 54 (D) 34
Let G be a non-abelian group, order of G can be ?(A) 24 (B) 44 (C) 54 (D) 34
0 votes
0 answers
78
Countable Set or not
How to know whether a enumeration method exist or not for a given set to prove it countable?? For example how to know that set of irrational numbers is countable or not..
How to know whether a enumeration method exist or not for a given set to prove it countable?? For example how to know that set of irrational numbers is countable or not.....
1 votes
0 answers
79
Multivalued Dependency
Can anyone please explain it ?
Can anyone please explain it ?
0 votes
0 answers
80
Multivalued Dependency
Can anyone please explain how to check Multivalued Dependency ?
Can anyone please explain how to check Multivalued Dependency ?
Page: