Interviews Questions And Answers Data Structure And Algorithm and Data Structure Interviews questions

Interviews Questions And Answers Data Structure And Algorithm 

1. Can you explain the difference between the structure and storage Structure?

File structure : Representation of data into secondary of auxiliary memory say any device such as hard disk or pen drives  that store data which remains intact until manually deleted is known as a file structure representation .

Storage structure : In this type , data stored in this main memory i.e RAM and is deleted once the function that uses this data gets completely executed .

The difference is that storage structure has data stored in the memory of the computer system whereas file structure has the data stored in stored in the auxiliary memory

Data Structure Interviews questions

1. What are operations performed on Data structure?

• Insertion : To add a new element from data structure 
• Detection : To remove a data element from data structure 
• Searching : To search a specific data elements in data structured
• Traversal : To process all elements presents in data structure
• Merging : To combine two similar data structure or form new one 
• Sorting : To arrange the all data elements of data structure in specific order

2. List out where the data structure is used ?

Data structure is used to handle the data

• Numerical analysis
• Database management
• Statistical analysis
• Artificial intelligence (A.I)
• Operating System (O.S)

3. What is LIFO ?

• LIFO stands for last in first out 
• LIFO describes how to access , store and retrieve the data
• The last added data in database is first out that database last in fist out.

4. What is FIFO?

FIFO is stands for fist in first out

• The FIFO describes how to store access , insert data into queue 
• The first added data is out first from database 

5. How to dynamic memory helps in managing data ?

• Process of allocating memory at runtime is called dynamic memory allocation.
• Dynamic memory allocation can combine separately allocated structured that expands & contract as need.
• It is also allows us to store & remove data blocks arbitrary size.

6. What is advantage of linked list?

• We can increase are decrease linked list at runtime.
• We can allocate deallocate memory at run time.
• Access time is very fast . It can be accessed at certain time without memory overhead.
• Memory is well utilized in linked list
• It has flexibility to rearrangement the element easily.
• Linked list does not waste memory space.

7. How merge sort is useful?

• Merge sort is a process where the data is divided and stored to reach and goal.
• Adjacent elements are sort & merge to make huge element
• The sorted element are combine to make bigger size .
• The process is continuous until make single sorted list.

8. Application of stack in Data structure?

• Function calling and return.
• Expression evaluation.
• Backtracking
• Memory Management in Data structure

9. What operation perform on stack?

(i) Push : To add new item in the stack. If stack is complete , then it will overflow.

(ii)POP : POP () is used to remove item from stack . If stack is empty , then it called underflow.

10. What is AVL tree?

• AVL stands for Adelson velskii  and landis 
• AVL tree can defined as height balance binary search tree.
• In AVL  each note is associated with balance factor.
• The tree is balanced when balance factor of each node is between -1 to 1.
• If it is unbalanced then we need to balance it.