In computer science, algorithm refers to a special method useable by a computer for solution of a problem. a) True b) False

In computer science, algorithm refers to a special method useable by a computer for solution of a problem. a) True b) False
by

1 Answer

Answer :

Answer: a Explanation: The statement is true. This word algorithm refers to a special method useable by a computer for solution of a problem. The statement of the problem specifies in general terms the desired input/output relationship
by
selected

Related questions

Any algorithm is a program. a) True b) False

Description : Any algorithm is a program. a) True b) False

Last Answer : Answer: b Explanation: The statement is false. An algorithm when represented in the form of a programming language is called a program. Any program is an algorithm but the reverse is not true

Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk service are not influenced by file allocation method. (C) Caching the directories and index blocks in main memory can also help in reducing disk arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Description : Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk ... arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Last Answer : (B) The number of requests for disk service are not influenced by file allocation method.

my butternut squash got frozen outside, is it still useable?

Description : my butternut squash got frozen outside, is it still useable?

Last Answer : Need Answer

To obtain the most reliable sky wave propagation the ____ should be used. A. Lowest useable frequency (LUF). B. Maximum useable frequency (MUF). C. Optimum useable frequency (OUF). D. Critical frequency

Description : To obtain the most reliable sky wave propagation the ____ should be used. A. Lowest useable frequency (LUF). B. Maximum useable frequency (MUF). C. Optimum useable frequency (OUF). D. Critical frequency

Last Answer : C. Optimum useable frequency (OUF).

The phylum Cyanobacteria are unique because they _____. a. convert nitrogen to a useable form b. are poisonous c. photosynthesize d. have a waxy cell wall

Description : The phylum Cyanobacteria are unique because they _____. a. convert nitrogen to a useable form b. are poisonous c. photosynthesize d. have a waxy cell wall

Last Answer : c. photosynthesize

At a fuel check you have 60 US gallons (USG) of useable fuel remaining. Alternative fuel required is 12 USG. The flight time remaining is 1 hour 35 mins. What is the highest consumption rate acceptable?

Description : At a fuel check you have 60 US gallons (USG) of useable fuel remaining. Alternative fuel required is 12 USG. The flight time remaining is 1 hour 35 mins. What is the highest consumption rate acceptable?

Last Answer : 30.3 USG/HR

In the method of problem-solving, a committee is set up to find a solution. (True/False)

Description : In the method of problem-solving, a committee is set up to find a solution. (True/False)

Last Answer : Ans. True

A search algorithm takes _________ as an input and returns ________ as an output. a) Input, output b) Problem, solution c) Solution, problem d) Parameters, sequence of actions

Description : A search algorithm takes _________ as an input and returns ________ as an output. a) Input, output b) Problem, solution c) Solution, problem d) Parameters, sequence of actions

Last Answer : b) Problem, solution

A problem solving approach (algorithm) to find a satisfactory solution where finding an optimal or exact solution is impractical or impossible. Heuristic A. Algebraic B. Hyroglyphics C. Hypertext

Description : A problem solving approach (algorithm) to find a satisfactory solution where finding an optimal or exact solution is impractical or impossible. Heuristic A. Algebraic B. Hyroglyphics C. Hypertext

Last Answer : C. Hypertext

. In simplex algorithm, which method is used to deal with the situation where an infeasible starting basic solution is given? a. Slack variable b. Simplex method c. Big M Method d. None of the above

Description : . In simplex algorithm, which method is used to deal with the situation where an infeasible starting basic solution is given? a. Slack variable b. Simplex method c. Big M Method d. None of the above

Last Answer : b. Simplex method

Algorithm and Flow chart help us to A) Know the memory capacity B) Identify the base of a number system C) Direct the output to a printer D) Specify the problem completely and clearly

Description : Algorithm and Flow chart help us to A) Know the memory capacity B) Identify the base of a number system C) Direct the output to a printer D) Specify the problem completely and clearly

Last Answer : Answer : D

Algorithm and Flow chart help us to--- 1) Know the memory Capacity 2) Identify the base of a number system 3) Direct the output to a printer 4) Specify the problem completely and clearly

Description : Algorithm and Flow chart help us to--- 1) Know the memory Capacity 2) Identify the base of a number system 3) Direct the output to a printer 4) Specify the problem completely and clearly

Last Answer : 4) Specify the problem completely and clearly

is a branch of science which deals with helping machine find solution to complex to problem in a more human like a fashion. (a) Artificial intelligence (b) Internet of think (c) Embided system (d) Cyber security

Description : is a branch of science which deals with helping machine find solution to complex to problem in a more human like a fashion. (a) Artificial intelligence (b) Internet of think (c) Embided system (d) Cyber security

Last Answer : (a) Artificial intelligence

Decision Tree is a display of an algorithm. a) True b) False

Description : Decision Tree is a display of an algorithm. a) True b) False

Last Answer : a) True

