Computer Science GCSE Theory Terms

Question	Answer
Abstraction	Filtering out specific details and characteristics we don't need and gathering general details
Decomposition	Breaking down complex problems or systems into smaller parts that are more manageable and easier to understand
Pattern recognition	Finding similarities and patterns in order to solve complex problems more efficiently.
Algorithms	A list of instructions that solves the problem and ends
Sequencing	The specific order in which instructions are performed in an algorithm
Advantages of quick sort	- very quick for large sets of data - once a pivot is put in its place, it doesn't need to be compared again
Disadvantages of quick sort	- can't identify when the list is ordered - costs a lot in terms of storage

Resource summary

	Created by Raja Yasaswini Sriramoju almost 5 years ago