Wednesday, May 31, 2023
HomeSoftware DevelopmentAlgorithms - GATE CSE Earlier Yr Questions

# Algorithms – GATE CSE Earlier Yr Questions

Fixing GATE Earlier Yr’s Questions (PYQs) not solely clears the ideas but in addition helps to realize flexibility, velocity, 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 Yr Questions assist a candidate apply and revise for GATE, which helps crack GATE with a very good rating.

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

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

## Algorithms GATE Earlier Yr Questions

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

In Algorithms, we are going to take care of the next ideas. We have now additionally offered GATE Earlier Yr’s Questions on these matters. Right here is the checklist of these matters together with their hyperlinks.

Additionally, right here we’re going to talk about some fundamental PYQs associated to Algorithms.

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

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

(B) f(n2) = o(f(n)2)

(C) f(n2) = O(f(n)2), when f(n) is an exponential perform

(D) f(n2) = Ω(f(n)2)

For extra, check with GATE | CS 2022 | Query 11.

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

(A) θ(logalogbn)

(B) θ(logabn)

(C) θ(logblogan)

(D) θ(log2log2n)

For extra, check with GATE | GATE CS 2020 | Query 12.

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

(A) Grasping Algorithm

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

For extra, check with 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 under, 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

For extra, check with GATE | GATE-CS-2015 (Set 1) | Query 12.

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

(A) θ(n log n)

(B) θ(n)

(C) θ(log n)

(D) θ(1)

For extra, check with GATE | GATE-CS-2015 (Set 2) | Query 65.

6. Think about 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

For extra, check with 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) n2

(C) n log n

(D) n log2 n

For extra, check with 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

For extra, check with GATE-CS-2004 | Query 30.

9. A sorting method known as secure if: [GATE CSE 1999]

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

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

(C) It makes use of divide and conquers paradigm

(D) It takes O(n) house

For extra, check with GATE | GATE CS 1999 | Query 12.

10. For merging two sorted lists of sizes m and n right into a sorted checklist 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)

## GATE CSE Earlier Yr Query Papers

These earlier 12 months’s questions provide help to in understanding the query patterns adopted by GATE that immediately assist a candidate in scoring good marks in GATE. Beneath are the talked about hyperlinks of year-wise GATE Earlier Query Papers.

Final Up to date :
20 Might, 2023

Like Article

Save Article

RELATED ARTICLES