How many different equivalence relations with exactly three different equivalence classes are there on a set with five elements? (A) 10 (B) 15 (C) 25 (D) 30

How many different equivalence relations with exactly three different equivalence classes are there on a set with five elements? (A) 10 (B) 15 (C) 25 (D) 30
by

1 Answer

Answer :

(C) 25
by

Related questions

Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has ................ equivalence classes. (A) 2 (B) 4 (C) 5 (D) 6

Description : Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has ................ equivalence classes. (A) 2 (B) 4 (C) 5 (D) 6

Last Answer : (D) 6

Equivalence partitioning is a .................. method that divides the input domain of a program into classes of data from which test cases can be derived. (A) White-box testing (B) Black-box testing (C) Orthogonal array testing (D) Stress testing

Description : Equivalence partitioning is a .................. method that divides the input domain of a program into classes of data from which test cases can be derived. (A) White-box testing (B) Black-box testing (C) Orthogonal array testing (D) Stress testing

Last Answer : (B) Black-box testing

Which of the following statement(s) is/are TRUE with regard to software testing? I. Regression testing technique ensures that the software product runs correctly after the changes during maintenance. II. Equivalence partitioning is a white-box testing technique that divides the input domain of a program into classes of data from which test cases can be derived. (1) only I (2) only II (3) both I and II (4) neither I nor II

Description : Which of the following statement(s) is/are TRUE with regard to software testing? I. Regression testing technique ensures that the software product runs correctly after the changes during maintenance. II. Equivalence partitioning is a ... (1) only I (2) only II (3) both I and II (4) neither I nor II

Last Answer : (1) only I 

f the temperature falls below 18 degrees, the heating is switched on. When the temperature reaches 21 degrees, the heating is switched off. What is the minimum set of test input values to cover all valid equivalence partitions? A. 15, 19 and 25 degrees B. 17, 18, 20 and 21 degrees C. 18, 20 and 22 degrees D. 16 and 26 degrees

Description : f the temperature falls below 18 degrees, the heating is switched on. When the temperature reaches 21 degrees, the heating is switched off. What is the minimum set of test input values to cover all valid equivalence ... 17, 18, 20 and 21 degrees C. 18, 20 and 22 degrees D. 16 and 26 degrees

Last Answer : A. 15, 19 and 25 degrees

Let R and S be two fuzzy relations defined as: Image Then, the resulting relation, T, which relates elements of universe x to elements of universe z using max-min composition is given by

Description : Let R and S be two fuzzy relations defined as: Then, the resulting relation, T, which relates elements of universe x to elements of universe z using max-min composition is given by

Last Answer : Answer: C

One weakness of boundary value analysis and equivalence partitioning is (A) they are not effective. (B) they do not explore combinations of input circumstances. (C) they explore combinations of input circumstances (D) none of the above

Description : One weakness of boundary value analysis and equivalence partitioning is (A) they are not effective. (B) they do not explore combinations of input circumstances. (C) they explore combinations of input circumstances (D) none of the above

Last Answer : (B) they do not explore combinations of input circumstances.

Write ‘yes’ if each of the following relations is an equivalence relation. -Maths 9th

Description : Write ‘yes’ if each of the following relations is an equivalence relation. -Maths 9th

Last Answer : (i) is parallel to' is reflexive, because any line is parallel to itself. Symmetric, because if line l is parallel to line m, then line m is parallel to line l. Transitive, because if l || m ... y cannot be a factor of x. (v) No, because the relation is reflexive and transitive but not symmetric.

Suppose that R1 and R2 are reflexive relations on a set A. Which of the following statements is correct? (A) R1∩R2 is reflexive and R1UR2 is irreflexive. (B) R1∩R2 is irreflexive and R1UR2 is reflexive. (C) Both R1∩R2 and R1UR2 are reflexive. (D) Both R1∩R2 and R1UR2 are irreflexive.

Description : Suppose that R1 and R2 are reflexive relations on a set A. Which of the following statements is correct? (A) R1∩R2 is reflexive and R1UR2 is irreflexive. (B) R1∩R2 is irreflexive and R1UR2 is reflexive. (C) Both R1∩R2 and R1UR2 are reflexive. (D) Both R1∩R2 and R1UR2 are irreflexive.

