What is parity and majority function?

What is parity and majority function?
by

1 Answer

Answer :

Parity Function : It Returns 1 if and only if an even number of inputs are 1.

 Majority function : It Returns 1 if more than half of its inputs are 1.
by

Related questions

Which of the following is true? Single layer associative neural networks do not have the ability to: (i) perform pattern recognition (ii) find the parity of a picture (iii)determine whether two or more shapes in a picture are connected or not a) (ii) and (iii) are true b) (ii) is true c) All of the mentioned d) None of the mentioned

Description : Which of the following is true? Single layer associative neural networks do not have the ability to: (i) perform pattern recognition (ii) find the parity of a picture (iii)determine whether two or more shapes in ... ) are true b) (ii) is true c) All of the mentioned d) None of the mentioned

Last Answer : a) (ii) and (iii) are true

Which of the following is true? Single layer associative neural networks do not have the ability to: (i) perform pattern recognition (ii) find the parity of a picture (iii)determine whether two or more shapes in a picture are connected or not a) (ii) and (iii) are true b) (ii) is true c) All of the mentioned d) None of the mentioned

Description : Which of the following is true? Single layer associative neural networks do not have the ability to: (i) perform pattern recognition (ii) find the parity of a picture (iii)determine whether two or more shapes in a ... ) are true b) (ii) is true c) All of the mentioned d) None of the mentioned

Last Answer : a) (ii) and (iii) are true

When a top-level function is entered, the LISP processor does? a) It reads the function entered b) It prints the result returned by the function c) Large memory and high-speed processor d) All of the mentioned

Description : When a top-level function is entered, the LISP processor does? a) It reads the function entered b) It prints the result returned by the function c) Large memory and high-speed processor d) All of the mentioned

Last Answer : b) It prints the result returned by the function

Which of the following function returns t if the object is a number in LISP? a) (number <object>) b) (numberp <object>) c) (numericp <object>) d) (numeric <object>)

Description : Which of the following function returns t if the object is a number in LISP? a) (number ) b) (numberp ) c) (numericp ) d) (numeric )

Last Answer : b) (numberp )

In LISP, the function (minusp (-20 4 8 8 1)) returns? a) T b) F

Description : In LISP, the function (minusp (-20 4 8 8 1)) returns? a) T b) F

Last Answer : a) T

In LISP, which of the following function assigns the value 10 to the symbol a? a) (setq a 10) b) (a = b) where b = 10 c) (a = 10) (d) (setq 10 a) d) All of the mentioned

Description : In LISP, which of the following function assigns the value 10 to the symbol a? a) (setq a 10) b) (a = b) where b = 10 c) (a = 10) (d) (setq 10 a) d) All of the mentioned

Last Answer : a) (setq a 10)

In LISP, the following function (minusp (-20 4 8 8 1)) returns? a) T b) F c) NIL d) -20

Description : In LISP, the following function (minusp (-20 4 8 8 1)) returns? a) T b) F c) NIL d) -20

Last Answer : a) T

In LISP, what is the function assigns the symbol x to y? a) (setq y x) b) (set y = ‘x’) c) (setq y = ‘x’) d) (setq y ‘x’)

Description : In LISP, what is the function assigns the symbol x to y? a) (setq y x) b) (set y = ‘x’) c) (setq y = ‘x’) d) (setq y ‘x’)

Last Answer : d) (setq y ‘x’)

In LISP, the function returns t if is a CONS cell and nil otherwise ________ a) (cons ) b) (consp ) c) (eq ) d) (cous =)

Description : In LISP, the function returns t if is a CONS cell and nil otherwise ________ a) (cons ) b) (consp ) c) (eq ) d) (cous =)

Last Answer : b) (consp )

What is the name of the function in the following statement “A perceptron adds up all the weighted inputs it receives, and if it exceeds a certain value, it outputs a 1, otherwise it just outputs a 0”? a) Step function b) Heaviside function c) Logistic function d) Perceptron function

Description : What is the name of the function in the following statement “A perceptron adds up all the weighted inputs it receives, and if it exceeds a certain value, it outputs a 1, otherwise it just outputs a 0”? a) Step function b) Heaviside function c) Logistic function d) Perceptron function

