ALGORITHM AND COMPLEXITY

Question 1

IT SHOULD TERMINATE AFTER A FINITE TIME

Answer 1

FINITE-NESS

Question 2

IT MUST BE JUST PLAIN INSTRUCTIONS THAT CAN BE IMPLEMENTED IN ANY LANGUAGE YET THE OUTPUT WILL BE THE SAME

Answer 2

LANGUAGE INDEPENDENT

Question 3

CONTAINS A FUNDAMENTAL OPERATOR MUST ACCEPT ZERO OR MORE INPUTS

Answer 3

INPUT

Question 4

A SET OF RULES TO BE FOLLOWED IN CALCULATIONS OR OTHER PROBLEM-SOLVING OPERATIONS

Answer 4

ALGORITHM

Question 5

ARE USED TO SOLVE PROBLEMS RANGING FROM SIMPLE SORTING TO COMPLEX TASKS SUCH AS ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Answer 5

ALGORITHM IN COMPUTER SCIENCE

Question 6

USED TO SOLVE MATHEMATICAL PROBLEMS

Answer 6

ALGORITHM IN MATHEMATICS

Question 7

ARE FOUNDATION OF ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING AND ARE USED TO DEVELOP INTELLIGENT SYSTEMS THAT CAN PERFORM TASKS

Answer 7

ALGORITHM IN ARTIFICIAL INTELLIGENCE

Question 8

ARE USED TO OPTIMIZE AND MAKE DECISIONS IN FIELDS SUCH AS TRANSPORTATION,LOGISTICS, AND RESOURCE ALLOCATION

Answer 8

ALGORITHM IN OPERATION RESEARCH

Question 9

ARE USSED TO ANALYZE,PROCESS, AND EXTRACT INSIGHTS FROM LARGE AMOUNTS OF DATA IN FIELDS SUCH AS MARKETING,FINANCE, AND HEALTHCARE

Answer 9

ALGORITHM IN DATA SCIENCE

Question 10

IS A FINITE SET OF INSTRUCTION

Answer 10

ALGORITHM

Question 11

TRUE/FALSE
ALGORITHMS ARE NECESSARY FOR SOLVING COMPLEX PROBLEMS EFFICIENTLY AND EFFECTIVELY

Answer 11

TRUE

Question 12

SET OF RULES TO OBTAIN THE EXPECTED OUTPUT FROM THE GIVEN INPUT

Answer 12

ALGORITHM

Question 13

TRUE/FALSE
ALGORITHMS ALSO ENABLE COMPUTERS TO PERFORM TASKS THAT BE DIFFICULT OR IMPOSSIBLE FOR HUMANS TO DO MANUALLY.

Answer 13

TRUE

Question 14

TRUE/FALSE
THEY ARE USED IN VAARIOUS FIELDS SUCH SD MATHEMATICS,COMPUTER SCIENCE,ENGINEERING,FINANCE, AND MANY OTHERS TO OPTIMIZE PROCESSES, ANALYZE DATA,MAKE PREDICTIONS AND PROVIDE SOLUTION TO THE PROBLEM

Answer 14

TRUE

Question 15

TRUE/FALSE
THEY DO`NT HELP AUTOMATE PROCESSES AND MAKE THEM MORE RELIABLE,FASTER AND EASIER TO PERFORM

Answer 15

FALSE(THEY HELP)

Question 16

PLAY A CRUCIAL ROLE IN VARIOUS FIELDS AND HAVE MANY APPLICATIONS

Answer 16

ALGORITHM

Question 17

MUST LEAD TO ONLY ONE THING

Answer 17

CLEAR AND UNAMBIGOUS

Question 18

IT SHOULD PRODUCE AT LEAST ONE OUTPUT

Answer 18

WELL-DEFINED OUTPUTS

Question 19

MUST BE SIMPLE GENERIC AND PRACTICAL SUCH THAT IT CAN BE EXECUTED WITH THE AVAILABLE RESOURCES

Answer 19

FEASIBLE

Question 20

GIVE THE 10 CHARACTERISTICS OF AN ALGORITHM (WEIN,WEOUT,CLEUN,LAIN,FINES,FEABLE,EFFNESS,DEFNESS,OPUT,IPUT)

Answer 20

-WELL-DEFINED INPUTS
-WELL-DEFINED OUTPUTS
-CLEAR AND UNAMBIGOUS
-LANGUAGE INDEPENDENT
-FINITE-NESS
-FEASIBLE
-EFFECTIVENESS
-DEFINITENESS
-OUTPUT
-INPUT

Question 21

IT MAY OR MAY NOT TAKE INPUT

Answer 21

WELL-DEFINED INPUTS

Question 22

CONTAINS A FUNDAMENTAL OPERATOR MUST ACCEPT ZERO OR MORE INPUTS

Answer 22

INPUT

Question 23

All instructions in an algorithm must be unambiguous, precise, and easy to interpret.

Answer 23

DEFINITENESS

Question 24

An algorithm must be developed by using very basic, simple, and feasible operations so that one can trace it out by using just paper and pencil.

Answer 24

EFFECTIVENESS

Question 25

GIVE THE 10 TYPES OF ALGORITHM

Answer 25

Brute Force Algorithm Recursive Algorithm Backtracking Algorithm Searching Algorithm Sorting Algorithm Hashing Algorithm Divide and Conquer Algorithm Greedy Algorithm Dynamic Programming Algorithm Randomized Algorithm

Question 26

IT IS THE SIMPLEST APPROACH FOR A PROBLEM

Answer 26

BRUTE FORCE ALGORITHM

Question 27

A PROBLEM IS BROKEN INTO SUB-PARTS AND CALLED THE SAME FUNCTION AGAIN AND AGAIN

Answer 27

RECURSIVE ALGORITHM

Question 28

BUILDS THE SOLUTION BY SEARCHING AMONG ALL POSSIBLE SOLUTIONS

Answer 28

BACKTRACKING ALGORITHM

Question 29

ARE USED FOR SEARCHING ELEMENTS OR GROUPS OF ELEMENTS FROM A PARTICULAR DATA STRUCTURE

Answer 29

SEARCHING ALGORITHM

Question 30

ARE USED TO SORT GROUPS OF DATA IN AN INCREASING OR DECREASING MANNER

Answer 30

SORTING ALGORITHM

Question 31

A KEY IS ASSIGNED TO SPECIFIC DATA

Answer 31

HASHING ALGORITHM

Question 32

breaks a problem into sub-problems, solves a single sub-problem and merges the solutions together to get the final solution.

Answer 32

DIVIDE AND CONQUER ALGORITHM

Question 33

DIVIDE AND CONQUER ALGORITHM STEPS

Answer 33

DIVIDE SOLVE COMBINE

Question 34

this type of algorithm the solution is built part by part.

Answer 34

GREEDY ALGORITHM

Question 35

uses the concept of using the already found solution to avoid repetitive calculation of the same part of the problem.

Answer 35

DYNAMIC PROGRAMMING ALGORITHM

Question 36

use a random number so it gives immediate benefit.

Answer 36

RANDOMIZED ALGORITHM

Question 37

Run time increases at the same pace as the input

Answer 37

O(n) Linear time