Question
You are given a problem to find the shortest path in a graph where edge weights can be negative. Which algorithm would you *not* use?
More IT Operating System Questions
- Which type of fragmentation is primarily addressed by paging, and which type does paging typically introduce?
- A greedy algorithm is used to make change for a given amount using a set of coin denominations. For denominations {1, 5, 10, 25} and an amount of 30, it wo...
- Which of the following sorting algorithms has the best worst-case time complexity of O(n log n)?
- You need to store a sequence of items where elements are always added to one end and removed from the other end. Which data structure is most suitable?
- What is the time complexity of Heap Sort in the worst case and what type of heap is used to sort an array in ascending order?
- What is the "DRY" principle in software development?
- Strategy for software debugging in which the tester has limited knowledge of the internal details of the program :
- When tracing the execution of a for loop, what aspect of code flow are you primarily analyzing?
- Which of the following algorithm uses Darwinian based algorithm to find the best solutions to solve complicated problems with a greater number of variables...
- Which type of cable is referred to as K-type or Category 5e/6 in network infrastructure, and what is its maximum standard data transfer rate for Category ...
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