Sussman Anomaly illustrates a weakness of interleaved planning algorithm. a) True b) False

Description : Sussman Anomaly illustrates a weakness of interleaved planning algorithm. a) True b) False

Last Answer : b) False

An inference algorithm that derives only entailed sentences is called sound or truth-preserving. a) True b) False

Description : An inference algorithm that derives only entailed sentences is called sound or truth-preserving. a) True b) False

Last Answer : a) True

The minimax algorithm computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The recursion proceeds all the way down to the leaves of the tree, and then the minimax values are backed up through the tree as the recursion unwinds. a) True b) False

Description : The minimax algorithm computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The ... are backed up through the tree as the recursion unwinds. a) True b) False

Last Answer : a) True

The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure. a) True b) False

Description : The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is ... also possible to go all the way to set of variable that caused failure. a) True b) False

Last Answer : a) True

A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining two parent states, rather than by modifying a single state. a) True b) False

Description : A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining two parent states, rather than by modifying a single state. a) True b) False

Last Answer : a) True

A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. a) True b) False

Description : A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. a) True b) False

Last Answer : a) True

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

Determine the correctness or otherwise of the following Assertion [a] and the Reason [r]. Assertion: Fast decoupled load flow method gives approximate load flow solution because it uses several assumptions. Reason: Accuracy depends on the power mismatch vector tolerance. a) Both [a] and [r] are true and [r] is the correct reason for [a]. b) Both [a] and [r] are true and [r] is not the correct reason for [a]. c) [a] is false and [r] is true.

Description : Determine the correctness or otherwise of the following Assertion [a] and the Reason [r]. Assertion: Fast decoupled load flow method gives approximate load flow solution because it uses several assumptions. Reason: Accuracy ... the correct reason for [a]. c) [a] is false and [r] is true.

Last Answer : c) [a] is false and [r] is true

Which of the following refers to a special type of video camera used for broadcasting images on the internet: a) WebCam b) icam c) eCamera d) None of The Above

Description : Which of the following refers to a special type of video camera used for broadcasting images on the internet: a) WebCam b) icam c) eCamera d) None of The Above

Last Answer : a) WebCam

Data going into the computer is called? 1) Output 2) Algorithm 3) Input 4) Calculations 5) Flowchart

Description : Data going into the computer is called? 1) Output 2) Algorithm 3) Input 4) Calculations 5) Flowchart

Last Answer : Answer :3

CAD stands for A) Computer aided design B) Computer algorithm for design C) Computer application in design D) All of the above

Description : CAD stands for A) Computer aided design B) Computer algorithm for design C) Computer application in design D) All of the above

Last Answer : Answer : A

Which one from the following is false ? (A) LALR parser is Bottom - Up parser (B) A parsing algorithm which performs a left to right scanning and a right most deviation is RL (1). (C) LR parser is Bottom - Up parser. (D) In LL(1), the 1 indicates that there is a one - symbol look - ahead.

Description : Which one from the following is false ? (A) LALR parser is Bottom - Up parser (B) A parsing algorithm which performs a left to right scanning and a right most deviation is RL (1). (C) LR parser is Bottom - Up parser. (D) In LL(1), the 1 indicates that there is a one - symbol look - ahead.

Last Answer : (B) A parsing algorithm which performs a left to right scanning and a right most deviation is RL (1).

Which of the following special cases does not require reformulation of the problem in order to obtain a solution ? (A) Alternate optimality (B) Infeasibility (C) Unboundedness (D) All of the above

Description : Which of the following special cases does not require reformulation of the problem in order to obtain a solution ? (A) Alternate optimality (B) Infeasibility (C) Unboundedness (D) All of the above

Last Answer : (A) Alternate optimality 

An algorithm A is admissible if ___________ a) It is not guaranteed to return an optimal solution when one exists b) It is guaranteed to return an optimal solution when one exists c) It returns more solutions, but not an optimal one d) It guarantees to return more optimal solutions

Description : An algorithm A is admissible if ___________ a) It is not guaranteed to return an optimal solution when one exists b) It is guaranteed to return an optimal solution when one exists c) It returns more solutions, but not an optimal one d) It guarantees to return more optimal solutions

Last Answer : b) It is guaranteed to return an optimal solution when one exists

An algorithm is complete if ____________ a) It terminates with a solution when one exists b) It starts with a solution c) It does not terminate with a solution d) It has a loop

Description : An algorithm is complete if ____________ a) It terminates with a solution when one exists b) It starts with a solution c) It does not terminate with a solution d) It has a loop

Last Answer : a) It terminates with a solution when one exists

Which is used to extract solution directly from the planning graph? a) Planning algorithm b) Graphplan c) Hill-climbing search d) All of the mentioned

Description : Which is used to extract solution directly from the planning graph? a) Planning algorithm b) Graphplan c) Hill-climbing search d) All of the mentioned

Last Answer : b) Graphplan

