GIC

Which algorithm guarantees the shortest path in a graph with negative weights but no negative cycles?

The minimum number of edges in a connected graph with n vertices is:

In a binary search tree (BST), what is true about the left child of a node?

Recursive problems are implemented by

Which algorithm finds the shortest paths between all pairs of vertices in a weighted graph?

Depth-First Search (DFS) typically uses which data structure implicitly or explicitly?

Which of the following properties must a problem exhibit to be solvable by a greedy algorithm?

Which of the following sorting algorithms is best for nearly sorted data?

Which of the following is a fundamental challenge in Natural Language Processing (NLP)?

In which case is QuickSort’s performance worst?