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

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

by

1 Answer

Answer :

Answer: C
by

Related questions

Compute the value of adding the following two fuzzy integers: A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)} B = {(0.5,11), (1,12), (0.5,13)} Where fuzzy addition is defined as μA+B(z) = maxx+y=z (min(μA(x), μB(x))) Then, f(A+B) is equal to (A) {(0.5,12), (0.6,13), (1,14), (0.7,15), (0.7,16), (1,17), (1,18)} (B) {(0.5,12), (0.6,13), (1,14), (1,15), (1,16), (1,17), (1,18)} (C) {(0.3,12), (0.5,13), (0.5,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)}

Description : Compute the value of adding the following two fuzzy integers: A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)} B = {(0.5,11), (1,12), (0.5,13)} Where fuzzy addition is defined as μA+B(z) = maxx+y=z (min(μA(x), μB( ... ,18)} (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)}

Last Answer : (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} 

Let A and B be two fuzzy integers defined as: A={(1,0.3), (2,0.6), (3,1), (4,0.7), (5,0.2)} B={(10,0.5), (11,1), (12,0.5)} Using fuzzy arithmetic operation given by Image (A) {(11,0.8), (13,1), (15,1)} (B) {(11,0.3), (12,0.5), (13,1), (14,1), (15,1), (16,0.5), (17,0.2)} (C) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,1), (16,0.5), (17,0.2)} (D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

Description : Let A and B be two fuzzy integers defined as: A={(1,0.3), (2,0.6), (3,1), (4,0.7), (5,0.2)} B={(10,0.5), (11,1), (12,0.5)} Using fuzzy arithmetic operation given by (A) {(11,0.8), (13,1), (15,1)} ( ... ,0.2)} (D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

Last Answer : (D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

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

Let f and g be the functions from the set of integers to the set integers defined by f(x) = 2x + 3 and g(x) = 3x + 2 Then the composition of f and g and g and f is given as (A) 6x + 7, 6x + 11 (B) 6x + 11, 6x + 7 (C) 5x + 5, 5x + 5 (D) None of the above

Description : Let f and g be the functions from the set of integers to the set integers defined by f(x) = 2x + 3 and g(x) = 3x + 2 Then the composition of f and g and g and f is given as (A) 6x + 7, 6x + 11 (B) 6x + 11, 6x + 7 (C) 5x + 5, 5x + 5 (D) None of the above

Last Answer : (A) 6x + 7, 6x + 11 Explanation: fog(x)=f(g(x))=f(3x+2)=2(3x+2)+3=6x+7 gof(x)=g(f(x))=g(2x+3)=3(2x+3)+2=6x+11

A fuzzy set A on R is ................. iff A(λx1 + (1 – λ)x2) ≥ min [A(x1), A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator. (A) Support (B) α-cut (C) Convex (D) Concave

Description : A fuzzy set A on R is ................. iff A(λx1 + (1 – λ)x2) ≥ min [A(x1), A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator. (A) Support (B) α-cut (C) Convex (D) Concave 

Last Answer : (C) Convex 

Let f(n) and g(n) be asymptotically non-negative functions. Which of the following is correct? (A) θ(f(n) * g(n)) = min(f(n), g(n)) (B) θ(f(n) * g(n)) = max(f(n), g(n)) (C) θ(f(n) + g(n)) = min(f(n), g(n)) (D) θ(f(n) + g(n)) = max(f(n), g(n))

Description : Let f(n) and g(n) be asymptotically non-negative functions. Which of the following is correct? (A) θ(f(n) * g(n)) = min(f(n), g(n)) (B) θ(f(n) * g(n)) = max(f(n), g(n)) (C) θ(f(n) + g(n)) = min(f(n), g(n)) (D) θ(f(n) + g(n)) = max(f(n), g(n))

Last Answer : (D) θ(f(n) + g(n)) = max(f(n), g(n))

Let `f : R ->R` defined by `f(x) = min(|x|, 1-|x|)`, then which of the following hold(s) good ?

Description : Let `f : R ->R` defined by `f(x) = min(|x|, 1-|x|)`, then which of the following hold(s) good ?

Last Answer : Let `f : R ->R` defined by `f(x) = min(|x|, 1-|x|)`, then which of the following ... neither even nor odd. D. f is neither injective nor surjective.

Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be (A) m x n (B) max (m, n) (C) min (m, n) (D) m + n – 1

Description : Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be (A) m x n (B) max (m, n) (C) min (m, n) (D) m + n – 1

Last Answer :  (D) m + n – 1

The crossover points of a membership function are defined as the elements in the universe for which a particular fuzzy set has values equal to A. infinite B. 1 C. 0 D. 0.5

Description : The crossover points of a membership function are defined as the elements in the universe for which a particular fuzzy set has values equal to A. infinite B. 1 C. 0 D. 0.5

Last Answer : D. 0.5

The height of h(A) of a fuzzy set A is defined as h(A) = sup A(x) xϵA Then the fuzzy set A is called normal when (A) h(A) = 0 (B) h(A) < 0 (C) h(A) = 1 (D) h(A) < 1

Description : The height of h(A) of a fuzzy set A is defined as h(A) = sup A(x)  xϵA Then the fuzzy set A is called normal when (A) h(A) = 0 (B) h(A) < 0 (C) h(A) = 1 (D) h(A) < 1

Last Answer : (C) h(A) = 1 

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)}

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

. ………………… 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

Let R be a relation on the set N, defined by {(x, y) : 2x – y = 10} then R is -Maths 9th

Description : Let R be a relation on the set N, defined by {(x, y) : 2x – y = 10} then R is -Maths 9th

Last Answer : (a) ReflexiveGiven, {(\(x\), y) : 2\(x\) – y = 10} Reflexive, \(x\) R \(x\) = 2\(x\) – \(x\) = 10 ⇒ \(x\) = 10 ⇒ y = 10 ∴ Point (10, 10) ∈ N ⇒ R is reflexive.

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}\)

................ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution. (A) Best first search (B) Goal stack planning (C) Alpha-beta pruning procedure (D) Min-max search

Description : ................ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution. (A) Best first search (B) Goal stack planning (C) Alpha-beta pruning procedure (D) Min-max search

Last Answer : (C) Alpha-beta pruning procedure

Suppose the function y and a fuzzy integer number around -4 for x are given as y=(x-3)2+2 Around -4={(2,0.3), (3,0.6), (4,1), (5,0.6), (6,0.3)} respectively. Then f(Around - 4) is given by: (A) {(2,0.6), (3,0.3), (6,1), (11,0.3)} (B) {(2,0.6), (3,1), (6,1), (11,0.3)} (C) {(2,0.6), (3,1), (6,0.6), (11,0.3)} (D) {(2,0.6), (3,0.3), (6,0.6), (11,0.3)}

Description : Suppose the function y and a fuzzy integer number around -4 for x are given as y=(x-3)2+2 Around -4={(2,0.3), (3,0.6), (4,1), (5,0.6), (6,0.3)} respectively. Then f(Around - 4) is given by: (A) {(2,0.6), (3,0.3), ... 6), (3,1), (6,0.6), (11,0.3)} (D) {(2,0.6), (3,0.3), (6,0.6), (11,0.3)}

Last Answer : (C) {(2,0.6), (3,1), (6,0.6), (11,0.3)}

Let R be a relation defined on the set A of all triangles such that R = {(T1, T2) : T1 is similar to T2}. Then R is -Maths 9th

Description : Let R be a relation defined on the set A of all triangles such that R = {(T1, T2) : T1 is similar to T2}. Then R is -Maths 9th

Last Answer : (d) An equivalence relation.Every triangle is similar to itself, so (T1, T1) ∈ R ⇒ R is reflexive. (T1, T2) ∈ R ⇒ T1 ~ T2 ⇒T2 ~ T1, ⇒ (T2, T1) ∈ R ⇒ R is symmetrictransitive. ∴ R is an equivalence relation.

Let R be a relation defined as a Rb if | a – b | > 0, then the relation is -Maths 9th

Description : Let R be a relation defined as a Rb if | a – b | > 0, then the relation is -Maths 9th

