The mean-end analysis process centers around the detection of differences between the current state and the goal state. Once such a difference is isolated, an operator that can reduce the difference must be found. But perhaps that operator cannot be applied to the current state. So a sub-problem of getting to a state in which it can be applied is set up. The kind of backward chaining in which operators are selected and then sub goals are set up to establish the precondition of operators is called (A) backward planning (B) goal stack planning (C) operator subgoaling (D) operator overloading

The mean-end analysis process centers around the detection of differences between the current state and the goal state. Once such a difference is isolated, an operator that can reduce the difference must be found. But perhaps that operator cannot be applied to the current state. So a sub-problem of getting to a state in which it can be applied is set up. The kind of backward chaining in which operators are selected and then sub goals are set up to establish the precondition of operators is called (A) backward planning (B) goal stack planning (C) operator subgoaling (D) operator overloading
by

1 Answer

Answer :

(C) operator subgoaling
by

Related questions

State True or False. i) While overloading operators new operator can be overloaded. ii) The binary operator such as +, -, * and must explicitly return a value. A) True, True B) True, False C) False, True D) False, False

Description : State True or False. i) While overloading operators new operator can be overloaded. ii) The binary operator such as +, -, * and must explicitly return a value. A) True, True B) True, False C) False, True D) False, False

Last Answer : C) False, True

Forward chaining systems are ............. where as backward chaining systems are ................ (A) Data driven, Data driven (B) Goal driven, Data driven (C) Data driven, Goal driven (D) Goal driven, Goal driven

Description : Forward chaining systems are ............. where as backward chaining systems are ................ (A) Data driven, Data driven (B) Goal driven, Data driven (C) Data driven, Goal driven (D) Goal driven, Goal driven

Last Answer : (C) Data driven, Goal driven 

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

Reasoning strategies used in expert systems include ............... (A) Forward chaining, backward chaining and problem reduction (B) Forward chaining, backward chaining and boundary mutation (C) Forward chaining, backward chaining and back propagation (D) Backward chaining, problem reduction and boundary mutation

Description : Reasoning strategies used in expert systems include ............... (A) Forward chaining, backward chaining and problem reduction (B) Forward chaining, backward chaining and boundary ... chaining, backward chaining and back propagation (D) Backward chaining, problem reduction and boundary mutation

Last Answer : (A) Forward chaining, backward chaining and problem reduction

Some of the C++ operators cannot overloaded which are i) Member access operators (. And .*) ii) Conditional operator (? :) iii) Scope resolution operator (: :) iv) Size operator (sizeof) A) only i, ii and iii B) only ii, iii and iv C) only ii and iv D) All i, ii, iii and iv

Description : Some of the C++ operators cannot overloaded which are i) Member access operators (. And .*) ii) Conditional operator (? :) iii) Scope resolution operator (: :) iv) Size operator (sizeof) A) only i, ii and iii B) only ii, iii and iv C) only ii and iv D) All i, ii, iii and iv

Last Answer : D) All i, ii, iii and iv

Which algorithm will work backward from the goal to solve a problem? a) Forward chaining b) Backward chaining c) Hill-climb algorithm d) None of the mentioned

Description : Which algorithm will work backward from the goal to solve a problem? a) Forward chaining b) Backward chaining c) Hill-climb algorithm d) None of the mentioned

Last Answer : b) Backward chaining

Forward chaining systems are _____________ where as backward chaining systems are ___________ a) Goal-driven, goal-driven b) Goal-driven, data-driven c) Data-driven, goal-driven d) Data-driven, data-driven

Description : Forward chaining systems are _____________ where as backward chaining systems are ___________ a) Goal-driven, goal-driven b) Goal-driven, data-driven c) Data-driven, goal-driven d) Data-driven, data-driven

Last Answer : c) Data-driven, goal-driven

In the illustration, if one of the devices labeled 'TURB' should fail the ___________. EL-0003 A. device labeled 'EXC' will drive the alternator B. device labeled 'BKR' for that alternator should automatically open because of the reverse power relay C. operator must open all the devices labeled 'BKRS' to reduce the load on the remaining turbo-alternator D. emergency generator should automatically start and be placed on line to supply emergency load centers

Description : In the illustration, if one of the devices labeled 'TURB' should fail the ___________. EL-0003 A. device labeled 'EXC' will drive the alternator B. device labeled 'BKR' for that ... -alternator D. emergency generator should automatically start and be placed on line to supply emergency load centers

Last Answer : Answer: B