Last Answer : b) Heaviside function

What is back propagation? a) It is another name given to the curvy function in the perceptron b) It is the transmission of error back through the network to adjust the inputs c) It is the transmission of error back through the network to allow weights to be adjusted so that the network can learn d) None of the mentioned

Description : What is back propagation? a) It is another name given to the curvy function in the perceptron b) It is the transmission of error back through the network to adjust the inputs c) It is the ... the network to allow weights to be adjusted so that the network can learn d) None of the mentioned

Last Answer : c) It is the transmission of error back through the network to allow weights to be adjusted so that the network can learn

Decision trees are appropriate for the problems where ___________ a) Attributes are both numeric and nominal b) Target function takes on a discrete number of values. c) Data may have errors d) All of the mentioned

Description : Decision trees are appropriate for the problems where ___________ a) Attributes are both numeric and nominal b) Target function takes on a discrete number of values. c) Data may have errors d) All of the mentioned

Last Answer : d) All of the mentioned

What will happen if the hypothesis space contains the true function? a) Realizable b) Unrealizable c) Both Realizable & Unrealizable d) None of the mentioned

Description : What will happen if the hypothesis space contains the true function? a) Realizable b) Unrealizable c) Both Realizable & Unrealizable d) None of the mentioned

Last Answer : b) Unrealizable

In LISP, the function evaluates <object> and assigns this value to the unevaluated <sconst>. a) (constant <sconst> <object>) b) (defconstant <sconst> <object>) c) (eva <sconst> <object>) d) (eva <object> <sconst>)

Description : In LISP, the function evaluates and assigns this value to the unevaluated . a) (constant ) b) (defconstant ) c) (eva ) d) (eva )

Last Answer : b) (defconstant )

In LISP, the function returns t if <integer> is even and nil otherwise ___________ a) (evenp <integer>) b) (even <integer>) c) (numeven <integer>) d) (numnevenp <integer>)

Description : In LISP, the function returns t if is even and nil otherwise ___________ a) (evenp ) b) (even ) c) (numeven ) d) (numnevenp )

Last Answer : a) (evenp )

What is meant by probability density function? a) Probability distributions b) Continuous variable c) Discrete variable d) Probability distributions for Continuous variables

Description : What is meant by probability density function? a) Probability distributions b) Continuous variable c) Discrete variable d) Probability distributions for Continuous variables

Last Answer : d) Probability distributions for Continuous variables

Where did all the facts are stored to implement store and fetch function? a) Database b) Knowledge base c) Datamart d) All of the mentioned

Description : Where did all the facts are stored to implement store and fetch function? a) Database b) Knowledge base c) Datamart d) All of the mentioned

Last Answer : b) Knowledge base

Which will be the instance of the class datalog knowledge bases? a) Variables b) No function symbols c) First-order definite clauses d) None of the mentioned

Description : Which will be the instance of the class datalog knowledge bases? a) Variables b) No function symbols c) First-order definite clauses d) None of the mentioned

Last Answer : b) No function symbols

The adjective “first-order” distinguishes first-order logic from ___________ in which there are predicates having predicates or functions as arguments, or in which one or both of predicate quantifiers or function quantifiers are permitted. a) Representational Verification b) Representational Adequacy c) Higher Order Logic d) Inferential Efficiency

Description : The adjective first-order distinguishes first-order logic from ___________ in which there are predicates having predicates or functions as arguments, or in which one or both of ... Representational Verification b) Representational Adequacy c) Higher Order Logic d) Inferential Efficiency

Last Answer : c) Higher Order Logic

A Term is either an individual constant (a 0-ary function), or a variable, or an n-ary function applied to n terms: F(t1 t2 ..tn). a) True b) False

Description : A Term is either an individual constant (a 0-ary function), or a variable, or an n-ary function applied to n terms: F(t1 t2 ..tn). a) True b) False

Last Answer : a) True

Which function is used to calculate the feasibility of whole game tree? a) Evaluation function b) Transposition c) Alpha-beta pruning d) All of the mentioned

Description : Which function is used to calculate the feasibility of whole game tree? a) Evaluation function b) Transposition c) Alpha-beta pruning d) All of the mentioned

