Search for notes by fellow students, in your own course and all over the country.

Browse our notes for titles which look like what you need, you can preview any of the notes via a sample of the contents. After you're happy these are the notes you're after simply pop them into your shopping cart.

My Basket

You have nothing in your shopping cart yet.

Title: IB Computer Science HL Topic 4 Notes
Description: Notes for IB Comp Sci Topic 4.

Document Preview

Extracts from the notes are below, to see the PDF you'll receive please use the links above




Thinking concurrently is solving a problem by concurrently (simultaneously) solving different parts of the
problem and then bringing them back together

Advantages of concurrent processing:
- Increases computation speed
- Increases complexity of programming language and hardware (machinery and communication among
machines)
- Reduces complexity of working with array operations within loops, of performing matrix multiplication,
of conducting parallel searches in databases, and of sorting or merging files
...
1
...


• Abstraction is the hiding of complex Abstraction is the hiding of complex details from users/clients who do not need to know about them
...
g
...
1
...


Thinking abstractly is selecting the pieces of information that are relevant to solving the problem
...
1
...


Example of abstraction:
A man might be interested in the specific tree that he carved his name in
...


4
...
20 Distinguish between a
real-world entity and its
abstraction
...
2 Connecting computational thinking and program design
7:03 PM

4
...

In externally assessed components questions will be presented using flow charts and/or pseudocode as outlined in the
approved notation sheet
...


Students must be given the opportunity to convert algorithms into working code that is executed and tested
...

Topic

Class Notes

4
...
1 Describe the characteristics •
of standard algorithms on linear
arrays
...

Binary Search works by comparing the target value to the middle element of a sorted array
...

Bubble Sort is a sorting algorithm that searches through a list, compares each pair of adjacent items
and swaps them if they are in the wrong order
...


Selection Sort divides the list into two parts: the items that are already sorted, and the items
already sorted
...

4
...
2 Outline the standard
operations of collections
...
g
...

Queue
Order is important
Duplicate elements are allowed
Stack
Set
Order isn't important
Duplicate elements are NOT allowed
Multi-set
Order isn't important
Duplicate elements are allowed
Standard operations
addItem()
getN
Title: IB Computer Science HL Topic 4 Notes
Description: Notes for IB Comp Sci Topic 4.