Last Answer : (C) Both R1∩R2 and R1UR2 are reflexive.

A thermometer measures temperature in whole degrees only. If the temperature falls below 18 degrees, the heating is switched off. It is switched on again when the temperature reaches 21 degrees. What are the best values in degrees to cover all equivalence partitions? A. 15,19 and 25. B. 17,18 and19. C. 18, 20 and22. D. 16, 26 and 32.

Description : A thermometer measures temperature in whole degrees only. If the temperature falls below 18 degrees, the heating is switched off. It is switched on again when the temperature reaches 21 degrees. What are the best values in degrees to ... and 25. B. 17,18 and19. C. 18, 20 and22. D. 16, 26 and 32.

Last Answer : A. 15,19 and 25.

In hierarchical routing with 4800 routers, what region and cluster sizes should be chosen to minimize the size of the routing table for a three layer hierarchy? (A) 10 clusters, 24 regions and 20 routers (B) 12 clusters, 20 regions and 20 routers (C) 16 clusters, 12 regions and 25 routers (D) 15 clusters, 16 regions and 20 routers

Description : In hierarchical routing with 4800 routers, what region and cluster sizes should be chosen to minimize the size of the routing table for a three layer hierarchy? (A) 10 clusters, 24 regions and 20 routers (B ... (C) 16 clusters, 12 regions and 25 routers (D) 15 clusters, 16 regions and 20 routers

Last Answer : (D) 15 clusters, 16 regions and 20 routers Rooters minimum, then regions minimum, then clusters minimum.

There are exactly ................ different finite automata with three states x, y and z over the alphabet {a, b} where x is always the start state. (A) 64 (B) 256 (C) 1024 (D) 5832

Description : There are exactly ................ different finite automata with three states x, y and z over the alphabet {a, b} where x is always the start state. (A) 64 (B) 256 (C) 1024 (D) 5832

Last Answer : Answer: D

The seven elements A, B, C, D, E, F and G are pushed onto a stack in reverse order, i.e., starting from G. The stack is popped five times and each element is inserted into a queue. Two elements are deleted from the queue and pushed back onto the stack. Now, one element is popped from the stack. The popped item is ................... (1) A (2) B (3) F (4) G

Description : The seven elements A, B, C, D, E, F and G are pushed onto a stack in reverse order, i.e., starting from G. The stack is popped five times and each element is inserted into a queue. Two elements are deleted from the queue and pushed ... The popped item is ................... (1) A (2) B (3) F (4) G

Last Answer : Answer: 2

What will be the values of x, m and n after execution of the following statements? Int x, m, n; m=10; n=15; x= ++m + n++; A) x=25, m=10, n=15 B) x=27, m=10, n=15 C) x=26, m=11, n=16 D) x=27, m=11, n=16

Description : What will be the values of x, m and n after execution of the following statements? Int x, m, n; m=10; n=15; x= ++m + n++; A) x=25, m=10, n=15 B) x=27, m=10, n=15 C) x=26, m=11, n=16 D) x=27, m=11, n=16

Last Answer : C) x=26, m=11, n=16

Consider the fractional knapsack instance n = 4, (p1, p2, p3, p4) = (10, 10, 12, 18), (w1, w2, w3, w4) = (2, 4, 6, 9) and M = 15. The maximum profit is given by (Assume p and w denotes profit and weight of objects respectively) (A) 40 (B) 38 (C) 32 (D) 30

Description : Consider the fractional knapsack instance n = 4, (p1, p2, p3, p4) = (10, 10, 12, 18), (w1, w2, w3, w4) = (2, 4, 6, 9) and M = 15. The maximum profit is given by (Assume p and w denotes profit and weight of objects respectively) (A) 40 (B) 38 (C) 32 (D) 30

Last Answer : (B) 38

. ………………… is a special type of integrity constraint that relates two relations & maintains consistency across the relations. A) Entity Integrity Constraints B) Referential Integrity Constraints

Description : . ………………… is a special type of integrity constraint that relates two relations & maintains consistency across the relations. A) Entity Integrity Constraints B) Referential Integrity Constraints

