This page will cover the following (a) HTML, CSS and Javascript (b) Search engine indexing (c) PageRank Algorithm (d) Server and client side processing Throughout this post the following example is used: Harry Styles Together Together Tour Setlist Viewer Which is available here: https://drive.google.com/drive/folders/101mGdi8SFa3Wcn1U66WKqUPyRT-TSNwb?usp=sharing HTML HTML is Hyper Text Markup Language. It's used to define the structure and elements on a web page. Elements are

This post covers the following topics: Linked Lists Linked Lists Linked lists are the most common type of dynamic data structure, as they are dynamic they can grow to any size that is required. Their size isn't declared at the beginning on the program. Linked lists are made up of nodes and pointers, each node stores the pointer to the next node, this makes them extremely flexible and powerful data structured. They can implement all types of data stores. Here's an example of a

This post covers the following topics: Stacks Queues Stacks (LIFO) A stack handles linear lists of data, stacks follow Last-In First-Out (LIFO) . This means that the most recent piece of data to be placed onto the stack is the first piece to be taken off of it. Example of Last-In First-Out (Stack) To add data to a stack it's pushing to the stack and to take data off the stack it's popping . Stacks can be implemented easily using an array or linked list and a variable to poin

This post covers the following topics: Static vs Dynamic Arrays Tuples Records Static vs Dynamic In static data structures the size of the structure is set at the beginning of the program when the data structure is created, the size cannot be changed. This makes the data structures easier to implement but they are more limited. In dynamic data structures there is no size limit and they can expand and shrink as needed. This does make them more complex than static data structur

This post covers the following topics: Database Table Record Field Entities and relationships Use of keys: primary key, foreign key, secondary key, composite key Database tools: query, form, report Methods of importing external data into a database Flatfile vs relational database Data redundancy Types of validations Validation vs verification DBMS (database management system) ERD (Entity Relationship Modelling - degrees of relationships, issues with M:M relationships and how

Scheduling is how and when a process (can be referred to as a "job") is swapped in and out of the CPU (given time slices) to allow for multitasking. A schedular handles this, it manages which process to execute next and it manages the length of time the next process can execute for. The ready queue is where all processes are kept, then a process is removed from the queue and enteres a running state where the CPU is executing it. A process can either finish execution and leav