Logout

Home Topic 5 Last Next

HL extension (45 hours)

Topic 5— Abstract data structures (23 hours)

5.1 Abstract data structures (23 hours)

START  of  STAGE  F

"This will be examined at the level of diagrams and pseudocode.

Students should be able to describe the most common data structures (arrays, stacks, queues, linked lists, binary trees) and the most common data processing operations on each of the basic data structures (addition, deletion and retrieval of data, traversal, searching for a given data, sorting of data into some order).

This should be taught and connected to flow charts, pseudocode and programming in the SL/HL core.

The basic ideas and their application should be illustrated with non-computer examples. Each basic idea should then be practiced in specific algorithmic contexts using concepts drawn from flow charts, pseudocode and programming."

 

JSR Notes About Topic 5

It is very important to appreciate the degree to which you are to understand the topics of Topic 5 and how this differs from the same topics in the OOP Option. So pay very close attention to what the IB says above regarding Topic 5.

And note, in terms of order, that RECURSION is re-placed as a separate main page, since a prime exmple of it, binary trees, isn't covered until just before the end of Topic 5, and the understanding of recursion to an OOP level is necessary to fully understand it.

 

JSR Note on ADTS

It seems to be no place else, so note, here what ADTs are, in the first place. They are Abstrat Data Types, i.e. data types that are made by us as programmers, one level of abstraction up from the core of a programming language. We make them to accomplish certain specific things we wish. We build these ADTs using the programming language's basic, fundamental structures. So for us in Java, ADTs are structures made as we wish, using the primitives int, double, char etc. along with the String class, and the array data structure.

 

JSR Note on 2D Arrays as ADTs

Before getting into lists and so on you'll note that 2D Arrays are technically ADTs! This is the case since we logically make 2D arrays by using the fundamental Java structure array [ ] in a new way.