Which problem can frequently occur in backward chaining algorithm? a) Repeated states b) Incompleteness c) Complexity d) Both Repeated states & Incompleteness

Description : Which problem can frequently occur in backward chaining algorithm? a) Repeated states b) Incompleteness c) Complexity d) Both Repeated states & Incompleteness

Last Answer : d) Both Repeated states & Incompleteness

Which of the following statements is correct? (A) Every class containing abstract method must not be declared abstract. (B) Abstract class cannot be directly initiated with ‘new’ operator. (C) Abstract class cannot be initiated. (D) Abstract class contains definition of implementation.

Description : Which of the following statements is correct? (A) Every class containing abstract method must not be declared abstract. (B) Abstract class cannot be directly initiated with ‘new’ operator. (C) Abstract class cannot be initiated. (D) Abstract class contains definition of implementation.

Last Answer : Answer: B,C

…………… can be defined as most recent and perhaps the most comprehensive technique for solving computer problems. A) System Analysis B) System Data C) System Procedure D) System Record

Description : …………… can be defined as most recent and perhaps the most comprehensive technique for solving computer problems. A) System Analysis B) System Data C) System Procedure D) System Record

Last Answer : A) System Analysis

What arithmetic operators cannot be used with strings ? a) + b) * c) – d) All of the mentioned

Description : What arithmetic operators cannot be used with strings ? a) + b) * c) – d) All of the mentioned

Last Answer : c) –

Which of the following operators cannot be overloaded in C+ + ? (A) * (B) += (C) == (D) ::

Description : Which of the following operators cannot be overloaded in C+ + ? (A) * (B) += (C) == (D) ::

Last Answer : (D) ::

Which of the following operators cannot be overloaded in C/C++? (1) Bitwise right shift assignment (2) Address of (3) Indirection (4) Structure reference

Description : Which of the following operators cannot be overloaded in C/C++? (1) Bitwise right shift assignment (2) Address of (3) Indirection (4) Structure reference

Last Answer : Answer: 4

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

…………. Is the process of creating new classes, called derived classes from existing classes called base class. A) Inheritance B) Encapsulation C) Polymorphism D) Overloading

Description : …………. Is the process of creating new classes, called derived classes from existing classes called base class. A) Inheritance B) Encapsulation C) Polymorphism D) Overloading

Last Answer : A) Inheritance

There are primarily two modes for an inference engine: forward chaining and backward chaining. a) True b) False

Description : There are primarily two modes for an inference engine: forward chaining and backward chaining. a) True b) False

Last Answer : a) True

In a backward chaining system you start with the initial facts, and keep using the rules to draw new conclusions (or take certain actions) given those facts. a) True b) False

Description : In a backward chaining system you start with the initial facts, and keep using the rules to draw new conclusions (or take certain actions) given those facts. a) True b) False

Last Answer : b) False

Which algorithm are in more similar to backward chaining algorithm? a) Depth-first search algorithm b) Breadth-first search algorithm c) Hill-climbing search algorithm d) All of the mentioned

Description : Which algorithm are in more similar to backward chaining algorithm? a) Depth-first search algorithm b) Breadth-first search algorithm c) Hill-climbing search algorithm d) All of the mentioned

Last Answer : a) Depth-first search algorithm

What will backward chaining algorithm will return? a) Additional statements b) Substitutes matching the query c) Logical statement d) All of the mentioned

Description : What will backward chaining algorithm will return? a) Additional statements b) Substitutes matching the query c) Logical statement d) All of the mentioned

Last Answer : b) Substitutes matching the query

Which is mainly used for automated reasoning? a) Backward chaining b) Forward chaining c) Logic programming d) Parallel programming

Description : Which is mainly used for automated reasoning? a) Backward chaining b) Forward chaining c) Logic programming d) Parallel programming

Last Answer : c) Logic programming

Define backward chaining.

Description : Define backward chaining.

Last Answer : This algorithm works backward from the goal, chaining through rules to find known facts that support the proof.

What is the difference between function overloading and function overriding?

Description : What is the difference between function overloading and function overriding?

Last Answer : A: In function overloading only the function name is same but function signature (list of parameters) is different, whereas, in function overriding both the function name as well as function ... is an example of static polymorphism, whereas, function overriding is an example of dynamic polymorphism.

Point out the correct statement. a) Google’s cloud includes perhaps some 10 data centers worldwide b) Flipkart.com’s infrastructure was built to support elastic demand so the system could accommodate peak traffic c) Data centers have been sited to optimize the overall system latency d) All of the mentioned

