Posts

Showing posts from September, 2016

Featured post

Why should I learn Go?

Image
What is unique about GO language? Here are some of the advantages of GO programming language:           Code runs fast           Garbage collection           Simpler objects           Efficient concurrency Code runs faster: Before understanding why GO runs faster, let us know the process of software translation. Basically, we have three broad categories of languages:             Machine level language ·        Machine level language is a low-level language where instructions are directly executed on the CPU. Machine level instructions are small steps which are straight forward and simple (Ex: ADD, SUBTRACT, MULTIPLY ) Assembly language ·        Assembly language is similar to machine level language but a bit more specific for humans to understand. For example, 1000...

Multitasking vs Multithreading

Image
Threads - BASIC CONCEPTS Most of us are confused between multitasking and multithreading. In this post let us try to give a brief description about multitasking, Threads and multithreading. Multithreading is one of the major features of Java. What is multitasking? Before learning about multitasking we should understand “what is a process?” A process is a task which is under execution. So multiple processes running at the same time is known as multitasking. Example:  When you open a web browser and a word document at the same time, you are making the operating system to undergo multitasking. So multitasking is a method of running more than one task simultaneously. We say that both the processes are executing simultaneously but in reality the instructions are executed one at a time. Then how do we justify our statement “multitasking“? Here comes the concept of context switching. The control of execution jumps between the processes with negligible time ...

Binary Trees

Image
A data structure is said to be linear if its elements form a sequence or linear lists. Examples : ARRAYS , LINKED LISTS , STACKS , QUEUE A data structure is said to be non-linear if its elements form a hierarchical order. Here the data items are appeared at various levels. A tree is a hierarchical collection of nodes . The topmost node is known as the root of the tree. The tree has no parent node but may have child nodes . At the bottom of the tree are child nodes which have no children .Each node can have at most one link coming into it .  A tree can have any number of children . TREE TERMINOLOGIES: ROOT :  The top node in a tree is known as root or the node with no parent is known as a tree or the node whose indegree is 0 is known as a tree .  In the above picture A represents the root of the tree . PARENT NODE : A node which has a child is known as a parent node or ancestor node .In the above tree A,B,E,G are parent nodes . ...