graph = {
"Me": ["DP"],
"DP": ["More DP"],
"More DP": ["Hard DP"],
"Hard DP": ["Existential Crisis"],
"Existential Crisis": []
}
visited = set()
def dfs(node):
if node in visited:
return
visited.add(node)
print(f"Visiting: {node}")
for nei in graph[node]:
dfs(nei)
dfs("Me")
I am an Android developer with...
I am a DevOps Engineer with 6+ years of hands-on experience working on real-time cloud and automation technologies. I teach DevOps and AWS Cloud in a practical, industry-oriented way so that students can confidently attend interviews and work on real projects.
My training focuses more on hands-on practice than theory. I help students understand...
I obtained Ph.D. from IIT Kanpur in the year 1994. Then I worked as Post doctoral research associate in IIT Bombay. I have more then 35 years of total teaching experience of undergraduate and postgraduate courses related to Mathematics in an Engineering College affiliated to Mumbai University including 12 yrs as teaching associate at IIT Kanpur...