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

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

1 Answer

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

Related questions

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

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

Last 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

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

A compiler translates a program written in a high-level language into a) Machine language b) An algorithm c) A debugged program d) Java e) None of these

Description : A compiler translates a program written in a high-level language into a) Machine language b) An algorithm c) A debugged program d) Java e) None of these

Last Answer : a) Machine language

A compiler translates a program written in a high level language into 1) Machine Language 2) An algorithm 3) A debugged program 4) None of these

Description : A compiler translates a program written in a high level language into 1) Machine Language 2) An algorithm 3) A debugged program 4) None of these

Last Answer : 1) Machine Language

Compiling creates a(n)- 1) Program Specification 2) Algorithm 3) Executable Program 4) Subroutine

Description : Compiling creates a(n)- 1) Program Specification 2) Algorithm 3) Executable Program 4) Subroutine

Last Answer : 3) Executable Program

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

Micro-program consists of a set of microinstructions which are strings of 0s and 1s. a) True b) False

Description : Micro-program consists of a set of microinstructions which are strings of 0s and 1s. a) True b) False

Last Answer : Answer: a Explanation: The computer understands only binary language. So, the microprogram should have instructions which are in the form of 0s and 1s. Each output line of the micro-program corresponds to one control signal

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

What is the next step in program algorithm ?

Description : What is the next step in program algorithm ?

Last Answer : Answer : The next step in the program algorithm is drawing the flowchart.

___uses various symbols to represent function within program and is __ _representation: a. Flowchart, pictorial b. Algorithm, pictorial c. Pictorial, flowchart d. None of these

Description : ___uses various symbols to represent function within program and is __ _representation: a. Flowchart, pictorial b. Algorithm, pictorial c. Pictorial, flowchart d. None of these

Last Answer : a. Flowchart, pictorial

is useful to prepare detailed program documentation: a. Flowchart b. Algorithm c. Botha &b d. None of these

Description : is useful to prepare detailed program documentation: a. Flowchart b. Algorithm c. Botha &b d. None of these

Last Answer : a. Flowchart

Write a Program in ‘C’ for DDA Circle drawing algorithm

Description : Write a Program in ‘C’ for DDA Circle drawing algorithm

Last Answer : #include<stdio.h> #include<conio.h> #include<graphics.h> #include<math.h> void main() { int gdriver=DETECT,gmode,errorcode,tmp,i=1,rds; float st_x,st_y,x1,x2,y1,y2,ep; initgraph(& ... =y2; }while((y1-st_y)<ep || (st_x-x1)>ep); getch(); }

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

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

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

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

Which algorithm is used in layered Feed forward Neural Network? (A) Back propagation algorithm (B) Binary Search (C) Both(A) & (B) (D) None of the Above

Description : Which algorithm is used in layered Feed forward Neural Network? (A) Back propagation algorithm (B) Binary Search (C) Both(A) & (B) (D) None of the Above

Last Answer : (A) Back propagation algorithm

What is the significance of an algorithm to C programming?

Description : What is the significance of an algorithm to C programming?

Last Answer : Before a program can be written, an algorithm has to be created first. An algorithm provides a step by step procedure on how a solution can be derived. It also acts as a blueprint on how a program will start and end, including what process and computations are involved.

What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Description : What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Last Answer : B : Hill-Climbing

When will Hill-Climbing algorithm terminate? A : Stopping criterion met B : Global Min/Max is achieved C : No neighbour has higher value D : no criteria to terminate

Description : When will Hill-Climbing algorithm terminate? A : Stopping criterion met B : Global Min/Max is achieved C : No neighbour has higher value D : no criteria to terminate

Last Answer : C : No neighbour has higher value

What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Description : What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Last Answer : B : Hill-Climbing

A* algorithm is based on which of the following concept? A : Best-First-Search B : Breadth-First-Search C : Depth-First –Search D : Hill climbing

Description : A* algorithm is based on which of the following concept? A : Best-First-Search B : Breadth-First-Search C : Depth-First –Search D : Hill climbing

Last Answer : A : Best-First-Search

Algorihtm used for path planning is A : Dijkstra's Algorithm B : DFS Algorithm C : BFS Algorithm D : Searching Algorithm

Description : Algorihtm used for path planning is A : Dijkstra's Algorithm B : DFS Algorithm C : BFS Algorithm D : Searching Algorithm

Last Answer : A : Dijkstra's Algorithm

What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Description : What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Last Answer : B : Hill-Climbing