Last Answer : B) Referential Integrity

The relational model is based on the concept that data is organized and stored in two-dimensional tables called ………………………A) Fields B) Records C) Relations D) Keys

Description : The relational model is based on the concept that data is organized and stored in two-dimensional tables called ………………………A) Fields B) Records C) Relations D) Keys

Last Answer : C) Relations

The ............ operator preserves unmatched rows of the relations being joined. A) Inner join B) Outer join C) Union D) Union join

Description : The ............ operator preserves unmatched rows of the relations being joined. A) Inner join B) Outer join C) Union D) Union join

Last Answer : B) Outer join

In RDBMS, Data is presented as a collection of ............ A) Table B) Attributes C) Relations D) Entities

Description : In RDBMS, Data is presented as a collection of ............ A) Table B) Attributes C) Relations D) Entities

Last Answer : C) Relations

In a relational schema, each tuple is divided into fields called A) Relations B) Domains C) Queries D) All of the above

Description : In a relational schema, each tuple is divided into fields called A) Relations B) Domains C) Queries D) All of the above

Last Answer : B) Domains

In a relational model, relations are termed as (A) Tuples. (B) Attributes (C) Tables. (D) Rows.

Description : In a relational model, relations are termed as (A) Tuples. (B) Attributes (C) Tables. (D) Rows.

Last Answer : (C) Tables

Consider the relations R(A,B) and S(B,C) and the following four relational algebra queries over R and S: I. πA,B(R⋈S) II. R⋈πB(S) III. R∩(πA(R) Χ πB(S)) IV. πA,R.B(R Χ S) where R.B refers to the column B in table R. One can determine that: (A) I, III and IV are the same query. (B) II, III and IV are the same query. (C) I, II and IV are the same query. (D) I, III and III are the same query.

Description : Consider the relations R(A,B) and S(B,C) and the following four relational algebra queries over R and S: I. πA,B(R⋈S) II. R⋈πB(S) III. R∩(πA(R) Χ πB(S)) IV. πA,R.B(R Χ S) where R.B refers to ... IV are the same query. (C) I, II and IV are the same query. (D) I, III and III are the same query.

Last Answer : (D) I, III and III are the same query.

Let pk(R) denotes primary key of relation R. A many-to-one relationship that exists between two relations R1 and R2 can be expressed as follows: (1) pk(R2)→pk(R1) (2) pk(R1)→pk(R2) (3) pk(R2)→R1∩R2 (4) pk(R1)→R1∩R2

Description : Let pk(R) denotes primary key of relation R. A many-to-one relationship that exists between two relations R1 and R2 can be expressed as follows: (1) pk(R2)→pk(R1) (2) pk(R1)→pk(R2) (3) pk(R2)→R1∩R2 (4) pk(R1)→R1∩R2

Last Answer : Answer: 2

The language of all non-null strings of a’s can be defined by a context free grammar as follow : S→a S|S a| a The word a3 can be generated by ................ different trees. (A) Two (B) Three (C) Four (D) Five

Description : The language of all non-null strings of a’s can be defined by a context free grammar as follow : S→a S|S a| a The word a3 can be generated by ................ different trees. (A) Two (B) Three (C) Four (D) Five

Last Answer : (C) Four Explanation:

Consider a uniprocessor system where new processes arrive at an average of five processes per minute and each process needs an average of 6 seconds of service time. What will be the CPU utilization ? (A) 80 % (B) 50 % (C) 60 % (D) 30 %

Description : Consider a uniprocessor system where new processes arrive at an average of five processes per minute and each process needs an average of 6 seconds of service time. What will be the CPU utilization ? (A) 80 % (B) 50 % (C) 60 % (D) 30 %

Last Answer : (B) 50 %

Write a program to create a vector with five elements as (5, 15, 25, 35, 45). Insert new element at 2nd position. Remove 1st and 4th element from vector.

Description : Write a program to create a vector with five elements as (5, 15, 25, 35, 45). Insert new element at 2nd position. Remove 1st and 4th element from vector.

