- 447
- 22 797 715
Amulya's Academy
India
Приєднався 2 кві 2016
Here in Amuls Academy we provide free video tutorials on computer programming languages and tech topics.
currently we are making python tutorials and we will add more languages as early as possible.
currently we are making python tutorials and we will add more languages as early as possible.
Python Program To Implement DFS Using Iterative Approach | Using Stack | Data Structure
In this Python Programming video tutorial you will learn how to write function for DFS implementation in detail.
Data structure is a way of storing and organising the data so that it can be accessed effectively.
Graph is a non linear data structure consisting of nodes and edges.
Add_node
ua-cam.com/video/mDSoQbQYuSk/v-deo.html
Add_edge
ua-cam.com/video/9RB-DB3kUm0/v-deo.html
Delete_node
ua-cam.com/video/Am3g025nqXA/v-deo.html
Delete_edge
ua-cam.com/video/g0P6wBz7Y-I/v-deo.html
DFS {Recursive}:
ua-cam.com/video/Y-I9b3rOo3Q/v-deo.html
Iterative Implementation Of DFS Using Stack:
ua-cam.com/video/pBasV9jlQ0w/v-deo.html
#DataStructures #PythonPrograms #Graph
For more free tutorials on computer programming
AmulsAcademy
AmulsAcademy
Data structure is a way of storing and organising the data so that it can be accessed effectively.
Graph is a non linear data structure consisting of nodes and edges.
Add_node
ua-cam.com/video/mDSoQbQYuSk/v-deo.html
Add_edge
ua-cam.com/video/9RB-DB3kUm0/v-deo.html
Delete_node
ua-cam.com/video/Am3g025nqXA/v-deo.html
Delete_edge
ua-cam.com/video/g0P6wBz7Y-I/v-deo.html
DFS {Recursive}:
ua-cam.com/video/Y-I9b3rOo3Q/v-deo.html
Iterative Implementation Of DFS Using Stack:
ua-cam.com/video/pBasV9jlQ0w/v-deo.html
#DataStructures #PythonPrograms #Graph
For more free tutorials on computer programming
AmulsAcademy
AmulsAcademy
Переглядів: 49 053
Відео
Python Number Pattern - Reverse Floyd's Triangle
Переглядів 45 тис.2 роки тому
In this Python Pattern Printing Programs video tutorial you will learn how to print numbers in right triangle shape in detail. To print the pattern i will use nested for loops. In this program pattern contains two for loops: the first loop is responsible for rows and the second for loop is responsible for columns. Number Pattern Part 1: ua-cam.com/video/n1iyraKXykY/v-deo.html Number Pattern Par...
DFS Recursive Function Working | Python Program | Data Structure
Переглядів 12 тис.2 роки тому
In this Python Programming video tutorial you will learn how to write function for DFS implementation in detail. Data structure is a way of storing and organising the data so that it can be accessed effectively. Graph is a non linear data structure consisting of nodes and edges. Add_node ua-cam.com/video/mDSoQbQYuSk/v-deo.html Add_edge ua-cam.com/video/9RB-DB3kUm0/v-deo.html Delete_node ua-cam....
Python Program To Implement DFS Using Recursion | Data Structure
Переглядів 26 тис.2 роки тому
In this Python Programming video tutorial you will learn how to write function for DFS implementation in detail. Data structure is a way of storing and organising the data so that it can be accessed effectively. Graph is a non linear data structure consisting of nodes and edges. Add_node ua-cam.com/video/mDSoQbQYuSk/v-deo.html Add_edge ua-cam.com/video/9RB-DB3kUm0/v-deo.html Delete_node ua-cam....
DFS Implementation Using Stack Data Structure | Graph Traversal Algorithm
Переглядів 23 тис.3 роки тому
In this Python Programming video tutorial you will learn about graph traversal operation using DFS algorithm and ow to use stack in dfs in detail. Data structure is a way of storing and organising the data so that it can be accessed effectively. Graph is a non linear data structure consisting of nodes and edges. #DataStructures #PythonPrograms #Graph For more free tutorials on computer programm...
Graph Traversal Algorithm | Depth First Search | Data Structure | Part 2
Переглядів 11 тис.3 роки тому
In this Python Programming video tutorial you will learn about graph traversal operation using DFS algorithm in detail. Data structure is a way of storing and organising the data so that it can be accessed effectively. Graph is a non linear data structure consisting of nodes and edges. #DataStructures #PythonPrograms #Graph For more free tutorials on computer programming AmulsAcade...
Graph Traversal Algorithm | DFS | Data Structure
Переглядів 15 тис.3 роки тому
In this Python Programming video tutorial you will learn about graph traversal operation using DFS algorithm in detail. Data structure is a way of storing and organising the data so that it can be accessed effectively. Graph is a non linear data structure consisting of nodes and edges. #DataStructures #PythonPrograms #Graph For more free tutorials on computer programming AmulsAcade...
Graphs With Multiple Edges | Data Structure
Переглядів 10 тис.3 роки тому
In this Python Programming video tutorial you will learn about multi edge graphs in detail. Data structure is a way of storing and organising the data so that it can be accessed effectively. Graph is a non linear data structure consisting of nodes and edges. #DataStructures #PythonPrograms #Graph For more free tutorials on computer programming AmulsAcademy AmulsAcademy
Python Program For Graph Deletion Operation | Delete Edge | Adjacency List | Data Structure
Переглядів 9 тис.3 роки тому
In this Python Programming video tutorial you will write a function to delete given edge in the given graph in detail. Data structure is a way of storing and organising the data so that it can be accessed effectively. Graph is a non linear data structure consisting of nodes and edges. add_node function: ua-cam.com/video/mDSoQbQYuSk/v-deo.html add_edge function: ua-cam.com/video/9RB-DB3kUm0/v-de...
Python Program For Graph Deletion Operation | Delete Node | Adjacency List | Data Structure
Переглядів 9 тис.3 роки тому
In this Python Programming video tutorial you will write a function to delete given node in the given graph in detail. Data structure is a way of storing and organising the data so that it can be accessed effectively. Graph is a non linear data structure consisting of nodes and edges. add_node function: ua-cam.com/video/mDSoQbQYuSk/v-deo.html add_edge function: ua-cam.com/video/9RB-DB3kUm0/v-de...
Python Program For Graph Deletion Operation | Delete Edge | Adjacency Matrix | Data Structure
Переглядів 8 тис.3 роки тому
In this Python Programming video tutorial you will write a function to delete edge between given vertices in the given graph in detail. Data structure is a way of storing and organising the data so that it can be accessed effectively. Graph is a non linear data structure consisting of nodes and edges. format function: ua-cam.com/video/L19e53kEciI/v-deo.html add_node function: ua-cam.com/video/R...
Python Program For Graph Deletion Operation | Delete Node | Adjacency Matrix | Data Structure
Переглядів 9 тис.3 роки тому
In this Python Programming video tutorial you will write a function to delete given node in the given graph in detail. Data structure is a way of storing and organising the data so that it can be accessed effectively. Graph is a non linear data structure consisting of nodes and edges. format function: ua-cam.com/video/L19e53kEciI/v-deo.html add_node function: ua-cam.com/video/RS6pKl7hqR4/v-deo....
Graph Operations - Deletion | Data Structure | Python Tutorials
Переглядів 11 тис.3 роки тому
In this Python Programming video tutorial you will learn about graph deletion operation in detail. Data structure is a way of storing and organising the data so that it can be accessed effectively. Graph is a non linear data structure consisting of nodes and edges. #DataStructures #PythonPrograms #Graph For more free tutorials on computer programming AmulsAcademy AmulsA...
Python Program To Implement Graph Insertion Operation | Add Edge | Adjacency List | Data Structure
Переглядів 12 тис.3 роки тому
In this Python Programming video tutorial you will write a function to add edge between given vertices in the given graph in detail. Data structure is a way of storing and organising the data so that it can be accessed effectively. Graph is a non linear data structure consisting of nodes and edges. #DataStructures #PythonPrograms #Graph For more free tutorials on computer programming facebook.c...
Python Program To Implement Graph Insertion Operation | Add Node | Adjacency List | Data Structure
Переглядів 13 тис.3 роки тому
In this Python Programming video tutorial you will write a function to add node or a vertex to given graph in detail. Data structure is a way of storing and organising the data so that it can be accessed effectively. Graph is a non linear data structure consisting of nodes and edges. #DataStructures #PythonPrograms #Graph For more free tutorials on computer programming AmulsAcademy...
Graph Representation - Adjacency List | Data Structures
Переглядів 20 тис.3 роки тому
Graph Representation - Adjacency List | Data Structures
Python Program To Implement Graph Insertion Operation | Add Edge | Adjacency Matrix | Data Structure
Переглядів 15 тис.3 роки тому
Python Program To Implement Graph Insertion Operation | Add Edge | Adjacency Matrix | Data Structure
Python Program To Implement Graph Insertion Operation | Add Node | Adjacency Matrix | Data Structure
Переглядів 20 тис.3 роки тому
Python Program To Implement Graph Insertion Operation | Add Node | Adjacency Matrix | Data Structure
Graph Operations - Insertion | Data Structure | Python Tutorials
Переглядів 24 тис.3 роки тому
Graph Operations - Insertion | Data Structure | Python Tutorials
How To Delete Root Node In Binary Search Tree | Python Program | Data Structure | Part 2
Переглядів 23 тис.3 роки тому
How To Delete Root Node In Binary Search Tree | Python Program | Data Structure | Part 2
Graph Representation - Adjacency Matrix | Data Structure | Python Tutorials
Переглядів 27 тис.3 роки тому
Graph Representation - Adjacency Matrix | Data Structure | Python Tutorials
Terminologies of Graph | Data Structure
Переглядів 28 тис.3 роки тому
Terminologies of Graph | Data Structure
Introduction To Graphs | Data Structure
Переглядів 27 тис.3 роки тому
Introduction To Graphs | Data Structure
Heapq Module And Priority Queue | Binary Heap | Python Tutorials
Переглядів 29 тис.3 роки тому
Heapq Module And Priority Queue | Binary Heap | Python Tutorials
List Representation of Binary Heap | Python Tutorials
Переглядів 11 тис.3 роки тому
List Representation of Binary Heap | Python Tutorials
Create/Build Binary Heap {min heap or max heap} From List Of Numbers | data Structure
Переглядів 18 тис.3 роки тому
Create/Build Binary Heap {min heap or max heap} From List Of Numbers | data Structure
Binary Heap Operations | Data Structure
Переглядів 22 тис.3 роки тому
Binary Heap Operations | Data Structure
Introduction to Binary Heap Data Structure | Heap Tree
Переглядів 22 тис.3 роки тому
Introduction to Binary Heap Data Structure | Heap Tree
Python Program To Implement Binary Search Tree | Program 7 | Min and Max Key
Переглядів 14 тис.3 роки тому
Python Program To Implement Binary Search Tree | Program 7 | Min and Max Key
this series was epic
Great explanation ❤
n=int(input('enter no. of rows: ')) for i in range(1,n+1): r=i-1 for j in range(r): print(end=' ') for k in range(n-(r)): print('*',end=' ') print()
n=int(input('enter no. of rows:')) for i in range(1,n+1): k=n-i for j in range(k): print(' ',end='') for 1 in range(i): print('*',end=' ') print()
n=int(input('enter a number: ')) for i in range(1,n+1): for j in range(i+(i-1)): print('*',end='') print()
Please name the next tutorial. Thanks. ❤😂
Pl show goto code and polygon at desired position. Thanks for clear and slow speed of presentation.
Your way of instruction is very very good. I have seen one code heart shaped flower in UA-cam but found no clarification for taking the various codes. 😂😂❤🎉
I do not want fill color or background color but turtle lines should be red color. What to do?
how to print small alphabets
Tqsm mam❤
@AmulsAcademy it is good to learn data structures in python for top company placements
This really helped me a lot, thankyou for creating such great content :) It'd also be great if you explain multiple problems like the ones on leetcode, codeforces, etc
Did not understand 2nd forloop j
s=input("enter the string you want: ") for i in range (1,len(s)+1): print(s[0:i]) print()
Second value is assigned to first, but while adding u use temp+second???
want advanced ds concepts Amulya's Academy
I really appreciate your amazing way of teaching! 😊 Please, could you create videos on the following topics: django, python MySQL, kivyMd? Thank you! <3
Madam, can you please prepare a few videos on how to combine pythgon and excel. Or if you can suggest any book or a channel. thank you
Thank you for the video. The best part of this video is that it has explained how and what happens with the keyword 'return'.
How many are watching in 2024
!!!!!!!!!!!!!!6
You haven't incremented the while loop....Is it auto incremented..Can you explain in detail
nice explanation
in data structures you talked about data structures concepts where are the remaining algorithms topics..mam?
osm osm osm nice explanation thank you very much
At 5:40 sec u got confused ......tuples are immutable right ? But u said mutable once check it mam
osm osm osm osm osm
osm madam no words to express about your explanation
Thank you for a very informative and well explained lesson.
@amulya - your style of tracing the flow of program/control is EXCELLENT, feels like computer is tracing the instructions !! simply like your way of teaching Data Structures !!😊
Mam in add_before method can we use New_node.nref=n.pref.nref Instead of giving New_node=n But it gives attribute error,could you please tell me abt this..!
Osm explanation
Thank you so much mam❤its a crystal clear content
can you share the codes please?
Mam , We are linking a whole class with methods and functions whenever we used to create a new node sub tress will consist not only left , right and key but also insert function I think it will consume more memory.
Thank you very much! Everything is clear!
Pls post Python videos
mam, your voice quality is just wow 😌😌😌😌
n = int(input("enter a number :")) for i in range(2,n+1): for j in range(1,i): print(i-j,end="") print() out put is done. is this methode correct??
You pattern is wrong, this is the right pattern # Top half for i in range(num): print(" " * (num - i - 1) + "*" * (2 * i + 1)) # Bottom half for j in range(num - 2, -1, -1): print(" " * (num - j - 1) + "*" * (2 * j + 1))
def delete_end(self): if self.head is None: print("Linked list is empty") else: n=self.head while n.ref is not None: if n.ref.ref is None: break n=n.ref n.ref=None
Is this playlist enough for understanding complete dsa ?
Great Video maam really helpful glad i am learning good
Perfect explanation......❤
Thank you very much for all your videos mam.
Nice tutorial
Thank you mam for your excellent explanation
can you cover the advanced topics..??