SOFTWARE

SOFTWARE

As you are aware, computer cannot do anything on its own. It is the user who instructs computer; what to do, how to do and when to do. In order…
Inside a computer

Inside a computer

Have you ever looked inside a computer case, or seen pictures of the inside of one? The small parts may look complicated, but the inside of a computer case isn't…
2-3 Trees

2-3 Trees

The 2-3 tree is also a search tree like the binary search tree, but this tree tries to solve the problem of the unbalanced tree. Imagine that you have a…
Queues

Queues

Queues are data structures that, like the stack, have restrictions on where you can add and remove elements. To understand a queue, think of a cafateria line: the person at…
Stacks

Stacks

Stacks are a type of list in which all inserts and removals happen at one end. Imagine a normal stack of cafeteria trays: to get one, you take it off…
The Binary Search Algorithm

The Binary Search Algorithm

All right, so you've read about sorting algorithms, and now you've got a sorted array. Just having a sorted array, however, doesn't do anything for you unless you are going…
Data Trees: Introduction

Data Trees: Introduction

It is recommended that you read the essay on linked lists before proceeding to this essay. Trees are data structures organized into a group of interconnected nodes that form leaves…
Sorting Algorithms: Introduction

Sorting Algorithms: Introduction

Sorting has been analyzed by computer scientists for decades, and thus it is an ideal subject to begin with when studying computer science. Sorting is done with algorithms, which are…
Lists and Arrays: Introduction

Lists and Arrays: Introduction

Lists and Array are the most basic types of data structures. They allow the programmer to organize data into more sophisticated patterns than the simple variables would allow. Almost all…