1

GATE CSE 2024 Set 2

MCQ (Single Correct Answer)

+1

-0.33

Let $T(n)$ be the recurrence relation defined as follows:

$T(0) = 1$

$T(1) = 2$, and

$T(n) = 5T(n - 1) - 6T(n - 2)$ for $n \geq 2$

Which one of the following statements is TRUE?

2

GATE CSE 2024 Set 1

MCQ (Single Correct Answer)

+1

-0.33

Given an integer array of size $N$, we want to check if the array is sorted (in either ascending or descending order). An algorithm solves this problem by making a single pass through the array and comparing each element of the array only with its adjacent elements. The worst-case time complexity of this algorithm is

3

GATE CSE 2022

MCQ (Single Correct Answer)

+1

-0.33

Which one of the following statements is TRUE for all positive functions f(n) ?

4

GATE CSE 2022

MCQ (More than One Correct Answer)

+1

-0.33

Consider the following recurrence:

f(1) = 1;

f(2n) = 2f(n) $$-$$ 1, for n $$\ge$$ 1;

f(2n + 1) = 2f(n) + 1, for n $$\ge$$ 1;

Then, which of the following statements is/are TRUE?

Questions Asked from Complexity Analysis and Asymptotic Notations (Marks 1)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2024 Set 2 (1)
GATE CSE 2024 Set 1 (1)
GATE CSE 2022 (2)
GATE CSE 2020 (1)
GATE CSE 2015 Set 3 (1)
GATE CSE 2013 (3)
GATE CSE 2012 (2)
GATE CSE 2010 (1)
GATE CSE 2007 (1)
GATE CSE 2006 (1)
GATE CSE 2005 (1)
GATE CSE 2003 (2)
GATE CSE 2002 (1)
GATE CSE 2001 (1)
GATE CSE 1999 (1)
GATE CSE 1997 (1)
GATE CSE 1996 (1)

GATE CSE Subjects

Discrete Mathematics

Programming Languages

Theory of Computation

Operating Systems

Computer Organization

Database Management System

Data Structures

Computer Networks

Algorithms

Compiler Design

Software Engineering

Web Technologies

General Aptitude