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

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
by

1 Answer

Answer :

(C) h(A) = 1 
by

Related questions

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

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

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

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}

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

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 

A recursive function h, is defined as follows: h(m)=k, if m=0 = 1, if m=1 = 2h(m-1) + 4h(m-2), if m≥2 If the value of h(4) is 88 then the value of k is: (1) 0 (2) 1 (3) 2 (4) -1

Description : A recursive function h, is defined as follows: h(m)=k, if m=0  = 1, if m=1 = 2h(m-1) + 4h(m-2), if m≥2 If the value of h(4) is 88 then the value of k is: (1) 0 (2) 1 (3) 2 (4) -1

Last Answer : (3) 2 

Which of the following provides the best description of an entity type? (A) A specific concrete object with a defined set of processes (e.g. Jatin with diabetes) (B) A value given to a particular attribute (e.g. height-230 cm) (C) A thing that we wish to collect data about zero or more, possibly real world examples of it may exist. (D) A template for a group of things with the same set of characteristics that may exist in the real world

Description : Which of the following provides the best description of an entity type? (A) A specific concrete object with a defined set of processes (e.g. Jatin with diabetes) (B) A value given to a ... template for a group of things with the same set of characteristics that may exist in the real world

Last Answer : Answer: D

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

In a Fuzzy set a prototypical element has a value A. 1 B. 0 C. infinite D. Not defined

Description : In a Fuzzy set a prototypical element has a value A. 1 B. 0 C. infinite D. Not defined

Last Answer : A. 1

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

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

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

For a B-tree of height h and degree t, the total CPU time used to insert a node is (A) O(h log t) (B) O(t log h) (C) O(t2h) (D) O(th)

Description : For a B-tree of height h and degree t, the total CPU time used to insert a node is (A) O(h log t) (B) O(t log h) (C) O(t2h) (D) O(th)

Last Answer : (D) O(th)

The number of disk pages access in B-tree search, where h is height, n is the number of keys, and t is the minimum degree, is: (A) θ(logn h*t) (B) θ(logt n*h) (C) θ(logh n) (D) θ(logt n)

Description : The number of disk pages access in B-tree search, where h is height, n is the number of keys, and t is the minimum degree, is: (A) θ(logn h*t) (B) θ(logt n*h) (C) θ(logh n) (D) θ(logt n)

Last Answer : Answer: D

A fuzzy set wherein no membership function has its value equal to 1 is called A. normal fuzzy set B. subnormal fuzzy set. C. convex fuzzy set D. concave fuzzy set

Description : A fuzzy set wherein no membership function has its value equal to 1 is called A. normal fuzzy set B. subnormal fuzzy set. C. convex fuzzy set D. concave fuzzy set

Last Answer : B. subnormal fuzzy set.

The membership values of the membership function are nor strictly monotonically increasing or decreasing or strictly monoronically increasing than decreasing. A. Convex Fuzzy Set B. Non convex fuzzy set C. Normal Fuzzy set D. Sub normal fuzzy set

Description : The membership values of the membership function are nor strictly monotonically increasing or decreasing or strictly monoronically increasing than decreasing. A. Convex Fuzzy Set B. Non convex fuzzy set C. Normal Fuzzy set D. Sub normal fuzzy set

Last Answer : B. Non convex fuzzy set

……………. Can be defined as the permanent blocking of a set of processed that either complete for system resources or communicate with each other. A) Deadlock B) Permanent lock C) Starvation D) Mutual exclusion

Description : ……………. Can be defined as the permanent blocking of a set of processed that either complete for system resources or communicate with each other. A) Deadlock B) Permanent lock C) Starvation D) Mutual exclusion

Last Answer : A) Deadlock

You notice a radiolucent area close to the apex of the central incisor, on a second x ray the radiolucent area moves; it is likely to be: A. Cyst B. Abscess C. Granuloma D. Incisive foramen in sup lingual for amen inf

