Skip to main content
Home › Blog › #graph
Tag

#graph

3 articles
Can you explain the role of TensorFlow’s computation graph and how it affects model performance during training and inference?

TensorFlow’s computation graph represents the logical flow of operations, where nodes are operations and edges are tensors. This graph allows for optimizations during training and inference, enabling TensorFlow to execute…

🏷️
Can you explain how to implement Dijkstra’s algorithm in Java for finding the shortest path in a graph, and discuss its time complexity?

Dijkstra’s algorithm can be implemented using a priority queue to efficiently extract the vertex with the smallest distance. It has a time complexity of O((V + E) log V), where…

🏷️
Can you explain the difference between depth-first search and breadth-first search, and when you would prefer one over the other in a graph traversal scenario?

Depth-first search (DFS) explores as far down a branch as possible before backtracking, making it memory efficient for deep graphs. Breadth-first search (BFS) explores all neighbors at the present depth…

🏷️
2,000 Interview Questions and Answers PDF cover
Developer Interview Kit · PDF

2,000 Interview Questions & Answers, in one PDF

  • Short answers, in-depth explanations, common mistakes and follow-ups
  • 89 topics, from Beginner to Architect, with a clickable contents list
  • 226 extra questions that are not on this website
  • Free Bonus Pack: 30-day study plan, behavioral questions, salary scripts
$7.99 one-time · instant email delivery
260 Developer Learning Paths cover
Also available: 260 Developer Learning Paths $4.99 Week-by-week roadmaps for 16 career tracks (Python, React, Java, DevOps, SQL, AI and more), with a progress tracker on every path. See what's inside →

Get both books for $9.99 (save $2.99):

The material stays free to read online. This is the organised, offline, print-ready PDF edition. Secure payment by PayPal; your personal download link is emailed after payment is confirmed. Digital product, no shipping.