Last Answer : (d) Symmetric and transitive| a - a | = | 0 | = 0 so (a, a) ∉R ⇒ R is not reflexive(a, b) ∈ R ⇒ | a - b | > 0 ⇒ | b - a | > 0 ⇒ (b, a) ∈R (∵ | a - b | = | b - a |) ⇒ R is symmetric (a, b) ∈ R ... a, b, c. ∴ | a - b | > 0 and | b - c | > 0 ⇒ | a - c | > 0 ⇒ (a, c) ∈ R ⇒ R is transitive.

Let A = {1, 2, 3, 4}, B = {5, 6, 7, 8}. Then R = {(1, 5), (1, 7), (2, 6)} is a relation from set A to B defined as : -Maths 9th

Description : Let A = {1, 2, 3, 4}, B = {5, 6, 7, 8}. Then R = {(1, 5), (1, 7), (2, 6)} is a relation from set A to B defined as : -Maths 9th

Last Answer : (d) R = {(a, b) : b/a is odd} Since (2, 6) ∈R, the relation a and b are odd does not exist. Since (1, 5) and (1, 7) ∈R, the relation a and b are even does not exist. None of the ... \(rac{7}{1}\) = 7, \(rac{6}{2}\) = 3, quotients being all odd numbers, the relation b/a is odd exists.

Let A = {(2, 5, 11)}, B = {3, 6, 10} and R be a relation from A to B defined by R = {(a, b) : a and b are co-prime}. Then R is -Maths 9th

Description : Let A = {(2, 5, 11)}, B = {3, 6, 10} and R be a relation from A to B defined by R = {(a, b) : a and b are co-prime}. Then R is -Maths 9th

Last Answer : (c) {(2, 3), (5, 3), (5, 6), (11, 3), (11, 6), (11, 10)}

Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). Consider the following three lines for clipping with the given end point co-ordinates: Line AB: A(-6,2) and B(-1,8) Line CD: C(-1,5) and D(4,8) Line EF: E(-2,3) and F(1,2) Which of the following line(s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Description : Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). ... s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Last Answer : (D) AB and CD

Let R be a relation from A = {1, 2, 3, 4, 5, 6} to B = {1, 3, 5} which is defined as “x is less than y”. -Maths 9th

Description : Let R be a relation from A = {1, 2, 3, 4, 5, 6} to B = {1, 3, 5} which is defined as “x is less than y”. -Maths 9th