Description : Point out the correct statement. a) Google's cloud includes perhaps some 10 data centers worldwide b) Flipkart.com's infrastructure was built to support elastic demand so the system could accommodate ... ) Data centers have been sited to optimize the overall system latency d) All of the mentioned

Last Answer : Data centers have been sited to optimize the overall system latency

................... are applied throughout the software process. (A) Framework activities (B) Umbrella activities (C) Planning activities (D) Construction activities

Description : ................... are applied throughout the software process. (A) Framework activities (B) Umbrella activities (C) Planning activities (D) Construction activities 

Last Answer : (B) Umbrella activities

State any four rules for operator overloading.

Description : State any four rules for operator overloading.

Last Answer : Rules for operator overloading: 1. Only existing operators can be overloaded. New operators cannot be created. 2. The overloaded operator must have at least one operand that is of user defined type. 3. ... * and / must explicitly return a value. They must not attempt to change their own arguments. 

.................. allows to create classes which are derived from other classes, so that they automatically include some of its "parent's" members, plus its own members. (A) Overloading (B) Inheritance (C) Polymorphism (D) Encapsulation

Description : .................. allows to create classes which are derived from other classes, so that they automatically include some of its "parent's" members, plus its own members. (A) Overloading (B) Inheritance (C) Polymorphism (D) Encapsulation 

Last Answer : (B) Inheritance

The marketing control process consists of A)establishing goals, market scanning, and market share analysis. B)establishing standards, evaluating performance, and reducing the differences between desired and actual performance. C)establishing goals and measuring performance. D)setting objectives, implementing strategies, and reducing the differences between desired and actual performance.

Description : The marketing control process consists of A)establishing goals, market scanning, and market share analysis. B)establishing standards, evaluating performance, and reducing the differences ... objectives, implementing strategies, and reducing the differences between desired and actual performance.

Last Answer : B)establishing standards, evaluating performance, and reducing the differences between desired and actual performance.

Which of the following operates cannot be overloaded? i) Size of operator (sizeof) ii) Scope resolution Operator iii) Conditional operator (?:) iv) Assignment Operator (=) A) i, ii, iii only B) ii, iii, iv only C) i, iii, iv only D) all i, ii, iii, iv

Description : Which of the following operates cannot be overloaded? i) Size of operator (sizeof) ii) Scope resolution Operator iii) Conditional operator (?:) iv) Assignment Operator (=) A) i, ii, iii only B) ii, iii, iv only C) i, iii, iv only D) all i, ii, iii, iv

Last Answer : A) i, ii, iii only

The map colouring problem can be solved using which of the following technique? (A) Means-end analysis (B) Constraint satisfaction (C) AO* search (D) Breadth first search

Description : The map colouring problem can be solved using which of the following technique? (A) Means-end analysis (B) Constraint satisfaction (C) AO* search (D) Breadth first search

Last Answer : (B) Constraint satisfaction

What is function overloading and operator overloading?

Description : What is function overloading and operator overloading?

Last Answer : Function overloading: C++ enables several functions of the same name to be defined, as long as these functions have different sets of parameters (at least as far as their types are ... add anything fundamental to the language (but they can improve understandability and reduce maintenance costs).

Write a program for overloading of ++unary operator for inch to feet conversion. 12 inch = 1 feet.

Description : Write a program for overloading of ++unary operator for inch to feet conversion. 12 inch = 1 feet.

Last Answer : #include #include class abc { int i,f; public: abc(int f1,int i1) { f=f1; i=i1; } void operator ++() {  while(i>11)  {  f++;  i=i-12;  }  cout

Use the concept of operator overloading to overload unary ‘-‘ operator to negate value of variables.

Description : Use the concept of operator overloading to overload unary ‘-‘ operator to negate value of variables.

Last Answer : # include <iostream.h> #include<conio.h> class unary { int x, y, z; public: void getdata (int a, int , int c); void display (void); void operator - (); // overload unary minus. }; ... u. display ( ) ; -u; cout<< " u : " ; u. display ( ) ; }

Refer the points as listed below: (a) What are the operator precedence rules ? (b) What are the operator associativity rules ? (c) What is the order of operand evaluation ? (d) Are there restrictions on operand evaluation side effects ? Which of the above must be considered as primary design issues for arithmetic expressions ? (A) (a), (b) and (c) (B) (a), (c) and (d) (C) (a), (b) and (d) (D) (a), (b), (c) and (d)

Description : Refer the points as listed below: (a) What are the operator precedence rules ? (b) What are the operator associativity rules ? (c) What is the order of operand evaluation ? (d) Are there restrictions on operand evaluation side effects ? ... (d) (C) (a), (b) and (d) (D) (a), (b), (c) and (d)

Last Answer : (D) (a), (b), (c) and (d)

Which of the following differentiates between overloaded functions and overridden functions ? (A) Overloading is a dynamic or runtime binding and overridden is a static or compile time binding. (B) Overloading is a static or compile time binding and overriding is dynamic or runtime binding. (C) Redefining a function in a friend class is called overloading, while redefining a function in a derived class is called as overridden function. (D) Redefining a function in a derived class is called function overloading, while redefining a function in a friend class is called function overriding.

Description : Which of the following differentiates between overloaded functions and overridden functions ? (A) Overloading is a dynamic or runtime binding and overridden is a static or compile time binding. ... function overloading, while redefining a function in a friend class is called function overriding.

Last Answer : (B) Overloading is a static or compile time binding and overriding is dynamic or runtime binding.

……………. Is a pile in which items are added at one end and removed from the other. A) Stack B) Queue C) List D) None of the above

