List of top Computer Science & Information Technology Questions on Computer Languages and Algorithms asked in AP PGECET

Which of the following sorting algorithms has the best average-case time complexity?
Order the following complexities in the increasing order: $ O(n^2), O(n^3), O(\log n), O(n \log n) $
The Travelling Salesman’s is an example of which of the following class of problems?
Which of the following is an example of divide and conquer strategy?
Which of the following problems is an example of backtracking strategy?
Which of the following is not an algorithmic strategy?
The average case time complexity of quick sort is