Implement core graph algorithms for graphics
Company: NVIDIA
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: Medium
Interview Round: Take-home Project
Given a scene or dependency graph, implement topological sort, BFS/DFS, and shortest path (Dijkstra). Discuss time/space complexity, memory layouts (CSR vs adjacency lists), and how you would parallelize traversals on CPU vs GPU while avoiding contention and ensuring determinism in a test framework.
Quick Answer: This question evaluates proficiency in core graph algorithms (topological sort, BFS/DFS, and shortest-path algorithms like Dijkstra), understanding of time/space complexity, memory layout trade-offs (CSR vs adjacency lists), and parallel traversal strategies for CPU and GPU.