RankVyuh

Home / GATE CS / Algorithms / Algorithms

Algorithms questions for GATE CS

15 Algorithms questions for GATE CS CS paper, in 1 timed test of about 42 minutes, each with solutions. Algorithms sits in the Algorithms section. The first test is free.

Start the free Algorithms test

Sample Algorithms questions

From the free test. Solutions open after you submit.

  1. 1. Which of the following functions grows asymptotically fastest as n → ∞?

    • a. 2^√n
    • b. n^100
    • c. (log2 n)^(log2 n)
    • d. (n!)^(1/n)
  2. 2. Insertion sort (the standard version that shifts larger elements one place to the right) is run on the array [7, 3, 8, 1, 5, 2]. How many element shifts does it perform in total? Give the answer as an integer.

    Algorithms tests

    Algorithms

    Then a full mock

    Topic drills fix one thing; the full mock shows whether it still costs you marks under the real clock.

    Free GATE CS full mock

    FAQ

    How many Algorithms questions come in GATE CS?
    Algorithms is part of the Algorithms section (see the pattern questions in the section). Its share varies by paper; our tests give 15 per test so one topic is drilled at a time.
    Are the GATE CS Algorithms questions free?
    The first Algorithms test is free, with solutions. Later tests come with any GATE CS pass or ₹9 each.
    How should I practise Algorithms for GATE CS?
    Take one timed test, read every solution (right answers included), note the method you missed, then take the next test two days later. Compare with your Algorithms score in a full mock to see if the topic still costs marks.