
Index 32

Lecture1.1

Lecture1.2

Lecture1.3

Lecture1.4

Lecture1.5

Lecture1.6

Lecture1.7

Lecture1.8

Lecture1.9

Lecture1.10

Lecture1.11

Lecture1.12

Lecture1.13

Lecture1.14

Lecture1.15

Lecture1.16

Lecture1.17

Lecture1.18

Lecture1.19

Lecture1.20

Lecture1.21

Lecture1.22

Lecture1.23

Lecture1.24

Lecture1.25

Lecture1.26

Lecture1.27

Lecture1.28

Lecture1.29

Lecture1.30

Lecture1.31

Lecture1.32


Notes 1

Lecture2.1


Data Structures Viva Question 6

Lecture3.1

Lecture3.2

Lecture3.3

Lecture3.4

Lecture3.5

Lecture3.6

Operations Of Data Structures
Operations Of Data Structures
Data Structure is the way of storing data in a computer’s memory so that it can be used easily and efficiently.
Operations Of Data Structures
1) Traversing: Every data structure contains the set of data elements. Traversing the data structure means visiting each element of the data structure in order to perform some specific operation like searching or sorting.
Example: If we need to calculate the average of the marks obtained by a student in 6 different subject, we need to traverse the complete array of marks and calculate the total sum, then we will devide that sum by the number of subjects i.e. 6, in order to find the average.
2) Insertion: Insertion can be defined as the process of adding the elements to the data structure at any location.
If the size of data structure is n then we can only insert n1 data elements into it.
3) Deletion:The process of removing an element from the data structure is called Deletion. We can delete an element from the data structure at any random location.
If we try to delete an element from an empty data structure then underflow occurs.
4) Searching: The process of finding the location of an element within the data structure is called Searching. There are two algorithms to perform searching, Linear Search and Binary Search. We will discuss each one of them later in this tutorial.
5) Sorting: The process of arranging the data structure in a specific order is known as Sorting. There are many algorithms that can be used to perform sorting, for example, insertion sort, selection sort, bubble sort, etc.
6) Merging: When two lists List A and List B of size M and N respectively, of similar type of elements, clubbed or joined to produce the third list, List C of size (M+N), then this process is called merging.
Prepare For Your Placements: https://lastmomenttuitions.com/courses/placementpreparation/
/ Youtube Channel: https://www.youtube.com/channel/UCGFNZxMqKLsqWERX_N2f08Q
Follow For Latest Updates, Study Tips & More Content!