Last Answer : R = {a, b : a < b, a ∈ A, b ∈ B}, where A = {1, 2, 3, 4, 5, 6} and B = {1, 3, 5}. ∴ R = {(1, 3), (1, 5), (2, 3), (2, 5), (3, 5), (4, 5)} Domain of R = {1, 2, 3, 4} Range of R = {3, 5} Codomain of R = {1, 3, 5}.

Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 : SQ1 : Select * From R Full Join S On R.B=S.B; SQ2 : Select * From R Inner Join S On R.B=S.B; The numbers of tuples in the result of the SQL query SQ1 and the SQL query SQ2 are given by : (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively

Description : Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 ... (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively

Last Answer : (D) 4 and 2 respectively

A fuzzy set has a membership function whose membership values are strictly monotonically increasing or strictly monotonically decreasing or strictly monotonically increasing than strictly monotonically decreasing with increasing values for elements in the universe A. convex fuzzy set B. concave fuzzy set C. Non concave Fuzzy set D. Non Convex Fuzzy set

Description : A fuzzy set has a membership function whose membership values are strictly monotonically increasing or strictly monotonically decreasing or strictly monotonically increasing than strictly monotonically decreasing with increasing ... fuzzy set C. Non concave Fuzzy set D. Non Convex Fuzzy set

Last Answer : A. convex fuzzy set

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.

If A and B are two fuzzy sets with membership functions μA(x) = {0.6, 0.5, 0.1, 0.7, 0.8} μB(x) = {0.9, 0.2, 0.6, 0.8, 0.5} Then the value of μ(A∪B)’(x) will be (A) {0.9, 0.5, 0.6, 0.8, 0.8} (B) {0.6, 0.2, 0.1, 0.7, 0.5} (C) {0.1, 0.5, 0.4, 0.2, 0.2} (D) {0.1, 0.5, 0.4, 0.2, 0.3}

Description : If A and B are two fuzzy sets with membership functions μA(x) = {0.6, 0.5, 0.1, 0.7, 0.8} μB(x) = {0.9, 0.2, 0.6, 0.8, 0.5} Then the value of μ(A∪B)’(x) will be (A) {0.9, 0.5, 0.6, 0.8, 0.8} (B) {0.6, 0.2, 0.1, 0.7, 0.5} (C) {0.1, 0.5, 0.4, 0.2, 0.2} (D) {0.1, 0.5, 0.4, 0.2, 0.3}

Last Answer : (C) {0.1, 0.5, 0.4, 0.2, 0.2}

If A and B are two fuzzy sets with membership functions µA(X) = {0.2, 0.5, 0.6, 0.1, 0.9} µB(X) = {0.1, 0.5, 0.2, 0.7, 0.8} Then the value of µA∩B will be (A) {0.2, 0.5, 0.6, 0.7, 0.9} (B) {0.2, 0.5, 0.2, 0.1, 0.8} (C) {0.1, 0.5, 0.6, 0.1, 0.8} (D) {0.1, 0.5, 0.2, 0.1, 0.8}

Description : If A and B are two fuzzy sets with membership functions µA(X) = {0.2, 0.5, 0.6, 0.1, 0.9} µB(X) = {0.1, 0.5, 0.2, 0.7, 0.8} Then the value of µA∩B will be (A) {0.2, 0.5, 0.6, 0.7, 0.9} (B) {0.2, 0.5, 0.2, 0.1, 0.8} (C) {0.1, 0.5, 0.6, 0.1, 0.8} (D) {0.1, 0.5, 0.2, 0.1, 0.8}

Last Answer : (D) {0.1, 0.5, 0.2, 0.1, 0.8}

Consider a sequence F00 defined as: Image Then what shall be the set of values of the sequence F00? (1) (1, 110, 1200) (2) (1, 110, 600, 1200) (3) (1, 2, 55, 110, 600, 1200) (4) (1, 55, 110, 600, 1200)

Description : Consider a sequence F00 defined as: Then what shall be the set of values of the sequence F00? (1) (1, 110, 1200) (2) (1, 110, 600, 1200) (3) (1, 2, 55, 110, 600, 1200) (4) (1, 55, 110, 600, 1200)

Last Answer : Answer: 1 Explanation: We have given, F00(0) = 1, F00(1) = 1 F00(2) = (10*F00(1) + 100)/F00(0) = 110 F00(3) = (10*F00(2) + 100)/F00(1) = 1200 F00(4) = (10*F00(3) + ... (2) = 110 Since the values repeats after the first three values, the set of values of F00 will be (1,110,1200).

Find the false statement: (A) The relationship construct known as the weak relationship type was defined by Dey, Storey & Barron (1999). (B) A weak relationship occurs when two relationship types are linked by either Event-Precedent sequence or Condition-Precedent sequence (C) Conceptual model is not accurate representation of "Universe of interest". (D) Ternary, Quaternary and Quintary relationships are shown through a series of application scenario's and vignette's

Description : Find the false statement: (A) The relationship construct known as the weak relationship type was defined by Dey, Storey & Barron (1999). (B) A weak relationship occurs when two ... Ternary, Quaternary and Quintary relationships are shown through a series of application scenario's and vignette's

Last Answer : (C) Conceptual model is not accurate representation of "Universe of interest".

The latest finish time for an activity: A. Equals the min. of LFT − t for al immediate successors B. Equals the max. of LFT − t for al immediate predecessors. C. Equals the max. of EST + t for all immediate predecessors. D. Equals the min. of EST + t for all immediate successors

Description : The latest finish time for an activity: A. Equals the min. of LFT − t for al immediate successors B. Equals the max. of LFT − t for al immediate predecessors. C. Equals the max. of EST + t for all immediate predecessors. D. Equals the min. of EST + t for all immediate successors

Last Answer : A. Equals the min. of LFT − t for al immediate successors

The asymptotic upper bound solution of the recurrence relation given by T(n)= 2T(n/2)+n/log n is: (1) O(n2) (2) O(n log n) (3) O(n log log n) (4) O(log log n)

Description : The asymptotic upper bound solution of the recurrence relation given by T(n)= 2T(n/2)+n/log n is: (1) O(n2) (2) O(n log n) (3) O(n log log n) (4) O(log log n)

Last Answer : (3) O(n log log n) 

Let P(m,n) be the statement “m divides n” where the Universe of discourse for both the variables is the set of positive integers. Determine the truth values of the following propositions. (a) ∃m ∀n P(m,n) (b) ∀n P(1,n) (c) ∀m ∀n P(m,n) (A) (a)-True; (b)-True; (c)-False (B) (a)-True; (b)-False; (c)-False (C) (a)-False; (b)-False; (c)-False (D) (a)-True; (b)-True; (c)-True

Description : Let P(m,n) be the statement m divides n where the Universe of discourse for both the variables is the set of positive integers. Determine the truth values of the following propositions. (a) ∃m ∀n P(m,n) (b) ∀n P(1,n) ( ... -False (C) (a)-False; (b)-False; (c)-False (D) (a)-True; (b)-True; (c)-True

Last Answer : Answer: A

A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G} Which of the following is a candidate key? (A) A (B) AB (C) ABC (D) ABD

Description : A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G} Which of the following is a candidate key? (A) A (B) AB (C) ABC (D) ABD

Last Answer : Answer: D

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

Description : 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

Last Answer : (C) 25

Suppose t = (1, 2, 4, 3), which of the following is incorrect? a) print(t[3]) b) t[3] = 45 c) print(max(t)) d) print(len(t))