Discuss the effect of acceleration factor in the load flow solution algorithm.

Description : Discuss the effect of acceleration factor in the load flow solution algorithm.

Last Answer : An acceleration factor is a value that can be used to speed up the convergence and reduce the number of required alteration in a Gauss Seidel method of power flow analysis .Very high or very ... trial and error load flow analysis. A generally recommended value of the acceleration factor is 1.6.

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

__________ algorithm translates a planning problem in to prepositional axioms. a) GraphPlan b) SatPlan c) Greedy d) None of the mentioned

Description : __________ algorithm translates a planning problem in to prepositional axioms. a) GraphPlan b) SatPlan c) Greedy d) None of the mentioned

Last Answer : b) SatPlan

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

Which algorithm is used to solve any kind of problem? a) Breadth-first algorithm b) Tree algorithm c) Bidirectional search algorithm d) None of the mentioned

Description : Which algorithm is used to solve any kind of problem? a) Breadth-first algorithm b) Tree algorithm c) Bidirectional search algorithm d) None of the mentioned

Last Answer : b) Tree algorithm

The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound algorithm (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm. (D) Polynomial time using backtracking algorithm.

Description : The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound algorithm (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm. (D) Polynomial time using backtracking algorithm.

Last Answer : (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm.

An all-pairs shortest-paths problem is efficiently solved using: (A) Dijkstra' algorithm (B) Bellman-Ford algorithm (C) Kruskal Algorithm (D) Floyd-Warshall algorithm

Description : An all-pairs shortest-paths problem is efficiently solved using: (A) Dijkstra' algorithm (B) Bellman-Ford algorithm (C) Kruskal Algorithm (D) Floyd-Warshall algorithm

Last Answer : (D) Floyd-Warshall algorithm

What True or false scope of practice refers to the tasks that a health care professional can legally perform as part of a specific occupation?

Description : What True or false scope of practice refers to the tasks that a health care professional can legally perform as part of a specific occupation?

Last Answer : Feel Free to Answer

Social media refers to the means of communication in virtual communities and networks.  A. True  B. False

Description : Social media refers to the means of communication in virtual communities and networks.  A. True  B. False

Last Answer : A. True

Validation refers to the set of tasks that ensure that software correctly implements a specific function. a) True b) False

Description : Validation refers to the set of tasks that ensure that software correctly implements a specific function. a) True b) False

Last Answer : Ans : b

______ is a static algorithm in which every incoming packet is sent out on every outgoing line except the one it arrives on. This method usually generates vast number of duplicate packets.. A. Flooding B. Wait and watch C. congestion D. both a and c

Description : ______ is a static algorithm in which every incoming packet is sent out on every outgoing line except the one it arrives on. This method usually generates vast number of duplicate packets.. A. Flooding B. Wait and watch C. congestion D. both a and c

Last Answer : A. Flooding

66. Which method is an iterative procedure for solving LPP in a finite number of steps? a. Simplex algorithm b. Slack variablec. Big M method d. Simplex method

Description : 66. Which method is an iterative procedure for solving LPP in a finite number of steps? a. Simplex algorithm b. Slack variable c. Big M method d. Simplex method

Last Answer : d. Simplex method

Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Description : Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Last Answer : Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

A _____ contains specific rules and words that express the logical steps of an algorithm. 1) Syntax 2) Programming structure 3) Programming language 4) Logic chart 5) None of these

Description : A _____ contains specific rules and words that express the logical steps of an algorithm. 1) Syntax 2) Programming structure 3) Programming language 4) Logic chart 5) None of these

Last Answer : Answer :3

A ______________ is diagram that depicts the flow of a program. a) Algorithm b) Hash Table c) Graph d) Flowchart

Description : A ______________ is diagram that depicts the flow of a program. a) Algorithm b) Hash Table c) Graph d) Flowchart

Last Answer : Answer: d Explanation: A flowchart is a diagram that helps us determine the flow of the program. Other options are irrelevant

When an algorithm is written in the form of a programming language, it becomes a _________ a) Flowchart b) Program c) Pseudo code d) Syntax

Description : When an algorithm is written in the form of a programming language, it becomes a _________ a) Flowchart b) Program c) Pseudo code d) Syntax

Last Answer : Answer: b Explanation: An algorithm becomes a program when it is written in the form of a programming language. Thus, any program is an algorithm

The word ____________comes from the name of a Persian mathematician Abu Ja’far Mohammed ibn-i Musa al Khowarizmi. a) Flowchart b) Flow c) Algorithm d) Syntax

Description : The word ____________comes from the name of a Persian mathematician Abu Ja’far Mohammed ibn-i Musa al Khowarizmi. a) Flowchart b) Flow c) Algorithm d) Syntax

Last Answer : Answer: c Explanation: The word algorithm comes from the name of a Persian mathematician Abu Ja’far Mohammed ibn-i Musa al Khowarizmi