Description : ……………. Is a pile in which items are added at one end and removed from the other. A) Stack B) Queue C) List D) None of the above

Last Answer : B) Queue

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

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

The Unix Kernel maintains two key data structures related to processes, the process table and the user structure. Which of following information is not the part of user structure? (A) File descriptor table (B) System call state (C) Scheduling parameters (D) Kernel stack

Description : The Unix Kernel maintains two key data structures related to processes, the process table and the user structure. Which of following information is not the part of user structure? (A) File descriptor table (B) System call state (C) Scheduling parameters (D) Kernel stack

Last Answer : (C) Scheduling parameters

In UNIX operating system, when a process creates a new process using the fork() system call, which of the following state is shared between the parent process and child process? (A) Heap (B) Stack (C) Shared memory segments (D) Both Heap and Stack

Description : In UNIX operating system, when a process creates a new process using the fork() system call, which of the following state is shared between the parent process and child process? (A) Heap (B) Stack (C) Shared memory segments (D) Both Heap and Stack

Last Answer : (C) Shared memory segments 

Which of the following is true about Java. A) Java does not support overloading. B) Java has replaced the destructor function of C++ C) There are no header files in Java. D) All of the above.

Description : Which of the following is true about Java. A) Java does not support overloading. B) Java has replaced the destructor function of C++ C) There are no header files in Java. D) All of the above.

Last Answer : D) All of the above

………… enable us to hide, inside the object, both the data fields and the methods that act on that data. A) Encapsulation B) Polymorphism C) Inheritance D) Overloading

Description : ………… enable us to hide, inside the object, both the data fields and the methods that act on that data. A) Encapsulation B) Polymorphism C) Inheritance D) Overloading

Last Answer : A) Encapsulation

Which of the following correctly describes overloading of functions? (A) Virtual polymorphism (B) Transient polymorphism (C) Ad-hoc polymorphism (D) Pseudo polymorphism

Description : Which of the following correctly describes overloading of functions? (A) Virtual polymorphism (B) Transient polymorphism (C) Ad-hoc polymorphism (D) Pseudo polymorphism

Last Answer : (C) Ad-hoc polymorphism

What is the problem space of means-end analysis? a) An initial state and one or more goal states b) One or more initial states and one goal state c) One or more initial states and one or more goal state d) One initial state and one goal state

Description : What is the problem space of means-end analysis? a) An initial state and one or more goal states b) One or more initial states and one goal state c) One or more initial states and one or more goal state d) One initial state and one goal state

Last Answer : a) An initial state and one or more goal states

Once the project is approved and moves into the planning stage, what happens in the next phase of the project life cycle?Select one: a. Agreements for risk sharing need to be concluded. b. The total risk on the project typically reduces as activities are performed without loss. c. Risks must be weighed against the potential benefit of the project’s success in order to decide if the project should be chosen. d. Risks are identified with each major group of activities. e. A risk response plan can be used to identify increasing levels of detailed risk analysis

Description : Once the project is approved and moves into the planning stage, what  happens in the next phase of the project life cycle? Select one: a. Agreements for risk sharing need to be concluded. ... activities. e. A risk response plan can be used to identify increasing levels of detailed risk analysis

Last Answer : d. Risks are identified with each major group of activities.

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