Skip to main content

Introduction to Data Structure

                           
A Data structures organises the group of data element in an efficient way to store and retrieve the data from computer.
Most commonly used data structures are  arrays, linked list,stack,queue,hash tables.
Why do we need Data Structure ?
As applications becomes complex and demands for the huge data handling then processor slows down,
data searching would become difficult and multiple requests to the server may slow down the system to overcome all this drawbacks
we use data structure in an efficient and reusable way. 
Data Structure Classification


Primitive Data Structure - it contains primary datatypes byte , short , int , long , char , Boolean , float and double.
Non-Primitive Data Structure - it is derived from primary datatypes such as array, list, files etc (contains of collection of similar type of datatype)
  1. Arrays - array is a collection of similar type of data element.
  2. Lists - list is a sequence of data structure which are connected through link
  • Linear List - In linear list data is stored in the linear/sequential orderEx: list or a stack of books, in linear list data is accessed using linked list,stacks or queues.
  • Linked List - linked list is a sequence of nodes where each node stores its own data and pointer(address) to the location of next node forming a chain.
  • Stack - stack inserts and removes data in last in fast out (LIFO) format where both insertion and deletion happens at the single end.
  • Queue - queue inserts data from end called rear/tail and removes data from other end called front/head.
  • Non-Linear List-  In non-linear list data is not stored in a sequential order it is stored in the form of hierarchical format /tree structure, in non-linear list data is accessed using tree or graph.
  • Trees - it is multilevel data structure with hierarchical relationship among its elements know as nodes.
  • Graph -Graphs can be defined as the pictorial representation of the set of elements (represented by vertices) connected by the links known as edges 
     3. Files - files is a collection of records.

Happy reading😊


Sushmitha N

Hi there ! Im a experienced android developer with 4 years of relevant experience Skills include Android,Core Java ,Oops and Kotlin.

Comments

Post a Comment

Popular posts from this blog

Android Interview Questions

Android Interview Questions Which was the first mobile brand with Android Application?                           Answer :   First Mobile brand with Android Application was HTC. What is the current version of android and its API ?   Answer: Current version of android  is “Pie” (as per Nov 2018) and its API level 28. Life cycle of Activity ? Answer: OnCreate() - This method is called when the activity is created . It is called only once in activity lifecycle. OnStart() - This method is called when the activity is getting started , no user interactions will be done at this stage,and this method will be called several times in activity life cycle depending upon the user navigation.(Loads UI) OnResume()- On this method call user can interact with the activity and perform actions like click. OnPause()- W...
Post a Comment
Read more
Find the biggest difference between any two numbers in array? Approach: Assume array of integer arr = [5,9,66,8,37]  Two calculate biggest difference between two numbers logic is largest number - smallest number . By arranging the array in ascending order we get the first element which is smallest and the last element which is largest. Now the array look like integer arr =[5,8,9,37,66] Here the solution is last element (largest number)- first element(smallest number) i.e; 66-5= 61 Implementing in Java /* Read input from STDIN. Print your output to STDOUT*/ import java.io.*; import java.util.*; public class BiggestDifference{   public static void main(String args[] ) throws Exception { //Takes user input Scanner sc = new Scanner(System.in); int n = sc.nextInt(); //create an array depending upon the number of user inputs int[] array = new int[n]; //insert user input elements into the array for(int i = 0; i < n; i++) ...
Post a Comment
Read more
Count how many numbers are negative in an array? Approach: Assume array of integer arr = [5,-9,66,-8,37] As  we know a negative number is a real number less than zero We are going to apply the same logic here , and check the number of negative numbers in the array. Expected output is : 2 ,since there are 2 negative numbers among the set of numbers Implementing in Java /* Read input from STDIN. Print your output to STDOUT*/ import java.io.*; import java.util.*; public class CountNegativeNumbers{   public static void main(String args[] ) throws Exception { //Write code here Scanner scan = new Scanner(System.in); int n = scan.nextInt();    // takes user input int a[] = new int[n];   // creates array depending on the user input int count=0;              //count variable which is zero initially for(...
Post a Comment
Read more