Question
In which direction is B facing now? I. From point
C, B walks 10m, then he takes left turn and walks 5m. II. From point A, B walks 5m towards east, then he takes a right turn and walks 8m and then he take a left turn and walks 5m and stops. Each of the questions given below has one question and two statements marked I and II. You have to decide whether the data provided in the statements are sufficient to answer the question. Read both the statements and give answer.Solution
From I, B is walking in which direction is not given. Hence, I alone is not sufficient to answer the question. From II,
B is facing East. Hence, statement II alone is sufficient to answer the question.
For which problem is dynamic programming NOT generally an applicable technique because it lacks overlapping subproblems?
Which of the following statements about Dijkstra’s algorithm is true?
Which of the following sorting algorithms is best for nearly sorted data?
In hashing, what is a collision?
Consider a directed acyclic graph (DAG). The problem of finding the longest path in a DAG (with edge weights) can be solved in:
The time complexity of computing the all-pairs shortest paths in a dense graph with V vertices using Floyd–Warshall is:
Which command is TCL command
Which sorting algorithm is not stable by default?
Which algorithm guarantees minimum spanning tree and will produce a different tree depending on tie-breaking?
Which algorithm guarantees the shortest path in a graph with negative weights but no negative cycles?