Day 23: Common Operations on Data Structure

Hello Dear Students,
  Hope you all are doing good.

Aaj hum data structure ke various operations ke baare mein study karenge..

Let's get started...

COMMON OPERATIONS ON DATA STRUCTURE - Data structure i.e. Array, Stack, Queue, Link list, Tree, Graphs par hum different operations ko perform karte hain. Jaise DBMS mein humne study kiya tha various queries perform hoti hain data par, waise hi hum data par operations perform karte hain. Jab data ko store kiya jata hai then uspar bahut saare operations perform hote hain, data ko change karne or access karne ke liye. Various Operations are as follows-
  • TRAVERSING - Traversing means basically travel karna, or visit krna, ek data element se doosre data element ko access karna, means view karna. Traversing means to see or visit every data element atleast once. For example, agar hum company mein employees ke salary ko print karana chahte hain, then traversing operation use hoga. 
  • INSERTION - Insertion operation mein new data element ko add kiya jata hai. Queue mein addition/insertion REAR se hoti hai, and stack mein TOP se, aise hi sabhi data structures mein insertion operation hota hai, new element ko add kiya jata hai. Suppose hum dataabse main koi value insert karna forget kr diya so insertion operation se hum wo kar sakte hain.
  • DELETION - Deletion operation mein hum existing values ko delete karte hain. Queue mein deletion FRONT se hota hai and stack mein TOP se. Suppose agar ek employee job leave kar deta hai then uska data deletion operation se delete kiya ja sakta hai. 
  • SEARCHING - Searching means finding, agar database mein se koi data element ko find out karna hai to searching operation use hoga. Jab koi bhi operation perform karna hota hai to sabse pehle us transaction ko search kiya jata hai. For example, if we want to delete the employee having salary 7,000 then first we search the employee and then do deletion.  Searching can be linear search or binary search.
 Linear search mein one by one data elements ko search kiya jata hai , but isme limitation hai that agar 100 transactions ho and humne jo search karna hai wo 80 position par ho then time and apce waste hoga.

 Binary search mein poore data elements ko 2 parts and dono mein se alag alag data elements ko search kiya jata hai so that above situations mein time and space save ho. Binary search mein sabse pehle data elements ko ascending or descending order mein arrange kiya jata hai, and then search kiya jata hai.
  • SELECTION - Selection mein data elements ko access kiya jata hai. For example, select query hoti hai jaise ki particular element ko select kiya jata hai, wo selection operation hota hai. 
  • SORTING - Sorting means data ko increasing or decreasing order mein arrange karna. Sorting can be - Bubble Sort, Quick Sort, Merge sort, Heap sort, Insertion sort, etc.
  • MERGING - Merge means combine karna 2 lists ko 1 list mein. So merging operation mein 2 list ke data elements ko merge kar diya jata hai means combine kar diya jata hai so that wo ek list ka data ban jaye. It is mostly used when data is placed at different locations. 
  • SPLITTING - Splitting means 1 list ke data ko divide or break kar dena so that wo 2 or more list mein divide or split ho jaye. It is mostly used when large file data is split into small files for faster processing. 
  • COPYING - Copying means ek file ke data ko another file mein copy karna simply.
  • CONCATENATION - Concatenation is also same as merging means to combine. Concatenation mein 2 similar data structure types ko combine kiya jata hai 1 file banane ke liye. 

Best of Luck Students,
 Do visit our website regularly for more content and for daily tests.