Become a world-class Digital Marketer in the next 3 months. Join SkillCamper's Digital Marketing Bootcamp. Get guaranteed job placement and a minimum salary of Rs 5 lakhs.
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
Try Now for free
Unit - 1 Data Structures
Unit 1Data 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 - 2 Abstract Data Types (ADTs) Arrays
Unit 2Abstract Data Types ADTs Arrays
2.1 Definition Single and Multidimensional Arrays Representation of Arrays Row Major Order and Column Major Order
2.2 Application of arrays
2.3 Stacks Introduction PUSH and POP operations on Stacks
2.5 Prefix Infix Postfix expressions Conversion and Evaluation
2.6 Multiple Stacks
2.7 Queues Introduction Insertion deletion in Queues
2.8 Circular Queues
2.9 Priority Queues
Unit - 3 Linked List- Linked List As ADT
Unit 3Linked List Linked List as ADT
3.1 Dynamic Memory Allocation Functions
3.2 Types of Linked Lists single double circular
3.3 Operations on Linked Lists create insert delete reverse etc.
3.4 Applications of Linked List Polynomial Representation Additiondeletionmultiplication of two polynomials
3.5 Trees Introduction
3.6 Implementation of Trees
3.7 Tree Traversals with an Application
3.8 Binary Trees
3.9 BST Insertion Deletion
3.10 Expression Trees
3.11 AVL Trees
3.12 Heap Trees
Unit - 4 Graphs
Unit 4Graphs
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
Unit - 5 ALGORITHMS
Unit 5Algorithms
5.1 Advanced algorithms based on the data structures
5.2 ShortestPath Algorithms Dijkstras Algorithm
5.3 Graphs with Negative Edge Costs
5.4 Acyclic Graphs
5.5 Network Flow Problems
5.6 Matrix Chain Multiplication
5.7 Longest Common Subsequence
5.8 Optimal Binary Search Tree
5.9 Backtracking strategy 4 queens problem
5.10 Hamiltonian Path
Unit 5
Algorithms
5.1 Advanced algorithms based on the data structures
5.2 ShortestPath Algorithms Dijkstras Algorithm
5.3 Graphs with Negative Edge Costs
5.4 Acyclic Graphs
5.5 Network Flow Problems
5.6 Matrix Chain Multiplication
5.7 Longest Common Subsequence
5.8 Optimal Binary Search Tree
5.9 Backtracking strategy 4 queens problem
5.10 Hamiltonian Path
Unit 5
Algorithms
5.1 Advanced algorithms based on the data structures
5.2 ShortestPath Algorithms Dijkstras Algorithm
5.3 Graphs with Negative Edge Costs
5.4 Acyclic Graphs
5.5 Network Flow Problems
5.6 Matrix Chain Multiplication
5.7 Longest Common Subsequence
5.8 Optimal Binary Search Tree
5.9 Backtracking strategy 4 queens problem
5.10 Hamiltonian Path
Unit 5
Algorithms
5.1 Advanced algorithms based on the data structures
5.2 ShortestPath Algorithms Dijkstras Algorithm
5.3 Graphs with Negative Edge Costs
5.4 Acyclic Graphs
5.5 Network Flow Problems
5.6 Matrix Chain Multiplication
5.7 Longest Common Subsequence
5.8 Optimal Binary Search Tree
5.9 Backtracking strategy 4 queens problem
5.10 Hamiltonian Path
Download ECE Sem 4 syllabus pdf
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free
Try Now for free
Other Subjects of Semester-2
Share
Link Copied
More than 1 Million students use Goseeko! Join them to feel the power of smart learning.
Spot anything incorrect? Contact us
Goseeko covers the entire spectrum of student’s journey from Academics to Career. From helping them to ace their academics with our personalized study material to providing them with career development resources, our students meet their academic and professional goals.
Courses
B.E.
B.Com
B.A.
BBA
BMS
BSC
Resources
Notes
MCQ
Question bank
Audio bites
Express Class
Reference Videos
Solved Question Papers
