100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Previously searched by you
Previously searched by you
logo
Summary IB Computer Science HL Notes: Unleash Your Potential £7.06   Add to cart
Quickly navigate to
Preview
  2.  
  3. The University Of Birmingham (UBir)
  4.  
  5. IB computer science HL

Summary

Summary IB Computer Science HL Notes: Unleash Your Potential
 3 views  0 purchase

For IB Computer Science Higher Level (HL) students, our HL notes are the perfect resource to conquer the challenging aspects of the curriculum. Dive deep into advanced topics, including data structures, algorithms, and AI, all aligned with the IB Computer Science HL syllabus. These comprehensive no...

[Show more]

Preview 4 out of 31  pages

Document information

  • October 13, 2023
  • 31
  • 2022/2023
  • Summary

Subjects

Written for

All documents for this subject (6)

Seller

avatar-seller
thanatvarinkittikasemsak

Content preview

IB HL Computer Science
___

Notes


Topic 5 Abstract data structure
5.1.4 two dimensional array




Indexed by two number [x][y]

Also access value with two indexes



5.1.6 Stack

● Last in first out

, ● Pop - remove


● Push - add


● isEmpty - return true if stack is empty


● Use for chronological order and undo
● Can use depth instead of index



5.1.8 Queue



● Enqueue - add an item to the end of the queue
● Dequeue - remove and return the first item from the queue
● First in First out
● Uses for situations where order is required
● Printer queue or ticketing system

5.1.11 Static vs Dynamic

● Static size is constant
● Statis is usually a less effective usage of storage space
● Dynamic size changes with the elements
● Dynamic is associated with while loop
● Static is associated with for loop
● Dynamic uses nodes

,5.1.12 Linked list




● Each element has a node that points to the next element
● The head points to the first element
● In order to access an element, you have to follow the pointers from
the beginning
● The last node contains a null pointer

5.1.13




Changing a linked list is easier than a normal list because only the nodes have to
change

, Singly linked list

There is a node pointing to the next element



Doubly linked list

There is a node pointing to the next element and the previous element



Circular linked list

Last link points back to the first one

Can cause infinite loop

The one on the rightmost is the head.



5.1.14 - 5.1.17 Tree
● Binary and non binary tree
● Binary tree node can’t have more than 2 children
● A null pointer is an empty binary tree
● Root is the first element on top
● Leaf are nodes that have no children
● Subtree are parent and children that are a part of a bigger tree
● There are left child and right child

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller thanatvarinkittikasemsak. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for £7.06. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

77333 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy revision notes and other study material for 14 years now

Start selling
£7.06
  • (0)
  Add to cart