Register
Filter

Questions by spriti1991

0 votes
1 answer
1
Data model
In a database , the specification of data where individual data item of same type can have different sets of attribute a) True b) false
In a database , the specification of data where individual data item of same type can have different sets of attribute a) True b) false
0 votes
2 answers
2
Pointers
Now I suppose if i have a statement like *P++ then it is broken down as first (P++) and then *p (because both are unary operator and associtivity is right to left ) and if we have statement like a=*p++ then it is broken down into a=*p and then p is incremented !! Am i right ?
Now I suppose if i have a statement like *P++ then it is broken down as first (P++) and then *p (because both are unary operator and associtivity is right to left ) and ...
0 votes
3 answers
3
Asymptotic Notation
Describe a Θ(nlgn)-time algorithm that, given a set S of n integers and another integer x, determines whether or not there exists two elements of S whose sum is exactly x.
Describe a Θ(nlgn)-time algorithm that, given a set S of n integers and another integer x, determines whether or not there exists two elements of S whose sum is exactly ...
0 votes
1 answer
4
DATA STRUCTURES
Suppose we are comparing implementations of insetion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n^2 steps, while merge sort runs in 64nlgn steps. For which values of n does insertion sort beat merge sort?
Suppose we are comparing implementations of insetion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n^2 steps, while merge sort ru...
1 votes
1 answer
8
SQl query
Consider the relation Customers (custid, name , address , city , state , introducer) List all the customers who have introduced at least one other customer 1) Select distinct e.name from Customer e, Customer F where f.introducer =e.ename 2) Select distinct e.name from Customer e, Customer F where f.introducer <>e.name
Consider the relation Customers (custid, name , address , city , state , introducer)List all the customers who have introduced at least one other customer1) Select distin...
11 votes
3 answers
9
Conflict Equivalent
Consider the following ordering S of transaction T1:R(X),W(Y), T2:R(X),W(Y);T3:R(X),W(Y). how many schedules if any are conflict equivalent to S? 1) 3 2) 5 c) 15 d) 30
Consider the following ordering S of transaction T1:R(X),W(Y), T2:R(X),W(Y);T3:R(X),W(Y). how many schedules if any are conflict equivalent to S?1) 32) 5c) 15d) 30
1 votes
2 answers
10
Concurrency Problems
T1 T2 R(A) R(A) R(B) R(B) W(A) COMMIT R(A) W(A) COMMIT in the above problem identify the concurrency in the following Schedule involving 2 Transaction T1 AND T2 (r: read and w : write ) a) Dirty Read problem b) Unrepeatable Read problem c) Lost update Problem d) Both a and b
T1T2R(A) R(A) R(B) R(B) W(A) COMMIT R(A) W(A) COMMIT in the above problem identify the concurrency in the following Schedule involving 2 Transaction T1 AND T2 (r: r...
0 votes
2 answers
11
ACID PROPERTIES
ATOMICITY IS MANAGED BY a) Programmer b) Recovery Management Component c) Concurrency Control Component d) None of it
ATOMICITY IS MANAGED BY a) Programmerb) Recovery Management Component c) Concurrency Control Componentd) None of it
0 votes
1 answer
12
Combinational Circuits
0 votes
2 answers
13
Decoder
Which of following statement is true ? S1. Any boolean function can be realized using decoder s2. One multiplexer can realize 1 function at a time a) S1 is true b) S2 is true 3) Both are true d) none of them
Which of following statement is true ?S1. Any boolean function can be realized using decoders2. One multiplexer can realize 1 function at a timea) S1 is trueb) S2 is true...
0 votes
1 answer
16
BCD Adder
A decimal parallel adder that add n decimal digits needs how many BCD adder stages 1. n 2. 2n 3. 1 4 n^2
A decimal parallel adder that add n decimal digits needs how many BCD adder stages1. n 2. 2n3. 14 n^2
0 votes
1 answer
17
Three state Buffer
I am just reading that Microperations from Morris mano They have explained the concept of 3 state gate which can be used as a multiplexer which have output 1, 0 and high Impedance. what is used of it (I am not getting )
I am just reading that Microperations from Morris mano They have explained the concept of 3 state gate which can be used as a multiplexer which have output 1, 0 and high ...
2 votes
1 answer
18
normalization
Can you explain me this : A table is in second normal form if every attribute is determined by every candidate key , but is not determined by any pure subset of Candidate key ? True or false
Can you explain me this :A table is in second normal form if every attribute is determined by every candidate key , but is not determined by any pure subset of Candidate ...
6 votes
1 answer
19
normalization
Let R(ABCDE) be a relational schema and F ={AB->CD, ABC->E,C->E} BE A SET OF FUNCTIONAL dependencies. WHAT IS highest normal of R ? 1NF 2NF 3NF BCNF
Let R(ABCDE) be a relational schema and F ={AB->CD, ABC->E,C->E} BE A SET OF FUNCTIONAL dependencies. WHAT IS highest normal of R ?1NF 2NF3NFBCNF
6 votes
4 answers
20
normalization
Consider the relation R(ABCD) with FD's set F={ AB->CD,C->.A,D->B} which of the following is false ? 1.C->A is a partial Dependency 2.C->A is a transitive Dependency 3.D->B IS A Partial dependency 4. All of these
Consider the relation R(ABCD) with FD's set F={ AB->CD,C->.A,D->B}which of the following is false ?1.C->A is a partial Dependency2.C->A is a transitive Dependency3.D->B I...
Page: