Full Stack Programming

A linked list is a linear data structure just like arrays but its elements do not store in the contagious location. Elements in a linked list are connected through pointers as shown in the below image. Link list consists of nodes. Each node contains a data field and a pointer reference to the next node in the list. Important Points about the linked list A linked list can be used to store linear data of diffent type. Dynamic size. Ease of insertion and deletion of an element. Random access of an element is not allowed. if we want to search an element we have to go sequentially starting from the first node.  Extra memory space would be required for the pointer with each element of a linked list. A linked list is represented by a pointer to the first node o the list. The first node called head.if the linked list is empty then the head is NULL. Let's start implementation of a simple linked list in C# I have created a project of the consol...

An array is a linear data structure which stores collection of data in a contagious memory location. The idea is to store the collection of the same type of data. this makes it easier to calculate the position of each item by simply adding an offset to a base value. In the above image of an array, we can identify each element by its index. we can declare an array by specifying the types of its element. type [] arrayname; Types of Arrays single dimensional arrays Multidimensional arrays Single Dimensional Arrays A single dimensional array can be declared in the following way. int [] array = new int [ 5 ]; this array will contain the element from array[0] to array[4].the new operator will initialize  each  element of this array with zero. An array which contains string value can be declared the same way. string[] array = new string[6]; Array Initializ...