Important Definitions DS:
1. What is meant by a data Structure?
Ans: A data structure is a structure which is defined to connect or interlink the data that is organized in a set of data items and their relation ship to other members.
2. List out some areas where the data structures are applied in a project?
Ans: Operating
System, The Database Management
System, The Stimulation done, Statistical analysis
package, Numerical Analysis, The Compiler Design, Graphics and one up coming technology called Artificial intelligence
3. What is meant by internal sorting algorithm?
Ans: Any technique which uses or occupies the internal storage or internal memory is known as a Internal sorting algorithm.
4. What is meant by external sorting algorithm?
Ans: Any technique which dosent use internal storage or internal memory or in other words it only used external memory like pen drives, disc, hard disk etc...
5. What is the
advantage of
recursive
approach than an
iterative
approach?
Ans: Recursive approach needs less
code and easy to implement.
The above given image is the classification of the data structure flow chart..
Classification of Data Structures : Data structure are normally divided into two types they are,
1. Primitive Data Structure
2. Non-Primitive Data Structure
1. Primitive Data Structure:
a. There are basic structures and directly operated upon by the machine instructions.
b. In general, there are different representation on different computers.
c. Integer, Floating-point number, Character constants, string constants, pointers etc, fall in this category.
2. Non - Primitive Data Structure:
a. There are more sophisticated data structures.
b. These are derived from the primitive data structures.
c. The non-primitive data structures are used to emphasize on structuring of a group of homogeneous data structures (same type) or heterogeneous data structures (different type) data items.
d. Linked List, Stack, Queue, Tree, Graph are example of non-primitive data structures.
e. The design of an efficient data structure must take operations to be performed on the data structure.
Now let us see some operations based on Data Structures:
The most commonly used operation on data structure are divided into these types:
1. Traversing
2. Searching
3. Inserting
4. Deleting
5. Sorting
6. Merging
1.Traversing- It is mainly used to access each data item exactly once such that it can be processed.
2.Searching- It is a technique used to find out the location of the data item when or if it exists in the given collection of data items or that data created .
3.Inserting- It is used to add a some more new data items to the data items already added collection .
4.Deleting- It is used to delete some data items from the collection of data items.
5.Sorting- It is used to arrange the data in ascending or descending order with the given data items.
6.Merging- It is usually used to combine or mix the data items of two sorted files or checked files into a single file in the sorted form.
0 Comments