OCR H446/01 – 1.4 Data types, data structures and algorithms

Posted on by Administrator Posted in H446 - Computer Science A Level (OCR)
1.4 Data types, data structures and algorithms - Overview / Checklist
1.4.1 Data Types
(a) Primitive data types, integer, real/floating point, character, string and Boolean.
(b) Represent positive integers in binary.
(c) Use of sign and magnitude and two’s complement to represent negative numbers in binary.
(d) Addition and subtraction of binary integers.
(e) Represent positive integers in hexadecimal.
(f) Convert positive integers between binary hexadecimal and denary.
(g) Representation and normalisation of floating point numbers in binary.
(h) Floating point arithmetic, positive and negative numbers, addition and subtraction.
(i) Bitwise manipulation and masks: shifts, combining with AND, OR, and XOR.
(j) How character sets (ASCII and UNICODE) are used to represent text
1.4.2 Data Structures
(a) Arrays (of up to 3 dimensions), records, lists, tuples.
(b) The following structures to store data: linked-list, graph (directed and undirected), stack, queue, tree, binary search tree, hash table.
(c) How to create, traverse, add data to and remove data from the data structures mentioned above. (NB this can be either using arrays and procedural programming or an object-oriented approach).
1.4.3 Boolean Algebra
(a) Define problems using Boolean logic.
(b) Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions.
(c) Use the following rules to derive or simplify statements in Boolean algebra: De Morgan’s Laws, distribution, association, commutation, double negation.
(d) Using logic gate diagrams and truth tables.
(e) The logic associated with D type flip flops, half and full adders.

Recommended Resources

1.4.1 Data Types

Data Types Quiz

Epoch/Unix Timestamp Converter

Binary Logic Activities

Access Rights using Binary Masks

XOR Encryption Algorithm

1.4.2 Data Structures
Linked Lists
Linked Lists

Binary Trees
Binary Trees Linked Lists Traversal of a Binary Tree Breadth-First Traversal of a Binary Tree Binary Expression Trees Binary Search Tree Implementation Prime Factor Tree Algorithm Morse Code using a Binary Tree Huffman Coding Algorithm Graphs
Graph Terminology Air-Flight Route Planner The Social Network Food Chain and Food Web London Underground Journey Planner

Hash Tables
Airport Lookup Check Chemical Elements Quiz

2D and 3D Arrays
Cinema Booking Challenge Laser Maze Game My Weekly Timetable Four in a row Challenge Noughts & Crosses Challenge Battleship Challenge Drone Display Space Invaders 2D/3D Pixel Art

Stack & Queues
Stacks and Queues using Python The Ice Cream Stack Bracket Validator (using a Stack) Reverse Polish Notation (using a Stack)

1.4.3 Boolean Algebra
Half Adders and Full Adders D-Type Flip Flop Circuits 4 bit Counter using Logic Gates Boolean Algebra Boolean Algebra using Logic Gates Using Karnaugh Maps to Simplify a Boolean Expresssion Karnaugh Map LED Dice using Logic Gates BCD to 7 Segment Display using Logic Gates

Further Reading…

Extra Resources
Investigate Key elements of the CPU using Logic Gates Circuits:
Logic Gates Tester Kit Creating Logic Gates using Transistors Fetching Data using Logic Gates Binary Decoder using Logic Gates 8-bit ALU using Logic Gates Binary Additions Using Logic Gates Comparison Operators using Logic Gates Digital Padlock Logic Gates Binary Subtractions Using Logic Gates Binary Shifters using Logic Gates Traffic Lights Controller using Logic Gates

Did you like this challenge?

Click on a star to rate it!

Average rating 4.3 / 5. Vote count: 6

No votes so far! Be the first to rate this post.

As you found this challenge interesting...

Follow us on social media!


Other challenges you may enjoy...