What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Description : What is the name of algorithm in which a loop that continually moves in the direction of increasing value – that is uphill A : Up-Hill Search B : Hill-Climbing C : Hill algorithm D : Platue climbing valley

Last Answer : B : Hill-Climbing

A mistake in an algorithm that causes incorrect results is called:a) Logical Errorb) Syntax Errorc) Procedural Errord) None of These

Description : A mistake in an algorithm that causes incorrect results is called: a) Logical Error b) Syntax Error c) Procedural Error d) None of These

Last Answer : a) Logical Error

A ______ contains specific rules and words t hat express the logical steps of an algorithm a) Programming language b) Syntax error c) Programming structure d) Logic chart e) None of these

Description : A ______ contains specific rules and words t hat express the logical steps of an algorithm a) Programming language b) Syntax error c) Programming structure d) Logic chart e) None of these

Last Answer : a) Programming language

A mistake in an algorithm that causes incorrect results is called a a) logical error b) syntax error c) procedural error d) compiler error e) None of these

Description : A mistake in an algorithm that causes incorrect results is called a a) logical error b) syntax error c) procedural error d) compiler error e) None of these

Last Answer : b) syntax error

A ...... contains specific rules and words that express the logical steps of an algorithm. 1) Programming Language 2) Programming Structure 3) Syntax 4) Logic chart

Description : A ...... contains specific rules and words that express the logical steps of an algorithm. 1) Programming Language 2) Programming Structure 3) Syntax 4) Logic chart

Last Answer : 3) Syntax

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

A* algorithm is based on (A) Breadth-First-Search (B) Depth-First –Search (C) Best-First-Search (D) Hill climbing

Description : A* algorithm is based on (A) Breadth-First-Search (B) Depth-First –Search (C) Best-First-Search (D) Hill climbing

Last Answer : (C) Best-First-Search

.Which one is used for compute the logical inference algorithm? a. Validity b.Satisfiability c. Logical equivalence d.All of these

Description : .Which one is used for compute the logical inference algorithm? a. Validity b.Satisfiability c. Logical equivalence d.All of these

Last Answer : d.All of these

Which algorithm is used to decide the path to transfer the packets from source to destination? (1) Routing (2) Pathing (3) Selecting (4) Directing

Description : Which algorithm is used to decide the path to transfer the packets from source to destination? (1) Routing (2) Pathing (3) Selecting (4) Directing

Last Answer : Routing

The Simplest CPU – scheduling algorithm is ______. (1) SJF scheduling algorithm (2) Round robin scheduling algorith (3) Multilevel scheduling algorithm (4) FCFS scheduling algorithm

Description : The Simplest CPU – scheduling algorithm is ______. (1) SJF scheduling algorithm (2) Round robin scheduling algorith (3) Multilevel scheduling algorithm (4) FCFS scheduling algorithm

Last Answer : FCFS scheduling algorithm

Which one of the following converts assembly language into machine language ? (1) Algorithm (2) Interpreter (3) Compiler (4) Assembler

Description : Which one of the following converts assembly language into machine language ? (1) Algorithm (2) Interpreter (3) Compiler (4) Assembler

Last Answer : Assembler

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.

Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm? (A) Queues have different priorities. (B) Each queue may have different scheduling algorithm (C) Processes are permanently assigned to a queue (D) This algorithm can be configured to match a specific system under design

Description : Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm? (A) Queues have different priorities. (B) Each queue may have different scheduling algorithm (C) ... to a queue (D) This algorithm can be configured to match a specific system under design

Last Answer : (C) Processes are permanently assigned to a queue

Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal binary tree with given weights. (d) Topological sorting provides a labelling such that the parents have larger labels than their children. Which of the above statements are true ? (A) (a) and (b) (B) (c) and (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)

Description : Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal ... (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)

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

The only deliverable work product for a successful project is the working program. a) True b) False

Description : The only deliverable work product for a successful project is the working program. a) True b) False

Last Answer : b) False

An expert system is a computer program that contains some of the subject-specific knowledge of one or more human experts. a) True b) False

Description : An expert system is a computer program that contains some of the subject-specific knowledge of one or more human experts. a) True b) False

Last Answer : a) True

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

State true or false for Java Program. i) All class variables are instance variables ii) All protected methods are friendly methods A) i-false, ii-false B) i-false, ii-true

Description : State true or false for Java Program. i) All class variables are instance variables ii) All protected methods are friendly methods A) i-false, ii-false B) i-false, ii-true

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