Description : You notice a radiolucent area close to the apex of the central incisor, on a second x ray the radiolucent area moves; it is likely to be: A. Cyst B. Abscess C. Granuloma D. Incisive foramen in sup lingual for amen inf

Last Answer : D. Incisive foramen in sup lingual for amen inf

A Boolean operator Ө is defined as follows: 1Ө1=1, 1Ө0=0, 0Ө1=0 and 0Ө0=1 What will be the truth value of the expression (xӨy)Өz = xӨ(yӨz)? (A) Always false (B) Always true (C) Sometimes true (D) True when x, y, z are all true

Description : A Boolean operator Ө is defined as follows: 1Ө1=1, 1Ө0=0, 0Ө1=0 and 0Ө0=1 What will be the truth value of the expression (xӨy)Өz = xӨ(yӨz)? (A) Always false (B) Always true (C) Sometimes true (D) True when x, y, z are all true

Last Answer : (B) Always true

If S1 is total number of modules defined in the program architecture, S3 is the number of modules whose correct function depends on prior processing then the number of modules not dependent on prior processing is: (A) 1 + S3/S1 (B) 1 - S3/S1 (C) 1 + S1/S3 (D) 1 - S1/S3

Description : If S1 is total number of modules defined in the program architecture, S3 is the number of modules whose correct function depends on prior processing then the number of modules not dependent on prior processing is: (A) 1 + S3/S1 (B) 1 - S3/S1 (C) 1 + S1/S3 (D) 1 - S1/S3

Last Answer : (B) 1 - S3/S1

Any tips for SUP (Stand up paddle boarding) techniques, do's and dont's and purchase?

Description : Any tips for SUP (Stand up paddle boarding) techniques, do's and dont's and purchase?

Last Answer : Rent first, wider and longer are better. Start out paddling on protected cove or bay, less wave action. Enjoy yourself.

How do I respond to "Hey man, sup?"?

Description : How do I respond to "Hey man, sup?"?

Last Answer : “Not much” “It’s all good in the hood, nigga” “Not bad, you?” or any others You just ain’t down wit the hood, gramps.

Distinguish between <sup> and <sub> tags with example. -Technology

Description : Distinguish between and tags with example. -Technology

Last Answer : Distinguishes between and tags are as follows: Tag TagThe tag is known assuperscript tag.The tag is known assubscript tag.It is used to definesuperscripted text.It is used to define subscripted text.Tags that are ... to display(a+ b)2is(a+ b) 2e.g. HTML command to displaylog2+log x islog 2+logx

Write the full forms of 1. <sup> 2. <a> -Technology

Description : Write the full forms of 1. 2. -Technology

Last Answer : 1. Superscript2. Anchor3. Image4. Subscript

Binance (Sup port*) Number☎️【(850)757‒.4558 Pro Customer Care Support Service helpLine#Support@2021SD A?

Description : Binance (Sup port*) Number☎️【(850)757‒.4558 Pro Customer Care Support Service helpLine#Support@2021SD A?

Last Answer : Binance (Sup port*) Number☎️【(850)757-.4558 Pro Customer Care Support Service helpLine#Support@2021SD ABinance (Sup port*) Number☎️【(850)757-.4558 Pro Customer Care Support Service helpLine#Support@2021SD ABinance ... ABinance (Sup port*) Number☎️【(850)757-.4558 Pro Customer Care Support Service h

who sup sup sup?

Description : who sup sup sup?

Last Answer : sup is not a word

Which of the following statement is true? i) An address with all bits 1 is interpreted as all networks or all hosts. ii) The class A network 128.0.0.0 is defined as the loopback network. A) i only B) ii only C) Both A and B D) None of the above

Description : Which of the following statement is true? i) An address with all bits 1 is interpreted as all networks or all hosts. ii) The class A network 128.0.0.0 is defined as the loopback network. A) i only B) ii only C) Both A and B D) None of the above

Last Answer : A) i only