Last Answer : a) Evaluation function

A game can be formally defined as a kind of search problem with the following components. a) Initial State b) Successor Function c) Terminal Test d) All of the mentioned

Description : A game can be formally defined as a kind of search problem with the following components. a) Initial State b) Successor Function c) Terminal Test d) All of the mentioned

Last Answer : d) All of the mentioned

What among the following constitutes to the incremental formulation of CSP? a) Path cost b) Goal cost c) Successor function d) All of the mentioned

Description : What among the following constitutes to the incremental formulation of CSP? a) Path cost b) Goal cost c) Successor function d) All of the mentioned

Last Answer : d) All of the mentioned

What are the two main features of Genetic Algorithm? a) Fitness function & Crossover techniques b) Crossover techniques & Random mutation c) Individuals among the population & Random mutation d) Random mutation & Fitness function

Description : What are the two main features of Genetic Algorithm? a) Fitness function & Crossover techniques b) Crossover techniques & Random mutation c) Individuals among the population & Random mutation d) Random mutation & Fitness function

Last Answer : a) Fitness function & Crossover techniques

What is the evaluation function in A* approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost

Description : What is the evaluation function in A* approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost

Last Answer : c) Path cost from start node to current node + Heuristic cost

What is the evaluation function in greedy approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost

Description : What is the evaluation function in greedy approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost

Last Answer : a) Heuristic function

Heuristic function h(n) is ________ a) Lowest path cost b) Cheapest path from root to goal node c) Estimated cost of cheapest path from root to goal node d) Average path cost

Description : Heuristic function h(n) is ________ a) Lowest path cost b) Cheapest path from root to goal node c) Estimated cost of cheapest path from root to goal node d) Average path cost

Last Answer : c) Estimated cost of cheapest path from root to goal node

The name “best-first search” is a venerable but inaccurate one. After all, if we could really expand the best node first, it would not be a search at all; it would be a straight march to the goal. All we can do is choose the node that appears to be best according to the evaluation function. a) True b) False

Description : The name best-first search is a venerable but inaccurate one. After all, if we could really expand the best node first, it would not be a search at all; it would be a straight march to the ... is choose the node that appears to be best according to the evaluation function. a) True b) False

Last Answer : a) True

Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion. a) Evaluation function returning lowest evaluation b) Evaluation function returning highest evaluation c) Evaluation function returning lowest & highest evaluation d) None of them is applicable

Description : Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion. a) Evaluation function returning lowest evaluation b) Evaluation function ... c) Evaluation function returning lowest & highest evaluation d) None of them is applicable

Last Answer : a) Evaluation function returning lowest evaluation

Which is used to improve the performance of heuristic search? a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) None of the mentioned

Description : Which is used to improve the performance of heuristic search? a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) None of the mentioned

Last Answer : b) Quality of heuristic function

Which function will select the lowest expansion node at first for evaluation? a) Greedy best-first search b) Best-first search c) Depth-first search d) None of the mentioned

Description : Which function will select the lowest expansion node at first for evaluation? a) Greedy best-first search b) Best-first search c) Depth-first search d) None of the mentioned

Last Answer : b) Best-first search

A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. a) True b) False

Description : A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. a) True b) False

Last Answer : a) True

The Set of actions for a problem in a state space is formulated by a ___________ a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned

Description : The Set of actions for a problem in a state space is formulated by a ___________ a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned

Last Answer : c) Successor function, which takes current action and returns next immediate state

An agent is composed of ________ a) Architecture b) Agent Function c) Perception Sequence d) Architecture and Program

Description : An agent is composed of ________ a) Architecture b) Agent Function c) Perception Sequence d) Architecture and Program

Last Answer : d) Architecture and Program

Agents behavior can be best described by ____________ a) Perception sequence b) Agent function c) Sensors and Actuators d) Environment in which agent is performing

Description : Agents behavior can be best described by ____________ a) Perception sequence b) Agent function c) Sensors and Actuators d) Environment in which agent is performing

Last Answer : b) Agent function

In LISP, the function evaluates both and is _____________ a) set b) setq c) add d) eva

