Important Question Of Data Structure Using C || Assignment 1 DSU || I Scheme Diploma 3rd Sem MSBTE || Computer Engineering

Important Questions Of Data Structure Using C [ DSU ] Diploma I scheme msbte :-

Important Question Of Data Structure Using C  Assignment 1 DSU ,I Scheme Diploma 3rd Sem MSBTE,Computer Engineering

1) Define data structure using C ?

Ans :- Data Structure is the branch of computer science to the knowledge of the data should be organized, how the flow of data should be controlled, and how a data structure should be designed and implemented to reduce the complexity and increase the efficiency of the algorithm.

Example : - queue,array,graph,tree,stack

2) Explain in detail the types of data structure?

Ans:-

Types of data structure:-

i) linear data structure.

ii) Non-linear data structure.

i) Linear data structure :- The data structure where data items are organized sequentially or linear where data elements attached one after another is called linear data structure. The data element in a linear Data Structure are Traveled one after the other and winding one element can be directly reached while Travelsing all the data item in linear Data Structure can be traversed in single Run. This kind of data structure are very easy to implement because memory of computer is also organised in linear way.

Example :- array, Stack,Queue,linked list

• Array:- Array the collection of similar data type. 
• Stack :- it is a LIFO [last in first out] data structure where element that added last will be deleted first. 
• Queue :- it is a FIFO [first in first out] data structure where element that added first will be deleted first. 
• Linked list:- it is a collection of nodes. 

ii) Non-Linear data structure:- The data structure where data items are not organized sequentially is called non-linear data structure. In other words, a data element of the nonlinear data structure would be connected to more than one element.

Example:-  graph and tree

3) List and explain operation on data structure?

Ans:- There are 5 operation present in data structure which are given below:

Searching, sorting, insertion, deletion, travelsing 

1. Searching:- Searching operation Data Structure involves searching for the specified data element in the data Structure by using Linear search and binary search. 
2. Sorting:- Sorting operation on data structure is arranging data element of a data structure in specified order is called sorting. 
3. Insertion:- Insertion operation on data structure is adding a new element in data structure. 
4. Deletion:- Deletion operation on data structure used for removing element from Data Structure. 
5. Travelsing :- Travelsing operation on data structure is a travelsing the all data element in data structure of processing all data structure. 

5) Explain algorithm complexity with space and time? 

Ans :- Algorithm is said to be efficient and fast if it takes less time to execute and consumes less memory space.

• Space complexity :- In space complexity amount of memory space required by an algorithm during execution 
• Time complexity :- In time complexity how much time it consumes to execute the program. 

6) Explain any data structure operation and what is need of data structure?

Ans:- Searching:- Searching operation on data structure involves searching for the specified data element in the data structure by using Linear search and binary search.

Need of data structure:- 

Data Structure helps you to understand the relationship of one data element with the other and organize it within the memory.

Assignment 1 Data Structure Using C [ DSU ] || I Scheme Diploma 3rd Sem MSBTE || Computer Engineering