Last Answer : import java.util.*; class VectorDemo { public static void main(String[] args) { Vector v = new Vector(); v.addElement(new Integer(5)); v.addElement(new Integer(15)); v.addElement(new ... .addElement(new Integer(45)); System.out.println("Original array elements are "); for(int i=0;i

A specific editor has 200 K of program text, 15 K of initial stack, 50 K of initialized data, and 70 K of bootstrap code. If five editors are started simultaneously, how much physical memory is needed if shared text is used ? (A) 1135 K (B) 335 K (C) 1065 K (D) 320 K

Description : A specific editor has 200 K of program text, 15 K of initial stack, 50 K of initialized data, and 70 K of bootstrap code. If five editors are started simultaneously, how much physical memory is needed if shared text is used ? (A) 1135 K (B) 335 K (C) 1065 K (D) 320 K

Last Answer : (B) 335 K

If R is a relation on a finite set A having n elements, then the number of relations on A is -Maths 9th

Description : If R is a relation on a finite set A having n elements, then the number of relations on A is -Maths 9th

Last Answer : (d) \(2^{n^2}\)Set A has n elements ⇒ n(A) = n ⇒ A × A has n × n = n2 elements ∴ Number of relations on A = Number of subsets of A × A = \(2^{n^2}\)

Given the following specification, which of the following values for age are in the SAME equivalence partition? If you are less than 18, you are too young to be insured. Between 18 and 30 inclusive, you will receive a 20% discount. Anyone over 30 is not eligible for a discount. A. 17, 18, 19. B. 29, 30, 31. C. 18, 29, 30. D. 17, 29, 31.

Description : Given the following specification, which of the following values for age are in the SAME equivalence partition? If you are less than 18, you are too young to be insured. Between 18 and 30 inclusive, you will receive a 20% discount. Anyone ... 17, 18, 19. B. 29, 30, 31. C. 18, 29, 30. D. 17, 29, 31.

Last Answer : C. 18, 29, 30.

Show that the relation ‘≅’ congruence on the set of all triangles in Euclidean plane geometry is an equivalence relation. -Maths 9th

Description : Show that the relation ‘≅’ congruence on the set of all triangles in Euclidean plane geometry is an equivalence relation. -Maths 9th

Last Answer : Reflexive : A ≅ A True Symmetric : if A ≅ B then B ≅ A True Transitive : if A ≅ B and B ≅ C, then A ≅ C True Therefore, the relation ‘≅’ is an equivalence relation.

Which of the following is an equivalence relation defined on set A = {1, 2, 3} -Maths 9th

Description : Which of the following is an equivalence relation defined on set A = {1, 2, 3} -Maths 9th

Last Answer : (c) {(1, 1), (2, 2), (3, 1), (1, 3), (3, 3)} Option (c) satisfies all the conditions of an equivalence relation. (1, 1), (2, 2), (3, 3) ∈ R ⇒ (a, a) ∈ R V a ∈ A ⇒ R is reflexive (3, 1) ∈ R and (1, 3) ∈ R ... R and (1, 1) ∈ R ⇒ (a, b) ∈ R, (b, c) ∈ R ⇒ (a, c) ∈ R V a, b, c ∈ A ⇒ R is transitive.

Consider a subnet with 720 routers. If a three-level hierarchy is choosen with eight clusters, each containing 9 regions of 10 routers, then total number of entries in the routing table is ................... (A) 25 (B) 27 (C) 53 (D) 72

Description : Consider a subnet with 720 routers. If a three-level hierarchy is choosen with eight clusters, each containing 9 regions of 10 routers, then total number of entries in the routing table is ................... (A) 25 (B) 27 (C) 53 (D) 72

Last Answer : Answer: A  Explanation: Each router needs 10 entries for local routers, 8 entries for routing to other regions within its own cluster, and 7 entries for distant clusters, for a total of 25 entries.

Consider the following Entity-Relationship (E-R) diagram and three possible relationship sets (I, II and III) for this E-R diagram: Image If different symbols stand for different values (e.g., t1 is definitely not equal to t2), then which of the above could not be the relationship set for the E-R diagram ? (A) I only (B) I and II only (C) II only (D) I, II and III

Description : Consider the following Entity-Relationship (E-R) diagram and three possible relationship sets (I, II and III) for this E-R diagram: If different symbols stand for different values (e.g., t1 is definitely not equal to t2 ... diagram ? (A) I only (B) I and II only (C) II only (D) I, II and III

Last Answer : (A) I only

A Multicomputer with 256 CPUs is organized as 16x16 grid. What is the worst case delay (in hops) that a message might have to take? (A) 16 (B) 15 (C) 32 (D) 30

Description : A Multicomputer with 256 CPUs is organized as 16x16 grid. What is the worst case delay (in hops) that a message might have to take? (A) 16 (B) 15 (C) 32 (D) 30

Last Answer : (D) 30

Consider a fuzzy set old as defined below Old = {(20, 0.1), (30, 0.2), (40, 0.4), (50, 0.6), (60, 0.8), (70, 1), (80, 1)} Then the alpha-cut for alpha = 0.4 for the set old will be (A) {(40, 0.4)} (B) {50, 60, 70, 80} (C) {(20, 0.1), (30, 0.2)} (D) {(20, 0), (30, 0), (40, 1), (50, 1), (60, 1), (70, 1), (80, 1)}

Description : Consider a fuzzy set old as defined below Old = {(20, 0.1), (30, 0.2), (40, 0.4), (50, 0.6), (60, 0.8), (70, 1), (80, 1)} Then the alpha-cut for alpha = 0.4 for the set old will be (A) {(40, 0.4)} (B) {50, 60, ... , (30, 0.2)} (D) {(20, 0), (30, 0), (40, 1), (50, 1), (60, 1), (70, 1), (80, 1)}

Last Answer : (D) {(20, 0), (30, 0), (40, 1), (50, 1), (60, 1), (70, 1), (80, 1)}

The virtual address generated by a CPU is 32 bits. The Translation Lookaside Buffer (TLB) can hold total 64 page table entries and a 4-way set associative (i.e. with 4- cache lines in the set). The page size is 4 KB. The minimum size of TLB tag is (A) 12 bits (B) 15 bits (C) 16 bits (D) 20 bits

Description : The virtual address generated by a CPU is 32 bits. The Translation Lookaside Buffer (TLB) can hold total 64 page table entries and a 4-way set associative (i.e. with 4- cache lines in the set). The page size is 4 KB. The minimum size of TLB tag is (A) 12 bits (B) 15 bits (C) 16 bits (D) 20 bits

Last Answer : (C) 16 bits Explanation: VirtualAddress = 32 bits PageSize = 4KB = 12 bits therefore : VPNTag = 20 bits, OffsetTag = 12 bits TLBEntryLength = VPNTag = 20 bits TotalTLBEntries = 64, 4-way implies ... therefore : TLBIndex = 4 bits TLBTag = TLBEntryLength - TLBIndex = 20 - 4 = 16 bits

Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) algorithm, then .............. context switches are required (suppose context switch at the beginning of Ready queue and at the end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5

Description : Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) ... end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5

Last Answer : (A) 3

Consider the following three SQL queries (Assume the data in the people table) : (a) Select Name from people where Age>21; (b) Select Name from people where Height>180; (c) Select Name from people where (Age>21) or (Height>180); If the SQL queries (a) and (b) above, return 10 rows and 7 rows in the result set respectively, then what is one possible number of rows returned by the SQL query (c) ? (A) 3 (B) 7 (C) 10 (D) 21

Description : Consider the following three SQL queries (Assume the data in the people table) : (a) Select Name from people where Age>21; (b) Select Name from people where Height>180; (c) Select Name from people where (Age>21) or (Height ... number of rows returned by the SQL query (c) ? (A) 3 (B) 7 (C) 10 (D) 21

Last Answer : (C) 10

Consider a system with twelve magnetic tape drives and three processes P1, P2 and P3. Process P1 requires maximum ten tape drives, process P2 may need as many as four tape drives and P3 may need upto nine tape drives. Suppose that at time t1, process P1 is holding five tape drives, process P2 is holding two tape drives and process P3 is holding three tape drives. At time t1, system is in: (A) safe state (B) unsafe state (C) deadlocked state (D) starvation state

Description : Consider a system with twelve magnetic tape drives and three processes P1, P2 and P3. Process P1 requires maximum ten tape drives, process P2 may need as many as four tape drives and P3 may need upto nine ... , system is in: (A) safe state (B) unsafe state (C) deadlocked state (D) starvation state

Last Answer : Answer: B

How many committees of five people can be chosen from 20 men and 12 women such that each committee contains at least three women? (A) 75240 (B) 52492 (C) 41800 (D) 9900

Description : How many committees of five people can be chosen from 20 men and 12 women such that each committee contains at least three women? (A) 75240 (B) 52492 (C) 41800 (D) 9900

Last Answer : (B) 52492

Consider a code with five valid code words of length ten : 0000000000, 0000011111, 1111100000, 1110000011, 1111111111 Hamming distance of the code is (A) 5 (B) 10 (C) 8 (D) 9

Description : Consider a code with five valid code words of length ten : 0000000000, 0000011111, 1111100000, 1110000011, 1111111111 Hamming distance of the code is (A) 5 (B) 10 (C) 8 (D) 9

Last Answer : Answer: Marks to all

What is StringTokenizer or Scanner and examples of similar classes (if you used it)

Description : What is StringTokenizer or Scanner and examples of similar classes (if you used it)

Last Answer : A: StringTokenizer or Scanner is a class which splits up any given string into tokens separated by delimiters.

State any two IOException classes.

Description : State any two IOException classes.

Last Answer : A: EOFException and FileNotFoundException.

Why did you write java.util package? (only if you use classes like Scanner or StringTokenizer)

Description : Why did you write java.util package? (only if you use classes like Scanner or StringTokenizer)

Last Answer : A: To include the functions of the Scanner or StringTokenizer class from the java.util package.

State true or false. i) Jpanel is a class included in awt package. ii) Anonymous classes are mostly used for event handling. iii) Names of anonymous classes must be unique iv) JOptionPane is an inner class A) i-false, ii-false, iii-true, iv-true B) i-true, ii-false, iii-true, iv-false C) i-false, ii-true, iii-false, iv-false D) i-true, ii-false, iii-false, iv-true