Description : In LISP, the function evaluates both and is _____________ a) set b) setq c) add d) eva

Last Answer : a) set

Which of the following function returns t If the object is a symbol m LISP? a) (* <object>) b) (symbolp <object>) c) (nonnumeric <object>) d) (constantp <object>)

Description : Which of the following function returns t If the object is a symbol m LISP? a) (* ) b) (symbolp ) c) (nonnumeric ) d) (constantp )

Last Answer : b) (symbolp )

In LISP, what is the function (list-length <list>)? a) returns a new list that is equal to &lt:list> by copying the top-level element of <list> b) returns the length of <list> c) returns t if <list> is empty d) all of the mentioned

Description : In LISP, what is the function (list-length )? a) returns a new list that is equal to <:list> by copying the top-level element of b) returns the length of c) returns t if is empty d) all of the mentioned

Last Answer : b) returns the length of

Which stage of the manufacturing process has been described as “the mapping of function onto form”? a) Design b) Distribution c) Project management d) Field service

Description : Which stage of the manufacturing process has been described as “the mapping of function onto form”? a) Design b) Distribution c) Project management d) Field service

Last Answer : a) Design

Generality is the measure of _____________ a) Ease with which the method can be adapted to different domains of application b) The average time required to construct the target knowledge structures from some specified initial structures c) A learning system to function with unreliable feedback and with a variety of training examples d) The overall power of the system

Description : Generality is the measure of _____________ a) Ease with which the method can be adapted to different domains of application b) The average time required to construct the target knowledge structures ... unreliable feedback and with a variety of training examples d) The overall power of the system

Last Answer : a) Ease with which the method can be adapted to different domains of application

In LISP, the function X (x). (2x+l) would be rendered as __________ a) (lambda (x) (+(*2 x)l)) b) (lambda (x) (+1 (* 2x) c) (+ lambda (x) 1 (*2x)) d) (* lambda(x) (+2×1)

Description : In LISP, the function X (x). (2x+l) would be rendered as __________ a) (lambda (x) (+(*2 x)l)) b) (lambda (x) (+1 (* 2x) c) (+ lambda (x) 1 (*2x)) d) (* lambda(x) (+2×1)

Last Answer : a) (lambda (x) (+(*2 x)l))

When a top-level function is entered, the LISP processor do(es)? a) It reads the function entered b) It evaluates the function and the function’s operands c) It prints the results returned by the function d) All of the mentioned

Description : When a top-level function is entered, the LISP processor do(es)? a) It reads the function entered b) It evaluates the function and the function’s operands c) It prints the results returned by the function d) All of the mentioned

Last Answer : d) All of the mentioned

In LISP, the function (copy-list <list>) a) returns a new list that is equal to <list> by copying the top-level element of <list> b) returns the length of <list> c) returns t if <list> is empty d) all of the mentioned

Description : In LISP, the function (copy-list ) a) returns a new list that is equal to by copying the top-level element of b) returns the length of c) returns t if is empty d) all of the mentioned

Last Answer : a) returns a new list that is equal to by copying the top-level element of

In LISP, the function returns the list that results after the first element is removed (the rest f the list), is __________ a) car b) last c) cons d) cdr

Description : In LISP, the function returns the list that results after the first element is removed (the rest f the list), is __________ a) car b) last c) cons d) cdr

Last Answer : d) cdr

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

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

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.

Three main basic features involved in characterizing membership function are A. Intution, Inference, Rank Ordering B. Fuzzy Algorithm, Neural network, Genetic Algorithm C. Core, Support , Boundary D. Weighted Average, center of Sums, Median

Description : Three main basic features involved in characterizing membership function are A. Intution, Inference, Rank Ordering B. Fuzzy Algorithm, Neural network, Genetic Algorithm C. Core, Support , Boundary D. Weighted Average, center of Sums, Median

Last Answer : C. Core, Support , Boundary

Membership function can be thought of as a technique to solve empirical problems on the basis of A. knowledge B. examples C. learning D. experience

Description : Membership function can be thought of as a technique to solve empirical problems on the basis of A. knowledge B. examples C. learning D. experience

Last Answer : D. experience