The Software Maturity Index (SMI) is defined as SMI = [Mf – (Fa + Fc + Fd)] / Mf Where Mf = the number of modules in the current release. Fa = the number of modules in the current release that have been added. Fc = the number of modules in the current release that have been changed. Fd = the number of modules in the current release that have been deleted. The product begins to stabilize when (A) SMI approaches 1 (B) SMI approaches 0 (C) SMI approaches -1 (D) None of the above

Description : The Software Maturity Index (SMI) is defined as SMI = [Mf - (Fa + Fc + Fd)] / Mf Where Mf = the number of modules in the current release. Fa = the number of modules in the current release that have ... (A) SMI approaches 1 (B) SMI approaches 0 (C) SMI approaches -1 (D) None of the above

Last Answer : (A) SMI approaches 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

The truth values of traditional set theory is ____________ and that of fuzzy set is __________ a) Either 0 or 1, between 0 & 1 b) Between 0 & 1, either 0 or 1 c) Between 0 & 1, between 0 & 1 d) Either 0 or 1, either 0 or 1

Description : The truth values of traditional set theory is ____________ and that of fuzzy set is __________ a) Either 0 or 1, between 0 & 1 b) Between 0 & 1, either 0 or 1 c) Between 0 & 1, between 0 & 1 d) Either 0 or 1, either 0 or 1

Last Answer : a) Either 0 or 1, between 0 & 1

The truth values of traditional set theory is ____________ and that of fuzzy set is __________ a) Either 0 or 1, between 0 & 1 b) Between 0 & 1, either 0 or 1 c) Between 0 & 1, between 0

Description : The truth values of traditional set theory is ____________ and that of fuzzy set is __________ a) Either 0 or 1, between 0 & 1 b) Between 0 & 1, either 0 or 1 c) Between 0 & 1, between 0

Last Answer : a) Either 0 or 1, between 0 & 1

If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from current node to the goal node, then A* algorithm gives an optimal solution if (A) h* us equal to h (B) h* overestimates h (C) h* underestimates h (D) none of these

Description : If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from current node to the goal node, then A* algorithm gives an optimal solution ... h* us equal to h (B) h* overestimates h (C) h* underestimates h (D) none of these

Last Answer : (C) h* underestimates h

Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Description : Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current ... ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Last Answer : (C) Greedy best first search algorithm

In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/y where x is discovery time stamp and y is finishing time stamp. Image It shows which of the following depth first forest? (A) {a,b,e} {c,d,f,g,h} (B) {a,b,e} {c,d,h} {f,g} (C) {a,b,e} {f,g} {c,d} {h} (D) {a,b,c,d} {e,f,g} {h}

Description : In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/y where x is discovery time stamp and y is finishing time stamp.  It shows which of the following depth first forest? (A ... {a,b,e} {f,g} {c,d} {h} (D) {a,b,c,d} {e,f,g} {h}

Last Answer : Answer: A

Consider a discrete memoryless channel and assume that H(x) is the amount of information per symbol at the input of the channel; H(y) is the amount of information per symbol at the output of the channel; H(x|y) is the amount of uncertainty remaining on x knowing y; and I(x;y) is the information transmission. Which of the following does not define the channel capacity of a discrete memoryless channel?

Description : Consider a discrete memoryless channel and assume that H(x) is the amount of information per symbol at the input of the channel; H(y) is the amount of information per symbol at the output of the channel; H(x|y) is the amount of uncertainty ... (H(x) - H(x|y))]  p(x) (D) max H(x|y)  p(x)

Last Answer : (D) max H(x|y)   p(x)

If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n≤m, the expected number of collisions involving a particular key x is less than ................... (1) 1 (2) 1/n (3) 1/m (4) n/m

Description : If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n≤m, the expected number of collisions involving a particular key x is less than ................... (1) 1 (2) 1/n (3) 1/m (4) n/m

Last Answer : Answer: 1

