Home/data structure interview questions/Page 3
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Explain the postfix expression.
In a postfix expression, the operator is fixed after the operands. Some examples are: B++ (i.e. B+B) AB+ (i.e. A+B) ABC*+ (i.e. A+B*C) AB*CD*+ (i.e. A*B + C*D)
In a postfix expression, the operator is fixed after the operands. Some examples are:
- B++ (i.e. B+B)
- AB+ (i.e. A+B)
- ABC*+ (i.e. A+B*C)
- AB*CD*+ (i.e. A*B + C*D)
See lessWhat are the various operations that can be performed on a data structure?
The following are the operations that can be performed on a data structure: Deletion: Deleting an existing element from the data structure. Insertion: Adding a new element to the data structure. Searching: Find the location of an element, if it exists, in the data structure. Sorting: Arranging elemeRead more
The following are the operations that can be performed on a data structure:
- Deletion: Deleting an existing element from the data structure.
- Insertion: Adding a new element to the data structure.
- Searching: Find the location of an element, if it exists, in the data structure.
- Sorting: Arranging elements of the data structure in ascending or descending order for numerical data, and dictionary order for alphanumeric data.
- Traversal: Accessing each element of the data structure once for processing.
See lessWhat is the difference between file structure and storage structure?
File Structure: A hard disk or external device (such as a USB), stores data that remains intact till manually deleted. Such data representation into secondary or auxiliary memory is called a file structure. Storage Structure: In this type of structure, data (variables, constants, etc.) are stored inRead more
- File Structure: A hard disk or external device (such as a USB), stores data that remains intact till manually deleted. Such data representation into secondary or auxiliary memory is called a file structure.
- Storage Structure: In this type of structure, data (variables, constants, etc.) are stored in the main memory, i.e. RAM, and is deleted once the function that uses this data has been completed.
See lessWhat are the applications of data structures?
Some practical applications of data structures are: Storing data in a tabular form. For example, the contact details of an individual can be stored in arrays. Arrays are widely used in image processing and speech processing. Music players and image sliders use linked lists to switch between items. ARead more
Some practical applications of data structures are:
- Storing data in a tabular form. For example, the contact details of an individual can be stored in arrays.
- Arrays are widely used in image processing and speech processing.
- Music players and image sliders use linked lists to switch between items.
- A queue is used for job scheduling – the arrangement of data packets for communication.
- A tree is used by the decision tree algorithm in machine learning.
- Technologies like blockchain and cryptography are based on hashing algorithms.
- Matrices are widely used to represent data and plot graphs, and perform statistical analysis.
See lessHow does a linear data structure differ from a non-linear data structure?
If the elements of a data structure form a sequence or a linear list then it is called a linear data structure. Non-linear data structures are those in which the traversal of nodes is done non-linearly. Arrays, linked lists, stacks, and queues are examples of linear data structures, while graphs andRead more
If the elements of a data structure form a sequence or a linear list then it is called a linear data structure. Non-linear data structures are those in which the traversal of nodes is done non-linearly.
Arrays, linked lists, stacks, and queues are examples of linear data structures, while graphs and trees are examples of non-linear data structures.
See less