Become a data analyst in the next 4 months and kickstart your career. 100% placement assistance. Start your Analytics journey with our free Python course.
Jharkhand University of Technology, Jharkhand, Electrical & Electronics Engineering Semester 4, Data Structures And Algorithms Syllabus
Data Structures And Algorithms 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 Basic Concepts And Notations
Unit 1
Basic concepts and notations
1.1 Data structures and data structure operations
1.2 Complexity Analysis Mathematical notation and functions
1.3 Algorithmic complexity and time space trade off Big O Notation
1.4 The best average worst cases analysis of various algorithms
1.5 Arrays Linear Multidimensional Arrays
1.6 Representation traversal
1.7 Sorting algorithms Bubble sort
1.8 Selection sort
1.9 Insertion sort
1.10 Merge sort and Quicksort
1.11 Counting Sort
1.12 Linear search and Binary search on sorted arrays
Unit 1
Basic concepts and notations
1.1 Data structures and data structure operations
1.2 Complexity Analysis Mathematical notation and functions
1.3 Algorithmic complexity and time space trade off Big O Notation
1.4 The best average worst cases analysis of various algorithms
1.5 Arrays Linear Multidimensional Arrays
1.6 Representation traversal
1.7 Sorting algorithms Bubble sort
1.8 Selection sort
1.9 Insertion sort
1.10 Merge sort and Quicksort
1.11 Counting Sort
1.12 Linear search and Binary search on sorted arrays
Unit - 2 Abstract Data Types (ADTs) Stack
Unit 2
Abstract Data Types ADTs Stack
2.1 Abstract Data Types ADTs Stack Push Pop
2.2 Stack representation using array and linked list
2.3 Applications of Stack
2.4 Recursion
2.5 Queue Representation using array and linked list
2.6 Insertion and deletion operations
2.7 Circular queue
2.8 Dequeue
2.9 Priority queue
2.10 Linked Lists their types Single Double Circular linked lists
2.11 Operations on Varieties of Linked Lists Search and Update with applications
Unit 2
Abstract Data Types ADTs Stack
2.1 Abstract Data Types ADTs Stack Push Pop
2.2 Stack representation using array and linked list
2.3 Applications of Stack
2.4 Recursion
2.5 Queue Representation using array and linked list
2.6 Insertion and deletion operations
2.7 Circular queue
2.8 Dequeue
2.9 Priority queue
2.10 Linked Lists their types Single Double Circular linked lists
2.11 Operations on Varieties of Linked Lists Search and Update with applications
Unit - 3 Introduction To Trees
Unit 3
Introduction to Trees
3.1 Introduction to Trees
3.2 Binary tree definitions and properties
3.3 Binary tree traversal algorithms with and without recursion
3.4 Binary Search Tree creation insertion and deletion operations
3.5 Threaded tree One way and Two way
3.6 AVL tree balancing
3.7 Btree
Unit 3
Introduction to Trees
3.1 Introduction to Trees
3.2 Binary tree definitions and properties
3.3 Binary tree traversal algorithms with and without recursion
3.4 Binary Search Tree creation insertion and deletion operations
3.5 Threaded tree One way and Two way
3.6 AVL tree balancing
3.7 Btree
Unit - 4 Graph Algorithms
Unit 4
Graph Algorithms
4.1 Graph Algorithms Graphs and their Representations
4.2 Graph Traversal Techniques Breadth First Search BFS and Depth First Search DFS
4.3 Applications of BFS and DFS
4.4 Minimum Spanning Trees MST
4.5 Prim’s and Kruskal’s algorithms for MST
4.6 Connected Components
4.7 Dijkstra’s Algorithm for Single Source Shortest Paths
4.8 Floydd’s Algorithm for AllPairs Shortest Paths Problem
Unit 4
Graph Algorithms
4.1 Graph Algorithms Graphs and their Representations
4.2 Graph Traversal Techniques Breadth First Search BFS and Depth First Search DFS
4.3 Applications of BFS and DFS
4.4 Minimum Spanning Trees MST
4.5 Prim’s and Kruskal’s algorithms for MST
4.6 Connected Components
4.7 Dijkstra’s Algorithm for Single Source Shortest Paths
4.8 Floydd’s Algorithm for AllPairs Shortest Paths Problem
Unit - 5 Hashing Techniques
Unit 5
Hashing techniques
5.1 Hashing techniques
5.2 Hash function
5.3 Address calculation techniques common hashing functions Collision resolution
5.4 Linear probing
5.5 Quadratic probing
5.6 Double hashing
5.7 Bucket addressing
5.8 Rehashing
Unit 5
Hashing techniques
5.1 Hashing techniques
5.2 Hash function
5.3 Address calculation techniques common hashing functions Collision resolution
5.4 Linear probing
5.5 Quadratic probing
5.6 Double hashing
5.7 Bucket addressing
5.8 Rehashing
Download EEE 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
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
