Algorithms

?
Define Abstraction
Removing unnecessary detail from a problem
1 of 6
Define Decomposition
Breaking down larger problems into sub problems which become small manageable tasks
2 of 6
How many items need to be examined to find the item "Tiger:Monkey,Chicken,Ape,Tiger,Baboon,Koala
4
3 of 6
Advantages of Binary Search
Faster than Linear Search,Easy to implement
4 of 6
Disadvantages of Merge Sort
Complex,Uses a lot of memory
5 of 6
Conduct a linear search for the following terms: 3,8,7,2,9,12,4,19,100
2,3,4,7,8,9,12,19,100
6 of 6

Other cards in this set

Card 2

Front

Define Decomposition

Back

Breaking down larger problems into sub problems which become small manageable tasks

Card 3

Front

How many items need to be examined to find the item "Tiger:Monkey,Chicken,Ape,Tiger,Baboon,Koala

Back

Preview of the front of card 3

Card 4

Front

Advantages of Binary Search

Back

Preview of the front of card 4

Card 5

Front

Disadvantages of Merge Sort

Back

Preview of the front of card 5
View more cards

Comments

No comments have yet been made

Similar Computing resources:

See all Computing resources »See all Computer systems resources »