Rashtrasant Tukadoji Maharaj Nagpur University, Maharashtra, Electronics and Communication engineering Semester 4, Data structure & Algorithm Syllabus

Data structure & Algorithm Lecture notes | Videos | Free pdf Download | Previous years solved question papers | MCQs | Question Banks| Syllabus
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free

Unit - 1 Data Structures

Unit 1

Data Structures

1.1 Introduction to Data Structures

1.2 Need of Data Structure

1.3 Abstract Data type

1.4 Types of Data Structures Algorithms Algorithm Efficiency of an Algorithm

1.5 Time and Space Complexity

1.6 Asymptotic notations Big O Omega Ω Theta

1.7 TimeSpace trade off

1.8 Searching Linear Binary Search

1.9 Sorting Bubble Sort Insertion Sort Selection Sort

1.10 Algorithm design strategies Divide and Conquer strategy Merge Sort Quick Sort

1.11 Complexity analysis of sorting methods

Unit 1

Data Structures

1.1 Introduction to Data Structures

1.2 Need of Data Structure

1.3 Abstract Data type

1.4 Types of Data Structures Algorithms Algorithm Efficiency of an Algorithm

1.5 Time and Space Complexity

1.6 Asymptotic notations Big O Omega Ω Theta

1.7 TimeSpace trade off

1.8 Searching Linear Binary Search

1.9 Sorting Bubble Sort Insertion Sort Selection Sort

1.10 Algorithm design strategies Divide and Conquer strategy Merge Sort Quick Sort

1.11 Complexity analysis of sorting methods

Unit 1

Data Structures

1.1 Introduction to Data Structures

1.2 Need of Data Structure

1.3 Abstract Data type

1.4 Types of Data Structures Algorithms Algorithm Efficiency of an Algorithm

1.5 Time and Space Complexity

1.6 Asymptotic notations Big O Omega Ω Theta

1.7 TimeSpace trade off

1.8 Searching Linear Binary Search

1.9 Sorting Bubble Sort Insertion Sort Selection Sort

1.10 Algorithm design strategies Divide and Conquer strategy Merge Sort Quick Sort

1.11 Complexity analysis of sorting methods

Data Structures

Unit 1

Data Structures

1.1 Introduction to Data Structures

1.2 Need of Data Structure

1.3 Abstract Data type

1.4 Types of Data Structures Algorithms Algorithm Efficiency of an Algorithm

1.5 Time and Space Complexity

1.6 Asymptotic notations Big O Omega Ω Theta

1.7 TimeSpace trade off

1.8 Searching Linear Binary Search

1.9 Sorting Bubble Sort Insertion Sort Selection Sort

1.10 Algorithm design strategies Divide and Conquer strategy Merge Sort Quick Sort

1.11 Complexity analysis of sorting methods

Unit - 4 Graphs

Unit 4

Graphs

4.1 Graphs Data Structures for Graphs

4.2 Graph Traversals Directed Graphs

4.3 Graph Storage Structures Adjacency Matrix Adjacency List Weighted Graphs

4.4 Shortest Paths and Minimum spanning Trees

4.5 Applications of DFS and BFS

4.6 HASHING TECHNIQUES

4.7 Symbol Tables static tree tables dynamic tree tables

4.8 Hash tables

4.10 Hash functions

4.11 Collision resolution

4.12 Overflow handling Applications

Unit 4

Graphs

4.1 Graphs Data Structures for Graphs

4.2 Graph Traversals Directed Graphs

4.3 Graph Storage Structures Adjacency Matrix Adjacency List Weighted Graphs

4.4 Shortest Paths and Minimum spanning Trees

4.5 Applications of DFS and BFS

4.6 HASHING TECHNIQUES

4.7 Symbol Tables static tree tables dynamic tree tables

4.8 Hash tables

4.10 Hash functions

4.11 Collision resolution

4.12 Overflow handling Applications

Unit 4

Graphs

4.1 Graphs Data Structures for Graphs

4.2 Graph Traversals Directed Graphs

4.3 Graph Storage Structures Adjacency Matrix Adjacency List Weighted Graphs

4.4 Shortest Paths and Minimum spanning Trees

4.5 Applications of DFS and BFS

4.6 HASHING TECHNIQUES

4.7 Symbol Tables static tree tables dynamic tree tables

4.8 Hash tables

4.10 Hash functions

4.11 Collision resolution

4.12 Overflow handling Applications

Unit 4

Graphs

4.1 Graphs Data Structures for Graphs

4.2 Graph Traversals Directed Graphs

4.3 Graph Storage Structures Adjacency Matrix Adjacency List Weighted Graphs

4.4 Shortest Paths and Minimum spanning Trees

4.5 Applications of DFS and BFS

4.6 HASHING TECHNIQUES

4.7 Symbol Tables static tree tables dynamic tree tables

4.8 Hash tables

4.10 Hash functions

4.11 Collision resolution

4.12 Overflow handling Applications

Share  
Link Copied
More than 1 Million students use Goseeko! Join them to feel the power of smart learning.
Spot anything incorrect? Contact us