Computer Science

  While going through the various data structures in a previous post, I briefly touched on what an tree data structure is, on which I wanted to dedicate a separate post for. This is not as easy as array data structures (not that difficult to understand though), so bear with me through this series of […]

  An associative array, dictionary or map in computer science is a collection of data in the form of key-value pairs. In each collection, there is a unique key that is associated with a value. The idea is that we can find a specific value directly by its unique key. This provides faster access times […]

  Stacks and Queues are two very commonly used dynamic data structures that provide us with a unique way of handling data. The usage of these types of data structures varies and depends on the problem as all other tools in software engineering. Let’s get more deeply into each of these data structures to understand […]

  What is an array? An array is a contiguous data structure of a predefined size where elements are adjacent to each other. Each element on this data structure is a variable we store values to. The entire array is ultimately a collection of these variables. Arrays can be one-dimensional, called vectors, as well as […]

  Why use Linked List As I briefly mentioned in an earlier post on data structures, arrays have some disadvantages such as, not being flexible in terms of extending or reducing its size (because it’s a static data structure) which linked lists address.   What is a Linked List An linked list is a dynamic […]

  What is a data structure? In computer science, data structure is how we organise a collection of data in computer memory so that we can use them efficiently. Two main characteristics we use to describe different data structures are the relationship amongst the data and the functions that can be executed on them. Data […]