Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

ALGORITHM AND COMPLEXITY > ALGORITHM AND COMPLEXITY > Flashcards

ALGORITHM AND COMPLEXITY Flashcards

1
Q

IT SHOULD TERMINATE AFTER A FINITE TIME

A

FINITE-NESS

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

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

A

LANGUAGE INDEPENDENT

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

CONTAINS A FUNDAMENTAL OPERATOR MUST ACCEPT ZERO OR MORE INPUTS

A

INPUT

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

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

A

ALGORITHM

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

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

A

ALGORITHM IN COMPUTER SCIENCE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

USED TO SOLVE MATHEMATICAL PROBLEMS

A

ALGORITHM IN MATHEMATICS

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

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

A

ALGORITHM IN ARTIFICIAL INTELLIGENCE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

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

A

ALGORITHM IN OPERATION RESEARCH

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

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

A

ALGORITHM IN DATA SCIENCE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

IS A FINITE SET OF INSTRUCTION

A

ALGORITHM

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

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

A

TRUE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

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

A

ALGORITHM

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

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

A

TRUE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

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

A

TRUE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

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

A

FALSE(THEY HELP)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

PLAY A CRUCIAL ROLE IN VARIOUS FIELDS AND HAVE MANY APPLICATIONS

A

ALGORITHM

17
Q

MUST LEAD TO ONLY ONE THING

A

CLEAR AND UNAMBIGOUS

18
Q

IT SHOULD PRODUCE AT LEAST ONE OUTPUT

A

WELL-DEFINED OUTPUTS

19
Q

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

A

FEASIBLE

20
Q

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

A

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

21
Q

IT MAY OR MAY NOT TAKE INPUT

A

WELL-DEFINED INPUTS

22
Q

CONTAINS A FUNDAMENTAL OPERATOR MUST ACCEPT ZERO OR MORE INPUTS

A

INPUT

23
Q

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

A

DEFINITENESS

24
Q

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.

A

EFFECTIVENESS

25
Q

GIVE THE 10 TYPES OF ALGORITHM

A

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

26
Q

IT IS THE SIMPLEST APPROACH FOR A PROBLEM

A

BRUTE FORCE ALGORITHM

27
Q

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

A

RECURSIVE ALGORITHM

28
Q

BUILDS THE SOLUTION BY SEARCHING AMONG ALL POSSIBLE SOLUTIONS

A

BACKTRACKING ALGORITHM

29
Q

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

A

SEARCHING ALGORITHM

30
Q

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

A

SORTING ALGORITHM

31
Q

A KEY IS ASSIGNED TO SPECIFIC DATA

A

HASHING ALGORITHM

32
Q

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

A

DIVIDE AND CONQUER ALGORITHM

33
Q

DIVIDE AND CONQUER ALGORITHM STEPS

A

DIVIDE
SOLVE
COMBINE

34
Q

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

A

GREEDY ALGORITHM

35
Q

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

A

DYNAMIC PROGRAMMING ALGORITHM

36
Q

use a random number so it gives immediate benefit.

A

RANDOMIZED ALGORITHM

37
Q

Run time increases at the same pace as the input

A

O(n) Linear time

ALGORITHM AND COMPLEXITY (1 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions