What is data Structure?

A data structure is a data administration, supervision, and storage format that enables efficient access and modification. Main goal is a  data Structure, assemble of data values, we can apply any types of data for the Data Structure.

Differentiate between file and structure storage structure. 

A file is a collection of data. All of the data structures are satisfy it. It usually assemble the records are stored in external storage in the computer’s.                                                                                                                                                                                                                                                                                     The major difference between file structure and storage structure is depend on memory area that is being accessed.
Storage structure is When we allocate with the structure that occupy in the main memory of the computer system, known as the storage structure.                                                        

When is a binary search best applied? 

A binary search is an algorithm that is elite petition to search a list when the component are previously in order or sorted.
The list is searched starting in the mid of binary, like that if that middle utility is not the quarry search key, it will inspect to see if it will pursue the seek on the bottom half of the list or the higher half. The split and search will then continue in the same process.

What is a linked list?   

A linked list is a succession of interchange in which severely interchange is fasten to the node following it. This forms a alternation link for data storage.                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                               How do you reference all the components in a one-dimension array?                                                                                                                                                                                                                                                                                                                                                                                                                            To mention all of the components in a  one-dimension array, you compulsory to use an indexed loop, in order that, the counter runs from 0 to the array size minus one.
In this demeanour, You can mention all of the components in progression by using the loop counter as the array appendix.

In what areas do data structures are applied?     

Data structures are indispensable in as good as every feature data is complicated. In circulation, algorithms that assume effective data structure is petition in many ways.

What is LIFO?       

 LIFO is a short form of Last In First Out. It mention how data is acquire, stored and repossess. Using this strategy, data that was stored last should be the one to be deracinate first.
This also means that in order to gain ebullition to the first data, all the other data that was stored before this first data must first be repossess and withdraw.

What is a queue?                                                                                                     

A queue is a data structure that can imitate a list or rivulet of data. In this structure, new component are position at one end and subsist component are withdraw from the other end.

                                                                                                                                  

What are binary trees?                                                                                              

  A binary tree is one type of data structure that has two confluence, a left confluence, and a right confluence. In programming, binary trees are an expansion of the linked list structures.

 

Which data structures are applied when transactions with a recursive function? 

Repetitive, is a function that calls itself position on a terminating condition, makes use of the mound. Using LIFO, a call to a repetitive function saves the submit address so that it knows how to return to the calling function after the call terminates.

go and check my other articles also click here

click here java point

Click here 

 

 

LEAVE A REPLY

Please enter your comment!
Please enter your name here