Description : State true or false. i) Jpanel is a class included in awt package. ii) Anonymous classes are mostly used for event handling. iii) Names of anonymous classes must be unique iv) JOptionPane is an inner class A) i-false ... ) i-false, ii-true, iii-false, iv-false D) i-true, ii-false, iii-false, iv-true

Last Answer : C) i-false, ii-true, iii-false, iv-false

The concept of multiple inheritance is implemented in Java by A) extending two or more classes B) extending one class and implementing one or more interfaces C) implementing two or more interfaces D) both B and C

Description : The concept of multiple inheritance is implemented in Java by A) extending two or more classes B) extending one class and implementing one or more interfaces C) implementing two or more interfaces D) both B and C

Last Answer : D) both B and C

A package is a collection of A) classes B) interfaces C) editing tools D) classes and interfaces

Description : A package is a collection of A) classes B) interfaces C) editing tools D) classes and interfaces

Last Answer : D) classes and interfaces

The .................. and .................... classes are abstract classes that support reading and writing of byte streams. A) reader, writer B) inputstream, outputstream C) objectinputstream, objectoutputstream D) none

Description : The .................. and .................... classes are abstract classes that support reading and writing of byte streams. A) reader, writer B) inputstream, outputstream C) objectinputstream, objectoutputstream D) none

Last Answer : B) inputstream, outputstream

The concept of multiple inheritance is implemented in Java by A) extending two or more classes B) extending one class and implementing one or more interfaces C) implementing two or more interfaces D) both B and C

Description : The concept of multiple inheritance is implemented in Java by A) extending two or more classes B) extending one class and implementing one or more interfaces C) implementing two or more interfaces D) both B and C

Last Answer : D) both B and C

A package is a collection of A) classes B) interfaces C) editing tools D) classes and interfaces

Description : A package is a collection of A) classes B) interfaces C) editing tools D) classes and interfaces

Last Answer : D) classes and interfaces