The characteristics of computing

The algorithms section of the course can be considered the hardest, in this document there are explanations, summaries and examples of the different algorithms and will cover: Analyzing Algorithms Time Complexity Logarithms Space Complexity Searching Algorithms Sorting Algorithms Path-Finding Algorithms.

This document can summarize the unit 2.2 in computer Science, which covers: Programming techniques Constructs Recursion Variables Integrated Development Environment Object Oriented Techniques Computational Methods

This document Contains the summary for 2.1 which contains the different elements for computational thinking, which are: Thinking Abstractly Thinking Ahead Thinking Procedurally Thinking Logically Thinking Concurrently

This document contains the summary for unit 1.5 which covers: Computer Related Legislation Data Protection Act Computer Misuse Act Regulation of Investigatory Powers Act Moral and Ethical Issues

Provides a summary needed for 1.4 of the specification which covers: Data Types Binary Hexadecimal Character Sets Data Structures Boolean Algebra

This document contains all the necessary information for Compression Encryption Hashing Databases Transactions SQL Networks LANs WANs DNS Security Client-server Peer-to-Peer