Algorithms – GATE CSE Earlier 12 months Questions

Fixing GATE Earlier 12 months’s Questions (PYQs) not solely clears the ideas but additionally helps to achieve flexibility, pace, accuracy, and understanding of the extent of questions usually requested within the GATE examination, and that ultimately lets you acquire good marks within the examination. Earlier 12 months Questions assist a candidate apply and revise for GATE, which helps crack GATE with a great rating. 

Algorithms Earlier 12 months GATE Questions assist in analyzing the query sample of a topic and marking scheme in addition to it helps in time administration which total will increase the rating within the GATE examination. With common apply of PYQs, candidates can simply crack GATE with a great GATE Rating.

Earlier than 2006, questions requested in GATE had been primarily theoretical, however in recent times, the questions requested had been multiple-choice questions with a single appropriate choice or a number of appropriate choices. We need to present the multiple-choice questions which are requested in GATE.

Algorithms GATE Earlier 12 months Questions

On this article, we’re primarily specializing in the Algorithms GATE Questions which are requested in Earlier Years with their options, and the place a proof is required, we now have additionally offered the explanation.

In Algorithms, we are going to cope with the next ideas. We’ve additionally offered GATE Earlier 12 months’s Questions on these matters. Right here is the record of these matters together with their hyperlinks.

Additionally, right here we’re going to focus on some fundamental PYQs associated to Algorithms.

1. Which one of many following statements is TRUE for all constructive features f(n)? [GATE CSE 2022]

(A) f(n²) = θ(f(n)²), when f(n) is a polynomial

(B) f(n²) = o(f(n)²)

(C) f(n²) = O(f(n)²), when f(n) is an exponential operate

(D) f(n²) = Ω(f(n)²)

Resolution: Appropriate reply is (A)

For extra, seek advice from GATE | CS 2022 | Query 11.

2. For parameters a and b, each of that are ω(1), T(n) = T(n^1/a) + 1, and T(b) = 1. Then T(n) is [GATE 2020]

(A) θ(log_alog_bn)

(B) θ(log_abn)

(C) θ(log_blog_an)

(D) θ(log₂log₂n)

Resolution: Appropriate reply is (A)

For extra, seek advice from GATE | GATE CS 2020 | Query 12.

3. The Floyd-Warshall algorithm for all-pair shortest paths computation is predicated on [GATE CSE 2016]

(A) Grasping Algorithm

(B) Divide-and-Conquer Paradigm

(C) Dynamic Programming Paradigm

(D) neither Grasping nor Divide-and-Conquer nor Dynamic Programming Paradigm

Resolution: Appropriate reply is (C)

For extra, seek advice from GATE | GATE-CS-2016 (Set 2) | Query 24.

4. Which one of many following is the recurrence equation for the worst-case time complexity of the Quicksort algorithm for sorting (n ≥ 2) numbers? Within the recurrence equations given within the choices beneath, c is a continuing. [GATE CSE 2015]

(A) T(n) = 2T(n/2) + cn

(B) T(n) = T(n-1) + T(0) + cn

(C) T(n) = 2T(n-1) + cn

(D) T(n) = T(n/2) + cn

Resolution: Appropriate reply is (B)

For extra, seek advice from GATE | GATE-CS-2015 (Set 1) | Query 12.

5. An unordered record incorporates n distinct parts. The variety of comparisons to seek out a component on this record that’s neither most nor minimal is [GATE CSE 2015]

(A) θ(n log n)

(B) θ(n)

(C) θ(log n)

(D) θ(1)

Resolution: Appropriate reply is (D)

For extra, seek advice from GATE | GATE-CS-2015 (Set 2) | Query 65.

6. Take into account the next array of parts: (89,19,50,17,12,15,2,5,7,11,6,9,100). The minimal variety of interchanges wanted to transform it right into a max-heap is [GATE CSE 2015]

(A) 4

(B) 5 

(C) 2 

(D) 3

Resolution: Appropriate reply is (D)

For extra, seek advice from GATE | GATE-CS-2015 (Set 3) | Query 65.

7. The tightest decrease certain on the variety of comparisons, within the worst case, for comparison-based sorting is of the order of [GATE CSE 2004]

(A) n

(B) n²

(C) n log n

(D) n log² n

Resolution: Appropriate reply is (C)

For extra, seek advice from Algorithms | Sorting | Query 13.

8. The issues 3-SAT and 2-SAT are [GATE CSE 2004]

(A) each in P

(B) each NP-Full

(C) NP-Full and in P respectively

(D) Undecidable and NP-Full respectively

Resolution: Appropriate reply is (C)

For extra, seek advice from GATE-CS-2004 | Query 30.

9. A sorting method is named steady if: [GATE CSE 1999]

(A) It takes O(n log n) time

(B) It maintains the relative order of prevalence of non-distinct parts.

(C) It makes use of divide and conquers paradigm

(D) It takes O(n) area

Resolution: Appropriate reply is (B)

For extra, seek advice from GATE | GATE CS 1999 | Query 12.

10. For merging two sorted lists of sizes m and n right into a sorted record of measurement m+n, we require comparisons of [GATE CSE 1995]

(A) O(m)

(B) O(n)

(C) O(m+n)

(D) O(log m + log n)

Resolution: Appropriate reply is (C)

GATE CSE Earlier 12 months Query Papers

These earlier 12 months’s questions make it easier to in understanding the query patterns adopted by GATE that instantly assist a candidate in scoring good marks in GATE. Under are the talked about hyperlinks of year-wise GATE Earlier Query Papers.

Final Up to date :
20 Might, 2023

Like Article

Save Article