Course Overview 0

This Course is Only Available On Our App

Dive-in and start learning! Get offline access to all the course contents!

No items in this section
Index 32
- Lecture2.1
  
  Introduction of Data Structure 08 min
- Lecture2.2
  
  Types Of Data Structures 06 min
- Lecture2.3
  
  Operations Of Data Structures 06 min
- Lecture2.4
  
  Concept Of Abstract Data Type 06 min
- Lecture2.5
  
  Array Part #1 16 min
- Lecture2.6
  
  Array Part #2 19 min
- Lecture2.7
  
  Introduction To Stack 05 min
- Lecture2.8
  
  Operations Of Stack ADT 06 min
- Lecture2.9
  
  Stack Implementation Using Array Part #1 10 min
- Lecture2.10
  
  Stack Implementation Using Array Part #2 12 min
- Lecture2.11
  
  Introduction Of Queue 05 min
- Lecture2.12
  
  Operations Of Queue ADT 04 min
- Lecture2.13
  
  Queue Implementation Using Array Part #1 11 min
- Lecture2.14
  
  Queue Implementation Using Array Part #2 09 min
- Lecture2.15
  
  Circular Queue Implementation Part #1 12 min
- Lecture2.16
  
  Circular Queue Implementation Part #2 08 min
- Lecture2.17
  
  Introduction To Linked Lists 06 min
- Lecture2.18
  
  Array Vs Linked List 08 min
- Lecture2.19
  
  Linked List Implementation Part #1 17 min
- Lecture2.20
  
  Linked List Implementation Part #2 11 min
- Lecture2.21
  
  Linked List Part #3 10 min
- Lecture2.22
  
  Linked List Part #4 15 min
- Lecture2.23
  
  Linked List Implementation Part #5 11 min
- Lecture2.24
  
  Linked List Implementation Part #6 10 min
- Lecture2.25
  
  Stack Using Linked List Part #1 09 min
- Lecture2.26
  
  Stack Using Linked List Part #2 06 min
- Lecture2.27
  
  Queue Using Linked List Part #1 10 min
- Lecture2.28
  
  Queue Using Linked List Part #2 06 min
- Lecture2.29
  
  Circular Queue Using Linked List 09 min
- Lecture2.30
  
  Implementation Of Doubly Linked List Part #1 13 min
- Lecture2.31
  
  Doubly Linked List Part #2 07 min
- Lecture2.32
  
  Doubly Linked List Part #3 09 min
Notes 7
- Lecture3.1
  
  Introduction to Data Structures & Algorithms.
- Lecture3.2
  
  Sorting & Searching
- Lecture3.3
  
  Stacks
- Lecture3.4
  
  Queue
- Lecture3.5
  
  Linked List
- Lecture3.6
  
  Trees
- Lecture3.7
  
  Graph
Data Structures Viva Question 6
- Lecture4.1
  
  Introduction to Data Structures
- Lecture4.2
  
  Stack and Queues
- Lecture4.3
  
  Linked List
- Lecture4.4
  
  Trees
- Lecture4.5
  
  Graphs
- Lecture4.6
  
  Searching Techniques
Importance 7
- Lecture5.1
  
  Introduction to Data Structures
- Lecture5.2
  
  Stack and Queues
- Lecture5.3
  
  Linked List
- Lecture5.4
  
  Trees
- Lecture5.5
  
  Graphs
- Lecture5.6
  
  Searching Techniques
- Lecture5.7
  
  [Extra] Previously Asked Important Questions

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 n-1 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/placement-preparation/