Flashcards
AQA computer science part 2
Cards in this deck (7)
- 1What is Reverse Polish Notation (RPN) used for?It eliminates the need of brackets in sub-expressions and it Is used in interpreters that are based on a stack.
- 2What order/precedence does converting from infix to RPN have (highest to lowest)?equals, open bracket, plus normal minus closed bracket, multiple divide, exponents , unary minus
- 3How do you convert from infix to RPN?Assign all operands from left to right with numbers and then assign the operators in order of highest precedence. Unless brackets are present.
- 4What is linear search and what is the time complexity?It is a searching algorithm which searches every element one by one until it is found, or no elements are left to search. Its time complexity is O(n).
- 5What is binary search and what is the time complexity?It is a searching algorithm which requires a list to be sorted. It selects the middle element and if it is the item being searched the algorithm terminates else it removes the half of the list which is which doesn’t meet the criteria. The process is repeated until no element is left or it is found. Its time complexity is O(log2n).
- 6What is bubble sort and what is the time complexity?It is a sorting algorithm which sequentially compares each item in a line. Its time complexity is O(n2). It is a particularly inefficient sorting method.
- 7What is merge sort and what is the time complexity?It is a sorting algorithm which divides the list into its individual elements and then recombines them in order by comparing them. Its time complexity is O(nlogn).
Information
- Description
- A level Computer Science Flashcards on AQA computer science part 2, created by Elliot Smith on 29/05/2018.
- Created by
- Elliot Smith
- Views
- 1
- Rating