Request New Subject
Home
Computer Science Engineering (CSE)
High Performance Computing (HPC)
Q. Time Complexity of DFS is? (V – number of vertices, E – number of edges) (Solved)
1. o(v + e)
2. o(v)
3. o(e)
4. o(v*e)
a. o(v + e)
Related Topics
→ Computer Architecture and Organization
→ Microprocessor and Interfacing Technique
→ Computer Networks
→ Data Structure and Algorithms (DSA)
→ Operating System (OS)
→ Artificial Intelligence and Robotics (AIR)
→ Software Project Management (SPM)
→ Computer Fundamentals
→ Data Communication and Computer Network
→ CPP Programming
Subscribe Now
Get All Updates & News
Subscribe