Description : Suppose t = (1, 2, 4, 3), which of the following is incorrect? a) print(t[3]) b) t[3] = 45 c) print(max(t)) d) print(len(t))

Last Answer : b) t[3] = 45

A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following statement is correct? (A) OS maintains only scheduling and accounting information for each thread. (B) OS maintains only CPU registers for each thread. (C) OS does not maintain a separate stack for each thread. (D) OS does not maintain virtual memory state for each thread.

Description : A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following ... separate stack for each thread. (D) OS does not maintain virtual memory state for each thread.

Last Answer : (B) OS maintains only CPU registers for each thread.

Let the time taken to switch between user mode and kernel mode of execution be T1 while time taken to switch between two user processes be T2. Which of the following is correct? (A) T1 < T2 (B) T1 > T2 (C) T1 = T2 (D) Nothing can be said about the relation between T1 and T2.

Description : Let the time taken to switch between user mode and kernel mode of execution be T1 while time taken to switch between two user processes be T2. Which of the following is correct? (A) T1 < T2 (B) T1 > T2 (C) T1 = T2 (D) Nothing can be said about the relation between T1 and T2.

Last Answer : (A) T1 < T2

Consider the following LPP: Min. Z = x1+x2+x3

Description : Consider the following LPP: Min. Z = x1+x2+x3 Subject to 3x1 + 4x3 ≤ 5 5x1 + x2 + 6x3 =7 8x1 + 9x3 ≥ 2 x1, x2, x3 ≥ 0 The standard form of this LPP shall be: (1) Min. Z = x1 + x2 + x3 + 0x4 + 0x5 Subject ... + 4x3 + x4 = 5; 5x1 + x2 + 6x3 + x6 = 7; 8x1 + 9x3 - x5 + x7 = 2; x1 to x7 ≥ 0

Last Answer : Answer: 1

Consider the formula in image processing RD = 1 - (1/CR) Where CR = n1/n2 CR is called as compression ratio n1 and n2 denotes the number of information carrying units in two datasets that represent the same information. In this situation RD is called as relative ................ of the first data set. (A) Data Compression (B) Data Redundancy (C) Data Relation (D) Data Representation