Consider a hash table of size m=100 and the hash function h(k) = floor(m(kA mod 1)) for A = (√5 − 1)/2 = 0.618033. Compute the location to which the key k = 123456 is placed in hash table. (A) 77 (B) 82 (C) 88 (D) 89

Description : Consider a hash table of size m=100 and the hash function h(k) = floor(m(kA mod 1)) for A = (√5 − 1)/2 = 0.618033. Compute the location to which the key k = 123456 is placed in hash table. (A) 77 (B) 82 (C) 88 (D) 89

Last Answer : (C) 88

When a function is defined inside a class, this function is called …………. A) Inside function B) Class function C) Inline function D) Interior function

Description : When a function is defined inside a class, this function is called …………. A) Inside function B) Class function C) Inline function D) Interior function

Last Answer : C) Inline function

FAN IN of a component A is defined as (A) Number of components that can call or pass control to component A. (B) Number of components that are called by component A. (C) Number of components related to component A. (D) Number of components dependent on component A.

Description : FAN IN of a component A is defined as (A) Number of components that can call or pass control to component A. (B) Number of components that are called by component A. (C) Number of components related to component A. (D) Number of components dependent on component A.

Last Answer : (A) Number of components that can call or pass control to component A.

There are also other operators, more linguistic in nature, called __________ that can be applied to fuzzy set theory. a) Hedges b) Lingual Variable c) Fuzz Variable d) None of the mentioned

Description : There are also other operators, more linguistic in nature, called __________ that can be applied to fuzzy set theory. a) Hedges b) Lingual Variable c) Fuzz Variable d) None of the mentioned

Last Answer : a) Hedges

The region of universe that is characterized by complete membership in the set is called A. Core B. Support C. Boundary D. Fuzzy

Description : The region of universe that is characterized by complete membership in the set is called A. Core B. Support C. Boundary D. Fuzzy

Last Answer : A. Core

There are also other operators, more linguistic in nature, called __________ that can be applied to fuzzy set theory. a) Hedges b) Lingual Variable c) Fuzz Variable d) None of the mentione

Description : There are also other operators, more linguistic in nature, called __________ that can be applied to fuzzy set theory. a) Hedges b) Lingual Variable c) Fuzz Variable d) None of the mentione

Last Answer : a) Hedges

A linear programm A linear programming model CANNOT be used when whic ing model CANNOT be used when which of the followin h of the following are true? g are true? a)An optimal production plan is desired b)The values of decision variables are fractional c)A set of linear constraints may be defined d)Cross product relationships exist between two or more decision variables

Description : A linear programm A linear programming model CANNOT be used when whic ing model CANNOT be used when which of the followin h of the following are true? g are true? a)An optimal ... set of linear constraints may be defined d)Cross product relationships exist between two or more decision variables

Last Answer : d)Cross product relationships exist between two or more decision variables

Data input is A) an abstract class defined in java.io B) a class we can use to read primitive data types C) an interface that defines methods to open files. D) an interface that defines methods to read primitive data types.

Description : Data input is A) an abstract class defined in java.io B) a class we can use to read primitive data types C) an interface that defines methods to open files. D) an interface that defines methods to read primitive data types.

Last Answer : D) an interface that defines methods to read primitive data types.

Data input is A) an abstract class defined in java.io B) a class we can use to read primitive data types C) an interface that defines methods to open files. D) an interface that defines methods to read primitive data types.

Description : Data input is A) an abstract class defined in java.io B) a class we can use to read primitive data types C) an interface that defines methods to open files. D) an interface that defines methods to read primitive data types.

Last Answer : D) an interface that defines methods to read primitive data types.

State true or false for Java Program. i) Data members of an interface are by default final ii) An abstract class has implementations of all methods defined inside it. A) i-false, ii-false B) i-false, ii-true C) i-true, ii-false D) i-true, ii-true

Description : State true or false for Java Program. i) Data members of an interface are by default final ii) An abstract class has implementations of all methods defined inside it. A) i-false, ii-false B) i-false, ii-true C) i-true, ii-false D) i-true, ii-true

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