“सिर आंखों पर

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

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

Which of the following sorting algorithms has a worst-case time complexity of O(N log N)?

Which algorithm guarantees minimum spanning tree and will produce a different tree depending on tie-breaking?

In intelligent systems, which of the following is a key characteristic of an expert system?

Which shortest-path algorithm is appropriate for graphs with non-negative weights and supports decrease-key efficiently for faster performance?

In Data Communication, what protocol is used to ensure reliable transmission of data over a network?

A unique piece of information that is used in encryption.

Which algorithm is used to detect cycles in a directed graph?

In mobile computing, what is the main feature of pervasive computing?