Description : Consider the formula in image processing RD = 1 - (1/CR) Where CR = n1/n2 CR is called as compression ratio n1 and n2 denotes the number of information carrying units in two datasets that represent ... . (A) Data Compression (B) Data Redundancy (C) Data Relation (D) Data Representation

Last Answer : (B) Data Redundancy

Let R be a relation on the set of integers given by a = 2^k .b for some integer k. Then R is -Maths 9th

Description : Let R be a relation on the set of integers given by a = 2^k .b for some integer k. Then R is -Maths 9th

Last Answer : (c) equivalence relationGiven, a R b = a = 2k .b for some integer. Reflexive: a R a ⇒ a = 20.a for k = 0 (an integer). True Symmetric: a R b ⇒ a = 2k b ⇒ b = 2-k . a ⇒ b R a as k, -k are both ... = 2k1 + k2 c, k1 + k2 is an integer. ∴ a R b, b R c ⇒ a R c True ∴ R is an equivalence relation.

Let R be the relation in the set {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}. Then R is -Maths 9th

Description : Let R be the relation in the set {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}. Then R is -Maths 9th

Last Answer : (b) Reflexive and transitive but not symmetricLet A = {1, 2, 3, 4} • ∵ (1, 1), (2, 2), (3, 3) and (4, 4) ∈R ⇒ R is reflexive • ∵ (1, 2) ∈ R but (2, 1) ∉ R ; (1, 3) ∈ R and (3, 1) ∉ R ; (3, 2) ∈R and (2, 3) ∉ R ⇒ R is not symmetric • (1, 3) ∈ R and (3, 2) ∈ R and (1, 2) ∈ R ⇒ R is transitive.

Let us assume that you construct ordered tree to represent the compound proposition (~(p˄q))↔(~p˅~q). Then, the prefix expression and post-fix expression determined using this ordered tree are given as ........... and ............. respectively. (A) ↔~˄pq˅ ~~pq, pq˄~p~q~˅↔ (B) ↔~˄pq˅ ~p~q, pq˄~p~q~˅↔ (C) ↔~˄pq˅ ~~pq, pq˄~p~ ~q˅↔ (D) ↔~˄pq˅ ~p~q, pq˄~p~~q˅↔

Description : Let us assume that you construct ordered tree to represent the compound proposition (~(p˄q))↔(~p˅~q). Then, the prefix expression and post-fix expression determined using this ordered tree are given as ........... and .......... ... ~p~q~˅↔ (C) ↔~˄pq˅ ~~pq, pq˄~p~ ~q˅↔ (D) ↔~˄pq˅ ~p~q, pq˄~p~~q˅↔

Last Answer : (B) ↔~˄pq˅ ~p~q, pq˄~p~q~˅↔

If a relation `R` on the set `N` of natural numbers is defined as `(x,y)hArrx^(2)-4xy+3y^(2)=0,Aax,yepsilonN`. Then the relation `R` is

Description : If a relation `R` on the set `N` of natural numbers is defined as `(x,y)hArrx^(2)-4xy+3y^(2)=0,Aax,yepsilonN`. Then the relation `R` is

Last Answer : If a relation `R` on the set `N` of natural numbers is defined as `(x,y)hArrx^(2) ... symmetric B. reflexive C. transitive D. an equivalence relation.

Below are the few steps given for scan-converting a circle using Bresenham's Algorithm. Which of the given steps is not correct? (1) Compute d = 3 – 2r (where r is radius) (2) Stop if x> y (3) If d<0, then d=4x+6 and x=x+1 (4) If d≥0,then d=4 *(x-y)+10, x=x+1 and y=y+1

Description : Below are the few steps given for scan-converting a circle using Bresenham's Algorithm. Which of the given steps is not correct? (1) Compute d = 3 – 2r (where r is radius) (2) Stop if x> y (3) If d

Last Answer : If d≥0,then d=4 *(x-y)+10, x=x+1 and y=y+1

Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto ............bits of error. (1) t + 1 (2) t (3) t - 2 (4) t/2

Description : Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto ............bits of error. (1) t + 1 (2) t (3) t - 2 (4) t/2

Last Answer : (2) t 

Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below Image The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2

Description : Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below  The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2

Last Answer : (C) 3