Table of Contents 1

Table of Contents

Table of Contents 1
Contributors 6
1 Algorithms (84) 7
1.1 Algorithm Design (32) 7
1.2 Divide And Conquer (2) 13
1.3 Dynamic Programming (5) 14
1.4 Graph Algorithms (2) 15
1.5 Greedy Algorithm (1) 15
1.6 Identify Function (12) 15
1.7 Minimum Spanning Trees (3) 20
1.8 P Np Npc Nph (2) 20
1.9 Recurrence (3) 21
1.10 Reduction (2) 21
1.11 Sorting (10) 22
1.12 Spanning Tree (1) 24
1.13 Time Complexity (9) 24
2 CO and Architecture (4) 28
2.1 Cache Memory (1) 28
2.2 Machine Instructions (1) 28
2.3 Pipelining (2) 28
3 Compiler Design (4) 30
3.1 Compilation Phases (1) 30
3.2 Parameter Passing (1) 30
3.3 Runtime Environments (2) 30
4 Computer Networks (8) 31
4.1 Crc Polynomial (1) 31
4.2 Data Link Layer (1) 31
4.3 Error Detection (1) 31
4.4 Link State Routing (1) 31
4.5 Routing (1) 32
4.6 Sliding Window (1) 32
4.7 Throughput (1) 32
4.8 Token Ring (1) 32
5 Databases (10) 33
5.1 Database Normalization (2) 33
5.2 Indexing (1) 33
5.3 Natural Join (1) 33
5.4 Relational Algebra (4) 34
5.5 Relational Calculus (1) 35
5.6 Sql (1) 35
6 Digital Logic (14) 36
6.1 Adder (1) 36
6.2 Boolean Algebra (4) 36
6.3 Boolean Expression (1) 36
6.4 Digital Circuits (1) 37
6.5 Error Detection (1) 37
6.6 Functional Completeness (1) 37
6.7 Ieee Representation (2) 37
6.8 K Map (1) 37
6.9 Number Representation (1) 38
6.10 Prime Implicants (1) 38
7 Discrete Mathematics: Combinatory (58) 39
7.1 Arrangements (4) 39
7.2 Binomial Theorem (10) 39
7.3 Circular Permutation (1) 41
7.4 Generating Functions (1) 41

© Copyright GATE Overflow. All rights reserved.

2 Table of Contents

7.5 Permutation And Combination (36) 41

7.6 Pigeonhole Principle (2) 46
7.7 Recurrence Relations (2) 46
7.8 Sets (1) 47
7.9 Summation (1) 47
8 Discrete Mathematics: Graph Theory (41) 48
8.1 Degree Of Graph (2) 48
8.2 Graph Coloring (3) 48
8.3 Graph Connectivity (22) 48
8.4 Independent Set (2) 52
8.5 Regular Pentagon (1) 53
8.6 Shortest Path (3) 53
8.7 Spanning Tree (2) 53
8.8 Trees (2) 54
8.9 Undirected Graph (1) 54
8.10 Vertex Cover (3) 54
9 Discrete Mathematics: Mathematical Logic (4) 56
9.1 First Order Logic (2) 56
9.2 Logical Reasoning (2) 56
10 Discrete Mathematics: Set Theory & Algebra (46) 57
10.1 Algebra (1) 57
10.2 Cartesian Product (1) 57
10.3 Disjoint Sets (1) 57
10.4 Factors (1) 57
10.5 Functions (8) 57
10.6 Graph Connectivity (1) 59
10.7 Group Theory (5) 59
10.8 Inequality (1) 59
10.9 Number Theory (2) 60
10.10 Polynomials (5) 60
10.11 Relations (2) 61
10.12 Sets (14) 61
10.13 Subgroups (1) 63
10.14 Subsets (2) 64
11 Engineering Mathematics: Calculus (126) 65
11.1 Area Under The Curve (2) 65
11.2 Continuity (9) 65
11.3 Convergence (1) 66
11.4 Convex Concave (1) 66
11.5 Curves (1) 67
11.6 Definite Integrals (11) 67
11.7 Determinants (1) 69
11.8 Differential Equation (6) 69
11.9 Differentiation (11) 70
11.10 Functions (17) 72
11.11 Inequality (1) 75
11.12 Integration (9) 75
11.13 Limits (40) 76
11.14 Logarithms (1) 82
11.15 Maxima Minima (8) 83
11.16 Polynomials (1) 84
11.17 Quadratic Equations (1) 84
11.18 Range (2) 84
11.19 Taylor Series (3) 85
12 Engineering Mathematics: Linear Algebra (57) 86
12.1 Definite Integrals (1) 86
12.2 Determinant (13) 86
12.3 Eigen Value (4) 88
12.4 Eigen Vectors (1) 89

© Copyright GATE Overflow. All rights reserved.

Table of Contents 3

12.5 Inverse (2) 89

12.6 Matrices (15) 89
12.7 Minors (1) 92
12.8 Orthogonal Matrix (3) 92
12.9 Rank Of Matrix (5) 93
12.10 Summation (1) 94
12.11 System Of Equations (10) 94
12.12 Vector Space (1) 96
13 Engineering Mathematics: Probability (35) 97
13.1 Balls In Bins (2) 97
13.2 Conditional Probability (4) 97
13.3 Independent Events (3) 98
13.4 Number System (1) 98
13.5 Poisson Distribution (3) 98
13.6 Probability (19) 99
13.7 Random Variable (2) 102
13.8 Uniform Distribution (1) 102
14 General Aptitude: Numerical Ability (183) 103
14.1 Area (2) 107
14.2 Arithmetic Series (6) 108
14.3 Binomial Theorem (1) 109
14.4 Cartesian Coordinates (1) 109
14.5 Circle (3) 109
14.6 Coefficients (1) 109
14.7 Congruent Modulo (1) 109
14.8 Conjunction (1) 110
14.9 Convergence Divergence (1) 110
14.10 Cubic Equations (3) 110
14.11 Factorial (1) 110
14.12 Factors (6) 111
14.13 Geometric Series (1) 111
14.14 Geometry (3) 111
14.15 Inequality (3) 112
14.16 Integer Solutions (1) 112
14.17 Intersection (1) 112
14.18 Inverse Trigonometry (1) 112
14.19 Lines (3) 113
14.20 Logarithms (7) 113
14.21 Logical Reasoning (10) 114
14.22 Median (2) 116
14.23 Minimum Value (1) 116
14.24 Number System (12) 116
14.25 Numerical Computation (1) 118
14.26 Parallelograms (1) 118
14.27 Percentage (1) 118
14.28 Pigeonhole Principle (4) 118
14.29 Polynomial (1) 119
14.30 Quadratic Equations (6) 119
14.31 Rectangles (1) 120
14.32 Remainder Theorem (11) 120
14.33 Roots (18) 122
14.34 Sequence Series (2) 124
14.35 Sets (1) 124
14.36 Squares (2) 124
14.37 Straight Lines (1) 125
14.38 Summation (9) 125
14.39 System Of Equations (1) 126
14.40 Triangles (2) 126
14.41 Trigonometry (13) 127
14.42 Unit Digit (1) 128

© Copyright GATE Overflow. All rights reserved.

4 Table of Contents

14.43 Work Time (1) 128

15 Non GATE: Geometry (47) 130
15.1 Area (9) 130
15.2 Centroid (1) 131
15.3 Cubes (2) 131
15.4 Curves (6) 131
15.5 Ellipses (1) 132
15.6 Geometry (2) 133
15.7 Hyperbola (1) 133
15.8 Inverse (2) 133
15.9 Lines (5) 133
15.10 Parabola (2) 134
15.11 Quadrilateral (1) 134
15.12 Triangles (5) 135
15.13 Trigonometry (10) 135
16 Non GATE: Others (39) 137
16.1 Complex Number (4) 137
16.2 Convergence Divergence (2) 137
16.3 Curves (1) 138
16.4 Differential Equation (7) 138
16.5 Differentiation (2) 139
16.6 Ellipses (3) 140
16.7 Functions (1) 140
16.8 General Solution (1) 140
16.9 Hyperbola (2) 140
16.10 Inequality (3) 141
16.11 Parabola (2) 141
16.12 Partial Derivatives (3) 142
16.13 Quadratic Equations (1) 142
16.14 Quadrilateral (1) 142
16.15 Sequence Series (1) 143
16.16 Summation (2) 143
16.17 Trignometry (3) 143
17 Operating System (15) 145
17.1 Bankers Algorithm (1) 145
17.2 Concurrency (2) 145
17.3 Demand Paging (1) 145
17.4 Memory Management (1) 146
17.5 Pipelining (1) 146
17.6 Process Schedule (3) 147
17.7 Process Synchronization (4) 147
17.8 Resource Allocation (1) 149
17.9 Tlb (1) 149
18 Programming and DS: DS (13) 150
18.1 Arrays (1) 150
18.2 Avl Tree (1) 150
18.3 Binary Search Tree (2) 150
18.4 Binary Tree (1) 150
18.5 Heap (1) 151
18.6 Linked Lists (4) 151
18.7 Queues (1) 153
18.8 Trees (2) 153
19 Programming and DS: Programming (14) 154
19.1 Identify Function (4) 154
19.2 Lifetime (1) 155
19.3 Output (3) 155
19.4 Programming In C (5) 156
19.5 Recursion (1) 157
20 Theory of Computation (43) 158

© Copyright GATE Overflow. All rights reserved.

Table of Contents 5

20.1 Closure Property (3) 158

20.2 Conjugates (1) 158
20.3 Context Free Grammars (2) 158
20.4 Context Free Languages (2) 159
20.5 Context Sensitive (1) 159
20.6 Finite Automata (11) 159
20.7 Identify Class Language (3) 161
20.8 Nfa Dfa (3) 161
20.9 Pushdown Automata (1) 162
20.10 Reduction (1) 162
20.11 Regular Expressions (5) 162
20.12 Regular Languages (9) 163
20.13 Turing Machine (1) 165

© Copyright GATE Overflow. All rights reserved.

6 Contributors

Contributors
User , Answers User Added User Done
srestha 145, 29 Jotheeswari 196 Jeet 114
Muktinath Vishwakarma 115, 8 gatecse 167 Arjun Suresh 29
Jeet 107, 124 Arjun Suresh 105 Lakshman Patel 21
Dhananjay Kumar Sharma 83, 6 Keval Malde 40 Milicevic3306 20
Leen Sharma 82, 12 Sayan Bose 30 kenzou 17
Manoj Kumar 81, 13 Akash Dinkar 28 Naveen Kumar 17
Kushagra Chatterjee 54, 23 Jayanta Mahata 13 Sayan Bose 15
Heisenberg 47, 4 Devasish Ghosh 5 Washeef 14
Arjun Suresh 41, 5 abhi18459 3 Akash Dinkar 12
Sukanya Das 37, 4 Aakanchha 2 srestha 8
Washeef 37, 24 Satbir Singh 7
Soumya Jain 36, 2 Pavan Singh 7
pratekag 36, 18 Krithiga2101 6
Keval Malde 35, 11 Ashish verma 5
HABIB MOHAMMAD 32, 2 Ankit Gupta 5
KHAN Kushagra Chatterjee 4
balaeinstein 32, 4 Leen Sharma 4
Rishabh Gupta 31, 3 pratekag 4
Akshay Arora 30, 2 Shaik Masthan 3
sonu 29, 1 Tauhin Gangwar 3
2018 28, 3 Sourajit25 3
Satbir Singh 28, 39 Ajay kumar soni 3
Hemant Parihar 27, 1 Manoj Kumar 3
Ashish verma 26, 10 Shikha Mallick 3
shekhar chauhan 25, 1 Keval Malde 2
Gaurab Ghosh 23, 1 !KARAN 2
sourb 23, 1 Sukanya Das 2
Tariq Husain khan 22, 1 chirudeepnamini 2
Shyam Singh 21, 1 Mk Utkarsh 2
Ahwan Mishra 21, 1 Pooja Khatri 2
Manish Joshi 20, 1 Yash Khanna 2
Prasita Mukherjee 19, 6 Debashish Deka 2
Tauhin Gangwar 19, 8 Devasish Ghosh 2
Debashish Deka 18, 5 Soumya Jain 2
Pankaj Kumar 17, 2
Dhruv Patel 16, 1
Manu Thakur 16, 2
shayal chhabra 15, 1
Dharmendra Lodhi 14, 4
Ashwani Kumar 14, 10
debanjan sarkar 13, 1
Subarna Das 12, 1
Arkaprava Paul 12, 9
Arjun 11, 1
Tanushree 10, 2
Deepak Poonia 10, 3
Ankit Gupta 10, 3
suman116 10, 5
Shikha Mallick 10, 6
Shubham Sharma 9, 3
Lokesh Dafale 9, 6
Digvijay 8, 2
Sourajit25 8, 6
Sayan Bose 7, 5
Arnab Bhadra 6, 1
Sukannya Purkayastha 6, 1
asutosh kumar Biswal 6, 3
Anand Vijayan 5, 1
chirudeepnamini 5, 8
Utkarsh Joshi 4, 1
Sambit Kumar 3, 1
Ashok Laxman Bhojane 3, 1
aditi19 3, 1
sasuke 3, 4
!KARAN 3, 4
Mk Utkarsh 3, 5
Lakshman Patel 3, 7
amit kumar 3, 9

© Copyright GATE Overflow. All rights reserved.

1 Algorithms (84) 7

1 Algorithms (84)

1.1 Algorithm Design (32)

1.1.1 Algorithm Design: CMI2010 - 6 https://gateoverflow.in/215034

You are given a list of positive integers along with a sequence of operations from the set {∗, +} .You construct
expressions from these two lists so that:

The numbers in the expression are drawn from the first list, without repetition and without altering their order.
All the operators in the second list are used in the expression, in the same order.

For example, if the two lists are [1, 3, 2, 1, 4] and [' ∗ ', ' + '] the set of possible expressions you can form are
1 ∗ 3 + 2, 1 ∗ 3 + 1, 1 ∗ 3 + 4, 1 ∗ 2 + 1, 1 ∗ 2 + 4, … , 2 ∗ 1 + 4, 1 ∗ 3 + 2, 1 ∗ 3 + 1, 1 ∗ 3 + 4, 1 ∗ 2 + 1, 1 ∗ 2 + 4, … , 2
For each expression, the value is computed by bracketing operators from the right. That is, the expressions above are evaluated
as
1 ∗ (3 + 2), 1 ∗ (3 + 1), 1 ∗ (3 + 4), 1 ∗ (2 + 1), 1 ∗ (2 + 4), … , 2 ∗ (1 + 4), 1 ∗ (3 + 2), 1 ∗ (3 + 1), 1 ∗ (3 + 4), 1 ∗ (2 +
The aim is to determine maximum value among these expressions. In this example, the maximum value is 18, from the
expression 3 ∗ 2 + 4, which is evaluated as 3 ∗ (2 + 4) = 3 ∗ 6 = 18 .
You may assume that the length of the first list is more than the length of the second list.
Describe an algorithm to solve this problem.

algorithms descriptive cmi2010 algorithm-design

1.1.2 Algorithm Design: CMI2010-B-01b https://gateoverflow.in/47072

An international cellphone company provides service on 7 different frequencies. They wish to set up business in Tamil
Nadu and have fixed the locations of 100 towers for their new service. The company has to ensure that two towers
broadcasting on the same frequency are at least 100 km apart, so that there is no interference of signals.
i. Describe an algorithm which will answer the question “Is it feasible to set up towers at the given locations and provide
service on 7 different frequencies?”. Your algorithm should say “feasible” if it is feasible, otherwise output the minimum
number of frequencies needed to utilise all 100 towers.

cmi2010 descriptive algorithms algorithm-design

1.1.3 Algorithm Design: CMI2012-B-03a https://gateoverflow.in/46563

Let A be an array of n integers, sorted, so that A[1] ≤ A[2] ≤ … A[n]. Suppose you are given a number x and you
wish to find out if there are indices k and l such that A[k] + A[l] = x.

a. Design an O(n log n) time algorithm for this problem.

cmi2012 descriptive algorithms algorithm-design

1.1.4 Algorithm Design: CMI2012-B-03b https://gateoverflow.in/47088

Let A be an array of n integers, sorted so that A[1] ≤ A[2] ≤ … A[n]. Suppose you are given a number x and you
wish to find out if there exist indices k and l such that A[k] + A[l] = x.

a. Design an O(n) algorithm for this problem.

descriptive cmi2012 algorithms algorithm-design

1.1.5 Algorithm Design: CMI2013-B-06a https://gateoverflow.in/46616

Your final exams are over and you are catching up on watching sports on TV. You have a schedule of interesting
matches coming up all over the world during the next week. You hate to start or stop watching a match midway, so
your aim is to watch as many complete matches as possible during the week.
Suppose there are n such matches scheduled during the coming week and you know the starting and finishing time for each
match.

i. Describe an efficient algorithm to compute the following: for each match, what is the next match whose starting time is
strictly later than the finishing time of the current match? Analyze the worse-case complexity of your algorithm.

© Copyright GATE Overflow. All rights reserved.

8 1 Algorithms (84)

cmi2013 descriptive algorithms algorithm-design

1.1.6 Algorithm Design: CMI2014-B-03 https://gateoverflow.in/46983

Air CMI operates direct flights between different cities. For any pair of cities A and B, there is at most one flight in a
day from A to B. The online site FakeTrip is tryingto compile a list of all routes available through Air CMI.

a. FakeTrip has a table of all direct flights operated by Air CMI. From this, it wants to prepare a list of all pairs of cities
connected by a sequence of flights. Describe an algorithm for this and analyze the complexity of your algorithm.
b. CheapTricks is trying to enter the market by improving on FakeTrip. CheapTricks has realized that not all
connections listed by FakeTrip are feasible because of arrival and departure constraints. A connection from A to B to C
is possible if the scheduled arrival of the flight from A to B is at least one hour before the scheduled departure of the flight
from B to C .

Given a table of direct flights with scheduled arrival and departure times, describe an algorithm for CheapTricks to list all
pairs of cities connected by a route on which all connections are feasible within the same day. Analyze the complexity of your
algorithm.

cmi2014 descriptive algorithms algorithm-design

1.1.7 Algorithm Design: CMI2014-B-04 https://gateoverflow.in/46984

The frequency of a number in an array is the number of times it appears in the array. Describe an algorithm that finds
the most frequent number in an array of n numbers. If there are multiple numbers with highest frequency then list them
all. Analyze the complexity of your algorithm.
cmi2014 descriptive algorithms algorithm-design

1.1.8 Algorithm Design: CMI2014-B-06a https://gateoverflow.in/46986

Let A be an array of n integers, sorted so that A[1] ≤ A[2] ≤ ⋯ ≤ A[n]. You are given a number xx. The aim is to
find out if there are indices k and l such that A[k] + A[l] = x. Design an algorithm for this problem that works in time
O(n).
cmi2014 descriptive algorithms algorithm-design

1.1.9 Algorithm Design: CMI2014-B-06b https://gateoverflow.in/46988

Let A be array of n integers that is not assumed to be sorted. You are given a number x. The aim is to find out if there
are indices k, l and m such that A[k] + A[l] + A[m] = x. Design an algorithm for this problem that works in time
O(n2 ).
cmi2014 descriptive algorithms algorithm-design

1.1.10 Algorithm Design: CMI2015-B-05 https://gateoverflow.in/47065

An airline runs flights between several cities of the world. Every flight connects two cities. A millionaire wants to
travel from Chennai to Timbuktu by changing at most k1 flights. Being a millionaire with plenty of time and money, he
does not mind revisiting the same city multiple times, or even taking the same flight multiple times in his quest. Can you help
the millionaire by describing how to compute the number of ways he can make his journey? How many steps does your
procedure take if there are n cities and he can change flights at most k1 times. You can assume that the procedure can add or
multiply two numbers in a single operation.
cmi2015 descriptive algorithms algorithm-design

1.1.11 Algorithm Design: CMI2016-B-1 https://gateoverflow.in/98385

A group of war prisoners are trying to escape from a prison. They have thoroughly planned the escape from the prison
itself, and after that they hope to find shelter in a nearby village. However, the village (marked as B, see picture below)
and the prison (marked as A) are separated by a canyon which is also guarded by soldiers (marked as S ). These soldiers sit in
their pickets and rarely walk; the range of view of each soldier is limited to exactly 100 meters. Thus, depending on the
locations of soldiers, it may be possible to pass the canyon safely, keeping the distance to the closest soldier strictly larger than
100 meters from any moment. The situation is depicted in the following picture, where the circles around S indicate the range
of view.

© Copyright GATE Overflow. All rights reserved.

1 Algorithms (84) 9

Provide an algorithm to determine if the prisoners can pass the canyon unnoticed, given the width and the length of a canyon
and the coordinated of every soldier in the canyon, and assuming that soldiers do not change their locations (Hint: Model this
as a graph, with soldiers represented by the vertices.)

cmi2016 algorithms descriptive algorithm-design

1.1.12 Algorithm Design: CMI2016-B-6 https://gateoverflow.in/98766

An automatic spelling checker works as follows. Given a word w, first check if w is found in the dictionary. If w is not
in the dictionary, compute a dictionary entry that is close to w. For instance if the user types ocurrance, the spelling
checker should suggest occurence , which belongs to the dictionary. Similarity between words such as occurrence and
occurrance is quantified in terms of alignment.

An alignment between two strings w1 and w2 (over the alphabet {a, b, c, . . . . , z }) is obtained by inserting hyphens in the two
strings such that the modified strings align (i.e.,the modified strings are of equal length, and at each position, either both
strings have the same letter or one of the strings has a hyphen).

here are three examples of alignments. The first is between ocurrance and occurrence and the second and third are between
ctatg and ttaagc.
oc-urr-ance ct-at-g- ctat---g-
(1) (2) (3)
occurre-nce -tta-agc ---ttaagc
A mismatch in an alignment is a position where one of modified strings has a hyphen and the other does not. There are three
mismatches in the first alignment given above, five mismatches in the second, and seven mismatches in the third.

Use dynamic programming to give an efficient algorithm that takes two strings x and y (over the alphabet {a, b, c, . . . , z } as
its input, and computes the minimum number of mismatches among all alignments of x and y. What is the running time of
your algorithm (in terms of the lengths of x and y)?

cmi2016 dynamic-programming algorithm-design descriptive

1.1.13 Algorithm Design: CMI2017-B-2 https://gateoverflow.in/203311

There are a number of tourist spots in a city and a company GoMad runs shuttle services between them. Each shuttle
plies between a designated origin and destination, and has a name. Due to lack of coordination, the same name may be
allotted to multiple routes.

To make matters worse, another company GoCrazy introduces its shuttle services using the same set of shuttle names. A
GoMad shuttle and a GoCrazy shuttle with the same name may start at different origins and/or end at different destinations.

A pass from a company allows unlimited travel in all the company’s shuttles. For each company, we have a list that specifies
all routes allotted to each shuttle name.

Design an algorithm to find out if there is a source s, a target t, and a sequence of shuttle names σ such that, irrespective of
whether you are carrying a GoMad pass or a GoCrazy pass, you can start at s and arrive at t using the sequence σ.
cmi2017 algorithms algorithm-design

1.1.14 Algorithm Design: CMI2018-B-4 https://gateoverflow.in/320459

You are given a sorted array of n elements which has been circularly shifted. For example, {35, 42, 5, 12, 23, 26} is a
sorted array that has been circularly shifted by 2 positions.
Give an O(log n) time algorithm to find the largest element in a circularly shifted array. (The number of positions through
which it has been shifted is unknown to you.)
cmi2018 algorithm-design descriptive

© Copyright GATE Overflow. All rights reserved.

10 1 Algorithms (84)

1.1.15 Algorithm Design: CMI2018-B-6 https://gateoverflow.in/320457

You are playing an old-style video game in which you have to shoot down alien spaceships as they fly across the screen
from left to right. Each spaceship flies across the screen at a specified height. You have an antiaircraft gun set to shoot
down all spaceships at a certain height. Spaceships fly one at a time, so if your gun is set to fire at the correct height, it will
shoot down the spaceship currently flying across the screen.
You can set the initial height at which the gun fires. As the game progresses, you can reset the height, but only to a lower
value. You are given in advance the height at which each spaceship flies. There are N spaceship numbered 1, 2, ⋯ , N in the
order in which they fly across the screen. For 1 ≤ i ≤ N, h[i] denotes the height at which spaceship i flies.

A. Let V [i] denotes the maximum number of spaceships from i, i + 1. ⋯ , N that you can shoot down with a single gun.
Write a recurrence for V [i] and describe a strategy to compute V [i] using dynamic programming. What is the space and
time complexity of your solution?
B. Describe an algorithm to compute the minimum number of guns required to shoot down all the space ships. Each gun can
be initialized separately to a firing height and each gun can be separately reset to a lower value.

cmi2018 descriptive algorithm-design

1.1.16 Algorithm Design: CMI2019-B-6 https://gateoverflow.in/320517

Let A be an n × n matrix of integers such that each row and each column is arranged in ascending order. We want to
check whether a number k appears in A. If k is present, we should report its position - that is, the row i and column j
such that A(i, j) = k. Otherwise, we should declare that k is not present in A.

A. Describe an algorithm that solves this problem in time O(n log n). Justify the complexity of your algorithm.
B. Describe an algorithm that solves this problem by examining at most 2n values in A. Justify the complexity of your
algorithm.
C. For both algorithms, describe a worst-case input where k is present in A.

cmi2019 algorithms algorithm-design descriptive

1.1.17 Algorithm Design: ISI-2017-PCB-C6 https://gateoverflow.in/214770

Let A = {a1 , a2 , … , an } be an array of n distinct numbers. The array may not be sorted. The first element a1 is said
to be a blip if a1 > a2 . Similar, the last element an is said to be a blip if an > an−1 . Among the remaining elements,
an element ai is said to be blip if ai > ai−1 and ai > ai+1 where i ∈ (2, 3, … , n − 1) . Design an O(log n) time algorithm
for finding a blip in A. Justify the complexity of your algorithm.
isi2017 algorithms algorithm-design descriptive

1.1.18 Algorithm Design: ISI2011-PCB-A-4b https://gateoverflow.in/48053

Consider the following intervals on the real line: A1 = (13.3, 18.3) A3 = (8.3, 23.3) − A1 ∪ A2
A2 = (10.8, 20.8) − A1 A4 = (5.8, 25.8) − A1 ∪ A2 ∪ A3 where (a, b) = {x : a < x < b} . Write pseudo-code
that calculates (without using any comparison operation) which interval a given input x ∈ (5.8, 25.8) belongs to, i.e., your
pseudo-code should calculate i ∈ {1, 2, 3, 4} such that x ∈ Ai .

descriptive isi2011 algorithms algorithm-design

1.1.19 Algorithm Design: ISI2012-PCB-A-3 https://gateoverflow.in/47837

Given an array A = {a1 , a2 , … , an } of unsorted distinct integers, write a program in pseudo-code for the following
problem: given an integer u, arrange the elements of the array A such that all the elements in A which are less than or
equal to u are at the beginning of the array, and the elements which are greater than u are at the end of the array. You may use
at most 5 extra variables apart from the array A.
descriptive isi2012 algorithms algorithm-design

1.1.20 Algorithm Design: ISI2013-PCB-CS-1a,b https://gateoverflow.in/47499

Consider the fast square and multiply algorithm to calculate xy mod N as given below, where x, y, N are
positive integers and 1 ≤ x, y < N .
Input: x, y, N
Output: xy mod N

© Copyright GATE Overflow. All rights reserved.

1 Algorithms (84) 11

1. z = y, u = 1, v = x;
2. while z > 0 do
3. if z ≡ 1 mod 2 then
4. u = uv mod N;
end
5. v = v2 mod N; z = ⌊ z2 ⌋
end
6. return u

a. Write a C function to implement the algorithm. Your function should take three arguments x, y and N , and return the
value xy mod N, all of which are of type unsignedlonglong (i.e., 64-bit unsigned integers).
b. Discuss whether your program works perfectly for all possible input combinations.

descriptive isi2013-pcb-cs algorithms algorithm-design

1.1.21 Algorithm Design: ISI2013-PCB-CS-2a https://gateoverflow.in/47629

Draw a complete binary tree T with (N − 1) nodes where N = 2n . Suppose each node in T is a processor and each
edge of T is a physical link between two processors through which they can communicate. Given M arrays
Ai = {e1i , e2i , … , eNi } for 1 ≤ i ≤ M , develop an algorithm for the given architecture to compute the sum of each array
SU Mi = ΣN j=1 eji for all i in O(log N + M) time.

descriptive isi2013-pcb-cs algorithms algorithm-design

1.1.22 Algorithm Design: ISI2013-PCB-CS-3 https://gateoverflow.in/47635

Let M be an (n × n) matrix where each element is a distinct positive integer. Construct another matrix M ′ by
permuting the rows and/or permuting the columns, such that the elements of one row appear in increasing order (while
looking from left to right) and those of one column appear in decreasing order (while looking from top to bottom).

a. Describe an O(n2 ) time algorithm for constructing M ′ . Justify your analysis.

b. Propose a data structure that supports your algorithm. Clearly explain how much additional storage, other than the matrix
itself, is required in your algorithm.

descriptive isi2013-pcb-cs algorithms algorithm-design

1.1.23 Algorithm Design: ISI2013-PCB-CS-7 https://gateoverflow.in/47648

A connected, simple, undirected planar graph G(V , E) is given where V denotes the set of vertices and E denotes the
set of edges. In V , there is a designated source vertex s and a designated destination vertex t. Let P (v) denote the
shortest path (may contain repetition of nodes/edges) from s to t that passes through v, and let l(v) denote the path length (i.e.,
the number of edges) of P (v).

a. Describe an O(|V |) time algorithm that determines the value of where . Justify your analysis.
b. Propose a data structure that supports your algorithm.

For example, in the graph shown in the above figure, = 10, which corresponds to
.]

descriptive isi2013-pcb-cs algorithms graph-theory algorithm-design

1.1.24 Algorithm Design: ISI2014-PCB-A-2b https://gateoverflow.in/49146

Let be a 30 × 40 matrix having 500 non-zero entries. For , let be the number of non-zero entries in the
-th row, and for , let be the number of non-zero entries in the -th column.

© Copyright GATE Overflow. All rights reserved.

12 1 Algorithms (84)

Suppose that it is desired to create a stack of size 30 containing the values , not necessarily in order such that the
top of the stack contains the value . Write pseudo-code for creating such a stack using a single scan of the matrix
.
isi2014 algorithms algorithm-design

1.1.25 Algorithm Design: ISI2014-PCB-CS-1 https://gateoverflow.in/47436

a. Assume you have a chocolate bar containing a number of small identical squares arranged in a rectangular pattern. Our job
is to split the bar into small squares by breaking along the lines between the squares. We obviously want to do it with the
minimum number of breakings. How many breakings will it take?
b. Consider that the chocolate bar has n breaking lines along the length and m breaking lines along the breadth. Write a C
function that will take n, m as inputs and print the line numbers along the length and the breadth according to your strategy
of breaking the chocolate.

isi2014-pcb-cs descriptive algorithms algorithm-design

1.1.26 Algorithm Design: ISI2014-PCB-CS-3a https://gateoverflow.in/47440

Let and be two arrays, each containing distinct integers. Each of them is sorted in increasing order. Let
. Design an algorithm for computing the median of as efficiently as you can.
isi2014-pcb-cs algorithms algorithm-design

1.1.27 Algorithm Design: ISI2015-PCB-A-1 https://gateoverflow.in/47265

Given an array of n positive integers, write a program segment / pseudo-code to print the histogram of using the
hash character ( ). Your histogram should consist of vertical columns of with the -th vertical bar containing
number of ’s. For example, if you consider as the array , your output should look like

isi2015-pcb-a descriptive algorithms algorithm-design

1.1.28 Algorithm Design: ISI2015-PCB-CS-2a https://gateoverflow.in/47271

You are given two strings and , each of length , consisting only of lower case English letters .
Propose an -time algorithm to decide whether can be obtained by permuting the symbols of . For example, if
, , your algorithm should return ; but if , , your
algorithm should return .
descriptive isi2015-pcb-cs algorithms algorithm-design

1.1.29 Algorithm Design: ISI2016-PCB-CS-7 https://gateoverflow.in/244395

Let be a sorted array of positive integers, such that . Given an integer as input, the
goal is to find two array indices and such that , if such indices exist; otherwise, the goal is to report
'Failure". Design an algorithm for this problem, that works in time.

isi2016-pcb-cs algorithm-design descriptive

1.1.30 Algorithm Design: ISI2018-PCB-CS1 https://gateoverflow.in/311920

Consider an array of length n consisting only of positive and negative integers. Design an algorithm to rearrange the
array so that all the negative integers appear before all the positive integers, using time and only a constant
amount of extra space.
isi2018-pcb-cs algorithms algorithm-design descriptive

© Copyright GATE Overflow. All rights reserved.

1 Algorithms (84) 13

1.1.31 Algorithm Design: ISI2018-PCB-CS5 https://gateoverflow.in/311927

Consider a max-heap of distinct integers, , stored in an array . The second minimum of is the
integer that is less than all integers in except the minimum of . Find all possible array indices of in which the
second minimum can occur. Justify your answer.
isi2018-pcb-cs algorithms algorithm-design heap descriptive

1.1.32 Algorithm Design: ISI2018-PCB-CS6 https://gateoverflow.in/311928

The following function computes an array , where, for any integer , is the smallest prime
factor of . For example, is , and is .

There are five missing parts in the following code, commented as . For each of them, copy the entire line with
the comment and fill the blank appropriately in your answer sheet.
int SPF[1000];

void findSPF() {

SPF[1] = 1;

// Initializing SPF of every number to be itself

for (int i = 2; i < 1000; i++) {

_____; /* Blank 1 */
}

// SPF of every even number is 2

for (int i = 4; i < 1000; i += 2) {

SPF[i] = _____; /* Blank 2 */

}

// For odd numbers, updating the SPFs of their multiples

for (int i = _____; i * i < 1000; i++) {

/* Blank 3 */

if (SPF[i] == i) {

// No smaller factor of i found yet

for (int j = _____; j < 1000; j+= i) {

/* Blank 4 */
if (SPF[j] == j) {

SPF[j] = _____; /* Blank 5 */

}
}
}
}
}

isi2018-pcb-cs algorithm-design descriptive

1.2 Divide And Conquer (2)

1.2.1 Divide And Conquer: CMI2012-B-04 https://gateoverflow.in/46567

You have an array with objects, some of which are identical. You can check if two objects are equal but you
cannot compare them in any other way — i.e., you can check and , but comparisons such
as are not meaningful. (Imagine that the objects are JPEG images.) The array A is said to have a majority element
if strictly more than half of its elements are equal to each other. Use divide and conquer to come up with an
algorithm to determine if has a majority element.
cmi2012 algorithms divide-and-conquer

© Copyright GATE Overflow. All rights reserved.

14 1 Algorithms (84)

1.2.2 Divide And Conquer: CMI2013-B-04 https://gateoverflow.in/46614

You are given two sorted lists of integers of size and . Describe a divide and conquer algorithm for computing the
-th smallest element in the union of the two lists in time .

cmi2013 algorithms sorting divide-and-conquer descriptive

1.3 Dynamic Programming (5)

1.3.1 Dynamic Programming: CMI2012-B-06 https://gateoverflow.in/46569

A certain string-processing language offers a primitive operation which splits a string into two pieces. Since this
operation involves copying the original string, it takes units of time for a string of length , regardless of the location
of the cut.
Suppose, now, that you want to break a string into many pieces. The order in which the breaks are made can affect the total
running time. For example, if you want to cut a -character string at positions and , then making the first cut at position
incurs a total cost of , while doing position first has a better cost of .
Give a dynamic programming algorithm that, given the locations of cuts in a string of length , finds the minimum cost of
breaking the string into pieces. You may assume that all m locations are in the interior of the string so each split is non-
trivial.
cmi2012 descriptive algorithms dynamic-programming

1.3.2 Dynamic Programming: CMI2013-B-06b https://gateoverflow.in/49177

Your final exams are over and you are catching up on watching sports on TV. You have a schedule of interesting
matches coming up all over the world during the next week. You hate to start or stop watching a match midway, so
your aim is to watch as many complete matches as possible during the week.
Suppose there are such matches scheduled during the coming week and you know the starting and finishing time for each
match.
Develop an algorithm based on dynamic programming to compute the maximum number of complete matches you can watch
next week. Analyze the worse-case complexity of your algorithm.

cmi2013 descriptive algorithms dynamic-programming

1.3.3 Dynamic Programming: CMI2014-B-05 https://gateoverflow.in/46985

At the end of its fifth successful season, the Siruseri Premier League is planning to give an award to the Most Improved
Batsman over the five years. For this, an Improvement Index will be computed for each batsman. This is defined as the
longest sequence of increasing scores by the batsman among all his scores over the five seasons. For example, if the scores for
a batsman over the five seasons are , his Improvement Index is based on the
sequence . Describe an efficient algorithm based on dynamic programming to compute the
Improvement Index for a batsman with an overall sequence of scores. Analyze the complexity of your algorithm.
cmi2014 algorithms dynamic-programming

1.3.4 Dynamic Programming: CMI2015-B-07 https://gateoverflow.in/47071

There is a thin, long and hollow fibre with a virus in the centre. The virus occasionally becomes active and secretes
some side products. The fibre is so thin that new side products secreted by the virus push the old products along the
fibre towards its ends. The possible actions of the virus are as follows

a. Produce an acid molecule to its left and a base molecule to its right.
b. Produce a base molecule to its left and an acid molecule to its right.
c. Divide into two viruses, each of which continues to behave like its ancestor.
d. Die.

You are given a sequence of acid and base molecules from one end of the fibre to the other end. Design an algorithm to check
if a single virus could possibly have produced the given sequence. Use dynamic programming, checking smaller subsequences
before checking bigger subsequences.

cmi2015 descriptive algorithms dynamic-programming

1.3.5 Dynamic Programming: CMI2019-B-7 https://gateoverflow.in/320516

A college professor gives several quizzes during the semester, with negative marking. He has become bored of the
usual "Best out of quizzes" formula to award marks for internal assessment. Instead, each student will be
evaluated based on the sum of the best contiguous segment (i.e., no gaps) of marks in the overall sequence of quizzes.

© Copyright GATE Overflow. All rights reserved.

1 Algorithms (84) 15

However, the student is allowed to drop upto quizzes before calculating this sum.
Suppose a student has scored the following marks in quizzes during the semester.

Without dropping any quizzes, the best segment is quiz , which yields a total of marks. If the student is allowed to
drop upto quizzes in a segment, the best segment is quiz , which yields a total of marks after dropping quizzes and
. If the student is allowed to drop upto quizzes in a segment, the best total is obtained by taking the entire list and dropping
all negative entries, yielding marks.
For let denote the maximum sum segment ending at position with at most marks dropped.

A. Write a recursive formula for

B. Explain how to calculate, using dynamic programming, the score the professor needs to award each student.
C. Describe the space and time complexity of your dynamic programming algorithm.

cmi2019 algorithms dynamic-programming descriptive non-gate

1.4 Graph Algorithms (2)

1.4.1 Graph Algorithms: CMI2011-B-05 https://gateoverflow.in/46210

Let be a undirected graph. We say is a clique if and only if for all , the edge is in
.

Now let be a graph in which each vertex has degree at most 5. Give an algorithm to find the largest clique in .
What is the complexity of your algorithm?
cmi2011 descriptive algorithms graph-algorithms time-complexity

1.4.2 Graph Algorithms: CMI2013-B-05 https://gateoverflow.in/46615

You are going abroad and you have to complete a number of formalities before you leave. Each task takes a full day to
complete. Fortunately, you have an army of friends to help you and each task can be done by either you or any of your
friends, so you can complete as many tasks as possible in parallel, on the same day.
Some tasks depend on others: for instance, you cannot purchase foreign exchange till you have bought your ticket. If task
depends on task , you can start only after you complete . A set of tasks with no pending dependencies can be completed
in parallel.
You are given a list of such tasks to be completed, where each task comes with a set of other tasks that it depends on. The set
of tasks is feasible: there are no circular dependencies. You want to compute the minimum number of days needed to complete
all the tasks, given the constraints.

i. Model this problem formally using graphs.

ii. Describe an efficient algorithm for the problem and analyze the worst-case complexity of your algorithm.

cmi2013 descriptive algorithms graph-algorithms

1.5 Greedy Algorithm (1)

1.5.1 Greedy Algorithm: CMI2015-B-04 https://gateoverflow.in/47063

You are given positive integers, , each greater than . Design a greedy algorithm to test whether these
integers correspond to the degrees of some -vertex simple undirected graph . [A simple graph has no
self-loops and at most one edge between any pair of vertices].
cmi2015 descriptive algorithms greedy-algorithm

1.6 Identify Function (12)

1.6.1 Identify Function: CMI2010-B-07b https://gateoverflow.in/47075

A finite sequence of bits is represented as a list with values from the set . For example,
denotes the empty list, and is the list consisting of one bit . The function
returns the length (number of bits) in the list . For a nonempty list , returns the first element of , and returns
the list obtained by removing the first element from . The operator denotes list concatenation.

© Copyright GATE Overflow. All rights reserved.

16 1 Algorithms (84)

For example:

,
, and
.

Consider the following functions:

takes as input two bits and returns a bit.
op(a,b)
if (a = b) return(0)
else return(1)
endif

takes as input two lists and returns a list.

mystery1(s,t)
if (length(s) != length(t)) then return(t)
else if (length(s) = 0) then return(s)
else return([op(head(s),head(t))] ++ mystery1(tail(s),tail(t)))
endif
endif

takes as input two lists and outputs a list.

mystery2(s,t)
if (length(t) = 0) then return(s)
else return( mystery1(mystery2(s,tail(t)),mystery2(s,tail(t))))
endif

Suppose . What are the first two bits of ?

descriptive cmi2010 algorithms identify-function

1.6.2 Identify Function: CMI2011-B-07b https://gateoverflow.in/47085

A finite sequence of bits is represented as a list with values from the set —for example,
denotes the empty list, and is the list consisting of one bit . For a nonempty list
returns the first element of , and returns the list obtained by removing the first element from
denotes a new list formed by adding a at the head of list .
For example:
,
and
.
Consider the following functions:
takes takes as input two bits and returns a bit.
xor(a,b)
if (a == b) return(0)
else return(1)
endif

takes as input a list and returns another list.

f1(s)
if (s == []) then return([1])
else if (head(s) == 0) then return(1:tail(s))
else if (head(s) == 1) then return(0:f1(tail(s)))
endif

takes as input a bit and a list and returns a bit.

f2(b,s)
if (s == [ ]) then return(b)
else if (head(s) == 0) then return(f2(xor(b,1),tail(s)))
else if (head(s) == 1) then return(xor(b,1))
endif

takes as input a nonnegative number and returns a list.

g1(n)
if (n == 0) then return([0])
else return f1(g1(n-1))
endif

takes as input a nonnegative number and returns a bit.

g2(n)

© Copyright GATE Overflow. All rights reserved.

1 Algorithms (84) 17

if (n == 0) then return(0)
else return f2(g2(n-1),g1(n))
endif

What is the value of and ?

descriptive cmi2011 algorithms identify-function

1.6.3 Identify Function: CMI2012-A-03 https://gateoverflow.in/46532

The below question is based on the following program. In the program, we assume that integer division returns only the
quotient. For example returns since is the quotient and is the remainder.
mystery(a,b){
if (b == 0) return a;
if (a < b) return mystery(b,a);
if (eo(a,b) == 0){
return(2*mystery(a/2,b/2));
}
if (eo(a,b) == 1){
return(mystery(a,b/2));
}
if (eo(a,b) == 2){
return(mystery(a/2,b));
}
if (eo(a,b) == 3){
return (mystery((a-b)/2,b));
}
}
eo(a,b){
if ((a/2)*2 == a and (b/2)*2 == b) return 0; end;
if ((a/2)*2 < a and (b/2)*2 == b) return 1; end;
if ((a/2)*2 == a and (b/2)*2 < b) return 2; end;
return 3;
}

returns

A. B. C. D.
cmi2012 algorithms identify-function

1.6.4 Identify Function: CMI2012-A-04 https://gateoverflow.in/46533

The below question is based on the following program. In the program, we assume that integer division returns only the
quotient. For example returns since is the quotient and is the remainder.
mystery(a,b){
if (b == 0) return a;
if (a < b) return mystery(b,a);
if (eo(a,b) == 0){
return(2*mystery(a/2,b/2));
}
if (eo(a,b) == 1){
return(mystery(a,b/2));
}
if (eo(a,b) == 2){
return(mystery(a/2,b));
}
if (eo(a,b) == 3){
return (mystery((a-b)/2,b));
}
}
eo(a,b){
if ((a/2)*2 == a and (b/2)*2 == b) return 0; end;
if ((a/2)*2 < a and (b/2)*2 == b) return 1; end;
if ((a/2)*2 == a and (b/2)*2 < b) return 2; end;
return 3;
}

When and are bit positive numbers the number of recursive calls to on input is

A. B. C. D.
cmi2012 algorithms identify-function time-complexity

© Copyright GATE Overflow. All rights reserved.

18 1 Algorithms (84)

1.6.5 Identify Function: CMI2013-A-09 https://gateoverflow.in/46599

The below question is based on the following program.

procedure mystery (A : array [1..100] of int)
int i,j,position,tmp;
begin
for j := 1 to 100 do
position := j;
for i := j to 100 do
if (A[i] > A[position]) then
position := i;
endfor
tmp := A[j];
A[j] := A[position];
A[position] := tmp;
endfor
end

When the procedure terminates, the array A has been:

A. Reversed B. Sorted in descending order
C. Left unaltered D. Sorted in ascending order
cmi2013 algorithms identify-function

1.6.6 Identify Function: CMI2014-A-03 https://gateoverflow.in/46966

In the code fragment on the right, start and end are integer values and is a function that returns true if is a
prime number and otherwise. At the end of the loop:
i := 0; j := 0; k := 0;
for (m := start; m <= end; m := m+1){
k := k + m;
if (prime(m)){
i := i + m;
}else{
j := j + m;
}
}

A. B. C. D. Depends on and
cmi2014 algorithms identify-function

1.6.7 Identify Function: CMI2014-B-07a https://gateoverflow.in/46992

Consider the code below, defining the function :

A(m, n, p) {
if (p == 0) return m+n;
else if (n == 0 && p == 1) return 0;
else if (n == 0 && p == 2) return 1;
else if (n == 0) return m;
else return A(m, A(m,n-1,p), p-1);
}

Express as a function of and .

cmi2014 descriptive algorithms identify-function

1.6.8 Identify Function: CMI2014-B-07b https://gateoverflow.in/46993

Consider the code below, defining the function :

A(m, n, p) {
if (p == 0) return m+n;
else if (n == 0 && p == 1) return 0;
else if (n == 0 && p == 2) return 1;
else if (n == 0) return m;
else return A(m, A(m,n-1,p), p-1);
}

Express as a function of and .

cmi2014 descriptive algorithms identify-function

© Copyright GATE Overflow. All rights reserved.

1 Algorithms (84) 19

1.6.9 Identify Function: CMI2014-B-07c https://gateoverflow.in/46994

Consider the code below, defining the function :

A(m, n, p) {
if (p == 0) return m+n;
else if (n == 0 && p == 1) return 0;
else if (n == 0 && p == 2) return 1;
else if (n == 0) return m;
else return A(m, A(m,n-1,p), p-1);
}

Compute and .

cmi2014 descriptive algorithms identify-function

1.6.10 Identify Function: CMI2015-B-06a https://gateoverflow.in/47067

Consider the code below, defining the functions and :

f(m, n) {
if (m == 0) return n;
else {
q = m div 10;
r = m mod 10;
return f(q, 10*n + r);
}
}
g(m, n) {
if (n == 0) return m;
else {
q = m div 10;
r = m mod 10;
return g(f(f(q, 0), r), n-1);
}
}

Compute .

descriptive cmi2015 algorithms identify-function

1.6.11 Identify Function: CMI2015-B-06b https://gateoverflow.in/47068

Consider the code below, defining the functions and :

f(m, n) {
if (m == 0) return n;
else {
q = m div 10;
r = m mod 10;
return f(q, 10*n + r);
}
}
g(m, n) {
if (n == 0) return m;
else {
q = m div 10;
r = m mod 10;
return g(f(f(q, 0), r), n-1);
}
}

What does compute, for nonnegative numbers and ?

descriptive cmi2015 algorithms identify-function

1.6.12 Identify Function: ISI2014-PCB-A-1b https://gateoverflow.in/47338

Let be two non-negative integers . By we mean the integer represented by the bitwise logical
of the 32- bit binary representations of and . For example, if and , then is the bitwise of
0 1101 and 0 0110, resulting in 0 0100, which is 4 in decimal. (Here 0 1101 means twenty-eight 0’s followed by the 4-bit
string 1101.) Now consider the following pseudo-code:
integer x, n = 0;
while (x 0){
x x (x − 1);

© Copyright GATE Overflow. All rights reserved.

20 1 Algorithms (84)

n n + 1;
}
print n;

i. What will be the output of the pseudo-code for the input ?

ii. What will be the output of the pseudo-code for an arbitrary non-negative integer ?

descriptive isi2014 algorithms identify-function

1.7 Minimum Spanning Trees (3)

1.7.1 Minimum Spanning Trees: CMI2012-B-05a https://gateoverflow.in/46568

Given an undirected weighted graph with non-negative edge weights, we can compute a minimum cost
spanning tree . We can also compute, for a given source vertex , the shortest paths from s to every
other vertex in . We now increase the weight of every edge in the graph by 1. Are the following true or false, regardless of
the structure of ? Give a mathematically sound argument if you claim the statement is true or a counterexample if the
statement is false.

is still a minimum cost spanning tree of .

cmi2012 descriptive algorithms graph-algorithms minimum-spanning-trees

1.7.2 Minimum Spanning Trees: CMI2012-B-05b https://gateoverflow.in/47090

Given an undirected weighted graph with non-negative edge weights, we can compute a minimum cost
spanning tree . We can also compute, for a given source vertex , the shortest paths from s to every
other vertex in . We now increase the weight of every edge in the graph by . Are the following true or false, regardless of
the structure of ? Give a mathematically sound argument if you claim the statement is true or a counterexample if the
statement is false.

All the shortest paths from to the other vertices are unchanged.
cmi2012 descriptive algorithms graph-algorithms minimum-spanning-trees

1.7.3 Minimum Spanning Trees: ISI2015-PCB-CS-2b https://gateoverflow.in/47272

Let be a collection of distinct points lying on a vertical line . The value of

is stored in a variable, and are stored in an array in decreasing order. Additionally, you are given two
points ' ' and '' '' , one on either side of . A route from to is a two-hop path , where
is one of the points from . The cost of is defined as the sum of the lengths of and . Design an
-time algorithm to find the minimum-cost route from to , i.e., your task is to select an appropriate point on
such that the cost of the route from to through is minimized.

descriptive isi2015-pcb-cs algorithms minimum-spanning-trees

1.8 P Np Npc Nph (2)

1.8.1 P Np Npc Nph: CMI2010-A-10 https://gateoverflow.in/46142

Consider the following statements.

1. NP-complete problems are those that we know we can never solve efficiently.
2. If we find an efficient algorithm for one NP-complete problem, then we can solve all NP-complete problems efficiently.
3. Checking whether a number is a prime is an NP-complete problem.

© Copyright GATE Overflow. All rights reserved.

1 Algorithms (84) 21

Then:

A. and are true but is false.

B. and are false but is true.
C. and are true but is false.
D. All three statements are false.

cmi2010 algorithms p-np-npc-nph

1.8.2 P Np Npc Nph: CMI2015-A-06 https://gateoverflow.in/47041

Suppose we have constructed a polynomial time reduction from problem to problem . Which of the following can
we infer from this fact?

A. If the best algorithm for takes exponential time, there is no polynomial time algorithm for .
B. If the best algorithm for takes exponential time, there is no polynomial time algorithm for .
C. If we have a polynomial time algorithm for , we must also have a polynomial time algorithm for .
D. If we don’t know whether there is a polynomial time algorithm for , there cannot be a polynomial time algorithm for .

cmi2015 algorithms p-np-npc-nph

1.9 Recurrence (3)

1.9.1 Recurrence: CMI2013-B-07 https://gateoverflow.in/46617

Consider the code below, defining the function

mystery(a,b){
if (a < 0 or b < 0) return 0;
else if (a == 0) return b+1;
else if (b == 0) return mystery(a-1,1);
else return mystery(a-1, mystery(a,b-1));
}

i. Express as a function of .
ii. Express as a function of .
iii. Compute and .

cmi2013 descriptive recurrence

1.9.2 Recurrence: ISI2011-PCB-CS-3a https://gateoverflow.in/48139

Solve the following recurrence ( is a natural number):

descriptive isi2011-pcb-cs algorithms recurrence

1.9.3 Recurrence: ISI2018-PCB-CS2 https://gateoverflow.in/311922

You can climb up a staircase of stairs by taking steps of one or two stairs at a time.

a. Formulate a recurrence relation for counting , the number of distinct ways in which you can climb up the staircase.
b. Mention the boundary conditions for your recurrence relation.
c. Find a closed form expression for by solving your recurrence.

isi2018-pcb-cs algorithms recurrence descriptive

1.10 Reduction (2)

1.10.1 Reduction: CMI2014-A-04 https://gateoverflow.in/46968

Alan’s task is to design an algorithm for a decision problem . He knows that there is an algorithm that transforms

© Copyright GATE Overflow. All rights reserved.

22 1 Algorithms (84)

instances of P to instances of the Halting Problem such that instances of map to instances of the Halting Problem,
and instances of map to instances of the Halting problem. Which of the following is true.

A. The existence of implies the existence of an algorithm for .

B. The existence of implies that there is no algorithm for .
C. The existence of says nothing about whether there is an algorithm for .
D. The Halting Problem can be solved using .

cmi2014 algorithms reduction

1.10.2 Reduction: CMI2017-A-10 https://gateoverflow.in/203287

We have constructed a polynomial time reduction from problem to problem . Which of the following is a valid
inference?

A. If the best algorithm for takes exponential time, then there is no polynomial time algorithm for
B. If the best algorithm for takes exponential time, then there is no polynomial time algorithm for .
C. If we have a polynomial time algorithm for , then we must also have a polynomial time algorithm for
D. If we don’t know whether there is a polynomial time algorithm for , then there cannot be a polynomial time algorithm for
.

cmi2017 algorithms reduction p-np-npc-nph

1.11 Sorting (10)

1.11.1 Sorting: CMI2010-B-03 https://gateoverflow.in/46128

The Income-Tax Department had prepared a list D of names of defaulters on March . However, the government
extended the deadline to pay taxes till April .
The IT department has now received two additional lists of names: a list B of names of people who have paid their taxes
between April and April at a bank, and a list O of names of people have paid their taxes during this period online. Some
people have paid part of their taxes at a bank and part online, so there may be names that appear in both B and O.
From the lists D, B and O, the IT department wants to prepare a revised list of defaulters. The names in the original list D are
sorted in alphabetical order while the names in B and O are listed according to the date on which they paid their taxes.
Fortunately, no two people have the same name.
Describe an efficient algorithm to compute the revised list of defaulters. Assume that the size of D, B and O is n, m and k
respectively and that . Describe the running time of your algorithm in terms of these parameters.
cmi2010 descriptive algorithms sorting

1.11.2 Sorting: CMI2011-B-06a https://gateoverflow.in/46212

Consider a plate stacked with several disks, each of a different diameter (they could all be, for instance, or
of different sizes). We want to sort these disks in decreasing order according to their diameter so that the
widest disk is at the bottom of the pile. The only operation available for manipulating the disks is to pick up a stack of them
from the top of the pile and invert that stack. (This corresponds to lifting up a stack or between two big spoons
and flipping the stack.)

Give an algorithm for sorting the disks using this operation.

cmi2011 descriptive algorithms sorting

1.11.3 Sorting: CMI2011-B-06b https://gateoverflow.in/47083

Consider a plate stacked with several disks, each of a different diameter (they could all be, for instance, or
of different sizes). We want to sort these disks in decreasing order according to their diameter so that the
widest disk is at the bottom of the pile. The only operation available for manipulating the disks is to pick up a stack of them
from the top of the pile and invert that stack. (This corresponds to lifting up a stack or between two big spoons
and flipping the stack.)

How many steps will your algorithm take in the worst case?
descriptive cmi2011 algorithms sorting

© Copyright GATE Overflow. All rights reserved.

1 Algorithms (84) 23

1.11.4 Sorting: CMI2012-A-08 https://gateoverflow.in/46537

You are given two sorting algorithms A and B that work in time and , respectively. Consider the
following statements:

I. Algorithm will sort any array faster than algorithm .

II. On an average, algorithm will sort a given array faster than algorithm .
III. If we need to implement one of the two as the default sorting algorithm in a system, algorithm will always be preferable
to algorithm .

Which of the statements above are true?

A. I, II and III B. I and III C. II and III D. None of them

cmi2012 algorithms sorting time-complexity asymptotic-notations

1.11.5 Sorting: CMI2013-A-05 https://gateoverflow.in/46595

You have lists, each consisting of integers sorted in ascending order. Merging these lists into a single sorted list
will take time:

A. B. C. D.
cmi2013 algorithms sorting

1.11.6 Sorting: CMI2017-A-08 https://gateoverflow.in/203281

A preserves the order of values that are equal with respect to the comparison function. We have a list of
three-dimensional points

We sort these in ascending order by the second coordinate. Which of the following corresponds to a stable sort of this input?

A.
B.
C.
D.

cmi2017 algorithms sorting

1.11.7 Sorting: ISI2011-PCB-A-2a https://gateoverflow.in/48028

Give a strategy to sort four given distinct integers in increasing order that minimizes the number of pairwise
comparisons needed to sort any permutation of .
descriptive isi2011 algorithms sorting

1.11.8 Sorting: ISI2011-PCB-CS-1b https://gateoverflow.in/48060

There are students of a class standing in a line. The students have to arrange themselves in ascending order on the
basis of their roll numbers. This rearrangement of the line must be accomplished only by successively swapping pairs
of adjacent students.

i. Design an algorithm for this purpose that minimizes the number of swaps required.
ii. Derive an expression for the number of swaps needed by your algorithm in the worst case.

isi2011-pcb-cs descriptive algorithms sorting

1.11.9 Sorting: ISI2011-PCB-CS-2 https://gateoverflow.in/48137

You are given sorted lists, each containing integers in ascending order. Assume that (i) the lists are stored as
singly-linked lists with one integer in each node, and (ii) the head pointers of these lists are stored in an array.

a. Write an efficient algorithm that merges these k sorted lists into a single sorted list using additional storage.

© Copyright GATE Overflow. All rights reserved.

24 1 Algorithms (84)

b. How would you modify your algorithm if you were permitted to use only constant additional storage?

Analyse the time complexity of your algorithm for each of the above two cases.

descriptive isi2011-pcb-cs algorithms sorting

1.11.10 Sorting: ISI2012-PCB-CS-5a https://gateoverflow.in/48014

Suppose you have the following three subroutines:

: returns the index of the maximum among the set of consecutive elements of the array .
: returns the index of the minimum among the set of consecutive elements of the array .
: swaps the two elements and in the array .

Design an time algorithm which can use only these three subroutines to sort a given array
of distinct integers. Assume that the time complexity of the first two subroutines is , where
, and that for the third subroutine is .

descriptive isi2012-pcb-cs algorithms sorting

1.12 Spanning Tree (1)

1.12.1 Spanning Tree: ISI2014-PCB-CS-3b https://gateoverflow.in/47442

Let be an undirected weighted graph with all edge weights being positive. Design an efficient algorithm
to find the maximum spanning tree of .
descriptive isi2014-pcb-cs algorithms spanning-tree graph-algorithms

1.13 Time Complexity (9)

1.13.1 Time Complexity: CMI2011-B-03 https://gateoverflow.in/46207

Your team is playing a chess tournament against a visiting team. Your opponents have arrived with a team of M
players, numbered . You have players, numbered from which to choose your team, where
. Each of the players from the visiting team must be paired up with one of your players. The tournament rules
insist that the pairings must respect the order that has been fixed for both teams. That is, when you pick players ,
to play against opponents numbered , it must be the case that , in terms of the order
in which your players are listed.
You want to ensure a good fight, so you plan to pick your team so that the teams are as
evenly balanced as possible. Each player on your team has a numerical score that represents his or her playing ability.
Likewise, each player in the opponent team has a playing ability indicated by a numerical score . The difference in
strength between a player from your team and his or her opponent on the visiting team is the absolute value
. The imbalance of a pairing is the sum of these differences across all M match-ups in the pairing. Your aim
is to minimize this imbalance.
For instance suppose you have six players, whose strengths are as follows.

Also, suppose that the visiting team has three players, whose strengths are as follows.

In this situation, the most balanced pairing is , and , which yields an imbalance of

Propose an efficient algorithm to solve this problem and analyse its complexity.
cmi2011 descriptive algorithms time-complexity

1.13.2 Time Complexity: CMI2013-A-10 https://gateoverflow.in/46602

The below question is based on following program:

© Copyright GATE Overflow. All rights reserved.

1 Algorithms (84) 25

procedure mystery (A : array [1..100] of int)

int i,j,position,tmp;
begin
for j := 1 to 100 do
position := j;
for i := j to 100 do
if (A[i] > A[position]) then
position := i;
endfor
tmp := A[j];
A[j] := A[position];
A[position] := tmp;
endfor
end

The number of times the test is executed is:

A. B. C. D. Depends on contents of
cmi2013 algorithms time-complexity

1.13.3 Time Complexity: CMI2015-A-08 https://gateoverflow.in/47045

How many times is the comparison performed in the following program?

int i=85, n=5;
main() {
while (i >= n) {
i=i-1;
n=n+1;
}
}

A. B. C. D.
cmi2015 algorithms time-complexity

1.13.4 Time Complexity: CMI2015-B-06c https://gateoverflow.in/47069

Consider the code below, defining the functions and :

f(m, n) {
if (m == 0) return n;
else {
q = m div 10;
r = m mod 10;
return f(q, 10*n + r);
}
}
g(m, n) {
if (n == 0) return m;
else {
q = m div 10;
r = m mod 10;
return g(f(f(q, 0), r), n-1);
}
}

How much time does it take to compute and ?

cmi2015 descriptive algorithms time-complexity

1.13.5 Time Complexity: CMI2017-B-6 https://gateoverflow.in/203319

We are given a sequence of pairs of integers . We would like to compute the largest
such that there is a sequence of numbers with and for each ,
or . Describe an algorithm to solve this problem and explain its complexity.

cmi2017 algorithms time-complexity descriptive

1.13.6 Time Complexity: CMI2017-B-7 https://gateoverflow.in/203320

Consider the following function that takes as input a sequence of integers with n elements, and
an integer and returns an integer value. The function length returns the length of the sequence . Comments start
with //.

© Copyright GATE Overflow. All rights reserved.

26 1 Algorithms (84)

function mystery(A, k){

n = length(A);
if (k > n) return A[n];
v = A[1];
AL = [ A[j] : 1 <= j <= n, A[j] < v ]; // AL has elements < v in A
Av = [ A[j] : 1 <= j <= n, A[j] == v ]; // Av has elements = v in A
AR = [ A[j] : 1 <= j <= n, A[j] > v ]; // AR has elements > v in A
if (length(AL) >= k) return mystery(AL,k);
if (length(AL) + length(Av) >= k) return v;
return mystery(AR, k - (length(AL) + length(Av)));
}

A. Explain what the function computes.

B. What is the worst-case complexity of this algorithm in terms of the length of the input sequence ?
C. Give an example of a worst-case input for this algorithm.

cmi2017 algorithms time-complexity descriptive

1.13.7 Time Complexity: ISI2013-PCB-CS-1c https://gateoverflow.in/47501

Consider the and to calculate as given below, where are

positive integers and .

Input:

Output:

1.

2. while do

3. if mod then

4. ;

end

5.

end

6. return .

What is the time complexity of the algorithm in terms of ? [Note that can be a very large integer, e.g., more than bits.
Assume that the time complexity of modular multiplication is , when the positive integers involved are less than
.]
descriptive isi2013-pcb-cs algorithms time-complexity

1.13.8 Time Complexity: ISI2017-PCB-CS-4 https://gateoverflow.in/245031

A file holds the non-zero elements of two large matrices, and . The matrix entries are sorted as triplets
, where is the th element of a matrix. The file first stores the element of and then those of .
The matrix elements are stored in in an arbitrary order. In each matrix, only the elements

are non-zero. You are to add and and store the sum in and then print , and . Due to limited memory, for storing
all three matrices, you can use space to hold only up to values (NOT triplets). Is it possible to have a solution? If no,
give reasons. If yes, provide a solution. Clearly explain the data structure and how you are going to store, retrieve, and add the
elements.

© Copyright GATE Overflow. All rights reserved.

1 Algorithms (84) 27

isi2017-pcb-cs algorithms time-complexity descriptive

1.13.9 Time Complexity: ISI2017-PCB-CS-6 https://gateoverflow.in/245029

Let be an array of distinct numbers. The array may not be sorted. The element is said
to be a if . Similarly, the element is said to be a if . Among the remaining
elements, an element is said to be if and where . Design an time
algorithm for finding a in . Justify the complexity of your algorithm.
isi2017-pcb-cs algorithms time-complexity descriptive

© Copyright GATE Overflow. All rights reserved.

28 2 CO and Architecture (4)

2 CO and Architecture (4)

2.1 Cache Memory (1)

2.1.1 Cache Memory: ISI2014-PCB-CS-5 https://gateoverflow.in/47446

The average memory access time for a microprocessor with first level cache is clock cycles.

If data is present in the cache, it is found in clock cycle.

If data is not found in the cache, clock cycles are needed to get it from off-chip memory.

It is desired to obtain a improvement in average memory access time by adding a second level cache.

This second level cache can be accessed in clock cycles.

The addition of this second level cache does not affect the first level cache.
Off-chip memory accesses still require clock cycles.

To obtain the desired speedup, how often must data be found in the second level cache?
b. Two modules and of an old machine are being replaced by their improved versions and , respectively in a
new machine. With respect to the old machine, the speed-up of these modules ( and ) are and , respectively. Only
one module is usable at any instant of time. A program , when run on the old machine, uses and for and
of the total execution time, respectively. Calculate the overall speed-up of when it is executed on the new machine.

descriptive isi2014-pcb-cs co-and-architecture cache-memory

2.2 Machine Instructions (1)

2.2.1 Machine Instructions: ISI2011-PCB-CS-6a https://gateoverflow.in/48179

Assume a machine has registers (one of which is the accumulator ) and the following instruction set.

and are indirect memory operations that load and store, using the address stored in the given register
operand. Thus, loads the contents of into , and stores the contents of in
.
copies any register into any other register.
and operate on the accumulator and one other register, such that .
stores a given -bit constant in the accumulator.
, , and are branch instructions, each taking a – bit offset.

Design an instruction encoding scheme that allows each of the above instructions (along with operands) to be encoded in
bits.

co-and-architecture descriptive isi2011-pcb-cs machine-instructions

2.3 Pipelining (2)

2.3.1 Pipelining: ISI2012-PCB-CS-2a https://gateoverflow.in/47848

A machine has the following five pipeline stages; their respective time requirements in nanoseconds (ns) are given
within parentheses:

-stage — instruction fetch ( ns),

-stage — instruction decode and register fetch ( ns),
-stage — execute/address calculation ( ns),
-stage — memory access ( ns),
-stage — write back to a register ( ns).

Assume that for each stage, the pipeline overhead is ns. A program having machine instructions runs on , where
every rd instruction needs a – cycle stall before the -stage. Calculate the CPU time in seconds for completing .

descriptive isi2012-pcb-cs co-and-architecture pipelining

2.3.2 Pipelining: ISI2015-PCB-CS-6a https://gateoverflow.in/47332

Consider the following timings for a five-stage processor pipeline (these timings include the latching overhead):

© Copyright GATE Overflow. All rights reserved.

2 CO and Architecture (4) 29

i. Given the timings for the datapath stages listed above, what would be the clock period for the entire datapath?
ii. In a pipelined datapath, assuming no hazards or stalls, what will be the throughput (instructions per second) in steady state?
iii. Assuming that instructions are executed, and that all instructions are add instructions, what is the speedup of this
pipelined implementation compared to a nonpipelined implementation? Assume that each add instruction consists of Fetch,
Decode, Execute and Write Back.

descriptive isi2015-pcb-cs co-and-architecture pipelining

© Copyright GATE Overflow. All rights reserved.

30 3 Compiler Design (4)

3 Compiler Design (4)

3.1 Compilation Phases (1)

3.1.1 Compilation Phases: CMI2012-A-09 https://gateoverflow.in/46538

Consider the following programming errors:

I. Type mismatch in an expression.

II. Array index out of bounds.
III. Use of an uninitialized variable in an expression.

Which of these errors will typically be caught at compile-time by a modern compiler.

A. I, II and III B. I and II C. I and III D. None of them

cmi2012 compiler-design compilation-phases normal

3.2 Parameter Passing (1)

3.2.1 Parameter Passing: CMI2010-A-08 https://gateoverflow.in/46140

In programming language terminology, refers to the fact that:

A. A function call can return a value.

B. When a function is called, arguments are copied into local storage.
C. Functions can indirectly modify the value of external variables.
D. Every argument passed to a function must have a value.

cmi2010 compiler-design runtime-environments parameter-passing

3.3 Runtime Environments (2)

3.3.1 Runtime Environments: CMI2011-A-08 https://gateoverflow.in/46195

In programming languages like C, C++, Python the memory used by a program is typically separated into two parts,
the stack and the heap. Consider the following statements:

1. A stack is efficient for managing nested function calls.

2. Stack space is limited while heap space is not.
3. The stack cannot be used for persistent data structures.

Then:
A. and are true but is false. B. and are true but is false.
C. and are true but is false. D. All three statements are true.
cmi2011 compiler-design runtime-environments

3.3.2 Runtime Environments: CMI2014-A-06 https://gateoverflow.in/46972

Suppose we are working with a programming language that supports automatic garbage collection. This means that:

A. Uninitialized variables are assigned null values.

B. Unreferenced dynamically allocated memory is added back to free space.
C. Unreachable branches are pruned.
D. Expressions where array indices exceed array bounds are flagged.

cmi2014 compiler-design runtime-environments

© Copyright GATE Overflow. All rights reserved.

4 Computer Networks (8) 31

4 Computer Networks (8)

4.1 Crc Polynomial (1)

4.1.1 Crc Polynomial: ISI2015-PCB-CS-4a https://gateoverflow.in/47275

Consider the use of Cyclic Redundancy Code (CRC) with generator polynomial for error detection. Recall that
error detection with a CRC works by appending the CRC value to the bit sequence to make it a multiple of .

i. Calculate the CRC value of the bit sequence , if .

ii. A of length means that there are bits from the first to the last error positions in the frame, including both
positions. Note that the intermediate bits may or may not be in error. For example, if is transmitted and
is received, then we can say that a burst error of length has occurred. Construct a burst error of length in
such a way that the error cannot be detected by the CRC with the given above.

descriptive isi2015-pcb-cs computer-networks error-detection crc-polynomial

4.2 Data Link Layer (1)

4.2.1 Data Link Layer: ISI2018-PCB-CS9 https://gateoverflow.in/311932

The data link layer uses a fixed-size sliding window protocol, where the window size for the connection is equal to
twice the bandwidth-delay product of the network path. Consider the following three scenarios, in each of which only
the given parameter changes as specified (no other parameters change). For each scenario, explain whether the throughput (not
utilization) of the connection increases, decreases, remains the same, or cannot be determined:

a. the packet loss rate decreases to ;

b. the minimum value of the round trip time increases to ;
c. the window size decreases to

isi2018-pcb-cs computer-networks data-link-layer descriptive

4.3 Error Detection (1)

4.3.1 Error Detection: ISI2013-PCB-CS-6a https://gateoverflow.in/47645

A block of bits with rows and columns uses horizontal and vertical parity bits for error detection. If exactly 4 bits
are in error during transmission, derive an expression for the probability that the error will be detected.
descriptive isi2013-pcb-cs error-detection computer-networks

4.4 Link State Routing (1)

4.4.1 Link State Routing: ISI2016-PCB-CS-2 https://gateoverflow.in/244400

i. Consider sending a large file of bits from Host to Host connected through a router, as shown in the below
figure Assume that there is no queuing and propagation delay, and the router has sufficient buffer space. Host splits
the file into segments of bits each and adds bits of header to each segment, forming packets of bits. Each
link has a transmission rate of Find the value of that minimizes the time needed to move the file from Host to
Host
ii. The of a system having an execution rate of million instructions per second needs machine cycles on an average
for executing an instruction. On an average, of the cycles use memory bus. For execution of the programs, the system
utilizes of the time. For block data transfer, an device is attached to the system, while the executes
background programs continuously. Determine the maximum transfer rate for each of the two cases:
a. programmed
b. cycle-stealing (in transparent mode)

You may assume that transferring one byte involves operations: in-status, check-status, branch and read/write in memory,
each requiring one machine cycle.

© Copyright GATE Overflow. All rights reserved.

32 4 Computer Networks (8)

isi2016-pcb-cs link-state-routing dma non-gate descriptive

4.5 Routing (1)

4.5.1 Routing: ISI2014-PCB-CS-6b https://gateoverflow.in/47450

In a LAN, routers are connected in an mesh such that represents a router in the -th row and -th
column of the mesh.

i. Find how many distinct shortest paths exist between two routers and . Two
paths are distinct if they differ in at least one link.
ii. At most how many of these distinct shortest paths will be node disjoint, i.e., with no common node except the source and
the destination? Justify your answer.

isi2014-pcb-cs descriptive computer-networks routing

4.6 Sliding Window (1)

4.6.1 Sliding Window: ISI2015-PCB-CS-4b https://gateoverflow.in/47326

Stations and are connected through a line of bandwidth . Station uses packets to transmit
messages to using a sliding window protocol. The round trip propagation delay between and is
. Determine the window size should use to maximize the line utilization. Assume that the ack frame is of
negligible size and processing delay may be ignored. Justify your answer.
descriptive isi2015-pcb-cs computer-networks sliding-window

4.7 Throughput (1)

4.7.1 Throughput: ISI2012-PCB-CS-6b https://gateoverflow.in/48019

A network has stations attached by a dedicated pair of lines to a hub in a star topology. The distance from each
station to the hub is meters, the speed of the transmission lines is Mbps, all frames are of length bytes,
and the signal propagates on the line at a speed of meters/second. Assume that token-ring protocol is used for
medium access control. Assume single-frame operation, eight-bit latency at each station, and a free token is of three bytes long.

i. Find the effective frame transmission time.

ii. Assume that each station can transmit up to a maximum of frames/token. Find the maximum throughput of the
network.

descriptive isi2012-pcb-cs computer-networks throughput

4.8 Token Ring (1)

4.8.1 Token Ring: ISI2014-PCB-CS-7b https://gateoverflow.in/47452

A heavily loaded km long, Mbps token ring network has a propagation speed of meter per micro-second.
Fifty stations are uniformly spaced around the ring. Each data packet is bits long, including bits of header. The
token is of bits. What is the effective data rate of the network assuming the stations always have packets to transmit?
descriptive isi2014-pcb-cs token-ring

© Copyright GATE Overflow. All rights reserved.

5 Databases (10) 33

5 Databases (10)

5.1 Database Normalization (2)

5.1.1 Database Normalization: ISI2011-PCB-CS-5b https://gateoverflow.in/48168

Suppose we have a relation with the functional dependencies:

.

If we project and therefore its functional dependencies onto the schema , what will the key(s) for be?
descriptive isi2011-pcb-cs databases database-normalization

5.1.2 Database Normalization: ISI2013-PCB-CS-6b https://gateoverflow.in/47646

A school database maintains the following relations for its students, teachers and subjects:

Student(st_name, st_address, class, section, roll_no, regn_no)

Teacher(t_name, t_address, tel_no)

Subject(s_name, t_name, text_book, class)

Consider the following constraints on the existing data.

A student after admission to the school is assigned with a unique regn no. However, a student also gets a roll no that starts
from for each class and section. A class can have many sections and a student is placed in only one class and section as
expected in a school.
In the school a teacher’s name (t_name) has been found to be unique. However, more than one teacher may stay at the same
address and the tel no is a land line connection where an address will have only one such telephone.
A subject name (s_name) is unique but the same subject may be taught in many classes (for example, History may be
taught in many classes with different contents but s name remains the same). Every subject has a set of standard text books
for a class and there may be more than one teacher who can teach the subject. Any teacher may use any of the standard text
books to teach a subject.

i. Considering the above constraints, identify the functional /multivalued dependencies present and normalize the relations.
ii. Using the normalized set of relations answer the following query using relational algebra or SQL: List all the teachers
(t_name) who can teach History in Class V and reside in “Baranagar” (name of a locality). Consider that any address offers
a locality name.

descriptive isi2013-pcb-cs databases database-normalization sql

5.2 Indexing (1)

5.2.1 Indexing: ISI2014-PCB-CS-6a https://gateoverflow.in/47448

Two queries equivalent to each other are specified for a relation . The queries are:

The system maintains a tree index for on . However, the index is unclustered. The relation occupies
pages and the index structure needs pages only. Compute the number of disk accesses required for each of the queries and
thereby decide which one of the two queries will be preferred by the query optimizer for minimum cost of execution. The cost
of query execution is primarily dependent on the number of disk accesses.

descriptive isi2014-pcb-cs databases b-tree indexing

5.3 Natural Join (1)

5.3.1 Natural Join: ISI2017-PCB-CS-3-a https://gateoverflow.in/245032

Let be a relation with primary key and a relation with primary key . Each of the
relations has tuples. If the number of tuples in is , then determine the number of tuples in
.

© Copyright GATE Overflow. All rights reserved.

34 5 Databases (10)

isi2017-pcb-cs databases relational-algebra natural-join

5.4 Relational Algebra (4)

5.4.1 Relational Algebra: ISI2011-PCB-CS-5a https://gateoverflow.in/48162

Consider relations and . Find a propositional formula such that the following two relational
algebra expressions produce the same answer.

descriptive isi2011-pcb-cs databases relational-algebra

5.4.2 Relational Algebra: ISI2012-PCB-CS-6a https://gateoverflow.in/48016

Consider a LIBRARY database consisting of the following entity sets:

Book (bookid, title, publishername)

Book authors (bookid, authorname)
Publisher (publishername, address, phonenumber)
Bookcopies (bookid, accessionnumber)
Book loans (bookid, cardnumber, issuedate, duedate)
Borrower (cardnumber, name, address, phonenumber)

Write a relational algebra expression for retrieving the names of the borrowers who do not have any book issued. Hence write
an equivalent SQL statement for the above query.

descriptive isi2012-pcb-cs databases relational-algebra sql

5.4.3 Relational Algebra: ISI2015-PCB-CS-7 https://gateoverflow.in/47335

Consider the following schema:

SUPPLIER (supId : integer, supName : string, supAddress : string)

PARTS (partId : integer, partName : string, partColour : string)
CATALOG (supId : integer, partId : integer, price : real)

The key fields are underlined, and the domain of each field is listed after the field name. The CATALOG relation lists the
prices charged for parts by suppliers.

a. Let the relations have the following properties:

Estimate the number of block accesses required to produce the result of the following query: Find the names of suppliers
who supply every part.
b. Write the above query (given in (a)) in relational algebra using some or all of the following operators: SELECT,
PROJECT, JOIN, CARTESIAN PRODUCT, UNION, INTERSECTION, DIFFERENCE.

descriptive isi2015-pcb-cs databases sql relational-algebra

5.4.4 Relational Algebra: ISI2018-PCB-CS10 https://gateoverflow.in/311941

Consider two vectors and , stored as table and with the same schema A row
of table specifies the element of vector has value (similarly for , respectively). Only the non-zero entries of
the vectors are stored in the corresponding tables. For example, if the vector equals , then it is represented in
table as

© Copyright GATE Overflow. All rights reserved.

5 Databases (10) 35

Write a relational algebra expression or an SQL query to compute the sum of the two vectors and . Explain your
solution.
isi2018-pcb-cs databases relational-algebra sql descriptive

5.5 Relational Calculus (1)

5.5.1 Relational Calculus: ISI2017-PCB-CS-3-b https://gateoverflow.in/309306

Consider the following relations:

and

The former indicates the choice of courses for students and the latter indicates the course assigned to teachers for different
semesters. Note that each student may take multiple courses, each teacher can teach multiple courses and each course can also
be taught by multiple teachers. Write the relational calculus expression to output the ID for all the students who have not been
taught by the same teacher in more than one course across all semesters.
isi2017-pcb-cs databases relational-algebra relational-calculus descriptive

5.6 Sql (1)

5.6.1 Sql: ISI2016-PCB-CS-4 https://gateoverflow.in/244398

Commodity items have some positive or negative changes in their prices each week. Each trading company picks a
portfolio of commodity items, that is, they have one or more items and they own some non-zero quantity of each one.
The database table for this problem consists of the following two relations:
Commodity(item-number int, price-change float, week int),
Owns(company-name text, item-number int, quantity float).

Write an SQL query which returns the item-numbers of commodities for which, in any given week, the price change is greater
than or equal to that of all other items and there exists at least one company selling that item only. (i.e., not selling any other
item) in that week.

isi2016-pcb-cs databases sql non-gate descriptive

© Copyright GATE Overflow. All rights reserved.

36 6 Digital Logic (14)

6 Digital Logic (14)

6.1 Adder (1)

6.1.1 Adder: ISI2012-PCB-CS-2b https://gateoverflow.in/47849

The CPU of a computer has a ripple-carry implementation of a ’s complement adder that takes two – bit integers
and as inputs, and produces a sum , where
. Let and . What will be the output of the adder? How
will the value of be interpreted by the machine?
descriptive isi2012-pcb-cs digital-logic adder

6.2 Boolean Algebra (4)

6.2.1 Boolean Algebra: ISI2012-A-2c https://gateoverflow.in/47830

Professor Hijibiji has defined the following Boolean algebra , where

, i.e., the set of all eight factors of ;
the two binary operators and respectively denote the LCM (least common multiple) and GCD (greatest common
divisor) of two integer operands.

Define the complementation operation for all such that .

descriptive isi2013 boolean-algebra

6.2.2 Boolean Algebra: ISI2012-PCB-A-2a https://gateoverflow.in/47827

Professor Hijibiji has defined the following Boolean algebra , where

, i.e., the set of all eight factors of ;

the two binary operators and respectively denote the LCM (least common multiple) and GCD (greatest common
divisor) of two integer operands.

Show that the two operations of satisfy

i. associativity
ii. commutativity
iii. distributivity.

descriptive isi2012 digital-logic boolean-algebra

6.2.3 Boolean Algebra: ISI2012-PCB-A-2b https://gateoverflow.in/47829

Professor Hijibiji has defined the following Boolean algebra , where

, i.e., the set of all eight factors of ;

the two binary operators and respectively denote the LCM (least common multiple) and GCD (greatest common
divisor) of two integer operands.

Which are the identity elements for ?

isi2012 descriptive digital-logic boolean-algebra

6.2.4 Boolean Algebra: ISI2013-PCB-CS-2b https://gateoverflow.in/47633

Let denote a logic block that is capable of comparing two – bit ’s complement numbers and
, where for . The circuit has eight input lines
, and three output lines (Equal: ; Less than: ; Greater than: ). For example, if ,
then the outputs should be , and . Write the Boolean equations for the three outputs , and .
descriptive isi2013-pcb-cs digital-logic number-representation boolean-algebra

6.3 Boolean Expression (1)

© Copyright GATE Overflow. All rights reserved.

6 Digital Logic (14) 37

6.3.1 Boolean Expression: ISI2017-DCG-10 https://gateoverflow.in/321077

The value of the Boolean expression (with usual definitions) is

A. B. C. D.
isi2017-dcg digital-logic boolean-algebra boolean-expression

6.4 Digital Circuits (1)

6.4.1 Digital Circuits: ISI2015-PCB-CS-3b https://gateoverflow.in/47274

You are given a logic block that takes two inputs and , and produces as output. Realize a two-input
gate using only the logic block . You can use as many pieces of block as you need. You may use the
constant function 0; but no other type of gate is allowed.
descriptive isi2015-pcb-cs digital-logic digital-circuits

6.5 Error Detection (1)

6.5.1 Error Detection: ISI2017-PCB-CS-8-b https://gateoverflow.in/309311

Consider a simple code for error detection and correction. Each codeword in consists of data bits
followed by check bits . The check bits are computed as follows: and ,
where is a modulo- addition.

i. Write down all the codewords for

ii. Determine the minimum Hamming distance between any two distinct codewords of

isi2017-pcb-cs digital-logic error-detection programming descriptive

6.6 Functional Completeness (1)

6.6.1 Functional Completeness: ISI2017-PCB-CS-7-a https://gateoverflow.in/245028

Show that is functionality complete, i.e., any Boolean function with variables and can be expressed
using these two primitives.
isi2017-pcb-cs digital-logic functional-completeness descriptive

6.7 Ieee Representation (2)

6.7.1 Ieee Representation: ISI2012-PCB-CS-2c https://gateoverflow.in/47851

Add the following two floating point numbers and given in IEEE single precision format and show the sum
in the same format.

descriptive isi2012-pcb-cs digital-logic number-representation ieee-representation

6.7.2 Ieee Representation: ISI2017-PCB-CS-8-a https://gateoverflow.in/245027

Write the number in single precision IEEE 754 floating point form.

isi2017-pcb-cs digital-logic ieee-representation descriptive

6.8 K Map (1)

6.8.1 K Map: ISI2011-PCB-CS-6b https://gateoverflow.in/48181

For the function given by the Karnaugh map shown below, you can change at most one or one entry to a DON'T
CARE. Determine what single change of this kind produces the simplest two-level AND-OR realization. Assume both
uncomplemented and complemented inputs are available.

© Copyright GATE Overflow. All rights reserved.

38 6 Digital Logic (14)

digital-logic descriptive isi2011-pcb-cs k-map

6.9 Number Representation (1)

6.9.1 Number Representation: ISI2011-PCB-CS-1a https://gateoverflow.in/48057

The function given below is intended to check whether a given number is divisible by 3. It assumes that the
argument is a string containing the decimal representation of a positive integer, and returns 1 or 0
depending on whether the integer is divisible by 3 or not.
int divby3(char *number)
{
int sum = 0;
while (*number != ’\0’) {
sum += *number - ’0’;
number++;
}
return (sum % 3) ? 0 : 1;
}

Assume that (i) a variable of type is stored using 4 bytes, and (ii) the decimal representations of arbitrarily large positive
integers can be passed as arguments to .

i. Show that the given function does not work correctly for some integers larger than
ii. Modify the above function so that it works as intended for all positive integers.

note: The smaller the number of ALU operations used by your function, the more marks you will get.

descriptive isi2011-pcb-cs number-representation

6.10 Prime Implicants (1)

6.10.1 Prime Implicants: ISI2017-PCB-CS-7-b https://gateoverflow.in/309310

Define a Boolean function of six variables such that

How many essential prime implicants does have? Justify they are essential.
isi2017-pcb-cs digital-logic prime-implicants descriptive

© Copyright GATE Overflow. All rights reserved.

7 Discrete Mathematics: Combinatory (58) 39

7 Discrete Mathematics: Combinatory (58)

7.1 Arrangements (4)

7.1.1 Arrangements: CMI2019-A-4 https://gateoverflow.in/320550

There are five buckets, each of which can be open or closed. An arrangement is a specification of which buckets are
open and which bucket are closed. Every person likes some of the arrangements and dislikes the rest. You host a party,
and amazingly, no two people on the guest list have the same likes and dislikes. What is the maximum number of guests
possible?

A. B. C. D.
cmi2019 permutation-and-combination arrangements

7.1.2 Arrangements: ISI2014-DCG-66 https://gateoverflow.in/321889

Consider all possible words obtained by arranging all the letters of the word . These words are now arranged
in the alphabetical order, as in a dictionary. The fiftieth word in this arrangement is

A. B. C. D.
isi2014-dcg permutation-and-combination arrangements

7.1.3 Arrangements: ISI2015-DCG-24 https://gateoverflow.in/321200

If the letters of the word be arranged in random order, the number of arrangements in which the
three vowels and occur together is

A. B. C. D. None of these
isi2015-dcg permutation-and-combination arrangements

7.1.4 Arrangements: ISI2016-DCG-24 https://gateoverflow.in/321133

If the letters of the word be arranged in random order, the number of arrangements in which the three
vowels and occur together is

A. B. C. D. None of these
isi2016-dcg permutation-and-combination arrangements

7.2 Binomial Theorem (10)

7.2.1 Binomial Theorem: ISI2014-DCG-1 https://gateoverflow.in/321954

Let , being a positive integer. The value of

is

A. B. C. D.
isi2014-dcg permutation-and-combination binomial-theorem

7.2.2 Binomial Theorem: ISI2014-DCG-18 https://gateoverflow.in/321937

equals

A. B. C. D. none of these
isi2014-dcg permutation-and-combination binomial-theorem

7.2.3 Binomial Theorem: ISI2014-DCG-34 https://gateoverflow.in/321921

The following sum of terms

© Copyright GATE Overflow. All rights reserved.

40 7 Discrete Mathematics: Combinatory (58)

up to terms is equal to

A. B. C. D.
isi2014-dcg permutation-and-combination binomial-theorem summation

7.2.4 Binomial Theorem: ISI2015-DCG-21 https://gateoverflow.in/321203

The value of the term independent of in the expansion of is

A. B. C. D. None of these
isi2015-dcg permutation-and-combination binomial-theorem

7.2.5 Binomial Theorem: ISI2015-MMA-9 https://gateoverflow.in/321868

Let being a positive integer. The value of

is

A. B. C. D.
isi2015-mma permutation-and-combination binomial-theorem

7.2.6 Binomial Theorem: ISI2016-DCG-21 https://gateoverflow.in/321136

The value of the term independent of in the expansion of is

A. B. C. D. None of these
isi2016-dcg permutation-and-combination binomial-theorem

7.2.7 Binomial Theorem: ISI2016-MMA-14 https://gateoverflow.in/242716

The number of terms independent of in the binomial expansion of is

A. B. C. D.
isi2016-mma permutation-and-combination binomial-theorem

7.2.8 Binomial Theorem: ISI2017-DCG-11 https://gateoverflow.in/321076

The coefficient of in the expression is

A. B. C. D. none of these
isi2017-dcg permutation-and-combination binomial-theorem

7.2.9 Binomial Theorem: ISI2018-DCG-17 https://gateoverflow.in/321040

The value of is

A. B. C. D.
isi2018-dcg permutation-and-combination binomial-theorem

7.2.10 Binomial Theorem: ISI2018-DCG-4 https://gateoverflow.in/321053

The number of terms with integral coefficients in the expansion of is

© Copyright GATE Overflow. All rights reserved.

7 Discrete Mathematics: Combinatory (58) 41

A. B. C. D.
isi2018-dcg permutation-and-combination binomial-theorem

7.3 Circular Permutation (1)

7.3.1 Circular Permutation: ISI2014-DCG-71 https://gateoverflow.in/321884

Five letters and are arranged so that and are always adjacent to each other and and are never
adjacent to each other. The total number of such arrangements is

A. B. C. D.
isi2014-dcg permutation-and-combination arrangements circular-permutation

7.4 Generating Functions (1)

7.4.1 Generating Functions: ISI2018-MMA-26 https://gateoverflow.in/311877

Let be the coefficient of in .Then

is equal to

A. B. C. D.
isi2018-mma engineering-mathematics discrete-mathematics generating-functions

7.5 Permutation And Combination (36)

7.5.1 Permutation And Combination: CMI2010-A-02 https://gateoverflow.in/46132

We need to choose a team of from a pool of players and also select a captain. The number of different ways this
can be done is

A. B. .
C. D.
cmi2010 permutation-and-combination normal discrete-mathematics

7.5.2 Permutation And Combination: CMI2010-B-05 https://gateoverflow.in/46126

Sales have slumped at the Siruseri noodle factory and the management may need to terminate the contracts of some
employees. Every employee has one immediate boss. The seniormost person in the company is the president, who has
no boss. For legal reasons, if an employee’s contract is not terminated, then his boss’s contract cannot be terminated either. For
how many different sets of employees can the management legally terminate contracts? Note that one possibility that has to be
counted explicitly is that no employees’ contracts are terminated (that is, the set of employees whose contract is terminated is
the empty set).
For example, suppose there are four employees, organised as follows. Each arrow points from an employee to his or her boss.

Here, there are different ways to terminate contracts for a set of employees, as follows:

cmi2010 descriptive permutation-and-combination

7.5.3 Permutation And Combination: CMI2014-A-01 https://gateoverflow.in/46964

For the inter-hostel six-a-side football tournament, a team of players is to be chosen from players consisting of
forwards, defenders and goalkeepers. The team must include at least forwards, at least defenders and at least
goalkeeper. Find the number of different ways in which the team can be chosen.

A. B. C. D.
cmi2014 permutation-and-combination discrete-mathematics normal

© Copyright GATE Overflow. All rights reserved.

42 7 Discrete Mathematics: Combinatory (58)

7.5.4 Permutation And Combination: CMI2015-A-10 https://gateoverflow.in/47051

The school athletics coach has to choose students for the relay team. He calculates that there are ways of
choosing the team if the order in which the runners are placed is not considered. How many ways are there of choosing
the team if the order of the runners is to be taken into account?
A. Between and B. Between and
C. Between and D. More than
cmi2015 permutation-and-combination

7.5.5 Permutation And Combination: CMI2015-B-02 https://gateoverflow.in/47056

Consider a social network with persons. Two persons and are said to be connected if either they are friends or
they are related through a sequence of friends: that is, there exists a set of persons such that and are
friends, and are friends, and are friends, and finally and are friends.
It is known that there are persons such that no pair among them is connected. What is the maximum number of friendships
possible?
descriptive cmi2015 permutation-and-combination

7.5.6 Permutation And Combination: CMI2017-B-4 https://gateoverflow.in/203317

In a party there are participants, where is a positive integer. Some participants shake hands with other
participants. It is known that there are no three participants who have shaken hands with each other. Prove that the total
number of handshakes is not more than
cmi2017 engineering-mathematics discrete-mathematics permutation-and-combination descriptive

7.5.7 Permutation And Combination: CMI2018-A-5 https://gateoverflow.in/320488

How many paths are there in the plane from to if the possible steps from are either
or

A. B. C. D.
cmi2018 permutation-and-combination

7.5.8 Permutation And Combination: CMI2019-A-5 https://gateoverflow.in/320549

Let be a permutation of For we say that has its first ascent at if

and How many permutations have their first ascent at

A. B.
C. D.
cmi2019 permutation-and-combination

7.5.9 Permutation And Combination: ISI 2004 MIII https://gateoverflow.in/123721

A subset of set of numbers is said to be good if has exactly elements and their ,
Then number of good subset is

A. B. C. D.
permutation-and-combination isi2004 discrete-mathematics normal

7.5.10 Permutation And Combination: ISI 2004 MIII https://gateoverflow.in/123718

A club with members is organized into four committees such that

i. each member is in exactly two committees,

ii. any two committees have exactly one member in common .

Then has
A. exactly two values both between and B. exactly one value and this lies between
. and .
C. exactly two values both between and D. exactly one value and this lies between
. and .

© Copyright GATE Overflow. All rights reserved.

7 Discrete Mathematics: Combinatory (58) 43

permutation-and-combination isi2004

7.5.11 Permutation And Combination: ISI 2004 MIII https://gateoverflow.in/123714

The number of permutation of that keep at least one integer fixed is.

A. B. C. D.
permutation-and-combination isi2004 discrete-mathematics normal

7.5.12 Permutation And Combination: ISI 2004 MIII https://gateoverflow.in/123727

In how many ways can three person, each throwing a single die once, make a score of

A. B. C. D.
permutation-and-combination isi2004

7.5.13 Permutation And Combination: ISI 2016 PCB C8 https://gateoverflow.in/120576

Consider committees, each having at least persons, formed from a group of persons. Prove that there exists at
least one person who belongs to at least committees.
isi2016-pcb permutation-and-combination descriptive

7.5.14 Permutation And Combination: ISI2011-PCB-A-3a https://gateoverflow.in/48045

Consider an integer lattice. A path from to can use steps of , or diagonal steps .
Let be the number of such distinct paths. Prove that

descriptive isi2011 permutation-and-combination proof

7.5.15 Permutation And Combination: ISI2014-DCG-32 https://gateoverflow.in/321923

Consider multiple-choice questions, each with four options of which exactly one is correct. Then the number of
ways one can get only the alternate questions correctly answered is

A. B.
D.
C.

isi2014-dcg permutation-and-combination

7.5.16 Permutation And Combination: ISI2014-DCG-41 https://gateoverflow.in/321914

The number of permutations of the letters and such that does not follow does not follow , and does
not follow , is

A. B. C. D.
isi2014-dcg permutation-and-combination

7.5.17 Permutation And Combination: ISI2014-DCG-63 https://gateoverflow.in/321892

If , an then is equal to

A. B. C. D. none of these
isi2014-dcg permutation-and-combination

7.5.18 Permutation And Combination: ISI2015-MMA-4 https://gateoverflow.in/321873

Suppose in a competition matches are to be played, each having one of distinct outcomes as possibilities. The
number of ways one can predict the outcomes of all matches such that exactly of the predictions turn out to be
correct is

A. B.
C. D. none of the above

© Copyright GATE Overflow. All rights reserved.

44 7 Discrete Mathematics: Combinatory (58)

isi2015-mma permutation-and-combination

7.5.19 Permutation And Combination: ISI2015-MMA-6 https://gateoverflow.in/321871

A club with members is organized into four committees such that

a. each member is in exactly two b. any two committees have exactly one
committees, member in common.
Then has
A. exactly two values both between and B. exactly one value and this lies between
and
C. exactly two values both between and D. exactly one value and this lies between
and
isi2015-mma permutation-and-combination

7.5.20 Permutation And Combination: ISI2015-MMA-60 https://gateoverflow.in/321817

Let be the permutation:

be the identity permutation and be the order of i.e. . Then is

A. B. C. D.
isi2015-mma permutation-and-combination

7.5.21 Permutation And Combination: ISI2015-PCB-A-3 https://gateoverflow.in/47267

Consider all possible permutations of eight distinct elements . In how many of them, will appear
before ? Note that and may not necessarily be consecutive.
descriptive isi2015-pcb-a permutation-and-combination

7.5.22 Permutation And Combination: ISI2016 https://gateoverflow.in/45161

A palindrome is a sequence of digits which reads the same backward or forward. For example, , are
palindromes, but , are not palindromes. How many digit prime palindromes are there?
isi2016 permutation-and-combination discrete-mathematics normal descriptive

7.5.23 Permutation And Combination: ISI2016-MMA-25 https://gateoverflow.in/242705

A integer is said to be a if it reads the same forward or backward. For example, the integer is a
-digit palindrome and is not a palindrome. How many -digit palindromes are prime?

A. B. C. D.
isi2016-mmamma permutation-and-combination

7.5.24 Permutation And Combination: ISI2016-MMA-30 https://gateoverflow.in/242700

A club with members is organized into four committees so that each member belongs to exactly two committees and
each pair of committees has exactly one member in common. Then
A. B.
C. D. cannot be determined from the given
information
isi2016-mmamma permutation-and-combination

7.5.25 Permutation And Combination: ISI2016-PCB-CS-8 https://gateoverflow.in/244394

i. Consider all possible trees with nodes. Let be the number of nodes with degree greater than 1 in a given tree. What is
the maximum possible value of ? Justify your answer.
ii. Consider committees, each having at least persons, formed from a group of persons. Prove that there exists at

© Copyright GATE Overflow. All rights reserved.

7 Discrete Mathematics: Combinatory (58) 45

least one person who belongs to at least committees.

isi2016-pcb-cs permutation-and-combination descriptive

7.5.26 Permutation And Combination: ISI2017-MMA-22 https://gateoverflow.in/214179

The five vowels— —along with are to be arranged in a row such that no is at an extreme
position. Also, between any two vowels, there must be at least . The number of ways in which this can be done is

A. B. C. D.
isi2017-mma engineering-mathematics discrete-mathematics permutation-and-combination

7.5.27 Permutation And Combination: ISI2017-MMA-26 https://gateoverflow.in/243358

Let be the number of ways in which men and women can stand in a queue such that all the women stand
consecutively. Let be the number of ways in which the same persons can stand in a queue such that exactly
women stand consecutively. Then the value of is

A. B. C. D.
isi2017-mma engineering-mathematics discrete-mathematics permutation-and-combination

7.5.28 Permutation And Combination: ISI2017-MMA-6 https://gateoverflow.in/243378

In a class of students, are girls and are boys. Also, exactly students wear glasses. Then the set of all
possible numbers of boys without glasses is
A. B.
C. D. none of these
isi2017-mma engineering-mathematics discrete-mathematics permutation-and-combination

7.5.29 Permutation And Combination: ISI2018-DCG-12 https://gateoverflow.in/321045

Let . How many pairs of numbers and are possible so that and and
belong to ?

A. B. C. D.
isi2018-dcg permutation-and-combination

7.5.30 Permutation And Combination: ISI2018-DCG-14 https://gateoverflow.in/321043

In a room there are men, numbered . These men have to be divided into teams in such a way that

i. every team has exactly members, and

ii. there are no common members between any two teams. For example,
are two such -team combinations. The total number of such
-team combinations is

A. B. C. D.
isi2018-dcg permutation-and-combination

7.5.31 Permutation And Combination: ISI2018-DCG-8 https://gateoverflow.in/321049

A Pizza Shop offers different toppings, and they do not take an order without any topping. I can afford to have one
pizza with a maximum of toppings. In how many ways can I order my pizza?

A. B. C. D.
isi2018-dcg permutation-and-combination

7.5.32 Permutation And Combination: ISI2018-MMA-10 https://gateoverflow.in/311830

A new flag of ISI club is to be designed with vertical strips using some or all of the four colors: green, maroon, red
and yellow. In how many ways this can be done so that no two adjacent strips have the same color?

© Copyright GATE Overflow. All rights reserved.

46 7 Discrete Mathematics: Combinatory (58)

A. B. C. D.
isi2018-mma engineering-mathematics discrete-mathematics permutation-and-combination

7.5.33 Permutation And Combination: ISI2019-MMA-2 https://gateoverflow.in/311372

The number of digit positive integers whose sum of the digits is at least is

A. B. C. D.
isi2019-mma engineering-mathematics discrete-mathematics permutation-and-combination

7.5.34 Permutation And Combination: ISI2019-MMA-20 https://gateoverflow.in/311467

Suppose that the number plate of a vehicle contains two vowels followed by four digits. However, to avoid confusion,
the letter and the digit are not used in the same number plate. How many such number plates can be formed?

A. B. C. D.
isi2019-mma engineering-mathematics discrete-mathematics permutation-and-combination

7.5.35 Permutation And Combination: ISI2019-MMA-27 https://gateoverflow.in/311475

A general election is to be scheduled on days in May such that it is not scheduled on two consecutive days. In how
many ways can the days be chosen to hold the election?

A. B.

C. D.

isi2019-mma engineering-mathematics discrete-mathematics permutation-and-combination

7.5.36 Permutation And Combination: ISI2019-MMA-4 https://gateoverflow.in/311375

Suppose that -digit numbers are formed using each of the digits exactly once. The number of such -
digit numbers that are divisible by but not divisible by is equal to

A. B. C. D.
isi2019-mma engineering-mathematics discrete-mathematics permutation-and-combination

7.6 Pigeonhole Principle (2)

7.6.1 Pigeonhole Principle: CMI2019-B-3 https://gateoverflow.in/320520

There is a party of people. Each attendee has at most friends in the party. The friend circle of a person includes the
person and all her friends. You are required to pick some people for a party game, with the restriction that at most one
person is picked from each friend circle. Show that you can pick people for the game.

cmi2019 permutation-and-combination pigeonhole-principle

7.6.2 Pigeonhole Principle: ISI2011-PCB-A-3b https://gateoverflow.in/48047

The numbers are arranged in a circle in some order. Show that it is always possible to find three adjacent
numbers whose sum is at least , irrespective of the ordering.
descriptive isi2011 pigeonhole-principle

7.7 Recurrence Relations (2)

7.7.1 Recurrence Relations: ISI2015-MMA-1 https://gateoverflow.in/321876

Let be a sequence of polynomials defined inductively as

© Copyright GATE Overflow. All rights reserved.

7 Discrete Mathematics: Combinatory (58) 47

Let and respectively denote the constant term and the coefficient of in . Then

A. B.
C. D.
isi2015-mma recurrence-relations non-gate

7.7.2 Recurrence Relations: ISI2016-PCB-A-3 https://gateoverflow.in/244360

A bit string is called legitimate if it contains no consecutive zeros is legitimate, where as is

not. Let denote the number of legitimate bit strings of length . Define . Derive a recurrence relation for
express in terms of the preceding

isi2016-pcb-a permutation-and-combination recurrence-relations non-gate descriptive

7.8 Sets (1)

7.8.1 Sets: ISI2015-MMA-8 https://gateoverflow.in/321869

Let be a set of elements. The number of ways, we can choose an ordered pair , where are disjoint
subsets of , equals

A. B. C. D.
isi2015-mma permutation-and-combination sets

7.9 Summation (1)

7.9.1 Summation: ISI2014-DCG-72 https://gateoverflow.in/321883

The sum is equal to

A. B. C. D.
isi2014-dcg permutation-and-combination summation

© Copyright GATE Overflow. All rights reserved.

48 8 Discrete Mathematics: Graph Theory (41)

8 Discrete Mathematics: Graph Theory (41)

8.1 Degree Of Graph (2)

8.1.1 Degree Of Graph: CMI2013-A-06 https://gateoverflow.in/46596

A simple graph is one in which there are no self-loops and each pair of distinct vertices is connected by at most one
edge. Let be a simple graph on vertices such that there is a vertex of degree , a vertex of degree , a vertex of
degree , a vertex of degree , a vertex of degree , a vertex of degree and a vertex of degree . Which of the following can
be the degree of the last vertex?

A. B. C. D.
cmi2013 graph-theory normal degree-of-graph

8.1.2 Degree Of Graph: CMI2015-A-05 https://gateoverflow.in/47039

An undirected graph has vertices labelled and edges. Vertices have degree and
vertices have degree What is the degree of vertex ?

A. B. C. D.
cmi2015 graph-theory degree-of-graph easy

8.2 Graph Coloring (3)

8.2.1 Graph Coloring: CMI2011-B-01a https://gateoverflow.in/46200

A multinational company is developing an industrial area with many buildings. They want to connect the buildings
with a set of roads so that:

Each road connects exactly two buildings.

Any two buildings are connected via a sequence of roads.
Omitting any road leads to at least two buildings not being connected by any sequence of roads.

Is it always possible to colour each building with either red or blue so that every road connects a red and blue building?

cmi2011 descriptive graph-coloring

8.2.2 Graph Coloring: CMI2015-A-03 https://gateoverflow.in/47033

Suppose each edge of an undirected graph is coloured using one of three colours — red, blue or green. Consider the
following property of such graphs: if any vertex is the endpoint of a red coloured edge, then it is either an endpoint of a
blue coloured edge or not an endpoint of any green coloured edge. If a graph does not satisfy this property, which of the
following statements about are valid?

A. There is a red coloured edge.

B. Any vertex that is the endpoint of a red coloured edge is also the endpoint of a green coloured edge.
C. There is a vertex that is not an endpoint of any blue coloured edge but is an endpoint of a green coloured edge and a red
coloured edge.
D. (A) and (C).

cmi2015 graph-theory graph-coloring

8.2.3 Graph Coloring: CMI2015-A-04b https://gateoverflow.in/47262

A college prepares its timetable by grouping courses in slots A, B, C, . . . All courses in a slot meet at the same time,
and courses in different slots have disjoint timings. Course registration has been completed and the administration now
knows which students are registered for each course. If the same student is registered for two courses, the courses must
be assigned different slots. The administration is trying to compute the minimum number of slots required to prepare the
timetable.
The administration decides to model this as a graph where the nodes are the courses and edges represent pairs of courses with
an overlapping audience. In this setting, the graph theoretic question to be answered is:
Find a minimal colouring.

cmi2015 descriptive graph-theory graph-coloring

8.3 Graph Connectivity (22)

© Copyright GATE Overflow. All rights reserved.

8 Discrete Mathematics: Graph Theory (41) 49

8.3.1 Graph Connectivity: CMI2010-A-06 https://gateoverflow.in/46137

A simple graph is one with no self-loops or multiple edges. Among the simple graphs with vertices and at most
edges:

A. There is always a graph with all vertices connected to at least other vertices.
B. For all such graphs the number of vertices connected to at least other vertices is at most cn for some constant .
C. There are no graphs with each vertex connected to at most other vertices.
D. None of the above

cmi2010 graph-theory graph-connectivity

8.3.2 Graph Connectivity: CMI2010-B-01a https://gateoverflow.in/46130

An international cellphone company provides service on different frequencies. They wish to set up business in
TamilNadu and have fixed the locations of towers for their new service. The company has to ensure that two
towers broadcasting on the same frequency are at least km apart, so that there is no interference of signals.

Model this problems using graphs.

cmi2010 descriptive graph-theory graph-connectivity

8.3.3 Graph Connectivity: CMI2010-B-02 https://gateoverflow.in/46129

Let be a graph in which each vertex has degree at least . Show that there is a path of length in —that is, a
sequence of distinct vertices such that for is connected to in .
cmi2010 descriptive graph-theory graph-connectivity

8.3.4 Graph Connectivity: CMI2011-A-07 https://gateoverflow.in/46194

Let be a graph. Define to be , where for all if and only if .

Then which of the following is true?

A. is always connected.
B. is connected if is not connected.
C. At least one of and connected.
D. is not connected or is not connected

cmi2011 graph-theory graph-connectivity

8.3.5 Graph Connectivity: CMI2011-B-01b https://gateoverflow.in/47092

A multinational company is developing an industrial area with many buildings. They want to connect the buildings
with a set of roads so that:

Each road connects exactly two buildings.

Any two buildings are connected via a sequence of roads.
Omitting any road leads to at least two buildings not being connected by any sequence of roads.

Two roads are said to be to each other if they serve a common building. A set of roads is said to be if:

No two roads in the set are adjacent, and,

Each building is served by at least one road in the set.

i. Is it always possible to find a preferred set of roads?

ii. Is it ever possible to find two sets of preferred roads differing in at least one road?

Substantiate your answers by either proving the assertion or providing a counterexample.

cmi2011 descriptive graph-theory graph-connectivity

8.3.6 Graph Connectivity: CMI2011-B-02b https://gateoverflow.in/47081

Let be a connected graph. For a vertex of we denote by the graph formed by removing and all edges

© Copyright GATE Overflow. All rights reserved.

50 8 Discrete Mathematics: Graph Theory (41)

incident on from . is said to be good if there are at least two distinct vertices in such that both and
are connected.

Given a good graph, devise a linear time algorithm to find two such vertices.
descriptive cmi2011 graph-theory graph-connectivity

8.3.7 Graph Connectivity: CMI2011-B-02c https://gateoverflow.in/47082

Let be a connected graph. For a vertex of we denote by the graph formed by removing and all edges
incident on from . is said to be good if there are at least two distinct vertices in such that both and
are connected.

Show that there exists a graph such that we cannot find three distinct vertices such that each of
and is connected.
cmi2011 descriptive graph-theory graph-connectivity

8.3.8 Graph Connectivity: CMI2012-B-01 https://gateoverflow.in/46545

Let be a graph where and the degree of each vertex is strictly greater than . Prove that has a
Hamiltonian path. (Hint: Consider a path of maximum length in .)
cmi2012 descriptive graph-theory graph-connectivity

8.3.9 Graph Connectivity: CMI2013-B-02 https://gateoverflow.in/46612

A complete graph on vertices is an undirected graph in which every pair of distinct vertices is connected by an edge.
A simple path in a graph is one in which no vertex is repeated. Let be a complete graph on vertices. Let , ,
be three distinct vertices in . How many simple paths are there from to going through ?
cmi2013 descriptive graph-theory graph-connectivity

8.3.10 Graph Connectivity: CMI2013-B-03 https://gateoverflow.in/46613

A simple graph is one in which there are no self loops and each pair of distinct vertices is connected by at most one
edge. Show that any finite simple graph has at least two vertices with the same degree.
cmi2013 descriptive graph-theory graph-connectivity

8.3.11 Graph Connectivity: CMI2016-A-9 https://gateoverflow.in/98379

ScamTel has won a state government contract to connect cities by high-speed fibre optic links. Each link will
connect a pair of cities so that the entire network is connected-there is a path from each city to every other city. The
contract requires the network to remain connected if single link fails. What is the minimum number of links that ScamTel
needs to set up?

A. B. C. D.
cmi2016 graph-theory graph-connectivity

8.3.12 Graph Connectivity: CMI2016-B-2a https://gateoverflow.in/98388

A (respectively cycle) in a graph is a path (respectively cycle) in which no edge or vertex is repeated. The
of such a path (respectively cycle) is the number of edges in the path (respectively cycle).
Let be an undirected graph with minimum degree . Show that contains a simple path of length at least .
cmi2016 graph-theory descriptive graph-connectivity

8.3.13 Graph Connectivity: CMI2016-B-2b https://gateoverflow.in/98389

A (respectively cycle) in a graph is a path (respectively cycle) in which no edge or vertex is repeated. The
of such a path (respectively cycle) is the number of edges in the path (respectively cycle).
Let be an undirected graph with minimum degree . Show that contains a simple cycle of length at least .
cmi2016 graph-theory graph-connectivity descriptive

© Copyright GATE Overflow. All rights reserved.

8 Discrete Mathematics: Graph Theory (41) 51

8.3.14 Graph Connectivity: CMI2016-B-3 https://gateoverflow.in/98391

An undirected graph can be converted into a directed graph by choosing a direction for every edge. Here is an example:

Show that for every undirected graph, there is a way of choosing directions for its edges so that the resulting directed graph has
no directed cycles.

cmi2016 descriptive graph-theory graph-connectivity

8.3.15 Graph Connectivity: CMI2017-A-04 https://gateoverflow.in/203261

City authorities are concerned about traffic accidents on major roads. They would like to have ambulances stationed at
road intersections to quickly reach the scene of any accident along these roads. To minimize response time, ambulances
are to be located at intersections with traffic lights so that any segment of road can be reached by at least one ambulance that
does not have to pass through a traffic light to reach the scene of the accident. If we model the road network as a graph, where
intersections with traffic lights are vertices and edges represent road segments between traffic lights, the graph-theoretic
question to be answered is:
A. Find a spanning tree with minimum B. Find a spanning tree with minimum
number of edges. cost.
C. Find a minimal coloring. D. Find a minimum size vertex cover.
cmi2017 graph-connectivity easy

8.3.16 Graph Connectivity: CMI2017-A-05 https://gateoverflow.in/203263

Let be an arbitrary graph on vertices with edges. Consider the following statements:

I. There is a vertex of degree smaller than in .

II. There is a vertex such that there are less than vertices at a distance exactly from it.

Which of the following is true:

A. I Only B. II Only
C. Both I and II D. Neither I nor II

cmi2017 engineering-mathematics discrete-mathematics graph-theory graph-connectivity

8.3.17 Graph Connectivity: CMI2017-B-5 https://gateoverflow.in/203318

An undirected graph is if, for any two vertices of the graph, there is a path in the graph starting at
and ending at . A tree is a connected, undirected graph that contains no cycle.

a. A in a tree is a vertex that has degree . Prove that if is a tree with at least two vertices then contains at least two
leaves.
b. A is one in which the vertex set can be partitioned into two disjoint sets and so that for every
edge , and lie in different partitions—that is, and v or vice versa. Prove that if is a tree with at
least two vertices, then is bipartite.

cmi2017 engineering-mathematics discrete-mathematics graph-theory graph-connectivity descriptive

8.3.18 Graph Connectivity: CMI2018-B-3 https://gateoverflow.in/320460

Let be a simple graph on vertices.

A. Prove that if has more than edges then is connected.

B. For every , find a graph which has exactly vertices and edges, and is not connected.

cmi2018 graph-theory graph-connectivity descriptive

© Copyright GATE Overflow. All rights reserved.

52 8 Discrete Mathematics: Graph Theory (41)

8.3.19 Graph Connectivity: CMI2019-B-4 https://gateoverflow.in/320519

Consider the assertion: Any connected undirected graph with at least two vertices contains a vertex such that
deleting from results in a connected graph. Either give a proof of the assertion, or give a counterexample (thereby
disproving the assertion).
cmi2019 graph-connectivity

8.3.20 Graph Connectivity: ISI2011-PCB-CS-3b https://gateoverflow.in/48141

Let be a tree, and let be any vertex of .

The of is the maximum distance from to any other vertex in .

The of is the set of vertices which have minimum eccentricity among all vertices in .
The is the number of vertices in the largest subtree of .
The of is the set of vertices with minimum weight among all vertices in .

Construct a tree that has disjoint centre and centroid, each having two vertices (i.e. and .

descriptive isi2011-pcb-cs graph-theory graph-connectivity

8.3.21 Graph Connectivity: ISI2015-PCB-C3 https://gateoverflow.in/120885

For a positive integer , let be a graph, where , i.e., is the set of vertices has one to one
correspondence with the set of all -bit binary strings and belongs to and differ in exactly
one bit position .

i. Determine size of
ii. Show that is connected

graph-theory discrete-mathematics isi2015 graph-connectivity

8.3.22 Graph Connectivity: ISI2017-PCB-CS-1(b) https://gateoverflow.in/309300

Show that if the edge set of the graph with nodes can be partitioned into trees, then there is at least one
vertex of degree less than in .
isi2017-pcb-cs engineering-mathematics discrete-mathematics graph-theory graph-connectivity descriptive

8.4 Independent Set (2)

8.4.1 Independent Set: CMI2015-A-04d https://gateoverflow.in/47264

A college prepares its timetable by grouping courses in slots A, B, C, . . . All courses in a slot meet at the same time,
and courses in different slots have disjoint timings. Course registration has been completed and the administration now
knows which students are registered for each course. If the same student is registered for two courses, the courses must
be assigned different slots. The administration is trying to compute the minimum number of slots required to prepare the
timetable.
The administration decides to model this as a graph where the nodes are the courses and edges represent pairs of courses with
an overlapping audience. In this setting, the graph theoretic question to be answered is:
Find a maximum size independent set.

cmi2015 descriptive graph-theory independent-set

8.4.2 Independent Set: CMI2018-A-9 https://gateoverflow.in/320484

Your college has sent a contingent to take part in a cultural festival at a neighbouring institution. Several team events
are part of the programme. Each event takes place through the day with many elimination rounds. Your contingent is
multi-talented and each individual has the skills to take part in a subset of the events. However, the same individual cannot be
part of the team for two different events because of a possible clash in timings. Your aim is to create teams to take part in as
many events as possible.
To do this, you decide to model the problem as a graph where the nodes are the events and edges represent pairs of events
where the team that you plan to send shares a member. In this setting, the graph theoretic question to be answered is:
A. Find a maximum length simple cycle B. Find a maximum size independent set
C. Find a maximum matching D. Find a maximal connected component
cmi2018 graph-theory graph-connectivity graph-matching independent-set descriptive

© Copyright GATE Overflow. All rights reserved.

8 Discrete Mathematics: Graph Theory (41) 53

8.5 Regular Pentagon (1)

8.5.1 Regular Pentagon: CMI2016-A-5 https://gateoverflow.in/98367

A dodecahedron is a regular solid with faces, each face being a regular pentagon. How many edges are there? And
how many vertices?
A. edges and vertices B. edges and vertices
C. edges and vertices D. edges and vertices
cmi2016 graph-theory undirected-graph regular-pentagon faces

8.6 Shortest Path (3)

8.6.1 Shortest Path: CMI2016-A-1 https://gateoverflow.in/98352

In a connected undirected graph, the distance between two vertices is the number of edges in the shortest path between
them. Suppose we denote bt the following property: there exists a vertex that is a neighbour of all other vertices .
Consider the following statements:

i. If is false, then there is a pair of vertices such that the distance between them is at least
ii. If is true, then the distance between any pair of vertices is at most

What can you say about these statements?

A. Only i is true B. Only ii is true
C. Both i and ii are true D. Neither i nor ii is true
cmi2016 graph-theory shortest-path

8.6.2 Shortest Path: CMI2016-A-4 https://gateoverflow.in/98366

Consider a weighted undirected graph with positive edge weights. Let be an edge in the graph. It is known
that the shortest path from a vertex to has weight and the shortest path from to has weight Which of the
statements is always true?
A. Weight of B. Weight of
C. Weight of D. Nothing can be said about the weight
of
cmi2016 graph-theory shortest-path

8.6.3 Shortest Path: CMI2018-A-4 https://gateoverflow.in/320489

Let be an undirected simple graph, and be a designated vertex in For each let be the
length of a shortest path between and For an edge in what can not be the value of

A. B. C. D.
cmi2018 graph-theory shortest-path

8.7 Spanning Tree (2)

8.7.1 Spanning Tree: CMI2015-A-04a https://gateoverflow.in/47036

A college prepares its timetable by grouping courses in slots A, B, C, . . . All courses in a slot meet at the same time,
and courses in different slots have disjoint timings. Course registration has been completed and the administration now
knows which students are registered for each course. If the same student is registered for two courses, the courses must be
assigned different slots. The administration is trying to compute the minimum number of slots required to prepare the
timetable.
The administration decides to model this as a graph where the nodes are the courses and edges represent pairs of courses with
an overlapping audience. In this setting, the graph theoretic question to be answered is:

Find a spanning tree with minimum number of edges.

cmi2015 descriptive graph-theory spanning-tree

8.7.2 Spanning Tree: ISI2012-PCB-CS-4 https://gateoverflow.in/47854

A fan of order is a graph on the vertices with edges defined as follows: vertex is connected
by an edge to each of the other vertices, and vertex is connected by an edge to vertex , for .

© Copyright GATE Overflow. All rights reserved.

54 8 Discrete Mathematics: Graph Theory (41)

Let denote the number of spanning trees of the fan of order .

1. Calculate .
2. Write a recurrence for .
3. Solve for fn using ordinary generating functions.

descriptive isi2012-pcb-cs graph-theory spanning-tree generating-functions

8.8 Trees (2)

8.8.1 Trees: CMI2012-A-02 https://gateoverflow.in/46531

L et be a tree on 100 vertices. Let be the number of vertices in which have exactly neighbors. Let
Which of the following is true?

A. B.
C. D. None of the above
cmi2012 graph-theory trees

8.8.2 Trees: ISI Entrance Exam MTech (CS) https://gateoverflow.in/124367

Consider all possible trees with nodes. Let be the number of nodes with degree greater than in a given tree. What
is the maximum possible value of ?
isi2016 graph-theory trees descriptive

8.9 Undirected Graph (1)

8.9.1 Undirected Graph: CMI2018-B-5 https://gateoverflow.in/320458

Let be an undirected graph and The input graph is given to you by a matrix
of size as follows. For any the entry if and only if is an edge in
A connected component in is a subgraph in which any two vertices are connected to each other by paths. Give a simple
algorithm to find the number of connected components in Analyze the time taken by your procedure.
cmi2018 graph-theory undirected-graph graph-connectivity connected-components descriptive

8.10 Vertex Cover (3)

8.10.1 Vertex Cover: CMI2015-A-04c https://gateoverflow.in/47263

A college prepares its timetable by grouping courses in slots A, B, C, . . . All courses in a slot meet at the same time,
and courses in different slots have disjoint timings. Course registration has been completed and the administration now
knows which students are registered for each course. If the same student is registered for two courses, the courses must be
assigned different slots. The administration is trying to compute the minimum number of slots required to prepare the
timetable.
The administration decides to model this as a graph where the nodes are the courses and edges represent pairs of courses with
an overlapping audience. In this setting, the graph theoretic question to be answered is:
A. Find a spanning tree with minimum B. Find a minimal colouring.
number of edges.
C. Find a minimum size vertex cover. D. Find a maximum size independent set
cmi2015 descriptive graph-theory vertex-cover

8.10.2 Vertex Cover: CMI2019-A-7 https://gateoverflow.in/320547

An interschool basketball tournament is being held at the Olympic sports complex. There are multiple basketball
courts. Matches are scheduled in parallel, with staggered timings, to ensure that spectators always have some match or
other available to watch. Each match requires a team of referees and linesmen. Two matches that overlap require disjoint teams
of referees and linesmen. The tournament organizers would like to determine how many teams of referees and linesmen they
need to mobilize to effectively conduct the tournament. To determine this, which graph theoretic problem do the organizers
have to solve?
A. Find a minimal colouring. B. Find a minimal spanning tree.
C. Find a minimal cut. D. Find a minimal vertex cover.
cmi2019 graph-theory graph-coloring spanning-tree vertex-cover descriptive

© Copyright GATE Overflow. All rights reserved.

8 Discrete Mathematics: Graph Theory (41) 55

8.10.3 Vertex Cover: ISI2011-PCB-CS-3c https://gateoverflow.in/48147

A vertex cover of a graph is a set of vertices such that for any edge , either or \ (or
both) is in . Write a linear time algorithm to find the minimum vertex cover of a given tree . Establish its
correctness.
descriptive isi2011-pcb-cs graph-theory vertex-cover

© Copyright GATE Overflow. All rights reserved.

56 9 Discrete Mathematics: Mathematical Logic (4)

9 Discrete Mathematics: Mathematical Logic (4)

9.1 First Order Logic (2)

9.1.1 First Order Logic: CMI2010-A-04 https://gateoverflow.in/46134

Let and range over natural numbers and let be true if is a prime number. Which of the following
formulas expresses the fact that the set of prime numbers is infinite?

A.
B.
C.
D.

cmi2010 first-order-logic

9.1.2 First Order Logic: CMI2015-A-01 https://gateoverflow.in/46996

Twin primes are pairs of numbers and such that both are primes—for instance, and , and , and .
The Twin Prime Conjecture says that there are infinitely many twin primes.
Let be a predicate that is true if and are twin primes. Which of the following formulas, interpreted
over positive integers, expresses that there are only finitely many twin primes?

A.
B.
C.
D.

cmi2015 mathematical-logic first-order-logic

9.2 Logical Reasoning (2)

9.2.1 Logical Reasoning: CMI2013-A-07 https://gateoverflow.in/46597

Consider the following two statements.

1. There are infinitely many interesting whole numbers.

2. There are finitely many uninteresting whole numbers.

Which of the following is true?

A. Statements and are equivalent. B. Statement implies statement .
C. Statement implies statement . D. None of the above.
cmi2013 mathematical-logic logical-reasoning

9.2.2 Logical Reasoning: CMI2019-B-5 https://gateoverflow.in/320518

In the land of Twitter, there are two kinds of people: knights (also called outragers), who always tell the truth, and
knaves (also called trolls), who always lie. It so happened that a person with handle @anand tweeted something
offensive. It was not known whether @anand was knight or a knave. A crack team, headed by Inspector Chitra, rounded up
three suspects and interrogated them.
The first interrogation went as follows.

Chitra : What do you know about @anand?

Suspect : @anand once claimed that I was a knave.
Chitra : Are you by any chance @anand?
Suspect : Yes.

cmi2019 mathematical-logic logical-reasoning

© Copyright GATE Overflow. All rights reserved.

10 Discrete Mathematics: Set Theory & Algebra (46) 57

10 Discrete Mathematics: Set Theory & Algebra (46)

10.0.1 ISI2018-PCB-A4 https://gateoverflow.in/311918

L e t and are two non-empty finite subsets of , the set of all integers. Define
.Prove that , where denotes the cardinality of finite
set .
isi2018-pcb-a set-theory&algebra descriptive

10.1 Algebra (1)

10.1.1 Algebra: ISI2014-DCG-15 https://gateoverflow.in/321940

L et be the set of natural numbers. For each , define . Then

equals

A. B. C. D.
isi2014-dcg sets algebra

10.2 Cartesian Product (1)

10.2.1 Cartesian Product: ISI2015-MMA-7 https://gateoverflow.in/321870

Let be the set . Define the set by and have the same
remainder when divided by .
Then the number of elements in is

A. B. C. D.
isi2015-mma sets cartesian-product

10.3 Disjoint Sets (1)

10.3.1 Disjoint Sets: ISI2014-DCG-35 https://gateoverflow.in/321920

Let and be disjoint sets containing and elements respectively, and let . Then the number of
subsets (of ) which contains elements and also has the property that contains elements, is

A. B.

C. D.

isi2014-dcg sets disjoint-sets

10.4 Factors (1)

10.4.1 Factors: ISI 2004 MIII https://gateoverflow.in/123730

is a factor of whenever

A. is odd B. is odd and multiple of

C. is an even multiple of D. is odd and not a multiple of
factors isi2004 engineering-mathematics

10.5 Functions (8)

10.5.1 Functions: CMI2011-A-05 https://gateoverflow.in/46192

A boolean function is a function that takes three boolean arguments and produces a boolean output. Let and
be boolean functions. We say that and are neighbours if and agree on at least one input and disagree on
at least one input: that is, there exist such that and such that
.
Suppose we fix a boolean function . How many neighbours does have?

© Copyright GATE Overflow. All rights reserved.

58 10 Discrete Mathematics: Set Theory & Algebra (46)

A. B. C. D.
cmi2011 functions

10.5.2 Functions: ISI 2004 MIII https://gateoverflow.in/124234

Let be a nonempty set and let denote the collection of all subsets of Define by

Then equals

A. B.
C. D.
isi2004 functions

10.5.3 Functions: ISI 2014 PCB A2 https://gateoverflow.in/215132

L e t and be two integers such that Count the number of functions

of the following two types:

a. strictly increasing; i.e., whenever and

b. non-decreasing; i.e., whenever

isi2014 set-theory&algebra functions

10.5.4 Functions: ISI2015-DCG-27 https://gateoverflow.in/321197

If be the set of triangles in a plane and be the set of all positive real numbers, then the function
defined by area of triangle is

A. one-one and into B. one-one and onto C. many-one and onto D. many-one and into
isi2015-dcg functions

10.5.5 Functions: ISI2015-DCG-36 https://gateoverflow.in/321188

Suppose and are finite sets, each with cardinality . The number of bijective functions from to is

A. B. C. D.
isi2015-dcg functions

10.5.6 Functions: ISI2015-DCG-49 https://gateoverflow.in/321175

The domain of the function is

A. set of positive real numbers B. set of real numbers

C. set of negative real numbers D. set of real numbers larger than
isi2015-dcg functions

10.5.7 Functions: ISI2016-DCG-50 https://gateoverflow.in/321107

The domain of the function is

A. set of positive real numbers B. set of real numbers

C. set of negative real numbers D. set of real numbers larger than
isi2016-dcg functions

10.5.8 Functions: ISI2018-PCB-CS3 https://gateoverflow.in/311925

An variable Boolean function is called symmetric if its value depends only on the number of
in the input. Let denote the number of such functions.

a. Calculate the value of .

b. Derive an expression for in terms of .

© Copyright GATE Overflow. All rights reserved.

10 Discrete Mathematics: Set Theory & Algebra (46) 59

isi2018-pcb-cs engineering-mathematics discrete-mathematics set-theory&algebra functions descriptive

10.6 Graph Connectivity (1)

10.6.1 Graph Connectivity: CMI2011-B-02a https://gateoverflow.in/46203

Let be a connected graph. For a vertex of we denote by the graph formed by removing and all edges
incident on from . is said to be good if there are at least two distinct vertices in such that both and
are connected.

Show that for any subgraph of , is good if and only if is good.

cmi2011 descriptive graph-connectivity proof

10.7 Group Theory (5)

10.7.1 Group Theory: ISI2015-MMA-93 https://gateoverflow.in/321784

Let be a group with identity element . If and are elements in satisfying , then which of the
following conditions is true?
A. B.
C. D.
isi2015-mma group-theory

10.7.2 Group Theory: ISI2015-MMA-94 https://gateoverflow.in/321783

Let be the group with multiplication of complex numbers as composition. Let be the quotient group
. Then the number of nontrivial group homomorphisms from to is

A. B. C. D.
isi2015-mma group-theory non-gate

10.7.3 Group Theory: ISI2017-MMA-28 https://gateoverflow.in/214013

Let be a subgroup of group and let be a normal subgroup of . Choose the correct statement :

A. is a normal subgroup of both and

B. is a normal subgroup of but not necessarily of
C. is a normal subgroup of but not necessarily of
D. need not to be a normal subgroup of either or

isi2017-mma engineering-mathematics discrete-mathematics set-theory&algebra group-theory

10.7.4 Group Theory: ISI2018-MMA-15 https://gateoverflow.in/311842

Let be a finite group of even order. Then which of the following statements is correct?
A. The number of elements of order in B. The number of elements of order in
is even is odd
C. has no subgroup of order D. None of the above.
isi2018-mma engineering-mathematics discrete-mathematics set-theory&algebra group-theory

10.7.5 Group Theory: ISI2019-MMA-19 https://gateoverflow.in/311466

Let be an Abelian group of order . Then the order of the element is

A. B. C. D.
isi2019-mma engineering-mathematics discrete-mathematics set-theory&algebra group-theory

10.8 Inequality (1)

10.8.1 Inequality: ISI 2004 MIII https://gateoverflow.in/123963

The inequality is true for all the value of if and only if

© Copyright GATE Overflow. All rights reserved.

60 10 Discrete Mathematics: Set Theory & Algebra (46)

A. B.
C. D.
isi2004 inequality

10.9 Number Theory (2)

10.9.1 Number Theory: ISI2004-MIII-11 https://gateoverflow.in/123882

If are the positive numbers then

is always

A. B. C. D. None of the above

isi2004 set-theory&algebra number-theory

10.9.2 Number Theory: ISI2016 https://gateoverflow.in/45218

Find the number of positive integers n for which is a perfect square.

isi2016 set-theory&algebra number-theory numerical-answers

10.10 Polynomials (5)

10.10.1 Polynomials: ISI 2004 MIII https://gateoverflow.in/123769

If the equation (where are real number) has no real roots and if at least one of
the root is of modulus one, then

A. B. C. D. none of this
isi2004 polynomials

10.10.2 Polynomials: ISI 2004 MIII https://gateoverflow.in/123813

If be the roots of , then is equal to

A. B. C. D.
isi2004 polynomials

10.10.3 Polynomials: ISI 2004 MIII https://gateoverflow.in/123819

The equation where has four distinct real root if and only if

A. B.
C. D.
isi2004 polynomials

10.10.4 Polynomials: ISI2004-MIII https://gateoverflow.in/123818

The equation

has
A. exactly three solution in B. exactly one solution in
C. exactly two solution in D. no solution in
isi2004 polynomials

10.10.5 Polynomials: ISI2004-MIII-7 https://gateoverflow.in/123770

The equation has

A. exactly two distinct real roots B. exactly three distinct real roots
C. exactly four distinct real roots D. six different real roots
isi2004 polynomials maxima-minima

© Copyright GATE Overflow. All rights reserved.

10 Discrete Mathematics: Set Theory & Algebra (46) 61

10.11 Relations (2)

10.11.1 Relations: CMI2015-A-02 https://gateoverflow.in/216454

A binary relation is said to be Euclidean if for every and implies

. Which of the following statements is valid?

A. If is Euclidean, and , then , for every

B. If is reflexive and Euclidean, implies , for every
C. If is Euclidean, and , then , for every
D. None of the above.

cmi2015 relations set-theory&algebra

10.11.2 Relations: ISI2017-PCB-A-3 https://gateoverflow.in/244735

Let . A set called a symmetric set of if for all ,

Find the number of symmetric sets of .

isi2017-pcb-a relations descriptive

10.12 Sets (14)

10.12.1 Sets: ISI2013-PCB-A-3 https://gateoverflow.in/47497

Let . Find all subsets of such that for all in , their product is also in
.
descriptive isi2013 sets

10.12.2 Sets: ISI2014-DCG-5 https://gateoverflow.in/321950

Consider the sets defined by the real solutions of the inequalities

Then

A.
B.
C. Each of the sets and is non-empty
D. none of the above

isi2014-dcg sets

10.12.3 Sets: ISI2015-DCG-17 https://gateoverflow.in/321207

The set is represented by the shaded region in

A. B. D.
C.
isi2015-dcg sets

10.12.4 Sets: ISI2015-DCG-35 https://gateoverflow.in/321189

Let , and be three non empty sets. Consider the two relations given below:

© Copyright GATE Overflow. All rights reserved.

62 10 Discrete Mathematics: Set Theory & Algebra (46)

A. Both and are correct B. is correct but is not

C. is correct but is not D. Both and are incorrect
isi2015-dcg sets

10.12.5 Sets: ISI2015-DCG-37 https://gateoverflow.in/321187

Suppose is given by

Then is
A. A bijective (one-one and onto) B. A surjective (onto ) function
function
C. An injective (one-one) function D. We cannot conclude about the type
isi2015-dcg sets functions

10.12.6 Sets: ISI2015-MMA-23 https://gateoverflow.in/321854

Let be a nonempty set and let denote the collection of all subsets of . Define by

Then equals

A. B.
C. D.
isi2015-mma sets functions non-gate

10.12.7 Sets: ISI2015-MMA-31 https://gateoverflow.in/321846

Consider the sets defined by the real solutions of the inequalities

Then

A.
B.
C. Each of the sets and is non-empty
D. none of the above

isi2015-mma sets non-gate

10.12.8 Sets: ISI2016-DCG-27 https://gateoverflow.in/321130

If be the set of triangles in a plane and be the set of all positive real numbers, then the function
defined by area of triangle is

A. one-one and into B. one-one and onto C. many-one and onto D. many-one and into
isi2016-dcg sets functions

10.12.9 Sets: ISI2016-DCG-35 https://gateoverflow.in/321122

Let and be three non empty sets. Consider the two relations given below:

A. Both (1) and (2) are correct. B. (1) is correct but (2) is not.
C. (2) is correct but (1) is not. D. Both (1) and (2) are incorrect.
isi2016-dcg sets

© Copyright GATE Overflow. All rights reserved.

10 Discrete Mathematics: Set Theory & Algebra (46) 63

10.12.10 Sets: ISI2016-DCG-36 https://gateoverflow.in/321121

Suppose and are finite sets, each with cardinality .. The number of bijective functions from to is

A. B. C. D.
isi2016-dcg sets functions

10.12.11 Sets: ISI2016-DCG-37 https://gateoverflow.in/321120

Suppose is given by

Then is
A. A bijective (one-one and onto) B. A surjective (onto) function.
function.
C. An injective (one-one) function. D. We can not conclude about the type.
isi2016-dcg sets functions

10.12.12 Sets: ISI2017-DCG-12 https://gateoverflow.in/321075

Two sets have and elements. The number of subsets of the first set is more than that of the second set. Then the
values of and are

A. and B. and C. and D. and

isi2017-dcg sets

10.12.13 Sets: ISI2018-DCG-5 https://gateoverflow.in/321052

Let be the set of all prime numbers, be the set of all even prime numbers, and be the set of all odd prime
numbers. Consider the following three statements in this regard:

I. .
II. is a singleton set
III.

Then which one of the following holds?

A. None of the above statements is true.

B. Exactly one of the above statements is true.
C. Exactly two of the above statements are true.
D. All the above three statements are true.

isi2018-dcg sets

10.12.14 Sets: ISI2018-DCG-7 https://gateoverflow.in/321050

You are given three sets in such a way that

i. the set consists of elements,

ii. the set consists of elements, and
iii. the set consists of elements.

The minimum number of elements in the set is

A. B. C. D.
isi2018-dcg sets

10.13 Subgroups (1)

10.13.1 Subgroups: ISI2015-MMA-92 https://gateoverflow.in/321785

Consider the group

© Copyright GATE Overflow. All rights reserved.

64 10 Discrete Mathematics: Set Theory & Algebra (46)

with usual matrix multiplication. Let

Then,

A. is not a subgroup of
B. is a subgroup of but not normal subgroup
C. is a normal subgroup and the quotient group is of finite order
D. is a normal subgroup and the quotient group is isomorphic to (the group of positive reals with multiplication).

isi2015-mma group-theory subgroups normal non-gate

10.14 Subsets (2)

10.14.1 Subsets: ISI2015-MMA-5 https://gateoverflow.in/321872

A set contains elements. The number of subsets of the set which contain at most elements is

A. B. C. D.
isi2015-mma sets subsets

10.14.2 Subsets: ISI2016-MMA-13 https://gateoverflow.in/242717

Which one of the following statements is correct regarding the elements and subsets of the set ?

A. B.
C. D.
isi2016-mmamma sets subsets

© Copyright GATE Overflow. All rights reserved.

11 Engineering Mathematics: Calculus (126) 65

11 Engineering Mathematics: Calculus (126)

11.1 Area Under The Curve (2)

11.1.1 Area Under The Curve: ISI2014-DCG-28 https://gateoverflow.in/321927

The area enclosed by the curve is

A. B. C. D.
isi2014-dcg calculus area-under-the-curve

11.1.2 Area Under The Curve: ISI2017-MMA-1 https://gateoverflow.in/213886

The area lying in the first quadrant and bounded by the circle and the lines and is given by

A. B. C. D.
isi2017-mma engineering-mathematics calculus area-under-the-curve

11.2 Continuity (9)

11.2.1 Continuity: ISI2014-DCG-29 https://gateoverflow.in/321926

If then

A. is continuous at , but not differentiable at

B. is differentiable at , and
C. is differentiable at , and
D. None of the above

isi2014-dcg calculus continuity differentiation

11.2.2 Continuity: ISI2014-DCG-37 https://gateoverflow.in/321918

L et be a continuous function, as and as .

Which one of the following functions satisfies the above properties of ?

A. B. C. D.
isi2014-dcg calculus functions limits continuity

11.2.3 Continuity: ISI2015-DCG-57 https://gateoverflow.in/321166

Let , where is greatest integer less than or equal to . Then

A. is continuous and many-one B. is not differentiable and many-one

C. is not differentiable D. is differentiable and many-one
isi2015-dcg calculus continuity differentiation

11.2.4 Continuity: ISI2016-DCG-58 https://gateoverflow.in/321099

Let where is greatest integer less than or equal to . Then

A. is continuous and many-one. B. is not differentiable and many-one.

C. is not differentiable. D. is differentiable and many-one.
isi2016-dcg calculus continuity differentiation functions

11.2.5 Continuity: ISI2016-MMA-24 https://gateoverflow.in/242706

Let be a strictly increasing function. Then which one the following is always true?

A. The limits and exist for all real numbers

B. If is differentiable at then
C. There cannot be any real number such that for all real

© Copyright GATE Overflow. All rights reserved.

66 11 Engineering Mathematics: Calculus (126)

D. There cannot be any real number such that for all real

isi2016-mmamma calculus continuity differentiation limits

11.2.6 Continuity: ISI2016-MMA-27 https://gateoverflow.in/242703

Consider the function . Then

A. is not continuous at some points

B. is continuous everywhere, but not differentiable anywhere
C. is continuous everywhere, but not differentiable at exactly one point
D. is differentiable everywhere

isi2016-mmamma calculus continuity differentiation

11.2.7 Continuity: ISI2016-PCB-A-2 https://gateoverflow.in/244361

Let be a fixed positive integer. For any real number if for some integer

then we define .

Specify the points of discontinuity of the function with proper reasoning.

isi2016-pcb-a calculus continuity non-gate descriptive

11.2.8 Continuity: ISI2017-MMA-4 https://gateoverflow.in/243380

Let . Consider the statement

“There exists a continuous function such that for all ”
This statement is false if equals

A. B. C. D.
isi2017-mma engineering-mathematics calculus continuity

11.2.9 Continuity: ISI2018-MMA-28 https://gateoverflow.in/311881

Consider the following functions

and

Define and . Which of the following statements is correct?

A. and are continuous everywhere

B. is continuous everywhere and has discontinuity at
C. is continuous everywhere and has discontinuity at
D. has discontinuity at and has discontinuity at .

isi2018-mma engineering-mathematics calculus continuity

11.3 Convergence (1)

11.3.1 Convergence: ISI-2017-MMA-16 https://gateoverflow.in/213959

Let be a sequence of a real number such that the subsequence and converge to limit and
respectively. Then
A. always converge B. If then converge
C. may not converge but D. it is possible to have
isi2017 calculus engineering-mathematics non-gate convergence

11.4 Convex Concave (1)

© Copyright GATE Overflow. All rights reserved.

11 Engineering Mathematics: Calculus (126) 67

11.4.1 Convex Concave: ISI2014-DCG-21 https://gateoverflow.in/321934

Suppose that the function is defined as where is monotone increasing, is concave,

and and exist for all . Then is

A. always concave B. always convex

C. not necessarily concave D. None of these
isi2014-dcg calculus functions maxima-minima convex-concave

11.5 Curves (1)

11.5.1 Curves: ISI2016-DCG-48 https://gateoverflow.in/321109

The piecewise linear function for the following graph is

A.

B.

C.

D.

isi2016-dcg calculus functions curves non-gate

11.6 Definite Integrals (11)

11.6.1 Definite Integrals: ISI2014-DCG-12 https://gateoverflow.in/321943

The integral

equals

A. B. C. D. none of these
isi2014-dcg calculus definite-integrals integration

11.6.2 Definite Integrals: ISI2014-DCG-31 https://gateoverflow.in/321924

For real , the value of , where denotes the largest integer less than or equal to , is

A. B.
C.
D.
isi2014-dcg calculus integration definite-integrals

11.6.3 Definite Integrals: ISI2014-DCG-47 https://gateoverflow.in/321908

The value of the definite integral is

© Copyright GATE Overflow. All rights reserved.

68 11 Engineering Mathematics: Calculus (126)

A. B. C. D.
isi2014-dcg calculus integration definite-integrals

11.6.4 Definite Integrals: ISI2014-DCG-53 https://gateoverflow.in/321902

The value of the integral is

A. B. C. D.
isi2014-dcg calculus integration definite-integrals

11.6.5 Definite Integrals: ISI2015-DCG-51 https://gateoverflow.in/321173

The area bounded by , and is

A. B. C. D.
isi2015-dcg integration definite-integrals

11.6.6 Definite Integrals: ISI2015-MMA-69 https://gateoverflow.in/321808

Consider the function

Then

A. is not continuous at
B. is continuous and differentiable everywhere
C. is continuous everywhere but not differentiable at
D. is continuous everywhere but not differentiable at

isi2015-mma calculus continuity differentiation definite-integrals non-gate

11.6.7 Definite Integrals: ISI2015-MMA-76 https://gateoverflow.in/321801

Given that , the value of

is

A. B. C. D.
isi2015-mma calculus definite-integrals non-gate

11.6.8 Definite Integrals: ISI2015-MMA-78 https://gateoverflow.in/321799

The value of

is

A. B. C. D.
isi2015-mma calculus limits definite-integrals non-gate

11.6.9 Definite Integrals: ISI2015-MMA-80 https://gateoverflow.in/321797

Let . Then

© Copyright GATE Overflow. All rights reserved.

11 Engineering Mathematics: Calculus (126) 69

is equal to

A. B.
C. D.
isi2015-mma calculus definite-integrals summation non-gate

11.6.10 Definite Integrals: ISI2015-MMA-81 https://gateoverflow.in/321796

If is continuous in then

(where is the largest integer less than or equal to )

A. does not exist B. exists and is equal to

C. exists and is equal to D. exists and is equal to
isi2015-mma limits definite-integrals non-gate

11.6.11 Definite Integrals: ISI2016-MMA-23 https://gateoverflow.in/242707

Given that , what is the value of ?

A. B. C. D.
isi2016-mmamma calculus integration definite-integrals

11.7 Determinants (1)

11.7.1 Determinants: ISI2017-DCG-23 https://gateoverflow.in/321064

A determinant is chosen at random from the set of all determinants of order with elements or only. The
probability of choosing a non-zero determinant is

A. B. C. D. none of these
isi2017-dcg probability determinants

11.8 Differential Equation (6)

11.8.1 Differential Equation: ISI2016-DCG-67 https://gateoverflow.in/321090

The general solution of the differential equation is (assuming as an arbitrary constant of integration)

A. B. C. D.
isi2016-dcg calculus differential-equation non-gate

11.8.2 Differential Equation: ISI2016-DCG-68 https://gateoverflow.in/321089

The general solution of the differential equation is (assuming as an arbitrary constant of

integration)
A. B.
C. D.
isi2016-dcg calculus differential-equation non-gate

11.8.3 Differential Equation: ISI2016-DCG-69 https://gateoverflow.in/321088

Consider the differential equation Assuming for its solution is

A. B.

© Copyright GATE Overflow. All rights reserved.

70 11 Engineering Mathematics: Calculus (126)

C. D.
isi2016-dcg calculus differential-equation non-gate

11.8.4 Differential Equation: ISI2016-MMA-7 https://gateoverflow.in/242723

The set of value(s) of for which is a solution to the differential equation

is

A. B. C. D.
isi2016-mmamma differential-equation non-gate

11.8.5 Differential Equation: ISI2017-MMA-9 https://gateoverflow.in/243375

A function that satisfies with the boundary condition is

A. B.
C. D.
isi2017-mmamma calculus differential-equation non-gate

11.8.6 Differential Equation: ISI2019-MMA-6 https://gateoverflow.in/311425

The solution of the differential equation

is

A. , where is a constant
B. , where is a constant
C. , where is a constant
D. , where is a constant

isi2019-mma non-gate engineering-mathematics calculus differential-equation

11.9 Differentiation (11)

11.9.1 Differentiation: ISI2014-DCG-13 https://gateoverflow.in/321942

Let the function be defined as . Then which of the following statements is true?

A. is differentiable at B. is differentiable at
C. is differentiable at but not D. none of the above
at
isi2014-dcg calculus differentiation

11.9.2 Differentiation: ISI2015-MMA-72 https://gateoverflow.in/321805

The map is differentiable at if and only if

A. and B. and
C. D. can take any real value
isi2015-mma calculus differentiation

11.9.3 Differentiation: ISI2015-MMA-73 https://gateoverflow.in/321804

is a differentiable function on the real line such that and . Then

A. must be B. need not be , but

C. D.

© Copyright GATE Overflow. All rights reserved.

11 Engineering Mathematics: Calculus (126) 71

isi2015-mma calculus limits differentiation

11.9.4 Differentiation: ISI2015-MMA-74 https://gateoverflow.in/321803

Let and be two differentiable functions such that for all and for all .
Then
A. if , then for B. if , then for
all all
C. D.
isi2015-mma calculus differentiation

11.9.5 Differentiation: ISI2016-MMA-8 https://gateoverflow.in/242722

Let be differentiable with for all and . Then equals

A. B. C. D.
isi2016-mmamma calculus differentiation

11.9.6 Differentiation: ISI2017-DCG-30 https://gateoverflow.in/321057

If and then equals

A. B. C. D.
isi2017-dcg calculus differentiation functions

11.9.7 Differentiation: ISI2017-MMA-13 https://gateoverflow.in/209635

An even function has left derivative at . Then

A. the right derivative of at need not exist

B. the right derivative of at exists and is equal to
C. the right derivative of at exists and is equal to
D. none of the above is necessarily true

isi2017-mma engineering-mathematics calculus differentiation

11.9.8 Differentiation: ISI2017-PCB-A-4 https://gateoverflow.in/244734

Let denote the integer nearest to . For example, and =2. Draw the graph of the
function for . Find all the points , where the function is not differentiable.
Justify your answer.
isi2017-pcb-a differentiation

11.9.9 Differentiation: ISI2018-DCG-24 https://gateoverflow.in/321033

Let denote the largest integer less than or equal to The number of points in the open interval in which the
function is not differentiable, is

A. B. C. D.
isi2018-dcg calculus differentiation

11.9.10 Differentiation: ISI2018-DCG-29 https://gateoverflow.in/321028

Let where is twice differentiable function. Then

A. there exists such that

B. there exists such that
C. there exists such that
D. none of the above is true.

isi2018-dcg calculus differentiation

© Copyright GATE Overflow. All rights reserved.

72 11 Engineering Mathematics: Calculus (126)

11.9.11 Differentiation: ISI2018-DCG-9 https://gateoverflow.in/321048

Let Then is equal to

A. B. C. D.
isi2018-dcg calculus functions differentiation

11.10 Functions (17)

11.10.1 Functions: CMI2016-B-7ai https://gateoverflow.in/98777

Consider the funciton defined as follows:

Compute the following

cmi2016 calculus functions descriptive

11.10.2 Functions: CMI2016-B-7aii https://gateoverflow.in/98773

Consider the funciton defined as follows:

Compute the following

cmi2016 calculus functions descriptive

11.10.3 Functions: CMI2016-B-7aiii https://gateoverflow.in/98775

Consider the funciton defined as follows:

Compute the following

cmi2016 calculus functions descriptive

11.10.4 Functions: CMI2016-B-7b https://gateoverflow.in/98776

Consider the funciton defined as follows:

Give a constant time algorithm that computes on input . (A constant-time algorithm is one whose running time is
independent of the input )
cmi2016 calculus functions descriptive

11.10.5 Functions: ISI 2016 MMA 24 https://gateoverflow.in/215002

Let be a strictly increasing function. Then which one of the following is always true?

A. The limits and exist for all real number a

B. if is differentiable at a then
C. There cannot not be a real number such that for all real
D. There cannot not be a real number such that for all real

isi2016 functions

© Copyright GATE Overflow. All rights reserved.

11 Engineering Mathematics: Calculus (126) 73

11.10.6 Functions: ISI2004-MIII-22 https://gateoverflow.in/124264

If then the range of is

A. the interval B. the interval

C. the interval D. none of the above
isi2004 engineering-mathematics functions

11.10.7 Functions: ISI2004-MIII-23 https://gateoverflow.in/124324

If and then

A. and agree at no point B. and agree at exactly one point

C. and agree at exactly two point D. and agree at more then two point
isi2004 engineering-mathematics functions

11.10.8 Functions: ISI2014-DCG-24 https://gateoverflow.in/321931

Let . State which of the following statements is true.

A. For all real , there exists such that

B. For all real , there exists such that
C. For all real , there exists such that
D. None of the above is true

isi2014-dcg calculus functions

11.10.9 Functions: ISI2014-DCG-6 https://gateoverflow.in/321949

If is a real valued function such that , for every , then is

A. B. C. D.
isi2014-dcg calculus functions

11.10.10 Functions: ISI2015-DCG-50 https://gateoverflow.in/321174

The piecewise linear function for the following graph is

A.

B.

C.

D.

© Copyright GATE Overflow. All rights reserved.

74 11 Engineering Mathematics: Calculus (126)

isi2015-dcg calculus functions

11.10.11 Functions: ISI2015-MMA-30 https://gateoverflow.in/321847

Suppose that a function defined on satisfies the following conditions:

Then for all is equal to

A. B. C. D. none of the above

isi2015-mma calculus functions non-gate

11.10.12 Functions: ISI2015-MMA-33 https://gateoverflow.in/321844

If is a real valued function such that

for every , then is

A. B. C. D.
isi2015-mma calculus functions non-gate

11.10.13 Functions: ISI2015-MMA-36 https://gateoverflow.in/321841

For non-negative integers , define a function as follows

Then the value of is

A. B. C. D.
isi2015-mma calculus functions non-gate

11.10.14 Functions: ISI2016-MMA-20 https://gateoverflow.in/242710

Let be a strictly decreasing function. Consider . Which one of the

following is always true?

A. is strictly decreasing
B. is strictly increasing
C. is strictly decreasing at first and then strictly increasing
D. is strictly increasing at first and then strictly decreasing

isi2016-mmamma calculus functions non-gate

11.10.15 Functions: ISI2017-DCG-3 https://gateoverflow.in/321084

If , then is

A. B. C. D.
isi2017-dcg calculus functions

11.10.16 Functions: ISI2017-DCG-6 https://gateoverflow.in/321081

© Copyright GATE Overflow. All rights reserved.

11 Engineering Mathematics: Calculus (126) 75

Let for all . Then is

A. B. C. D.
isi2017-dcg calculus functions

11.10.17 Functions: ISI2019-MMA-30 https://gateoverflow.in/311478

Consider the function defined on with and

Then the value of is

A. B. C. D.
isi2019-mma engineering-mathematics discrete-mathematics set-theory&algebra functions

11.11 Inequality (1)

11.11.1 Inequality: ISI2016-MMA-21 https://gateoverflow.in/242709

Let . How many functions can be defined such that ?

A. B. C. D.

isi2016-mmamma functions inequality permutation-and-combination

11.12 Integration (9)

11.12.1 Integration: ISI2004-MIII-13 https://gateoverflow.in/123887

Let . Then

A. B. C. D. none of the above

isi2004 engineering-mathematics integration

11.12.2 Integration: ISI2015-DCG-46 https://gateoverflow.in/321178

Let and be a constant of integration. Then the value of is

A. B.
C. D. None of these
isi2015-dcg calculus integration

11.12.3 Integration: ISI2015-MMA-77 https://gateoverflow.in/321800

Let be the triangle in the – plane bounded by the -axis, the line , and the line . The value of the
double integral

is

A. B. C. D.
isi2015-mma integration non-gate

11.12.4 Integration: ISI2016-DCG-46 https://gateoverflow.in/321111

Let and be a constant of integration. Then the value of is

A. B.
C. D. None of these
isi2016-dcg calculus integration non-gate

© Copyright GATE Overflow. All rights reserved.

76 11 Engineering Mathematics: Calculus (126)

11.12.5 Integration: ISI2017-MMA-25 https://gateoverflow.in/214014

For and , the maximum possible value of the integral is

A. B. C. D. none of these
isi2017-mma engineering-mathematics calculus integration

11.12.6 Integration: ISI2018-MMA-29 https://gateoverflow.in/311879

Let be a continuous function with . Define

.
The value of is

A. B. C. D.
isi2018-mma engineering-mathematics calculus integration

11.12.7 Integration: ISI2019-MMA-25 https://gateoverflow.in/311473

Let be non-zero real numbers such that

Then the quadratic equation has

A. no roots in B. one root in and one root outside
this interval
C. one repeated root in D. two distinct real roots in
isi2019-mma engineering-mathematics calculus integration

11.12.8 Integration: ISI2019-MMA-28 https://gateoverflow.in/311476

Consider the functions given by

Then the area enclosed between the graphs of and is

A. B. C. D.
isi2019-mma calculus engineering-mathematics integration

11.12.9 Integration: ISI2019-MMA-29 https://gateoverflow.in/311477

Let be a continuous function with for all and . Let be a

twice differentiable function. Then the value of

is

A. B. C. D.
isi2019-mma engineering-mathematics calculus integration

11.13 Limits (40)

11.13.1 Limits: ISI-2016-05 https://gateoverflow.in/210193

Let

© Copyright GATE Overflow. All rights reserved.

11 Engineering Mathematics: Calculus (126) 77

Then

A. equals B. equals C. equals D. does not exist

isi2016 engineering-mathematics limits

11.13.2 Limits: ISI2014-DCG-17 https://gateoverflow.in/321938

is

A. B. C. D. non-existent
isi2014-dcg calculus limits

11.13.3 Limits: ISI2014-DCG-2 https://gateoverflow.in/321953

Let . Then

A. equals B. does not exist C. equals D. equals

isi2014-dcg calculus limits

11.13.4 Limits: ISI2014-DCG-3 https://gateoverflow.in/321952

equals

A. B. C. D.
isi2014-dcg calculus limits

11.13.5 Limits: ISI2014-DCG-33 https://gateoverflow.in/321922

Let be a continuous function from to satisfying the following properties.

a. ,
b. , and
c. for with .

Then the number of such functions is

A. B. C. D.
isi2014-dcg calculus functions limits

11.13.6 Limits: ISI2014-DCG-4 https://gateoverflow.in/321951

is equal to

A. B. C. D.
isi2014-dcg calculus limits

11.13.7 Limits: ISI2014-DCG-43 https://gateoverflow.in/321912

Let

© Copyright GATE Overflow. All rights reserved.

78 11 Engineering Mathematics: Calculus (126)

Then exists

A. if B. for all C. for all D. only if

isi2014-dcg calculus functions limits

11.13.8 Limits: ISI2014-DCG-50 https://gateoverflow.in/321905

is equal to

A. B. C. D.
isi2014-dcg calculus limits

11.13.9 Limits: ISI2015-DCG-45 https://gateoverflow.in/321179

The value of is

A. B. C. D. None of these
isi2015-dcg calculus limits

11.13.10 Limits: ISI2015-DCG-48 https://gateoverflow.in/321176

equals

A. B. C. D. None of these
isi2015-dcg calculus limits

11.13.11 Limits: ISI2015-DCG-52 https://gateoverflow.in/321172

equals

A. B. C. D.
isi2015-dcg calculus limits

11.13.12 Limits: ISI2015-DCG-54 https://gateoverflow.in/321169

equals

A. B. C. D. Does not exist

isi2015-dcg calculus limits

11.13.13 Limits: ISI2015-DCG-55 https://gateoverflow.in/321168

equals

A. B. C. D. Does not exist

isi2015-dcg calculus limits

© Copyright GATE Overflow. All rights reserved.

11 Engineering Mathematics: Calculus (126) 79

11.13.14 Limits: ISI2015-DCG-56 https://gateoverflow.in/321167

equals

A. B. C. D. Does not exist

isi2015-dcg calculus limits

11.13.15 Limits: ISI2015-DCG-58 https://gateoverflow.in/321165

equals

A. B. C. D. Does not exist

isi2015-dcg calculus limits

11.13.16 Limits: ISI2015-MMA-10 https://gateoverflow.in/321867

The value of the infinite product

A. B. C. D. none of the above

isi2015-mma calculus limits

11.13.17 Limits: ISI2015-MMA-19 https://gateoverflow.in/321858

The limit is

A. B. C. D.
isi2015-mma calculus limits non-gate

11.13.18 Limits: ISI2015-MMA-20 https://gateoverflow.in/321857

The limit equals

A. B. C. D.
isi2015-mma calculus limits non-gate

11.13.19 Limits: ISI2015-MMA-22 https://gateoverflow.in/321855

Let . Then

A. equals B. does not exist C. equals D. equals

isi2015-mma calculus limits non-gate

11.13.20 Limits: ISI2015-MMA-25 https://gateoverflow.in/321852

The limit equals

A. B. C. D.
isi2015-mma calculus limits non-gate

11.13.21 Limits: ISI2015-MMA-26 https://gateoverflow.in/321851

is equal to

© Copyright GATE Overflow. All rights reserved.

80 11 Engineering Mathematics: Calculus (126)

A. B. C. D.
isi2015-mma calculus limits non-gate

11.13.22 Limits: ISI2015-MMA-55 https://gateoverflow.in/321822

Let be a sequence of real numbers. Then exists if and only if

A. and exists
B. and exist
C. and exist
D. none of the above

isi2015-mma calculus limits

11.13.23 Limits: ISI2015-MMA-57 https://gateoverflow.in/321820

Suppose . Consider the sequence . Then

A. does not exist B.

C. D. none of the above
isi2015-mma calculus limits

11.13.24 Limits: ISI2015-MMA-58 https://gateoverflow.in/321819

Let , be a sequence of real numbers satisfying for all . Define ,

for . Then is equal to

A. B. C. D. none of these
isi2015-mma calculus limits non-gate

11.13.25 Limits: ISI2016-DCG-45 https://gateoverflow.in/321112

The value of is

A. B. C. D. None of these
isi2016-dcg limits

11.13.26 Limits: ISI2016-DCG-49 https://gateoverflow.in/321108

equals

A. B. C. D. None of these
isi2016-dcg calculus limits

11.13.27 Limits: ISI2016-DCG-53 https://gateoverflow.in/321104

equals

A. B. C. D.
isi2016-dcg calculus limits

11.13.28 Limits: ISI2016-DCG-54 https://gateoverflow.in/321103

equals

© Copyright GATE Overflow. All rights reserved.

11 Engineering Mathematics: Calculus (126) 81

A. B. C. D. Does not exist

isi2016-dcg calculus limits

11.13.29 Limits: ISI2016-DCG-55 https://gateoverflow.in/321102

equals

A. B. C. D. Does not exist

isi2016-dcg calculus limits

11.13.30 Limits: ISI2016-DCG-56 https://gateoverflow.in/321101

equals

A. B. C. D. Does not exist

isi2016-dcg calculus limits

11.13.31 Limits: ISI2016-DCG-57 https://gateoverflow.in/321100

equals

A. B. C. D. Does not exist

isi2016-dcg calculus limits

11.13.32 Limits: ISI2016-MMA-5 https://gateoverflow.in/242725

Let

Then

A. equals B. equals C. equals D. does not exist

isi2016-mmamma calculus limits non-gate

11.13.33 Limits: ISI2017-DCG-26 https://gateoverflow.in/321061

The value of is

A. B. C. D. none of these
isi2017-dcg calculus limits

11.13.34 Limits: ISI2017-DCG-27 https://gateoverflow.in/321060

The limit of the sequence is

A. B. C. D.
isi2017-dcg calculus limits

11.13.35 Limits: ISI2017-MMA-14 https://gateoverflow.in/209650

Let be a sequence defined by and for . Then is

A. B. C. D.

© Copyright GATE Overflow. All rights reserved.

82 11 Engineering Mathematics: Calculus (126)

isi2017-mma engineering-mathematics calculus limits

11.13.36 Limits: ISI2017-MMA-16 https://gateoverflow.in/243368

Let be a sequence of real numbers such that the subsequences and converge to limits and
respectively. Then
A. always converges B. if , then converges
C. may not converge, but D. it is possible to have
isi2017-mma engineering-mathematics calculus limits

11.13.37 Limits: ISI2018-DCG-28 https://gateoverflow.in/321029

Let . Let and . Then

A. B.
C. D.
isi2018-dcg calculus limits functions

11.13.38 Limits: ISI2018-MMA-19 https://gateoverflow.in/311851

Let be independent and identically distributed with and

for all Define

, ,

Which of the following is true as tends to infinity?

A.
B.
C.
D.

isi2018-mma engineering-mathematics calculus limits

11.13.39 Limits: ISI2019-MMA-24 https://gateoverflow.in/311472

Let be a continuous function such that exists for every , where

for . Define

Then which of the following is necessarily true?

A. B. C. D. None of the above

isi2019-mma engineering-mathematics calculus limits

11.13.40 Limits: ISI2019-MMA-5 https://gateoverflow.in/311386

If and , then the value of

is

A. B. C. D.
isi2019-mma calculus limits

11.14 Logarithms (1)

© Copyright GATE Overflow. All rights reserved.

11 Engineering Mathematics: Calculus (126) 83

11.14.1 Logarithms: ISI2014-DCG-45 https://gateoverflow.in/321910

Which of the following is true?

A.
B.
C.
D.

isi2014-dcg calculus functions logarithms

11.15 Maxima Minima (8)

11.15.1 Maxima Minima: ISI2004-MIII-12 https://gateoverflow.in/123886

The maximum possible value of subjected to condition and is

A. B. C. D.
isi2004 engineering-mathematics maxima-minima

11.15.2 Maxima Minima: ISI2014-DCG-19 https://gateoverflow.in/321936

It is given that where and are real. Then the maximum value of is

A. B. C. D.
isi2014-dcg calculus maxima-minima

11.15.3 Maxima Minima: ISI2014-DCG-39 https://gateoverflow.in/321916

The function has

A. a minimum at ; B. a maximum at ;
C. neither a maximum nor a minimum at D. None of the above
;
isi2014-dcg maxima-minima calculus

11.15.4 Maxima Minima: ISI2014-DCG-42 https://gateoverflow.in/321913

Let . Then

A. has no local minima

B. has no local maxima
C. has local minima at and for odd integers and local maxima at for even
integers
D. None of the above

isi2014-dcg calculus maxima-minima

11.15.5 Maxima Minima: ISI2014-DCG-44 https://gateoverflow.in/321911

The function which is defined for all real values of

A. has a maximum at B. has a maximum at

C. has a minimum at D. has neither a maximum nor a
minimum at
isi2014-dcg calculus maxima-minima

11.15.6 Maxima Minima: ISI2014-DCG-46 https://gateoverflow.in/321909

The maximum value of the real valued function is

A. B. C. D.

© Copyright GATE Overflow. All rights reserved.

84 11 Engineering Mathematics: Calculus (126)

isi2014-dcg calculus maxima-minima

11.15.7 Maxima Minima: ISI2014-DCG-51 https://gateoverflow.in/321904

The function defined as , where is real, is

A. strictly increasing
B. strictly decreasing
C. increasing in and decreasing in
D. decreasing in and increasing in

isi2014-dcg calculus maxima-minima

11.15.8 Maxima Minima: ISI2018-MMA-30 https://gateoverflow.in/311880

Consider the function

where is a positive integer. Which of the following statements is correct?

A. has no local maximum

B. For every , has a local maximum at
C. has no local extremum if is odd and has a local maximum at when is even
D. has no local extremum if is even and has a local maximum at when is odd.

isi2018-mma engineering-mathematics calculus maxima-minima

11.16 Polynomials (1)

11.16.1 Polynomials: ISI2018-DCG-10 https://gateoverflow.in/321047

Let and Then is equal to

A. B.
C. D. none of these
isi2018-dcg calculus differentiation polynomials

11.17 Quadratic Equations (1)

11.17.1 Quadratic Equations: ISI2014-DCG-48 https://gateoverflow.in/321907

If is real, the set of real values of for which the function

is always greater than zero is

A. B.
C. D. None of these
isi2014-dcg calculus functions quadratic-equations

11.18 Range (2)

11.18.1 Range: ISI2014-DCG-7 https://gateoverflow.in/321948

If , then the range of is

A. the interval B. the interval

C. the interval D. none of these
isi2014-dcg calculus functions range

11.18.2 Range: ISI2015-MMA-34 https://gateoverflow.in/321843

© Copyright GATE Overflow. All rights reserved.

11 Engineering Mathematics: Calculus (126) 85

If , then the range of is

A. the interval B. the interval

C. the interval D. none of the above
isi2015-mma calculus functions range trigonometry non-gate

11.19 Taylor Series (3)

11.19.1 Taylor Series: ISI2015-DCG-47 https://gateoverflow.in/321177

The Taylor series expansion of about is

A. B.
C. D.
isi2015-dcg calculus taylor-series non-gate

11.19.2 Taylor Series: ISI2015-MMA-59 https://gateoverflow.in/321818

In the Taylor expansion of the function about , the coefficient of is

A. B. C. D. none of the above

isi2015-mma calculus taylor-series non-gate

11.19.3 Taylor Series: ISI2016-DCG-47 https://gateoverflow.in/321110

The Taylor series expansion of about is

A. B.
C. D.
isi2016-dcg calculus taylor-series non-gate

© Copyright GATE Overflow. All rights reserved.

86 12 Engineering Mathematics: Linear Algebra (57)

12 Engineering Mathematics: Linear Algebra (57)

12.1 Definite Integrals (1)

12.1.1 Definite Integrals: ISI2017-DCG-25 https://gateoverflow.in/321062

If then is

A. B. C. D.
isi2017-dcg linear-algebra determinant definite-integrals non-gate

12.2 Determinant (13)

12.2.1 Determinant: ISI2014-DCG-25 https://gateoverflow.in/321930

The determinant equals

A.

B.

C.

D. None of these

isi2014-dcg linear-algebra determinant

12.2.2 Determinant: ISI2015-DCG-22 https://gateoverflow.in/321202

The value of

is

A. B. C. D. None of these
isi2015-dcg linear-algebra determinant

12.2.3 Determinant: ISI2015-DCG-3 https://gateoverflow.in/321221

The value of is

A. B.
C. D. None of these
isi2015-dcg linear-algebra determinant

© Copyright GATE Overflow. All rights reserved.

12 Engineering Mathematics: Linear Algebra (57) 87

12.2.4 Determinant: ISI2015-DCG-31 https://gateoverflow.in/321193

Let be an matrix such that . Here stands for determinant of matrix . Then

A. B.
C. D.
isi2015-dcg linear-algebra matrices determinant

12.2.5 Determinant: ISI2015-DCG-34 https://gateoverflow.in/321190

Let denote the minors of an matrix . What is the relationship between and ?

A. They are always equal

B.
C. They are equal if is a symmetric matrix
D. If then

isi2015-dcg linear-algebra matrices determinant

12.2.6 Determinant: ISI2015-MMA-37 https://gateoverflow.in/321840

Let be a non-zero real number. Define

for . Then, the number of distinct real roots of is

A. B. C. D.
isi2015-mma linear-algebra determinant functions

12.2.7 Determinant: ISI2016-DCG-22 https://gateoverflow.in/321135

The value of is

A. B. C. D. None of these
isi2016-dcg linear-algebra determinant

12.2.8 Determinant: ISI2016-DCG-3 https://gateoverflow.in/321154

The value of is

A. B.
C. D. None of these
isi2016-dcg linear-algebra determinant

12.2.9 Determinant: ISI2016-DCG-31 https://gateoverflow.in/321126

Let be an matrix such that stands for determinant of matrix Then

A. B.
C. D.
isi2016-dcg linear-algebra matrices determinant

© Copyright GATE Overflow. All rights reserved.

88 12 Engineering Mathematics: Linear Algebra (57)

12.2.10 Determinant: ISI2017-DCG-7 https://gateoverflow.in/321080

If , then the value of is

A. B. C. D.
isi2017-dcg linear-algebra determinant

12.2.11 Determinant: ISI2017-MMA-19 https://gateoverflow.in/209723

If and are the roots of , then the value of the determinant

is

A. B. C. D.
isi2017-mma engineering-mathematics linear-algebra determinant

12.2.12 Determinant: ISI2018-MMA-13 https://gateoverflow.in/311840

If , the trace of is

A. B. C. D.
isi2018-mma engineering-mathematics linear-algebra determinant

12.2.13 Determinant: ISI2018-MMA-14 https://gateoverflow.in/311841

Let be a real matrix with all diagonal entries equal to . If is an eigenvalue of , the determinant of
equals

A. B. C. D.
isi2018-mma engineering-mathematics linear-algebra eigen-value determinant

12.3 Eigen Value (4)

12.3.1 Eigen Value: ISI2015-MMA-39 https://gateoverflow.in/321838

The eigenvalues of the matrix are

A. B. C. D.
isi2015-mma linear-algebra matrices eigen-value

12.3.2 Eigen Value: ISI2015-MMA-42 https://gateoverflow.in/321835

Let denote the eigenvalues of the matrix

If , then the set of possible values of , is

A. Empty set B.
C. D.

© Copyright GATE Overflow. All rights reserved.

12 Engineering Mathematics: Linear Algebra (57) 89

isi2015-mma linear-algebra matrices eigen-value

12.3.3 Eigen Value: ISI2015-MMA-62 https://gateoverflow.in/321815

If the matrix has as an eigenvalue, then is

A. B. C. D.
isi2015-mma linear-algebra matrices eigen-value

12.3.4 Eigen Value: ISI2016-MMA-19 https://gateoverflow.in/242711

Let be a real matrix. If is an eigenvalue of , then

A. equals 4 B. equals 8
C. equals 16 D. cannot be determined from the given
information
isi2016-mmamma linear-algebra matrices eigen-value

12.4 Eigen Vectors (1)

12.4.1 Eigen Vectors: ISI2015-DCG-32 https://gateoverflow.in/321192

The set of vectors constituting an orthogonal basis in is

A.

B.

C.

D. None of these

isi2015-dcg linear-algebra matrices eigen-vectors

12.5 Inverse (2)

12.5.1 Inverse: ISI2014-DCG-70 https://gateoverflow.in/321885

For the matrices and , is equal to

A. B.

C. D.

isi2014-dcg linear-algebra matrices inverse

12.5.2 Inverse: ISI2018-DCG-16 https://gateoverflow.in/321041

Let . Then does not exist if is equal to

A. B. C. D.
isi2018-dcg linear-algebra matrices inverse

12.6 Matrices (15)

© Copyright GATE Overflow. All rights reserved.

90 12 Engineering Mathematics: Linear Algebra (57)

12.6.1 Matrices: ISI2011-PCB-A-2b https://gateoverflow.in/48033

An matrix is said to be tridiagonal if its entries are zero except when for . Note that
only entries of a tridiagonal matrix are non-zero. Thus, an array of size is sufficient to store a
tridiagonal matrix. Given , write pseudo-code to

i. store in , and
ii. get the value of stored earlier in .

descriptive isi2011 linear-algebra matrices

12.6.2 Matrices: ISI2014-DCG-38 https://gateoverflow.in/321917

Suppose that is a real matrix such that for each where stands for the
transpose of . Then which one of the following is true?

A. B. C. D. None of these
isi2014-dcg linear-algebra matrices

12.6.3 Matrices: ISI2014-DCG-8 https://gateoverflow.in/321947

If is a matrix such that and then

is equal to
A. B.
C. D.
isi2014-dcg linear-algebra matrices

12.6.4 Matrices: ISI2015-DCG-5 https://gateoverflow.in/321219

If

then the value of is

A. B. C. D. None of these
isi2015-dcg linear-algebra matrices

12.6.5 Matrices: ISI2015-MMA-38 https://gateoverflow.in/321839

A real matrix such that

A. exists for all B. does not exist for any

C. exists for some D. none of the above is true
isi2015-mma linear-algebra matrices

12.6.6 Matrices: ISI2015-MMA-61 https://gateoverflow.in/321816

Let

Then
A. there exists a matrix such that B. there is no matrix such that

© Copyright GATE Overflow. All rights reserved.

12 Engineering Mathematics: Linear Algebra (57) 91

C. there exists a matrix such that D. there is no matrix such that

, but
isi2015-mma linear-algebra matrices

12.6.7 Matrices: ISI2015-MMA-63 https://gateoverflow.in/321814

Let . Now consider the matrix . Then the matrix is

A.

B.

C.

D.

isi2015-mma linear-algebra matrices

12.6.8 Matrices: ISI2016 https://gateoverflow.in/45220

Let be a matrix such that:

and . Then which of the following is true?

A. B. C. D. None of the above

isi2016 matrices

12.6.9 Matrices: ISI2016-DCG-4 https://gateoverflow.in/321153

If then the value of is

A. B. C. D. None of these
isi2016-dcg linear-algebra matrices

12.6.10 Matrices: ISI2017-DCG-4 https://gateoverflow.in/321083

If is a matrix satisfying (where is the zero matrix and is the identity matrix) then
the value of is

A. B. C. D. none of these
isi2017-dcg linear-algebra matrices

12.6.11 Matrices: ISI2017-MMA-15 https://gateoverflow.in/209657

The diagonal elements of a square matrix are odd integers while the off-diagonals are even integers. Then
A. must be singular B. must be nonsingular
C. There is not enough information to D. must have a positive eigenvalue.
decide the singularity of
isi2017-mma engineering-mathematics linear-algebra matrices

12.6.12 Matrices: ISI2017-MMA-20 https://gateoverflow.in/243364

The number of ordered pairs , where and are real, matrices such that is

© Copyright GATE Overflow. All rights reserved.

92 12 Engineering Mathematics: Linear Algebra (57)

A. B. C. D. infinite
isi2017-mma engineering-mathematics linear-algebra matrices

12.6.13 Matrices: ISI2018-PCB-A1 https://gateoverflow.in/311914

Consider a matrix , where is the identity matrix and is an column vector such
that .Show that .
isi2018-pcb-a engineering-mathematics linear-algebra matrices descriptive

12.6.14 Matrices: ISI2019-MMA-15 https://gateoverflow.in/311434

The rank of the matrix equals

A. for any real number B. for any real number

C. or depending on the value of D. or depending on the value of
isi2019-mma linear-algebra engineering-mathematics matrices

12.6.15 Matrices: ISI2019-MMA-23 https://gateoverflow.in/311471

Let be matrix with real entries. Now consider the function = . If the image of every circle under
is a circle of the same radius, then
A. A must be an orthogonal matrix B. A must be a symmetric matrix
C. A must be a skew-symmetric matrix D. None of the above must necessarily
hold
isi2019-mma engineering-mathematics linear-algebra matrices

12.7 Minors (1)

12.7.1 Minors: ISI2016-DCG-34 https://gateoverflow.in/321123

Let denote the minors of an matrix What is the relationship between and ?

A. They are always equal. B. if

C. They are equal if is a symmetric D. If then
matrix.
isi2016-dcg linear-algebra matrices minors

12.8 Orthogonal Matrix (3)

12.8.1 Orthogonal Matrix: ISI2015-DCG-33 https://gateoverflow.in/321191

Suppose and are orthogonal matrices. Which of the following is also an orthogonal matrix? Assume that
is the null matrix of order and is the identity matrix of order .
A.
B.
D.
C.

isi2015-dcg linear-algebra matrices orthogonal-matrix

12.8.2 Orthogonal Matrix: ISI2016-DCG-32 https://gateoverflow.in/321125

The set of vectors constituting an orthogonal basis in is

A.

B.

© Copyright GATE Overflow. All rights reserved.

12 Engineering Mathematics: Linear Algebra (57) 93

C.

D. None of these

isi2016-dcg linear-algebra matrices orthogonal-matrix eigen-vectors

12.8.3 Orthogonal Matrix: ISI2016-DCG-33 https://gateoverflow.in/321124

Suppose and are orthogonal matrices. Which of the following is also an orthogonal matrix? Assume that
is the null matrix of order and is the identity matrix of order
A.
B.
D.
C.

isi2016-dcg linear-algebra matrices orthogonal-matrix

12.9 Rank Of Matrix (5)

12.9.1 Rank Of Matrix: ISI2015-MMA-40 https://gateoverflow.in/321837

Let and be fixed real numbers, not all of them equal to zero. Define a matrix by

Then rank equals

A. or B. C. D. or
isi2015-mma linear-algebra matrices rank-of-matrix

12.9.2 Rank Of Matrix: ISI2016-MMA-28 https://gateoverflow.in/242702

Let be a square matrix such that , but . Then which of the following statements is not necessarily
true?

A. B. Eigenvalues of are all zero

C. rank( ) > rank( ) D. rank( ) > trace( )
isi2016-mmamma linear-algebra matrices eigen-value rank-of-matrix

12.9.3 Rank Of Matrix: ISI2017-MMA-29 https://gateoverflow.in/209917

Suppose the rank of the matrix

is for some real numbers and . Then equals

A. B. C. D.
isi2017-mma engineering-mathematics linear-algebra rank-of-matrix

12.9.4 Rank Of Matrix: ISI2017-MMA-5 https://gateoverflow.in/209513

If is a matrix such that trace then what is the trace of ?

A. B. C. D.

© Copyright GATE Overflow. All rights reserved.

94 12 Engineering Mathematics: Linear Algebra (57)

isi2017-mma engineering-mathematics linear-algebra rank-of-matrix

12.9.5 Rank Of Matrix: ISI2018-MMA-12 https://gateoverflow.in/311839

The rank of the matrix

A. B. C. D.
isi2018-mma engineering-mathematics linear-algebra rank-of-matrix

12.10 Summation (1)

12.10.1 Summation: ISI2016-MMA-18 https://gateoverflow.in/242712

Let , and . Then

A. B. C. D.
isi2016-mmamma linear-algebra matrices summation

12.11 System Of Equations (10)

12.11.1 System Of Equations: ISI-2016-04 https://gateoverflow.in/210190

If and satisfy the equations

Then equals

A. B. C. D.
isi2016 engineering-mathematics system-of-equations

12.11.2 System Of Equations: ISI2014-DCG-64 https://gateoverflow.in/321891

The value of such that the system of equation

has no solution is

A. B. C. D.
isi2014-dcg linear-algebra matrices system-of-equations

12.11.3 System Of Equations: ISI2014-DCG-9 https://gateoverflow.in/321946

The values of for which the following system of equations

has a solution are

© Copyright GATE Overflow. All rights reserved.

12 Engineering Mathematics: Linear Algebra (57) 95

A. B. C. D.
isi2014-dcg linear-algebra system-of-equations

12.11.4 System Of Equations: ISI2015-DCG-11 https://gateoverflow.in/321213

Let two systems of linear equations be defined as follows:

and . Then,

A. and are inconsistent B. and are consistent

C. is consistent but is inconsistent D. None of the above
isi2015-dcg linear-algebra system-of-equations

12.11.5 System Of Equations: ISI2015-MMA-43 https://gateoverflow.in/321834

The values of for which the following system of equations

has a solution are

A. B. C. D.
isi2015-mma linear-algebra system-of-equations

12.11.6 System Of Equations: ISI2015-MMA-44 https://gateoverflow.in/321833

Let , and denote, respectively, the planes defined by

It is given that , and intersect exactly at one point when . If now then
the planes
A. do not have any common point of B. intersect at a unique point
intersection
C. intersect along a straight line D. intersect along a plane
isi2015-mma linear-algebra system-of-equations

12.11.7 System Of Equations: ISI2016-DCG-11 https://gateoverflow.in/321146

Let two systems of linear equations be defined as follows:

and . Then,

A. and are inconsistent B. and are consistent

C. is consistent but is inconsistent D. None of the above
isi2016-dcg linear-algebra system-of-equations

12.11.8 System Of Equations: ISI2016-MMA-4 https://gateoverflow.in/242726

The and satisfy the equations

© Copyright GATE Overflow. All rights reserved.

96 12 Engineering Mathematics: Linear Algebra (57)

Then equals

A. B. C. D.
isi2016-mmamma linear-algebra matrices system-of-equations

12.11.9 System Of Equations: ISI2017-MMA-18 https://gateoverflow.in/214170

Consider following system of equations:

The locus of all such that this system has at least two distinct solution for ( ) is

A. a parabola B. a straight line C. entire D. a point

isi2017-mma engineering-mathematics linear-algebra system-of-equations

12.11.10 System Of Equations: ISI2019-MMA-14 https://gateoverflow.in/311433

If the system of equations

with has a non trivial solutions, the value of

is

A. B. C. D.
isi2019-mma linear-algebra system-of-equations

12.12 Vector Space (1)

12.12.1 Vector Space: ISI2019-MMA-13 https://gateoverflow.in/311432

Let be the vector space of all matrices such that the sum of the elements in any row or any column is the same.
Then the dimension of is

A. B. C. D.
isi2019-mma engineering-mathematics linear-algebra vector-space non-gate

© Copyright GATE Overflow. All rights reserved.

13 Engineering Mathematics: Probability (35) 97

13 Engineering Mathematics: Probability (35)

13.1 Balls In Bins (2)

13.1.1 Balls In Bins: CMI2018-A-7 https://gateoverflow.in/320486

Let be the number of strings consisting of and such that no initial segment of has more than
Now consider the following problem. A person stands on the edge of a swimming pool holding a bag of red and
blue balls. He draws a ball out one at a time and discards it. If he draws a blue ball, he takes one step back, if he draws a red
ball, he moves one step forward. What is the probability that the person remains dry?

A. B.

C. D.

cmi2018 conditional-probability balls-in-bins

13.1.2 Balls In Bins: ISI2017-DCG-28 https://gateoverflow.in/321059

A basket contains some white and blue marbles. Two marbles are drawn randomly from the basket without
replacement. The probability of selecting first a white and then a blue marble is . The probability of selecting a
white marble in the first draw is . What is the probability of selecting a blue marble in the second draw, given that the first
marble drawn was white?

A. B. C. D.
isi2017-dcg probability balls-in-bins

13.2 Conditional Probability (4)

13.2.1 Conditional Probability: CMI2013-A-02 https://gateoverflow.in/46592

of all email you receive is spam. Your spam filter is reliable: that is, of the mails it marks as spam are
indeed spam and of spam mails are correctly labeled as spam. If you see a mail marked spam by your filter, what
is the probability that it really is spam?

A. B. C. D.
cmi2013 probability conditional-probability

13.2.2 Conditional Probability: CMI2016-A-7 https://gateoverflow.in/98376

Varsha lives alone and dislikes cooking, so she goes out for dinner every evening. She has two favourite restaurants,
and , to which she travels by local train. The train to runs every
minutes, at and minutes past the hour. The train to runs every minutes, at
and minutes past the hour. She reaches the station at a random time between pm and pm and chooses
between the two restaurants based on the next available train/ What is the probability that she ends up eating in
?

A. B. C. D.
cmi2016 conditional-probability random-variable

13.2.3 Conditional Probability: CMI2018-A-6 https://gateoverflow.in/320487

You are given two coins and that look identical. The probability that coin turns up heads is , while the
probability that coin turns up heads is You choose one of the coins at random and toss it twice. If both the
outcomes are heads, what is the probability that you chose coin

A. B. C. D.
cmi2018 conditional-probability

13.2.4 Conditional Probability: CMI2018-A-8 https://gateoverflow.in/320485

There are switches on a switchboard, some of which are on and some of which are off. In one move, you pick any
switches and toggle each of them-if the switch you pick is currently off, you turn it on, if it is on, you turn it off. Your

© Copyright GATE Overflow. All rights reserved.

98 13 Engineering Mathematics: Probability (35)

aim is to execute a sequence of moves and turn all switches on. For which of the following initial configurations is this not
possible? Each configuration lists the initial positions of the switches in sequence, from switch to switch
A. (off,on,off,on,off,off,on) B. (off,on,on,on,on,on,off)
C. (on,off,on,on,on,on,on) D. (off,off,off,off,off,on,off)
cmi2018 conditional-probability

13.3 Independent Events (3)

13.3.1 Independent Events: ISI2015-MMA-52 https://gateoverflow.in/321825

Two coins are tossed independently where (head occurs when coin is tossed) . Given that at least one
head has occurred, the probability that coins produced different outcomes is

A. B.
C. D. none of the above
isi2015-mma probability independent-events

13.3.2 Independent Events: ISI2016-MMA-10 https://gateoverflow.in/242720

If are independent events with probabilities respectively, then equals

A. B.
C. D.
isi2016-mmamma probability independent-events

13.3.3 Independent Events: ISI2017-DCG-22 https://gateoverflow.in/321065

Let be independent events such that for . The probability that

none of occurs is

A. B. C. D. none of these
isi2017-dcg probability independent-events

13.4 Number System (1)

13.4.1 Number System: ISI2018-DCG-2 https://gateoverflow.in/321055

If is an integer from to , what is the probability that is divisible by ?

A. B. C. D. none of these
isi2018-dcg probability number-system

13.5 Poisson Distribution (3)

13.5.1 Poisson Distribution: ISI2015-MMA-53 https://gateoverflow.in/321824

The number of cars arriving at a service station per day follows a Poisson distribution with mean . The service
station can provide service to a maximum of cars per day. Then the expected number of cars that do not get service
per day equals
A. B.
C. D.
isi2015-mma poisson-distribution expectation

13.5.2 Poisson Distribution: ISI2015-MMA-7 https://gateoverflow.in/129269

Suppose is distributed as Poisson with mean Then is

A. B.
C. D.
isi2015 engineering-mathematics poisson-distribution

© Copyright GATE Overflow. All rights reserved.

13 Engineering Mathematics: Probability (35) 99

13.5.3 Poisson Distribution: ISI2016-MMA-9 https://gateoverflow.in/242721

Suppose and are two independent random variables both following Poisson distribution with parameter . What is
the value of ?

A. B. C. D.
isi2016-mmamma probability random-variable poisson-distribution expectation

13.6 Probability (19)

13.6.1 Probability: CMI2010-A-05 https://gateoverflow.in/46136

You have two normal, fair, dice, with faces labelled . If you throw both dice, which of the following is true
about the total value shown by the dice?

A. The probability that the total is is less than the probability that the total is .
B. The probability that the total is is equal to the probability that the total is .
C. The probability that the total is is greater than the probability that the total is .
D. None of the above.

cmi2010 probability

13.6.2 Probability: CMI2011-A-02 https://gateoverflow.in/46147

You have two six-sided cubic dice but they are numbered in a strange manner. On the first die, two opposite faces are
numbered , two opposite faces are numbered and the last pair of opposite faces are numbered . On the second die,
the three pairs of opposing faces are numbered , and . Both dice are fair: each side has an equal probability of coming face
up when tossed. Which of the following statements is not true of this pair of unusual dice?

A. The probability that the sum of the values shown by the dice is is the same as probability that the sum is .
B. The probability that the sum is odd is higher than the probability that the sum is even.
C. The probability that the sum is strictly less than is the same as the probability that the sum is strictly greater than .
D. The probability that the sum is a multiple of is the same as the probability that the sum is a prime number.

cmi2011 probability

13.6.3 Probability: CMI2011-A-03 https://gateoverflow.in/46148

You have a bag with black balls and white balls. Without looking, you pick up two balls from the bag and
apply the following rule. If both balls are of the same colour, you throw them both away. Otherwise, you throw away
the black ball and return the white ball to the bag. You keep repeating this process. If at some stage there is exactly one ball left
in the bag, which of the following is true?

A. The ball in the bag is definitely white.

B. The ball in the bag is definitely black.
C. Both colours are possible, but the probability of it being white is greater.
D. Both colours are possible, but the probability of it being black is greater.

cmi2011 probability

13.6.4 Probability: CMI2012-A-07 https://gateoverflow.in/46536

A man has three cats. At least one is male. What is the probability that all three are male?

A. B. C. D.
cmi2012 probability

13.6.5 Probability: CMI2014-A-02 https://gateoverflow.in/46965

The houses on one side of a street are numbered with even numbers starting at and going up to . A free
newspaper is delivered on Monday to different houses chosen at random from these . Find the probability that at
least of these newspapers are delivered to houses with numbers strictly greater than .

A. B. C. D.

© Copyright GATE Overflow. All rights reserved.

100 13 Engineering Mathematics: Probability (35)

cmi2014 probability

13.6.6 Probability: CMI2015-A-07 https://gateoverflow.in/47043

You arrive at a snack bar and you can’t decide whether to order a lime juice or a lassi. You decide to throw a fair -
sided die to make the choice, as follows.

If you throw or you order a lime juice.

If you throw a , you order a lassi.
Otherwise, you throw the die again and follow the same algorithm.

What is the probability that you end up ordering a lime juice?

A. B. C. D.
cmi2015 probability

13.6.7 Probability: CMI2017-A-02 https://gateoverflow.in/203259

An FM radio channel has a repository of songs. Each day, the channel plays distinct songs that are chosen
randomly from the repository.

Mary decides to tune in to the radio channel on the weekend after her exams. What is the probability that no song gets repeated
during these days?

A. B.

C. D.

cmi2017 engineering-mathematics probability

13.6.8 Probability: CMI2019-A-6 https://gateoverflow.in/320548

Suppose you alternate between throwing a normal six-sided fair die and tossing a fair coin. You start by throwing the
die. What is the probability that you will see a on the die before you see tails on the coin?

A. B. C. D.
cmi2019 probability

13.6.9 Probability: ISI2016-MMA-11 https://gateoverflow.in/242719

Ravi asked his neighbor to water a delicate plant while he is away. Without water, the plant would die with probability
4/5 and with water it would die with probability 3/20. The probability that Ravi's neighbor would remember to water
the plant is 9/10. If the plant actually died, what is the probability that Ravi's neighbor forgot to water the plant?

A. 4/5 B. 27/43 C. 16/43 D. 2/25

isi2016-mmamma probability

13.6.10 Probability: ISI2017-MMA-21 https://gateoverflow.in/209735

There are four machines and it is known that exactly two of them are faulty. They are tested one by one in a random
order till both the faulty machines are identified. The probability that only two tests are required is

A. B. C. D.

isi2017-mma engineering-mathematics probability

13.6.11 Probability: ISI2017-MMA-27 https://gateoverflow.in/214012

A box contains fair and biased coins. Each biased coin has a probability of head . A coin is drawn at random from
the box and tossed. Then the second coin is drawn at random from the box ( without replacing the first one). Given that
the first coin has shown head, the conditional probability that the second coin is fair is

A. B. C. D.

© Copyright GATE Overflow. All rights reserved.

13 Engineering Mathematics: Probability (35) 101

isi2017-mma engineering-mathematics probability

13.6.12 Probability: ISI2017-MMA-8 https://gateoverflow.in/243376

Let , and and be chosen independently from the set , each value being equally likely. What is
the probability that the arithmetic mean of and is the same as their geometric mean?

A. B. C. D.
isi2017-mma engineering-mathematics probability

13.6.13 Probability: ISI2018-DCG-6 https://gateoverflow.in/321051

A die is thrown thrice. If the first throw is a then the probability of getting as the sum of three throws is

A. B. C. D. none of these
isi2018-dcg probability

13.6.14 Probability: ISI2018-MMA-16 https://gateoverflow.in/311843

Consider a large village, where only two newspapers and are available to the families. It is known that the
proportion of families

i. not taking is ,
ii. not taking is ,
iii. taking only is .

The probability that a randomly chosen family from the village takes only is

A. B. C. D. can not be determined

isi2018-mma engineering-mathematics probability

13.6.15 Probability: ISI2018-MMA-17 https://gateoverflow.in/311844

There are eight coins, seven of which have the same weight and the other one weighs more. In order to find the coin
having more weight, a person randomly chooses two coins and puts one coin on each side of a common balance. If
these two coins are found to have the same weight, the person then randomly chooses two more coins from the rest and follows
the same method as before. The probability that the coin will be identified at the second draw is

A. B. C. D.
isi2018-mma engineering-mathematics probability

13.6.16 Probability: ISI2018-MMA-18 https://gateoverflow.in/311848

Let and be the four vertices of a square. A particle starts from the
point at time and moves either to or to with equal probability. Similarly, in each of the subsequent steps, it
randomly chooses one of its adjacent vertices and moves there. Let be the minimum number of steps required to cover all
four vertices. The probability is

A. B. C. D.
isi2018-mma engineering-mathematics probability

13.6.17 Probability: ISI2018-MMA-20 https://gateoverflow.in/311855

Consider the set of all functions from to ,where . If a function is chosen from this
set at random, the probability that it will be strictly increasing is

A. B.
C. D.
isi2018-mma engineering-mathematics probability

13.6.18 Probability: ISI2019-MMA-10 https://gateoverflow.in/311429

The chance of a student getting admitted to colleges and are and , respectively. Assume that the

© Copyright GATE Overflow. All rights reserved.

102 13 Engineering Mathematics: Probability (35)

colleges admit students independently. If the student is told that he has been admitted to at least one of these colleges, what is
the probability that he has got admitted to college ?

A. B. C. D.
isi2019-mma engineering-mathematics discrete-mathematics probability

13.6.19 Probability: ISI2019-MMA-22 https://gateoverflow.in/311470

A coin with probability of getting head, is tossed until a head appears for the first time. If the probability
that the number of tosses required is even is , then the value of is

A. B. C. D.
isi2019-mma probability

13.7 Random Variable (2)

13.7.1 Random Variable: ISI-2014-11 https://gateoverflow.in/207682

Let be i.i.d. random variables each assuming the value and with probability each. Then, the

probability that the matrix is nonsingular equals

A. B. C. D.
isi2014 probability random-variable

13.7.2 Random Variable: ISI2015-MMA-51 https://gateoverflow.in/321826

A permutation of is chosen at random. Then the probability that the numbers and appear as neighbour
equals

A. B. C. D.
isi2015-mma probability random-variable permutation-and-combination

13.8 Uniform Distribution (1)

13.8.1 Uniform Distribution: ISI2017-MMA-17 https://gateoverflow.in/209670

Suppose that is chosen uniformly from and given , is chosen uniformly from
Then

A. B.

C. D.

isi2017-mma engineering-mathematics probability uniform-distribution

© Copyright GATE Overflow. All rights reserved.

14 General Aptitude: Numerical Ability (183) 103

14 General Aptitude: Numerical Ability (183)

14.0.1 CMI2013-A-01 https://gateoverflow.in/46591

Ball Mart has different items in stock across all its stores worldwide. The company has collected billing data for
customer transactions. Each individual bill has at most distinct items in it. Ball Mart’s CEO wants to optimize
the company’s inventory and has asked for a list of those items that appear in at least of the billed transactions. Which of
the following is the most precise upper bound one can compute for the number of such items, given the data?

A. B. C. D.
cmi2013 numerical-ability

14.0.2 CMI2014-A-08 https://gateoverflow.in/46975

What are the possible values of , where is an arbitrary integer?

A. Either or B. Either or
C. Either or D. None of these
cmi2014 numerical-ability

14.0.3 CMI2015-B-03a https://gateoverflow.in/47058

A cook has a kitchen at the top of a hill, where she can prepare rotis. Each roti costs one rupee to prepare. She can sell
rotis for two rupees a piece at a stall down the hill. Once she goes down the steep hill, she can not climb back in time
make more rotis.

Suppose the cook starts at the top with rupees. What are all the possible amounts of money she can have at the end?
cmi2015 numerical-ability descriptive

14.0.4 CMI2015-B-03b https://gateoverflow.in/47060

A cook has a kitchen at the top of a hill, where she can prepare rotis. Each roti costs one rupee to prepare. She can sell
rotis for two rupees a piece at a stall down the hill. Once she goes down the steep hill, she can not climb back in time
make more rotis.

Suppose the cook can hitch a quick ride from her stall downhill back to the kitchen uphill, by offering a paan to a truck driver.
If she starts at the top with paans and rupee, what is the minimum and maximum amount of money she can have at the
end?
cmi2015 descriptive numerical-ability

14.0.5 ISI2014-PCB-A-1a https://gateoverflow.in/47336

Let By we mean the number of 1's in . Prove that

.

descriptive isi2014 numerical-ability proof

14.0.6 ISI2014-PCB-A-2a https://gateoverflow.in/47433

Let be a matrix having non-zero entries. For , let be the number of non-zero entries in
the -th row, and for , let be the number of non-zero entries in the -th column.

Show that there is a k such that , and there is an such that , .

isi2014 descriptive numerical-ability

14.0.7 ISI2017-MMA-10 https://gateoverflow.in/243374

The inequality holds if and only if

A. B. and
C. D. takes any value except and
isi2017-mma general-aptitude numerical-ability

© Copyright GATE Overflow. All rights reserved.

104 14 General Aptitude: Numerical Ability (183)

14.0.8 ISI2017-MMA-11 https://gateoverflow.in/243373

The digit in the unit's place of the number is

A. B. C. D.
isi2017-mma general-aptitude numerical-ability

14.0.9 ISI2017-MMA-12 https://gateoverflow.in/209610

Which of the following statements is true?

A. There are three consecutive integers with sum

B. There are four consecutive integers with sum
C. There are five consecutive integers with sum
D. There are three consecutive integers with product

isi2017-mma general-aptitude numerical-ability

14.0.10 ISI2017-MMA-2 https://gateoverflow.in/243382

If and are the opposite end points of a diameter of a circle, then the equation of the circle is given by

A. B.
C. D.
isi2017-mma general-aptitude numerical-ability

14.0.11 ISI2017-MMA-23 https://gateoverflow.in/214165

What is the smallest degree of a polynomial with real coefficients and having root and
[Here 1 is a cube root of unity.]

A. B. C. D.
isi2017-mma general-aptitude numerical-ability

14.0.12 ISI2017-MMA-24 https://gateoverflow.in/214015

The number of polynomial function of degree 1 satisfying for all real , is

A. B. C. D. infinitely many
isi2017-mma general-aptitude numerical-ability

14.0.13 ISI2017-MMA-3 https://gateoverflow.in/215341

If and are the roots of the equation , then an equation whose roots are
is given by

A. B. C. D.
isi2017-mma general-aptitude numerical-ability

14.0.14 ISI2017-MMA-30 https://gateoverflow.in/243354

The graph of a cubic polynomial is shown below. If is a constant such that has three real solutions,
which of the following could be a possible value of ?

A. B. C. D.
isi2017-mma general-aptitude numerical-ability

© Copyright GATE Overflow. All rights reserved.

14 General Aptitude: Numerical Ability (183) 105

14.0.15 ISI2017-MMA-7 https://gateoverflow.in/215372

Let be an integer.Then the statement

is
A. true for every B. true if and only if
C. not true for D. true for even integers , not true
for odd
isi2017-mma general-aptitude numerical-ability

14.0.16 ISI2018-MMA-1 https://gateoverflow.in/311817

The number of isosceles (but not equilateral) triangles with integer sides and no side exceeding is

A. B. C. D.
isi2018-mma general-aptitude numerical-ability

14.0.17 ISI2018-MMA-2 https://gateoverflow.in/311819

The number of squares in the following figure is

A. B. C. D.
isi2018-mma general-aptitude numerical-ability

14.0.18 ISI2018-MMA-21 https://gateoverflow.in/311857

The angle between the tangents drawn from the point to the parabola is

A. B. C. D.
isi2018-mma general-aptitude numerical-ability

14.0.19 ISI2018-MMA-22 https://gateoverflow.in/311859

The -axis divides the circle into two parts. The area of the smaller part is

A. B. C. D.
isi2018-mma general-aptitude numerical-ability

14.0.20 ISI2018-MMA-24 https://gateoverflow.in/311865

The sum of the infinite series is

A. B. C. D.
isi2018-mma general-aptitude numerical-ability

14.0.21 ISI2018-MMA-27 https://gateoverflow.in/311878

Number of real solutions of the equation is

A. B. C. D.
isi2018-mma general-aptitude numerical-ability

© Copyright GATE Overflow. All rights reserved.

106 14 General Aptitude: Numerical Ability (183)

14.0.22 ISI2018-MMA-3 https://gateoverflow.in/311822

The number of trailing zeros in is

A. B. C. D.
isi2018-mma general-aptitude numerical-ability

14.0.23 ISI2018-MMA-4 https://gateoverflow.in/216598

The number of common terms in the two sequences and is

A. B. C. D.
isi2018-mma general-aptitude numerical-ability

14.0.24 ISI2018-MMA-5 https://gateoverflow.in/311824

One needs to choose six real numbers such that the product of any five of them is equal to other
number. The number of such choices is

A. B. C. D.
isi2018-mma general-aptitude numerical-ability

14.0.25 ISI2018-MMA-6 https://gateoverflow.in/216667

The volume of the region is

A. B. C. D.
isi2018-mma general-aptitude numerical-ability

14.0.26 ISI2018-MMA-7 https://gateoverflow.in/311826

The greatest common divisor of all numbers of the form , where is a prime, is

A. B. C. D.
isi2018-mma general-aptitude numerical-ability

14.0.27 ISI2018-MMA-8 https://gateoverflow.in/311828

Let and be two positive integers such that and where are positive
integers with Then is same as

A. B. C. D.
isi2018-mma general-aptitude numerical-ability

14.0.28 ISI2018-MMA-9 https://gateoverflow.in/311829

If is a root of , then is

A. B. C. D.
isi2018-mma general-aptitude numerical-ability

14.0.29 ISI2018-PCB-A3 https://gateoverflow.in/311916

Let and be positive integers, each greater than .Prove that divides if and only if divides .
isi2018-pcb-a general-aptitude numerical-ability descriptive

14.0.30 ISI2019-MMA-1 https://gateoverflow.in/311371

The highest power of that divides is :

A. B. C. D.

© Copyright GATE Overflow. All rights reserved.

14 General Aptitude: Numerical Ability (183) 107

isi2019-mma general-aptitude numerical-ability

14.0.31 ISI2019-MMA-11 https://gateoverflow.in/311430

How many triplets of real numbers are simultaneous solutions of the equations and ?

A. B. C. D. infinitely many
isi2019-mma general-aptitude numerical-ability

14.0.32 ISI2019-MMA-12 https://gateoverflow.in/311431

Given a positive integer , we define as the highest power of that divides . If is a prime number greater
than , then

A. B.
C. D. None of the above is necessarily true
isi2019-mma general-aptitude numerical-ability

14.0.33 ISI2019-MMA-26 https://gateoverflow.in/311474

If , then

A. B.
C. D.
isi2019-mma general-aptitude numerical-ability

14.0.34 ISI2019-MMA-3 https://gateoverflow.in/311374

The sum of all digit numbers that leave a remainder of when divided by is:

A. B. C. D.
isi2019-mma general-aptitude numerical-ability

14.1 Area (2)

14.1.1 Area: ISI2015-DCG-16 https://gateoverflow.in/321208

The shaded region in the following diagram represents the relation

A. B.
C. D.
isi2015-dcg numerical-ability geometry area

14.1.2 Area: ISI2017-DCG-2 https://gateoverflow.in/321085

The area of the shaded region in the following figure (all the arcs are circular) is

© Copyright GATE Overflow. All rights reserved.

108 14 General Aptitude: Numerical Ability (183)

A. B. C. D.
isi2017-dcg numerical-ability geometry area

14.2 Arithmetic Series (6)

14.2.1 Arithmetic Series: ISI2014-DCG-23 https://gateoverflow.in/321932

The sum of the series is

A. B. C. D.
isi2014-dcg numerical-ability arithmetic-series

14.2.2 Arithmetic Series: ISI2014-DCG-61 https://gateoverflow.in/321894

If , , and , where and

are in arithmetic progression, then are in
A. arithmetic progression B. geometric progression
C. harmonic progression D. none of these
isi2014-dcg numerical-ability arithmetic-series

14.2.3 Arithmetic Series: ISI2014-DCG-62 https://gateoverflow.in/321893

If the sum of the first terms of an arithmetic progression is , then the sum of squares of these terms is

A. B.
C. D.
isi2014-dcg numerical-ability arithmetic-series

14.2.4 Arithmetic Series: ISI2015-DCG-1 https://gateoverflow.in/321223

The sequence is in

A. Arithmetic progression (AP) B. Geometric progression ( GP)

C. Harmonic progression (HP) D. None of these
isi2015-dcg numerical-ability arithmetic-series

14.2.5 Arithmetic Series: ISI2017-DCG-8 https://gateoverflow.in/321079

If are in and , then are in

A. B. C. D. none of these
isi2017-dcg numerical-ability arithmetic-series

14.2.6 Arithmetic Series: ISI2018-DCG-3 https://gateoverflow.in/321054

If the co-efficient of and terms in the expansion of are in Arithmetic Progression

(A.P.), then which one of the following is true?

A. B.
C. D.

© Copyright GATE Overflow. All rights reserved.

14 General Aptitude: Numerical Ability (183) 109

isi2018-dcg numerical-ability sequence-series arithmetic-series

14.3 Binomial Theorem (1)

14.3.1 Binomial Theorem: ISI2015-DCG-18 https://gateoverflow.in/321206

The value of correct to decimal places is

A. B. C. D.
isi2015-dcg numerical-ability number-system binomial-theorem

14.4 Cartesian Coordinates (1)

14.4.1 Cartesian Coordinates: ISI2011-PCB-A-4a https://gateoverflow.in/48049

Consider six distinct points in a plane. Let and denote the minimum and maximum distance between any pair of
points. Show that .

descriptive isi2011 cartesian-coordinates

14.5 Circle (3)

14.5.1 Circle: CMI2010-A-03 https://gateoverflow.in/46133

The area of the largest square that can be drawn inside a circle with unit radius is

A.
B.
C.
D. None of the above

cmi2010 circle

14.5.2 Circle: ISI2014-DCG-60 https://gateoverflow.in/321895

The equation of any circle passing through the origin and with its centre on the -axis is given by

A. where must be positive

B. for any given
C. where must be positive
D. for any given

isi2014-dcg numerical-ability geometry circle

14.5.3 Circle: ISI2017-DCG-19 https://gateoverflow.in/321068

The angle between the tangents drawn from the point to the circle is

A. B. C. D.
isi2017-dcg numerical-ability geometry circle trigonometry

14.6 Coefficients (1)

14.6.1 Coefficients: ISI2015-DCG-6 https://gateoverflow.in/321218

The coefficient of in the product is

A. B. C. D. None of these
isi2015-dcg numerical-ability number-system coefficients

14.7 Congruent Modulo (1)

14.7.1 Congruent Modulo: ISI2015-MMA-14 https://gateoverflow.in/321863

Consider the following system of equivalences of integers,

© Copyright GATE Overflow. All rights reserved.

110 14 General Aptitude: Numerical Ability (183)

The number of solutions in , where , to the above system of equivalences is

A. B. C. D.
isi2015-mma numerical-ability number-system congruent-modulo non-gate

14.8 Conjunction (1)

14.8.1 Conjunction: CMI2016-A-8 https://gateoverflow.in/98378

An advertisement for a tennis magazine states, "If I'm not playing tennis, I'm watching tennis. And If I'm not watching
tennis, I'm reading about tennis." We can assume that the speaker can do at most one of these activities at a time. What
is the speaker doing?
A. Playing tennis B. Watching tennis
C. Reading about tennis D. None of the above
cmi2016 logical-reasoning conjunction

14.9 Convergence Divergence (1)

14.9.1 Convergence Divergence: ISI2015-MMA-24 https://gateoverflow.in/321853

The series converges to

A. B. C. D. does not converge

isi2015-mma number-system convergence-divergence summation non-gate

14.10 Cubic Equations (3)

14.10.1 Cubic Equations: ISI2015-DCG-29 https://gateoverflow.in/321195

The condition that ensures that the roots of the equation are in is

A. B.
C. D.
isi2015-dcg numerical-ability cubic-equations

14.10.2 Cubic Equations: ISI2017-MMA-3 https://gateoverflow.in/243381

If and are the roots of the equation , then an equation whose roots are
and is given by

A. B. C. D.
isi2017-mmamma numerical-ability cubic-equations roots

14.10.3 Cubic Equations: ISI2017-PCB-A-1 https://gateoverflow.in/244737

Suppose all the roots of the equation (where is a real number) are real. Prove that exactly one
root is positive.
isi2017-pcb-a numerical-ability cubic-equations roots descriptive

14.11 Factorial (1)

14.11.1 Factorial: ISI2017-MMA-7 https://gateoverflow.in/243377

Let be an integer. Then the statement is

A. true for every B. true if and only if

C. not true for D. true for even integers , not true
for odd
isi2017-mmamma numerical-ability factorial inequality

© Copyright GATE Overflow. All rights reserved.

14 General Aptitude: Numerical Ability (183) 111

14.12 Factors (6)

14.12.1 Factors: ISI2012-PCB-A-1b https://gateoverflow.in/47823

How many ’s are there at the end of ?

descriptive isi2012 numerical-ability factors numerical-computation numerical-answers

14.12.2 Factors: ISI2014-DCG-10 https://gateoverflow.in/321945

The number of divisors of , where and are also considered as divisors of is

A. B. C. D.
isi2014-dcg numerical-ability number-system factors

14.12.3 Factors: ISI2014-DCG-69 https://gateoverflow.in/321886

The number of ways in which the number can be expressed as a product of two factors is equal to

A. B. C. D.
isi2014-dcg numerical-ability number-system factors

14.12.4 Factors: ISI2015-DCG-12 https://gateoverflow.in/321212

The highest power of contained in is

A. B. C. D.
isi2015-dcg numerical-ability number-system factors

14.12.5 Factors: ISI2015-DCG-20 https://gateoverflow.in/321204

The total number of factors of greater than but less than is

A. B. C. D. None of these
isi2015-dcg numerical-ability number-system factors

14.12.6 Factors: ISI2016-DCG-20 https://gateoverflow.in/321137

The total number of factors of greater than but less than is

A. B. C. D. None of these
isi2016-dcg numerical-ability number-system factors

14.13 Geometric Series (1)

14.13.1 Geometric Series: ISI2016-MMA-1 https://gateoverflow.in/242729

Suppose are in geometric progression and . Which one of the following is always true?

A. are in geometric progression B. are in arithmetic progression

C. are in harmonic progression D.
isi2016-mma sequence-series geometric-series

14.14 Geometry (3)

14.14.1 Geometry: CMI2014-A-07 https://gateoverflow.in/46974

Let be the maximum number of unit disks (disks of radius ) that can be placed inside a disk of radius so that
each unit disk lies entirely within the larger disk and no two unit disks overlap. Then:
A. B.
C. D.
cmi2014 numerical-ability geometry

© Copyright GATE Overflow. All rights reserved.

112 14 General Aptitude: Numerical Ability (183)

14.14.2 Geometry: ISI2013-PCB-A-1 https://gateoverflow.in/47495

The vertices of a triangle are given. For an arbitrary point in the plane, give an algorithm to test if belongs to
the interior of . (The interior of does not include its edges).
descriptive isi2013 numerical-ability geometry

14.14.3 Geometry: ISI2016-DCG-51 https://gateoverflow.in/321106

Four squares of sides each are cut off from the four corners of a square metal sheet having side The
residual sheet is then folded into an open box which is then filled with a liquid costing Rs. per The value of
for which the cost of filling the box completely with the liquid is maximized, is

A. B. C. D.
isi2016-dcg numerical-ability geometry

14.15 Inequality (3)

14.15.1 Inequality: ISI2016-DCG-14 https://gateoverflow.in/321143

For natural numbers the inequality is valid when

A. B. C. D. None of these
isi2016-dcg numerical-ability inequality

14.15.2 Inequality: ISI2016-DCG-2 https://gateoverflow.in/321155

Let and Then

A. B. C. D. None of these
isi2016-dcg numerical-ability summation inequality

14.15.3 Inequality: ISI2018-DCG-30 https://gateoverflow.in/321027

Let . Then
A. B.
C. D. no such real number is possible.
isi2018-dcg numerical-ability number-system inequality

14.16 Integer Solutions (1)

14.16.1 Integer Solutions: ISI2014-DCG-68 https://gateoverflow.in/321887

The number of integer solutions for the equation is

A. B. C. D.
isi2014-dcg numerical-ability integer-solutions

14.17 Intersection (1)

14.17.1 Intersection: ISI2018-DCG-19 https://gateoverflow.in/321038

The area of the region formed by line segments joining the points of intersection of the circle
with the two axes in succession in a definite order (clockwise or anticlockwise) is

A. B. C. D.
isi2018-dcg circle intersection non-gate

14.18 Inverse Trigonometry (1)

14.18.1 Inverse Trigonometry: ISI2017-DCG-15 https://gateoverflow.in/321072

The number of solutions of is

© Copyright GATE Overflow. All rights reserved.

14 General Aptitude: Numerical Ability (183) 113

A. B. C. D.
isi2017-dcg numerical-ability inverse-trigonometry

14.19 Lines (3)

14.19.1 Lines: ISI2015-DCG-38 https://gateoverflow.in/321186

The length of the chord on the straight line intercepted by the circle passing through the points
and is

A. B. C. D.
isi2015-dcg numerical-ability geometry lines circle

14.19.2 Lines: ISI2017-DCG-20 https://gateoverflow.in/321067

If the coordinates of the middle point of the portion of a line intercepted between the coordinate axes are , then
the equation of the straight line is

A. B. C. D.
isi2017-dcg numerical-ability geometry lines

14.19.3 Lines: ISI2017-DCG-21 https://gateoverflow.in/321066

If are in , then the straight line will always pass through the point whose coordinates are

A. B. C. D.
isi2017-dcg numerical-ability geometry lines arithmetic-series

14.20 Logarithms (7)

14.20.1 Logarithms: ISI2014-DCG-26 https://gateoverflow.in/321929

Let . Then which of the following is true?

A.
B.
C. There exist and such that and
D. None of these

isi2014-dcg numerical-ability logarithms

14.20.2 Logarithms: ISI2014-DCG-67 https://gateoverflow.in/321888

Let where denotes the greatest integer less than or equal to . Then

A. B. C. D.
isi2014-dcg numerical-ability logarithms

14.20.3 Logarithms: ISI2015-DCG-23 https://gateoverflow.in/321201

The value of is

A. B. C. D. None of these
isi2015-dcg numerical-ability logarithms

14.20.4 Logarithms: ISI2016-DCG-1 https://gateoverflow.in/321156

The sequence is in

A. Arithmetic progression (AP) B. Geometric progression (GP)

C. Harmonic progression (HP) D. None of these

© Copyright GATE Overflow. All rights reserved.

114 14 General Aptitude: Numerical Ability (183)

isi2016-dcg numerical-ability logarithms sequence-series

14.20.5 Logarithms: ISI2016-DCG-23 https://gateoverflow.in/321134

The value of is

A. B. C. D. None of these
isi2016-dcg numerical-ability logarithms summation

14.20.6 Logarithms: ISI2017-DCG-1 https://gateoverflow.in/321086

The value of where is

A. B. C. D. none of these
isi2017-dcg numerical-ability logarithms summation

14.20.7 Logarithms: ISI2017-DCG-9 https://gateoverflow.in/321078

The solution of is

A. B. C. D. none of these
isi2017-dcg numerical-ability logarithms

14.21 Logical Reasoning (10)

14.21.1 Logical Reasoning: CMI2011-A-04 https://gateoverflow.in/46191

Lavanya has to complete courses for her degree. There are six compulsory courses: Basic and Advanced
Mathematics, Basic and Advanced Physics and Basic and Advanced Electronics. She also has to complete six Optional
Courses. Each course takes one semester to complete. There are some constraints because of prerequisites.

For Mathematics, Physics and Electronics, the Basic course must be completed before starting the Advanced course.
Advanced Physics must be completed before starting Basic Electronics.
Advanced Mathematics must be completed before starting Advanced Physics.
The Optional Courses can be done in any order, but no more than two Optional Courses can be taken in a semester

Given these constraints, what is the minimum number of semesters that Lavanya needs to complete her course requirements.

A. B. C. D.
cmi2011 numerical-ability logical-reasoning

14.21.2 Logical Reasoning: CMI2011-A-06 https://gateoverflow.in/46193

A valuable sword belonging to the Grand King was stolen, and the three suspects were Ibn, Hasan, and Abu. Ibn
claimed that Hasan stole it, and Hasan claimed that Abu stole it. It was not clear that one of them stole it, but it was
later learnt that no innocent person had lied. It was also learnt that the sword was stolen by only one person.
Who stole the sword?

A. Ibn B. Hasan C. Abu D. None of them

cmi2011 logical-reasoning

14.21.3 Logical Reasoning: CMI2012-A-05 https://gateoverflow.in/46534

Amma baked a cake and left it on the table to cool. Before going for her bath, she told her four children that they
should not touch the cake as it was to be cut only the next day. However when she got back from her bath she found
that someone had eaten a large piece of the cake. Since only her four children were present at home when this happened, she
questioned them about who ate a piece of the cake. The four answers she got were:

Lakshmi: Aruna ate the piece of cake.

Ram: I did not eat the piece of cake.
Aruna: Varun ate the cake.
Varun: Aruna lied when she said I had eaten the piece of cake.

© Copyright GATE Overflow. All rights reserved.

14 General Aptitude: Numerical Ability (183) 115

If exactly one of them was telling the truth and exactly one of them actually ate the piece of cake, who is the culprit that Amma
is going to punish?

A. Lakshmi B. Ram C. Aruna D. Varun

cmi2012 logical-reasoning

14.21.4 Logical Reasoning: CMI2014-A-09 https://gateoverflow.in/46976

A company is due to send a shipment to a client and the CEO has resigned. To select a new CEO, some candidates have
been interviewed. One of them will be chosen through a vote. If the workers union resort to a strike and the candidates
have to be interviewed again, then the shipment deadline will be missed. If there are more abstainers than voters in the vote to
choose the new CEO, then the candidates have to be interviewed again. Suppose that the shipment was sent on time. Which of
the following is a valid conclusion?

A. The workers union did not resort to a strike.

B. The number of voters was more than the number of abstainers.
C. (A) or (B).
D. If the workers union resorted to a strike, then the number of voters was greater than or equal to the number of abstainers.

cmi2014 logical-reasoning

14.21.5 Logical Reasoning: CMI2014-A-10 https://gateoverflow.in/46978

Avinash is taller than Abhay. Bharat is taller than Vinu and Vinay is taller than Bharat. Which of the following is a
minimal set of additional information that can determine the tallest person?
A. Vinay is taller than Avinash and B. Avinash is taller than Vinay.
Abhay is taller than Bharat.
C. Abhay is shorter than Vinay. D. None of the above.
cmi2014 logical-reasoning

14.21.6 Logical Reasoning: CMI2017-A-03 https://gateoverflow.in/203260

Four siblings go shopping with their father. If Abhay gets shoes, then Asha does not get a necklace. If Arun gets a T-
shirt, then Aditi gets bangles. If Abhay does not get shoes or Aditi gets bangles, the mother will be happy. Which of the
following is TRUE?

A. If the mother is happy, then Aditi got bangles.

B. If Aditi got bangles, then Abhay got shoes.
C. If the mother is not happy, then Asha did not get a necklace and Arun did not get a T-shirt.
D. None of the above.

cmi2017 logical-reasoning

14.21.7 Logical Reasoning: CMI2018-A-2 https://gateoverflow.in/320491

Akash, Bharani, Chetan and Deepa are invited to a party. If Bharani and Chetan attend, then Deepa will attend too. If
Bharani does not attend, then Akash will not attend. If Deepa does not attend, which of the following is true?
A. Chetan does not attend B. Akash does not attend
C. either (A) or (B) D. none of the above
cmi2018 logical-reasoning

14.21.8 Logical Reasoning: CMI2018-A-3 https://gateoverflow.in/320490

In a running race, Geetha finishes ahead of Shalini and Vani finishes after Aparna. Divya finishes ahead of Aparna.
Which of the following is a minimal set of additional information that can determine the winner?
A. Geetha finishes ahead of Divya and B. Aparna finishes ahead of Shalini.
Vani finishes ahead of Shalini.
C. Divya finishes ahead of Geetha. D. None of the above.
cmi2018 logical-reasoning

© Copyright GATE Overflow. All rights reserved.

116 14 General Aptitude: Numerical Ability (183)

14.21.9 Logical Reasoning: CMI2018-B-2 https://gateoverflow.in/320461

A student requests a recommendation letter from a professor. The professor gives three sealed envelopes. Each
envelope contains either a good recommendation letter or a bad recommendation letter.

A. Make a list of all the possible scenarios.

B. Suppose now the professor tells the student that exactly one envelope contains a good recommendation letter and the other
two contain bad recommendation letters. In the list of scenarios you prepared above, mark the ones that are still possible.
C. On envelope is written the clue "This contains a bad recommendation letter".On envelope is written the clue "This
contains a bad recommendation letter". On envelope is written the clue "Envelope contains a good recommendation
letter". Suppose now the professor gives the additional information that exactly one of these three clues are true and the
other two are false. Can the student find out the contents of the envelopes without breaking their seals?

cmi2018 descriptive logical-reasoning

14.21.10 Logical Reasoning: ISI2018-PCB-A2 https://gateoverflow.in/311915

Let there be a pile of chips in the center of a table. Suppose there are two players who could alternately remove
one, two or three chips from the pile. At least one chip must be removed, but no more than three chips can be removed
in a single move. The player that removes the last chip wins. Does the first player (the player who starts playing the game) have
a winning strategy in this game, that is, whatever moves his opponent makes, he can always make his moves in a certain way
ensuring his win? Justify your answer.
isi2018-pcb-a general-aptitude numerical-ability logical-reasoning descriptive

14.22 Median (2)

14.22.1 Median: ISI2015-DCG-39 https://gateoverflow.in/321185

The medians and of the triangle with vertices , and are mutually perpendicular if

A. B. C. D.
isi2015-dcg numerical-ability geometry triangles median

14.22.2 Median: ISI2015-MMA-28 https://gateoverflow.in/321849

In a triangle , is the median. If length of is , length of is and length of is then length of

equals

A. B. C. D.
isi2015-mma numerical-ability geometry median non-gate

14.23 Minimum Value (1)

14.23.1 Minimum Value: ISI2015-MMA-2 https://gateoverflow.in/321875

If are positive real variables whose sum is a constant , then the minimum value of is

A. B.
C. D. None of the above
isi2015-mma numerical-ability number-system minimum-value non-gate

14.24 Number System (12)

14.24.1 Number System: CMI2016-A-2 https://gateoverflow.in/98361

The symbol reads as "divides", and as "does not divide". For instance, and are both true. Consider the
following statements.

i. There exists a positive integer such that and .

ii. There exists a positive integer such that .

What can you say about these statements?

A. Only i is true B. Only ii is true
C. Both i and ii are true D. Neither i nor ii is true

© Copyright GATE Overflow. All rights reserved.

14 General Aptitude: Numerical Ability (183) 117

cmi2016 numerical-ability number-system

14.24.2 Number System: ISI2015-DCG-13 https://gateoverflow.in/321211

For all the natural number is

A. divisible by B. not divisible by
C. divisible by D. None of these
isi2015-dcg numerical-ability number-system

14.24.3 Number System: ISI2015-DCG-14 https://gateoverflow.in/321210

For natural numbers , the inequality is valid when

A. B. C. D. None of these
isi2015-dcg numerical-ability number-system

14.24.4 Number System: ISI2015-DCG-19 https://gateoverflow.in/321205

The expression is divisible by for

A. all positive integer values of B. all non-negative integer values of
C. only even integer values of D. only odd integer values of
isi2015-dcg numerical-ability number-system

14.24.5 Number System: ISI2015-MMA-29 https://gateoverflow.in/321848

The set equals the set

A.
B.
C.
D.

isi2015-mma number-system non-gate

14.24.6 Number System: ISI2015-MMA-3 https://gateoverflow.in/321874

Let be a positive real number. Then

A. B.
C. D. none of the above
isi2015-mma number-system non-gate

14.24.7 Number System: ISI2016-DCG-18 https://gateoverflow.in/321139

The value of correct to decimal places is

A. B. C. D.
isi2016-dcg numerical-ability number-system

14.24.8 Number System: ISI2016-DCG-6 https://gateoverflow.in/321151

The coefficient of in the product is

A. B. C. D. None of these
isi2016-dcg numerical-ability number-system

14.24.9 Number System: ISI2016-MMA-12 https://gateoverflow.in/242718

Suppose there are positive real numbers such that their sum is 20 and the product is strictly greater than 1. What is
the maximum possible value of n?

A. 18 B. 19 C. 20 D. 21

© Copyright GATE Overflow. All rights reserved.

118 14 General Aptitude: Numerical Ability (183)

isi2016-mmamma numerical-ability number-system

14.24.10 Number System: ISI2016-MMA-15 https://gateoverflow.in/242715

The number of positive integers for which is a perfect square

A. B. C. D.
isi2016-mmamma numerical-ability number-system

14.24.11 Number System: ISI2016-MMA-17 https://gateoverflow.in/242713

The number of positive integers for which is

A. B. C. D.
isi2016-mmamma numerical-ability number-system

14.24.12 Number System: ISI2017-PCB-A-2 https://gateoverflow.in/244736

Let and be real numbers such that and . Prove that for all positive
integers .
isi2017-pcb-a numerical-ability number-system descriptive

14.25 Numerical Computation (1)

14.25.1 Numerical Computation: CMI2010-A-07 https://gateoverflow.in/46138

For integer values of , the expression

A. Is always divisible by . B. Is always divisible by .

C. Is always an integer. D. None of the above
cmi2010 numerical-ability numerical-computation

14.26 Parallelograms (1)

14.26.1 Parallelograms: ISI2018-DCG-15 https://gateoverflow.in/321042

The number of parallelograms that can be formed from a set of four parallel lines intersecting another set of three
parallel lines is

A. B. C. D.
isi2018-dcg numerical-ability number-system geometry parallelograms

14.27 Percentage (1)

14.27.1 Percentage: ISI2018-DCG-13 https://gateoverflow.in/321044

In a certain town, families own a car, own a phone, own neither a car nor a phone and families
own both a car and a phone. Consider the following statements in this regard:

i. families own both a car and a phone.

ii. families own either a car or a phone.
iii. families live in the town.

Then which one of the following is true?

A. (i) & (ii) are correct and (iii) is wrong.

B. (i) & (iii) are correct and (ii) is wrong.
C. (ii) & (iii) are correct and (i) is wrong.
D. (i), (ii) & (iii) are correct.

isi2018-dcg numerical-ability percentage

14.28 Pigeonhole Principle (4)

© Copyright GATE Overflow. All rights reserved.

14 General Aptitude: Numerical Ability (183) 119

14.28.1 Pigeonhole Principle: CMI2012-A-06 https://gateoverflow.in/46535

A basket of fruit is being arranged out of apples, bananas, and oranges. What is the smallest number of pieces of fruit
that should be put in the basket in order to guarantee that either there are at least apples or at least bananas or at
least oranges?

A. B. C. D.
cmi2012 numerical-ability pigeonhole-principle

14.28.2 Pigeonhole Principle: CMI2014-B-02 https://gateoverflow.in/46982

There are students in a class. The students have formed committees. Each committee consists of more than half of
the students. Show that there is at least one student who is a member of more than half of the committees.
cmi2014 descriptive numerical-ability pigeonhole-principle

14.28.3 Pigeonhole Principle: ISI2012-PCB-A-1a https://gateoverflow.in/47821

A group of boys plucked a total of apples. Prove that two of those boys plucked the same number of apples.
descriptive isi2012 numerical-ability pigeonhole-principle

14.28.4 Pigeonhole Principle: ISI2015-PCB-A-2 https://gateoverflow.in/47266

Prove that in any sequence of integers, there will always be a subsequence of consecutive elements in the
sequence, whose sum is divisible by .
descriptive isi2015-pcb-a numerical-ability pigeonhole-principle

14.29 Polynomial (1)

14.29.1 Polynomial: ISI2015-MMA-12 https://gateoverflow.in/321865

Consider the polynomial where are real numbers. If and

are two two roots of this polynomial then the value of is

A. B. C. D.
isi2015-mma numerical-ability number-system polynomial roots non-gate

14.30 Quadratic Equations (6)

14.30.1 Quadratic Equations: ISI2014-DCG-11 https://gateoverflow.in/321944

Let and be the roots of the quadratic equation , and and be the roots of the quadratic
equation . If and are in then equals

A. B. C. D.
isi2014-dcg quadratic-equations

14.30.2 Quadratic Equations: ISI2014-DCG-22 https://gateoverflow.in/321933

The conditions on , and under which the roots of the quadratic equation and
, are unequal magnitude but of the opposite signs, are the following:

A. and have the same sign while has the opposite sign.
B. and have the same sign while has the opposite sign; or and have the same sign while has the opposite sign.
C. and have the same sign.
D. , and have the same sign.

isi2014-dcg numerical-ability quadratic-equations

14.30.3 Quadratic Equations: ISI2014-DCG-55 https://gateoverflow.in/321900

If are sides of a triangle such that has real roots then

A. B.

© Copyright GATE Overflow. All rights reserved.

120 14 General Aptitude: Numerical Ability (183)

C. D.
isi2014-dcg numerical-ability geometry quadratic-equations

14.30.4 Quadratic Equations: ISI2015-MMA-13 https://gateoverflow.in/321864

The number of real roots of the equation

A. B. C. D. infinitely many
isi2015-mma numerical-ability quadratic-equations trigonometry

14.30.5 Quadratic Equations: ISI2015-MMA-15 https://gateoverflow.in/321862

The number of real solutions of the equations is

A. B. C. D. none of the above

isi2015-mma numerical-ability number-system quadratic-equations non-gate

14.30.6 Quadratic Equations: ISI2015-MMA-16 https://gateoverflow.in/321861

If two real polynomials and of degrees and respectively, satisfy

for every , then

A. has exactly one real root such that

B. has exactly one real root such that
C. has distinct real roots
D. has no real root

isi2015-mma numerical-ability quadratic-equations functions non-gate

14.31 Rectangles (1)

14.31.1 Rectangles: ISI2014-DCG-56 https://gateoverflow.in/321899

Two opposite vertices of a rectangle are and while the other two vertices lie on the straight line
. Then the value of is

A. B. C. D.
isi2014-dcg numerical-ability geometry rectangles lines

14.32 Remainder Theorem (11)

14.32.1 Remainder Theorem: ISI2014-DCG-36 https://gateoverflow.in/321919

Consider any integer , where and are odd integers. Then

A. is never divisible by B. is never divisible by
C. is never divisible by D. None of the above
isi2014-dcg numerical-ability number-system remainder-theorem

14.32.2 Remainder Theorem: ISI2015-DCG-8 https://gateoverflow.in/321216

Let and is divisible by . Then the number of elements in the set

is

A. B. C. D.
isi2015-dcg numerical-ability number-system remainder-theorem

© Copyright GATE Overflow. All rights reserved.

14 General Aptitude: Numerical Ability (183) 121

14.32.3 Remainder Theorem: ISI2015-DCG-9 https://gateoverflow.in/321215

Let be the – digit number of which all the digits are equal to . Then the number is,
A. divisible by but not divisible by B. divisible by but not divisible by
C. divisible by D. None of the above
isi2015-dcg numerical-ability number-system remainder-theorem

14.32.4 Remainder Theorem: ISI2015-MMA-11 https://gateoverflow.in/321866

The number of positive integers which are less than or equal to and are divisible by none of , and equals

A. B. C. D. none of the above

isi2015-mma numerical-ability number-system remainder-theorem

14.32.5 Remainder Theorem: ISI2015-MMA-41 https://gateoverflow.in/321836

Let and be integers greater than . Then is not necessarily divisible by

A. B. C. D.
isi2015-mma numerical-ability number-system remainder-theorem

14.32.6 Remainder Theorem: ISI2016-DCG-10 https://gateoverflow.in/321147

Let be the -digit number of which all the digits are equal to Then the number is ,
A. divisible by but not divisible by B. divisible by but not divisible by
C. divisible by D. None of the above
isi2016-dcg numerical-ability number-system remainder-theorem

14.32.7 Remainder Theorem: ISI2016-DCG-12 https://gateoverflow.in/321145

The highest power of contained in is

A. B. C. D.
isi2016-dcg numerical-ability number-system remainder-theorem

14.32.8 Remainder Theorem: ISI2016-DCG-13 https://gateoverflow.in/321144

For all the natural number is

A. divisible by B. not divisible by
C. divisible by D. None of these
isi2016-dcg numerical-ability number-system remainder-theorem

14.32.9 Remainder Theorem: ISI2016-DCG-19 https://gateoverflow.in/321138

The expression is divisible by for

A. all positive integer values of B. all non-negative integer values of
C. only even integer values of D. only odd integer values of
isi2016-dcg numerical-ability number-system remainder-theorem

14.32.10 Remainder Theorem: ISI2016-DCG-8 https://gateoverflow.in/321149

Let and . Then the number of elements in the

set is

A. B. C. D.
isi2016-dcg numerical-ability number-system remainder-theorem

14.32.11 Remainder Theorem: ISI2016-MMA-16 https://gateoverflow.in/242714

Suppose a 6 digit number is formed by rearranging the digits of the number 123456. If is divisible by 5, then the
set of all possible remainders when is divided by 45 is

© Copyright GATE Overflow. All rights reserved.

122 14 General Aptitude: Numerical Ability (183)

1.
2.
3.
4.

isi2016-mmamma numerical-ability number-system remainder-theorem

14.33 Roots (18)

14.33.1 Roots: ISI2014-DCG-30 https://gateoverflow.in/321925

Consider the equation where and are all real and positive. State which of the
following statements is always correct.

A. All roots of are real

B. The equation has at least one real root
C. The equation has no negative real root
D. The equation must have one positive and one negative real root

isi2014-dcg numerical-ability quadratic-equations roots

14.33.2 Roots: ISI2014-DCG-54 https://gateoverflow.in/321901

The number of real roots of the equation is equal to

A. B. C. D.
isi2014-dcg numerical-ability trigonometry roots

14.33.3 Roots: ISI2015-DCG-25 https://gateoverflow.in/321199

If and be the roots of the equation , then the equation with roots and is

A. B. C. D. None of the above

isi2015-dcg numerical-ability quadratic-equations roots

14.33.4 Roots: ISI2015-DCG-26 https://gateoverflow.in/321198

If be the ratio of the roots of the equation then

A. B. C. D.
isi2015-dcg numerical-ability quadratic-equations roots

14.33.5 Roots: ISI2015-DCG-28 https://gateoverflow.in/321196

If one root of a quadratic equation be equal to the power of the other, then

A. B.
C. D.
isi2015-dcg numerical-ability quadratic-equations roots

14.33.6 Roots: ISI2015-DCG-30 https://gateoverflow.in/321194

Let be real numbers such that . Consider the equations and

. Then

A. at least one of the equations has real roots

B. both these equations have real roots
C. neither of these equations have real roots
D. given data is not sufficient to arrive at any conclusion

isi2015-dcg numerical-ability quadratic-equations roots

© Copyright GATE Overflow. All rights reserved.

14 General Aptitude: Numerical Ability (183) 123

14.33.7 Roots: ISI2015-DCG-7 https://gateoverflow.in/321217

Let for any real value of . Then the integer value of is

A. B. C. D.
isi2015-dcg numerical-ability quadratic-equations roots

14.33.8 Roots: ISI2016-DCG-25 https://gateoverflow.in/321132

If and be the roots of the equation then the equation with roots and is

A. B. C. D. None of these
isi2016-dcg numerical-ability quadratic-equations roots

14.33.9 Roots: ISI2016-DCG-26 https://gateoverflow.in/321131

If be the ratio of the roots of the equation then

A. B. C. D.
isi2016-dcg numerical-ability quadratic-equations roots

14.33.10 Roots: ISI2016-DCG-28 https://gateoverflow.in/321129

If one root of a quadratic equation be equal to the n th power of the other, then

1.
2.
3.
4.

isi2016-dcg numerical-ability quadratic-equations roots

14.33.11 Roots: ISI2016-DCG-29 https://gateoverflow.in/321128

The condition that ensures that the roots of the equation are in H.P. is

A. B.
C. D.
isi2016-dcg numerical-ability quadratic-equations roots

14.33.12 Roots: ISI2016-DCG-30 https://gateoverflow.in/321127

Let be real numbers such that Consider the equations and

Then

A. at least one of the equations has real roots.

B. both these equations have real roots.
C. neither of these equations have real roots.
D. given data is not sufficient to arrive at any conclusion.

isi2016-dcg numerical-ability quadratic-equations roots

14.33.13 Roots: ISI2016-DCG-7 https://gateoverflow.in/321150

Let for any real value of . Then the integer value of is

A. B. C. D.
isi2016-dcg numerical-ability quadratic-equations roots

14.33.14 Roots: ISI2016-MMA-29 https://gateoverflow.in/242701

Suppose is a real number for which all the roots of the equation are real. Then

© Copyright GATE Overflow. All rights reserved.

124 14 General Aptitude: Numerical Ability (183)

A. B. C. D.
isi2016-mmamma numerical-ability quadratic-equations roots

14.33.15 Roots: ISI2016-MMA-3 https://gateoverflow.in/242727

The number of real roots of the equation is

A. B. C. D.
isi2016-mmamma trigonometry quadratic-equations roots

14.33.16 Roots: ISI2016-PCB-A-1 https://gateoverflow.in/244362

If are the roots of the equation , then prove that

isi2016-pcb-a numerical-ability quadratic-equations roots descriptive

14.33.17 Roots: ISI2017-DCG-5 https://gateoverflow.in/321082

The sum of the squares of the roots of becomes minimum when is

A. B. C. D.
isi2017-dcg numerical-ability quadratic-equations roots

14.33.18 Roots: ISI2018-DCG-11 https://gateoverflow.in/321046

The sum of power of all the roots of is equal to

A. B. C. D.
isi2018-dcg numerical-ability polynomials roots

14.34 Sequence Series (2)

14.34.1 Sequence Series: ISI2015-DCG-10 https://gateoverflow.in/321214

The th term of the sequence is

A. B. C. D.
isi2015-dcg numerical-ability sequence-series

14.34.2 Sequence Series: ISI2016-DCG-9 https://gateoverflow.in/321148

The th term of the sequence is

A. B. C. D.
isi2016-dcg numerical-ability sequence-series

14.35 Sets (1)

14.35.1 Sets: CMI2013-A-08 https://gateoverflow.in/46598

In the passing out batch, students know Java, know Python and know C++. Of these, know both Java and
Python, know both Python and C++ and know both Java and C++ and know all three languages. If there are
students in the class, how many know none of these three languages?

A. B. C. D.
cmi2013 numerical-ability sets

14.36 Squares (2)

© Copyright GATE Overflow. All rights reserved.

14 General Aptitude: Numerical Ability (183) 125

14.36.1 Squares: ISI2014-DCG-58 https://gateoverflow.in/321897

Consider a circle with centre at origin and radius . A square is inscribed in the circle whose sides are parallel to the
an axes. The coordinates of one of the vertices of this square are

A. B. C. D.
isi2014-dcg numerical-ability geometry circle squares

14.36.2 Squares: ISI2015-DCG-53 https://gateoverflow.in/321170

Four squares of sides cm each are cut off from the four corners of a square metal sheet having side cm. The
residual sheet is then folded into an open box which is then filled with a liquid costing Rs. with . The value of
for which the cost of filling the box completely with the liquid is maximized, is

A. B. C. D.
isi2015-dcg numerical-ability geometry squares

14.37 Straight Lines (1)

14.37.1 Straight Lines: ISI2015-MMA-18 https://gateoverflow.in/321859

The set of complex numbers satisfying the equation

represents, in the complex plane,

A. a straight line B. a pair of intersecting straight lines
C. a point D. a pair of distinct parallel straight lines
isi2015-mma numerical-ability geometry straight-lines complex-number non-gate

14.38 Summation (9)

14.38.1 Summation: ISI2013-PCB-A-2 https://gateoverflow.in/47496

Find the value of , where the summation is over all integers and such that .
isi2013 numerical-ability summation numerical-answers

14.38.2 Summation: ISI2014-DCG-16 https://gateoverflow.in/321939

The sum of the series is

A. B. C. D. non-existent
isi2014-dcg numerical-ability summation

14.38.3 Summation: ISI2014-DCG-65 https://gateoverflow.in/321890

The sum is

A. B. C. D.
isi2014-dcg numerical-ability summation non-gate

14.38.4 Summation: ISI2015-DCG-15 https://gateoverflow.in/321209

The smallest integer for which exceeds , given that , is

A. B. C. D. None of these
isi2015-dcg numerical-ability summation

© Copyright GATE Overflow. All rights reserved.

126 14 General Aptitude: Numerical Ability (183)

14.38.5 Summation: ISI2015-DCG-2 https://gateoverflow.in/321222

Let and & . Then

A. B. C. D. None of these
isi2015-dcg numerical-ability summation

14.38.6 Summation: ISI2015-MMA-17 https://gateoverflow.in/321860

Let . Then,

A. B.
C. D. none of the above holds
isi2015-mma numerical-ability summation

14.38.7 Summation: ISI2016-DCG-17 https://gateoverflow.in/321140

The smallest integer for which exceeds , given that , is

A. B. C. D. None of these
isi2016-dcg numerical-ability summation

14.38.8 Summation: ISI2017-DCG-13 https://gateoverflow.in/321074

The value of is

A. B. C. D.
isi2017-dcg numerical-ability summation

14.38.9 Summation: ISI2018-DCG-27 https://gateoverflow.in/321030

is

A. B.
C. D. not a convergent series
isi2018-dcg numerical-ability sequence-series summation

14.39 System Of Equations (1)

14.39.1 System Of Equations: ISI2018-MMA-11 https://gateoverflow.in/311835

The value of for which the system of linear equations , and

has no solution is

A. B. C. D.
isi2018-mma engineering-mathematics linear-algebra system-of-equations

14.40 Triangles (2)

14.40.1 Triangles: ISI2015-DCG-60 https://gateoverflow.in/321163

Which of the following relations is true for the following figure?

© Copyright GATE Overflow. All rights reserved.

14 General Aptitude: Numerical Ability (183) 127

A. B. C. D. All of these
isi2015-dcg numerical-ability geometry triangles

14.40.2 Triangles: ISI2017-DCG-14 https://gateoverflow.in/321073

If are the sides of a triangle such that , then (where are the angles
opposite to the sides of respectively) is

A. B. C. D.
isi2017-dcg numerical-ability geometry triangles

14.41 Trigonometry (13)

14.41.1 Trigonometry: ISI2015-DCG-4 https://gateoverflow.in/321220

If and , then the value of is

A. B. C. D.
isi2015-dcg numerical-ability trigonometry

14.41.2 Trigonometry: ISI2015-DCG-40 https://gateoverflow.in/321184

The equations and , and are arbitrary constants)

represent

A. a circle B. a parabola C. an ellipse D. a hyperbola

isi2015-dcg numerical-ability trigonometry geometry

14.41.3 Trigonometry: ISI2015-DCG-59 https://gateoverflow.in/321164

If in a , , then lies in

A. B.
C. D.
isi2015-dcg numerical-ability geometry trigonometry

14.41.4 Trigonometry: ISI2015-DCG-61 https://gateoverflow.in/321162

The value of is

A. B. C. D. None of these
isi2015-dcg numerical-ability trigonometry

14.41.5 Trigonometry: ISI2015-DCG-62 https://gateoverflow.in/321161

The number of values of for which the equation is satisfied, is

A. B. C. D. more than
isi2015-dcg numerical-ability trigonometry

14.41.6 Trigonometry: ISI2015-DCG-63 https://gateoverflow.in/321160

If and lie in , their sum is equal to

A. B. C. D.
isi2015-dcg numerical-ability trigonometry

© Copyright GATE Overflow. All rights reserved.

128 14 General Aptitude: Numerical Ability (183)

14.41.7 Trigonometry: ISI2015-DCG-64 https://gateoverflow.in/321159

If then equals

A. B. or
C. or D. None of these
isi2015-dcg numerical-ability trigonometry

14.41.8 Trigonometry: ISI2015-DCG-65 https://gateoverflow.in/321158

The value of is

A. B. C. D. None of these
isi2015-dcg numerical-ability trigonometry

14.41.9 Trigonometry: ISI2015-DCG-66 https://gateoverflow.in/321157

If , then equals

A. B. C. D. None of these
isi2015-dcg numerical-ability trigonometry

14.41.10 Trigonometry: ISI2015-MMA-27 https://gateoverflow.in/321850

Let . Then is

A. B. C. D.
isi2015-mma numerical-ability trigonometry non-gate

14.41.11 Trigonometry: ISI2017-DCG-16 https://gateoverflow.in/321071

If , the value of the expression is

A. B. C. D.
isi2017-dcg numerical-ability trigonometry

14.41.12 Trigonometry: ISI2017-DCG-17 https://gateoverflow.in/321070

If , then is equal to

A. B. C. D. none of these
isi2017-dcg numerical-ability trigonometry

14.41.13 Trigonometry: ISI2017-DCG-18 https://gateoverflow.in/321069

If are the sides of , then is equal to

A. B. C. D. none of these
isi2017-dcg numerical-ability trigonometry geometry

14.42 Unit Digit (1)

14.42.1 Unit Digit: ISI2018-DCG-1 https://gateoverflow.in/321056

The digit in the unit place of the number is

A. B. C. D.
isi2018-dcg numerical-ability number-system unit-digit

14.43 Work Time (1)

© Copyright GATE Overflow. All rights reserved.

14 General Aptitude: Numerical Ability (183) 129

14.43.1 Work Time: ISI2016-DCG-70 https://gateoverflow.in/321087

Water pours into a rectangular tank of depth which was initially half-filled. The rate at which the height of
the water rises is inversely proportional to the height of the water at that instant. If the height of the water after an hour
is observed to be , how much time, in hours, will be required to fill up the tank?

A. B. C. D.
isi2016-dcg numerical-ability work-time

© Copyright GATE Overflow. All rights reserved.

130 15 Non GATE: Geometry (47)

15 Non GATE: Geometry (47)

15.1 Area (9)

15.1.1 Area: ISI2014-DCG-20 https://gateoverflow.in/321935

If is the area of the region bounded by the curve and the portion of the -axis between and , then
equals

A. B. C. D.
isi2014-dcg calculus definite-integrals area

15.1.2 Area: ISI2014-DCG-52 https://gateoverflow.in/321903

The area under the curve in the positive quadrant and bounded by the line is equal to

A. B. C. D.
isi2014-dcg curves area

15.1.3 Area: ISI2015-MMA-82 https://gateoverflow.in/321795

The volume of the solid, generated by revolving about the horizontal line the region bounded by ,
and , is

A. B. C. D. none of the above

isi2015-mma area non-gate

15.1.4 Area: ISI2016-DCG-15 https://gateoverflow.in/321142

The shaded region in the following diagram represents the relation

A. B.
C. D.
isi2016-dcg area curves non-gate

15.1.5 Area: ISI2016-DCG-16 https://gateoverflow.in/321141

The set is represented by the shaded region in

A. B. D.
C.
isi2016-dcg curves area non-gate

15.1.6 Area: ISI2016-DCG-52 https://gateoverflow.in/321105

The area bounded by and is

A. B. C. D.
isi2016-dcg curves area non-gate

© Copyright GATE Overflow. All rights reserved.

15 Non GATE: Geometry (47) 131

15.1.7 Area: ISI2017-DCG-29 https://gateoverflow.in/321058

The area (in square unit) of the portion enclosed by the curve and the axes of reference is

A. B. C. D.
isi2017-dcg non-gate geometry area

15.1.8 Area: ISI2017-MMA-1 https://gateoverflow.in/243384

The area lying in the first quadrant and bounded by the circle and lines is given by

A. B. C. D.
isi2017-mmamma circle area non-gate descriptive

15.1.9 Area: ISI2018-DCG-26 https://gateoverflow.in/321031

The area of the region bounded by the curves and -axis in the first quadrant is

A. B. C. D.
isi2018-dcg curves area non-gate

15.2 Centroid (1)

15.2.1 Centroid: ISI2016-MMA-6 https://gateoverflow.in/242724

Find the centroid of the triangle whose sides are given by the following equations:

A. B. C. D.
isi2016-mmamma triangles centroid non-gate

15.3 Cubes (2)

15.3.1 Cubes: ISI2015-MMA-45 https://gateoverflow.in/321832

Angles between any pair of main diagonals of a cube are

A. B.
C. D. none of the above
isi2015-mma cubes non-gate

15.3.2 Cubes: ISI2018-DCG-21 https://gateoverflow.in/321036

A box with a square base of length and height has an open top and its volume is cubic centimetres, as shown in
the figure below. The values of and that minimize the surface area of the box are

A. cm cm B. cm cm
C. cm cm D. none of these.
isi2018-dcg cubes non-gate

15.4 Curves (6)

© Copyright GATE Overflow. All rights reserved.

132 15 Non GATE: Geometry (47)

15.4.1 Curves: ISI2014-DCG-27 https://gateoverflow.in/321928

Let and be two curves. State which one of the

following statements is true.

A. These two curves intersect at two points

B. These two curves are tangent to each other
C. These two curves intersect orthogonally at one point
D. These two curves do not intersect

isi2014-dcg curves

15.4.2 Curves: ISI2015-MMA-47 https://gateoverflow.in/321830

Consider the family of curves in the plane given by , where is a real parameter. Let be the family of
curves having the following property: every member of intersect each member of orthogonally. Then is given
by

A. B. C. D.
isi2015-mma curves

15.4.3 Curves: ISI2015-MMA-64 https://gateoverflow.in/321813

Let the position of a particle in three dimensional space at time be . Then the length of the path
traversed by the particle between the times and is

A. B. C. D. none of the above

isi2015-mma trigonometry curves non-gate

15.4.4 Curves: ISI2015-MMA-75 https://gateoverflow.in/321802

The length of the curve , from to is

A. B. C. D.
isi2015-mma curves non-gate

15.4.5 Curves: ISI2015-MMA-86 https://gateoverflow.in/321791

The coordinates of a moving point satisfy the equations

If the curve passes through the point when , then the equation of the curve in rectangular co-ordinates is

A. B.
C. D.
isi2015-mma trigonometry curves non-gate

15.4.6 Curves: ISI2016-DCG-40 https://gateoverflow.in/321117

The equations and and are arbitrary constants

represent

A. a circle B. a parabola C. an ellipse D. a hyperbola

isi2016-dcg trigonometry curves non-gate

15.5 Ellipses (1)

15.5.1 Ellipses: ISI2016-DCG-42 https://gateoverflow.in/321115

In an ellipse, the distance between its foci is and its minor axis is Then its eccentricity is

A. B. C. D.

© Copyright GATE Overflow. All rights reserved.

15 Non GATE: Geometry (47) 133

isi2016-dcg ellipses non-gate

15.6 Geometry (2)

15.6.1 Geometry: ISI2019-MMA-16 https://gateoverflow.in/311435

If and are the foci of the ellipse and is a point on the ellipse, then the perimeter of the triangle
is
A. B.
C. D. dependent on the coordinates of
isi2019-mma non-gate geometry

15.6.2 Geometry: ISI2019-MMA-17 https://gateoverflow.in/311437

The reflection of the point with respect to the line is

A. B. C. D.
isi2019-mma non-gate geometry

15.7 Hyperbola (1)

15.7.1 Hyperbola: ISI2016-DCG-44 https://gateoverflow.in/321113

If the distance between the foci of a hyperbola is and its eccentricity is then the equation of the hyperbola is

A. B. C. D.
isi2016-dcg hyperbola curves non-gate

15.8 Inverse (2)

15.8.1 Inverse: ISI2016-DCG-66 https://gateoverflow.in/321091

If then is

A. B. C. D. None of these
isi2016-dcg trigonometry inverse non-gate

15.8.2 Inverse: ISI2018-DCG-20 https://gateoverflow.in/321037

The value of is

A. B. C. D.
isi2018-dcg trigonometry inverse non-gate

15.9 Lines (5)

15.9.1 Lines: ISI2015-MMA-46 https://gateoverflow.in/321831

If the tangent at the point with coordinates on the curve is perpendicular to the straight line
, then
A. B.
C. D. no such point exists
isi2015-mma lines non-gate

15.9.2 Lines: ISI2015-MMA-79 https://gateoverflow.in/321798

Let . Then the minimum value of as varies over the line is

A. B. C. D.
isi2015-mma lines non-gate

© Copyright GATE Overflow. All rights reserved.

134 15 Non GATE: Geometry (47)

15.9.3 Lines: ISI2016-DCG-38 https://gateoverflow.in/321119

The length of the chord on the straight line intercepted by the circle passing through the points
and is

A. B. C. D.
isi2016-dcg lines non-gate

15.9.4 Lines: ISI2018-DCG-23 https://gateoverflow.in/321034

Let be the point of intersection of the lines and . Let be the point of reflection of the point
with respect to the -axis. Then the equation of the straight line through that produces a right angled triangle
with , and lies on the line , is

A. B. C. D.
isi2018-dcg lines triangles non-gate

15.9.5 Lines: ISI2018-DCG-25 https://gateoverflow.in/321032

There are three circles of equal diameter ( units each) as shown in the figure below. The straight line passes
through the centres of all the three circles. The straight line is a tangent to the third circle at and cuts the second
circle at the points and as shown in the figure.Then the length of the line segment is

A. units B. units C. units D. units

isi2018-dcg circle lines non-gate

15.10 Parabola (2)

15.10.1 Parabola: ISI2015-MMA-48 https://gateoverflow.in/321829

Suppose the circle with equation cuts the parabola at four distinct
points. If denotes the sum of the ordinates of these four points, then the set of possible values of is

A. B. C. D.
isi2015-mma circle parabola non-gate

15.10.2 Parabola: ISI2016-DCG-41 https://gateoverflow.in/321116

A straight line touches the circle and also the parabola Then the equation of the straight
line is

A. B. C. D.
isi2016-dcg lines parabola non-gate

15.11 Quadrilateral (1)

15.11.1 Quadrilateral: ISI2016-DCG-43 https://gateoverflow.in/321114

Four tangents are drawn to the ellipse at the ends of its latera recta. The area of the quadrilateral so
formed is

A. B. C. D.
isi2016-dcg ellipses quadrilateral area non-gate

© Copyright GATE Overflow. All rights reserved.

15 Non GATE: Geometry (47) 135

15.12 Triangles (5)

15.12.1 Triangles: ISI2015-MMA-32 https://gateoverflow.in/321845

If a square of side and an equilateral triangle of side are inscribed in a circle then equals

A. B. C. D.
isi2015-mma triangles non-gate

15.12.2 Triangles: ISI2016-DCG-39 https://gateoverflow.in/321118

The medians and of the triangle with vertices and are mutually perpendicular if

A. B. C. D.
isi2016-dcg triangles non-gate

15.12.3 Triangles: ISI2016-DCG-59 https://gateoverflow.in/321098

If in a then lies in

A. B.
C. D.
isi2016-dcg geometry triangles trigonometry non-gate

15.12.4 Triangles: ISI2016-DCG-60 https://gateoverflow.in/321097

Which of the following relations is true for the following figure?

A. B. C. D. All of these
isi2016-dcg triangles non-gate

15.12.5 Triangles: ISI2018-DCG-22 https://gateoverflow.in/321035

Let the sides opposite to the angles in a triangle be represented by respectively. If

then the angle is

A. B. C. D.
isi2018-dcg triangles non-gate

15.13 Trigonometry (10)

15.13.1 Trigonometry: ISI2011-PCB-A-1 https://gateoverflow.in/48025

Let be the set of distinct divisors of a positive integer ( includes 1 and ). Then show that
.
hint:

isi2011 descriptive proof trigonometry non-gate

15.13.2 Trigonometry: ISI2015-MMA-35 https://gateoverflow.in/321842

If and then

A. and agree at no points B. and agree at exactly one point

C. and agree at exactly two points D. and agree at more than two points
isi2015-mma trigonometry non-gate

© Copyright GATE Overflow. All rights reserved.

136 15 Non GATE: Geometry (47)

15.13.3 Trigonometry: ISI2015-MMA-49 https://gateoverflow.in/321828

The polar equation represents

A. a spiral B. a parabola C. a circle D. none of the above

isi2015-mma trigonometry non-gate

15.13.4 Trigonometry: ISI2016-DCG-5 https://gateoverflow.in/321152

If and then the value of is

A. B. C. D.
isi2016-dcg trigonometry non-gate

15.13.5 Trigonometry: ISI2016-DCG-61 https://gateoverflow.in/321096

The value of is

A. B. C. D. None of these
isi2016-dcg trigonometry non-gate

15.13.6 Trigonometry: ISI2016-DCG-62 https://gateoverflow.in/321095

The number of values of for which the equation is satisfied is

A. B. C. D. more than
isi2016-dcg trigonometry non-gate

15.13.7 Trigonometry: ISI2016-DCG-63 https://gateoverflow.in/321094

If and lie in their sum is equal to

A. B. C. D.
isi2016-dcg trigonometry non-gate

15.13.8 Trigonometry: ISI2016-DCG-64 https://gateoverflow.in/321093

If then equals

A. B. or
C. or D. None of these
isi2016-dcg trigonometry non-gate

15.13.9 Trigonometry: ISI2016-DCG-65 https://gateoverflow.in/321092

The value of is

A. B. C. D. None of these
isi2016-dcg trigonometry non-gate

15.13.10 Trigonometry: ISI2018-DCG-18 https://gateoverflow.in/321039

If the expression can be written as

A. B.
C. D.
isi2018-dcg trigonometry non-gate

© Copyright GATE Overflow. All rights reserved.

16 Non GATE: Others (39) 137

16 Non GATE: Others (39)

16.1 Complex Number (4)

16.1.1 Complex Number: ISI2015-MMA-21 https://gateoverflow.in/321856

Let denote a complex fifth root of unity. Define

for . Then is equal to

A. B. C. D.
isi2015-mma complex-number non-gate

16.1.2 Complex Number: ISI2015-MMA-83 https://gateoverflow.in/321794

If are complex numbers then the maximum value of is

A.
B.
C. the expression may not always be a real number and hence maximum does not make sense
D. none of the above

isi2015-mma complex-number non-gate

16.1.3 Complex Number: ISI2016-MMA-2 https://gateoverflow.in/242728

How many complex numbers are there such that and ?

A. B. C. D.
isi2016-mmamma complex-number non-gate

16.1.4 Complex Number: ISI2019-MMA-21 https://gateoverflow.in/311469

A function is called degenerate on , if remains constant when varies . Define

,
where . Then which of the following statements is true?

A. is degenerate on both and

B. is degenerate on but not on
C. is degenerate on but not on
D. is neither degenerate on nor on

isi2019-mma complex-number

16.2 Convergence Divergence (2)

16.2.1 Convergence Divergence: ISI2015-MMA-56 https://gateoverflow.in/321821

Let be a sequence of non-negative real numbers such that the series is convergent. If is a real number
such that the series diverges, then

A. must be strictly less than

B. must be strictly less than or equal to
C. must be strictly less than or equal to but can be greater than

© Copyright GATE Overflow. All rights reserved.

138 16 Non GATE: Others (39)

D. must be strictly less than but can be greater than or equal to

isi2015-mma convergence-divergence non-gate

16.2.2 Convergence Divergence: ISI2016-MMA-22 https://gateoverflow.in/242708

The infinite series converges if and only if

A. B.
C. D.
isi2016-mmamma sequence-series convergence-divergence summation non-gate

16.3 Curves (1)

16.3.1 Curves: ISI2014-DCG-40 https://gateoverflow.in/321915

Let the following two equations represent two curves and .

Further, let and be the tangents to these curves and , respectively, at the point . Then the angle between these
two tangents, and , is

A. B. C. D.
isi2014-dcg curves

16.4 Differential Equation (7)

16.4.1 Differential Equation: ISI2015-MMA-87 https://gateoverflow.in/321790

If is a solution of

and , then is equal to

A. B.
C. D.
isi2015-mma differential-equation non-gate

16.4.2 Differential Equation: ISI2015-MMA-89 https://gateoverflow.in/321788

Let be a non-trivial solution of the second order linear differential equation

where , and . Then

A. as
B. as
C. exists and is finite
D. none of the above is true

isi2015-mma differential-equation non-gate

16.4.3 Differential Equation: ISI2015-MMA-90 https://gateoverflow.in/321787

The differential equation of the system of circles touching the -axis at the origin is

A. B.
C. D.
isi2015-mma differential-equation non-gate

© Copyright GATE Overflow. All rights reserved.

16 Non GATE: Others (39) 139

16.4.4 Differential Equation: ISI2015-MMA-91 https://gateoverflow.in/321786

Suppose a solution of the differential equation

satisfies the initial condition . Then the value of when is

A. B. C. D.
isi2015-mma differential-equation non-gate

16.4.5 Differential Equation: ISI2017-DCG-24 https://gateoverflow.in/321063

The differential equation with has

A. unique solution B. no solution

C. infinite number of solutions D. none of these
isi2017-dcg engineering-mathematics calculus non-gate differential-equation

16.4.6 Differential Equation: ISI2018-MMA-25 https://gateoverflow.in/311883

The solution of the differential equation

is

A. B.
C. D.
isi2018-mma non-gate differential-equation

16.4.7 Differential Equation: ISI2019-MMA-18 https://gateoverflow.in/311439

For the differential equation

It is given that when . When , is given by

A. B.

C. D.

isi2019-mma non-gate engineering-mathematics calculus differential-equation

16.5 Differentiation (2)

16.5.1 Differentiation: ISI2014-DCG-49 https://gateoverflow.in/321906

Let , where . Then the derivative of is equal to

A.

B.

C.

D.

isi2014-dcg calculus differentiation functions

© Copyright GATE Overflow. All rights reserved.

140 16 Non GATE: Others (39)

16.5.2 Differentiation: ISI2016-MMA-26 https://gateoverflow.in/242704

Let and be real numbers satisfying . Then is maximum when

A. B. C. D.
isi2016-mma differentiation non-gate

16.6 Ellipses (3)

16.6.1 Ellipses: ISI2014-DCG-14 https://gateoverflow.in/321941

represents
A. A pair of circles having the same B. A circle and an ellipse
radius
C. A pair of circles having different radii D. none of the above
isi2014-dcg circle ellipses

16.6.2 Ellipses: ISI2015-DCG-42 https://gateoverflow.in/321182

In an ellipse, the distance between its foci is and its minor axis is . hen its eccentricity is

A. B. C. D.
isi2015-dcg geometry ellipses

16.6.3 Ellipses: ISI2015-MMA-85 https://gateoverflow.in/321792

The differential equation of all the ellipses centred at the origin is

A. B.
C. D. none of these
isi2015-mma differential-equation ellipses non-gate

16.7 Functions (1)

16.7.1 Functions: ISI2015-MMA-67 https://gateoverflow.in/321810

Given two real numbers , let . Then the function

satisfies

A. for every
B. for every
C. if and if
D. if and if

isi2015-mma functions non-gate

16.8 General Solution (1)

16.8.1 General Solution: ISI2015-MMA-88 https://gateoverflow.in/321789

Let be a given differentiable function. Consider the following differential equation in

The general solution of this equation is given by

A. B. C. D.
isi2015-mma differential-equation general-solution non-gate

16.9 Hyperbola (2)

© Copyright GATE Overflow. All rights reserved.

16 Non GATE: Others (39) 141

16.9.1 Hyperbola: ISI2014-DCG-59 https://gateoverflow.in/321896

The equation represents

A. an ellipse with the coordinates of foci being

B. a hyperbola with the coordinates of foci being
C. an ellipse with the coordinates of foci being
D. a hyperbola with the coordinates of foci being

isi2014-dcg hyperbola ellipses non-gate

16.9.2 Hyperbola: ISI2015-DCG-44 https://gateoverflow.in/321180

If the distance between the foci of a hyperbola is and its eccentricity is , then the equation of the hyperbola is

A. B. C. D.
isi2015-dcg geometry hyperbola

16.10 Inequality (3)

16.10.1 Inequality: ISI2015-MMA-50 https://gateoverflow.in/321827

Let

Then
A. B.
C. D.
isi2015-mma inequality non-gate

16.10.2 Inequality: ISI2015-MMA-65 https://gateoverflow.in/321812

Let be a positive real number and be a positive integer. Which of the following inequalities is true?

A. B.
C. D. none of the above

isi2015-mma inequality non-gate

16.10.3 Inequality: ISI2015-MMA-66 https://gateoverflow.in/321811

The smallest positive number for which the inequality holds for all and is

A.
B.
C.
D. there is no smallest positive value of ; any will make the inequality hold.

isi2015-mma inequality trigonometry non-gate

16.11 Parabola (2)

16.11.1 Parabola: ISI2014-DCG-57 https://gateoverflow.in/321898

If a focal chord of the parabola cuts it at two distinct points and , then

A. B. C. D.
isi2014-dcg parabola non-gate

© Copyright GATE Overflow. All rights reserved.

142 16 Non GATE: Others (39)

16.11.2 Parabola: ISI2015-DCG-41 https://gateoverflow.in/321183

A straight line touches the circle and also the parabola . Then the equation of the straight line
is

A. B. C. D.
isi2015-dcg geometry parabola

16.12 Partial Derivatives (3)

16.12.1 Partial Derivatives: ISI2015-MMA-68 https://gateoverflow.in/321809

Let

Then is

A. not continuous at
B. continuous at but does not have first order partial derivatives
C. continuous at and has first order partial derivatives, but not differentiable at
D. differentiable at

isi2015-mma partial-derivatives non-gate

16.12.2 Partial Derivatives: ISI2015-MMA-70 https://gateoverflow.in/321807

Let where and . Then is

A. B. C. D.
isi2015-mma partial-derivatives non-gate

16.12.3 Partial Derivatives: ISI2015-MMA-71 https://gateoverflow.in/321806

Let

Then

A. is continuous at and exists

B. is not continuous at and exists
C. is continuous at and does not exist
D. is not continuous at and does not exist

isi2015-mma continuity partial-derivatives non-gate

16.13 Quadratic Equations (1)

16.13.1 Quadratic Equations: ISI 2015 PCB A2 https://gateoverflow.in/120480

Find all real solutions of the equation

engineering-mathematics quadratic-equations isi2015

16.14 Quadrilateral (1)

16.14.1 Quadrilateral: ISI2015-DCG-43 https://gateoverflow.in/321181

Four tangents are drawn to the ellipse at the ends of its latera recta. The area of the quadrilateral so

© Copyright GATE Overflow. All rights reserved.

16 Non GATE: Others (39) 143

formed is

A. B. C. D.
isi2015-dcg geometry ellipses quadrilateral

16.15 Sequence Series (1)

16.15.1 Sequence Series: ISI2018-MMA-23 https://gateoverflow.in/311863

For , let and ,where for all

integer and . Then

A. both and are Cauchy sequences

B. is a Cauchy sequence,and is not Cauchy sequence
C. is not a Cauchy sequence,and is Cauchy sequence
D. neither nor is a Cauchy sequence.

isi2018-mma sequence-series non-gate

16.16 Summation (2)

16.16.1 Summation: ISI2015-MMA-54 https://gateoverflow.in/321823

If , then the sum of the infinite series is

A. B.
C. D.
isi2015-mma summation non-gate

16.16.2 Summation: ISI2015-MMA-84 https://gateoverflow.in/321793

For positive real numbers , let

Then

A. B. C. D. none of the above

isi2015-mma summation non-gate

16.17 Trignometry (3)

16.17.1 Trignometry: ISI2019-MMA-7 https://gateoverflow.in/311426

The value of – is

A. B. C. D.
isi2019-mma non-gate trignometry

16.17.2 Trignometry: ISI2019-MMA-8 https://gateoverflow.in/311427

For , the number of solutions of the equation

is

A. B. C. D.
isi2019-mma non-gate trignometry

© Copyright GATE Overflow. All rights reserved.

144 16 Non GATE: Others (39)

16.17.3 Trignometry: ISI2019-MMA-9 https://gateoverflow.in/311428

is equal to

A. B.
C. D.
isi2019-mma non-gate trignometry

© Copyright GATE Overflow. All rights reserved.

17 Operating System (15) 145

17 Operating System (15)

17.1 Bankers Algorithm (1)

17.1.1 Bankers Algorithm: ISI2017-PCB-CS-5(a) https://gateoverflow.in/245030

An operating system contains three resource classes. The number of resource units in these classes are
respectively. The current resource allocation state is shown below:

i. Is the current allocation state safe? Justify.

ii. If process now requests resources, then what will be the status of the new state?

isi2017-pcb-cs operating-system bankers-algorithm descriptive

17.2 Concurrency (2)

17.2.1 Concurrency: CMI2010-A-09 https://gateoverflow.in/46141

Consider the following functions and

f(){
w = 3;
w = 4;
}

g(){
z = w;
z = z + 2*w;
print(z);
}

We start with set to and execute and in parallel-that is, at each step we either execute one statement from or
one statement from . What is the set of possible values printed by

A.
B.
C.
D.

cmi2010 operating-system concurrency

17.2.2 Concurrency: CMI2011-A-10 https://gateoverflow.in/46197

Consider the following functions and :

f(){ g(){
x = x+1; y = y+1;
x = y*y; y = x*x;
x = x-y; y = y-x;
} }

Suppose we start with initial values of for and for and then execute and in parallel-that is, at each step we either
execute one statement from or one statement from Which of the following is not a possible final state?
A. B.
C. D.
cmi2011 operating-system concurrency

17.3 Demand Paging (1)

© Copyright GATE Overflow. All rights reserved.

146 17 Operating System (15)

17.3.1 Demand Paging: ISI2016-PCB-CS-3 https://gateoverflow.in/244399

Consider the following extract from a program, written in a C-like language, that computes the transpose of a matrix.
for (i=0; i<N; i++)
for (j=0; j<N; j++)
B[i,j]=A[i,j];

and are matrices with floating point entries that are stored in memory in row-major order as shown in the
example below:
A[N-
A[0,N-
A[0,0] A[0,1] A[0,2] ... A[1,0] A[1,1] ... 1,N-
1]
1]
This program runs under an OS that uses demand-paging. Considering memory references to the matrix entries, and
using the information given below, compute the page fault rate for the matrix transposition code given above.

Page size: bytes

Number of frames allocated to the program: 8
Page replacement policy: LRU

Size of each matrix entry: 8 bytes

Each of and is stored starting from the beginning of a page
None of the pages allocated to and are initially in memory.

isi2016-pcb-cs operating-system demand-paging page-fault non-gate descriptive

17.4 Memory Management (1)

17.4.1 Memory Management: ISI2012-PCB-CS-1a https://gateoverflow.in/47840

In a Buddy memory allocation system, a process is allocated an amount of memory whose size is the smallest power of
that is greater than or equal to the amount requested by the process.
A system using buddy memory allocation has memory. For a given sequence of nine processes, their respective memory
requirements in are

i. Illustrate with an allocation diagram to justify whether all the requests, in the given order, can be complied with. Assume
that memory once allocated to a process is no longer available during the entire span of the above sequence.
ii. Calculate the total memory wasted due to fragmentation in your memory allocation by the above scheme.

descriptive isi2012-pcb-cs operating-system memory-management

17.5 Pipelining (1)

17.5.1 Pipelining: ISI2018-PCB-CS8 https://gateoverflow.in/311931

Consider a -stage instruction pipeline. The stages and the corresponding stage delays are given below.

Assume that there is no delay between two consecutive stages. Consider a processor with a branch prediction mechanism by
which it is always able to correctly predict the direction of the branch at the stage itself, without executing the branch
instruction.A program consisting of a sequence of instructions , is executed in the pipeline, where the
instruction is the only branch instruction and its branch target is the instruction .

a. Draw the pipeline diagram over time showing how the instructions flow through the pipeline stages in this
processor.
b. Calculate the time needed to execute the program.

© Copyright GATE Overflow. All rights reserved.

17 Operating System (15) 147

isi2018-pcb-cs co-and-architecture pipelining descriptive

17.6 Process Schedule (3)

17.6.1 Process Schedule: ISI2014-PCB-CS-7a https://gateoverflow.in/47451

Consider a uniprocessor system with four processes having the following arrival and burst times:

i. Calculate the average waiting time and also the average turnaround time if shortest (remaining) job first (SJF) scheduling
policy is used with pre-emption. Assume that the context switching time is zero. Note that in SJF, if at any point there is a
tie, then the job that arrived earlier will get priority.
ii. Now consider the continuous arrival of new jobs at times following , with CPU burst times of units
each. In this case, what will be the turnaround time of ? Justify your answer

isi2014-pcb-cs descriptive operating-system process-schedule

17.6.2 Process Schedule: ISI2015-PCB-CS-6-b https://gateoverflow.in/47333

Consider scheduling processes which are created in this order at almost the same instant. Assume
that all processes have exactly one CPU burst of duration units (and no I/O bursts). Compute the average waiting
time and average turn-around time if the scheduling policy is:

i. FCFS
ii. RR with time slice units .

Assume that it takes units of time to switch from one running process to another and units of time to switch from a
terminated process to a running process.

descriptive isi2015-pcb-cs operating-system process-schedule

17.6.3 Process Schedule: ISI2018-PCB-CS7 https://gateoverflow.in/311929

A context switch from a process to a process consists of the following steps:

1. Step I:saving the context of ;

2. Step II: running the scheduling algorithm to pick ;
3. Step III: restoring the saved context of .

Suppose Steps I and III together take units of time. The scheduling algorithm takes units of time, where is the
number of ready-to-run processes. The scheduling policy is round-robin with a time slice of ms. Compute the CPU
utilization for the following scenario: processes become ready at almost the same instant in the order each
process requires exactly one CPU burst of ms and no I/O burst.

isi2018-pcb-cs operating-system process-schedule descriptive

17.7 Process Synchronization (4)

17.7.1 Process Synchronization: CMI2012-A-10 https://gateoverflow.in/46540

Consider the following functions and .

f(){ g( ) {
x = x-50; a = a+x;
y = y+50; a = a+y;
} }

Suppose we start with initial values of for for , and for , and then execute and in parallel - that is, at each
step we either execute one statement from or one statement from . Which of the following is not a possible final value of ?

A. B. C. D.
cmi2012 operating-system process-synchronization

17.7.2 Process Synchronization: ISI2011-PCB-CS-5c https://gateoverflow.in/48178

One of your classmates has suggested the following modified version of a standard scheme for solving the -process

© Copyright GATE Overflow. All rights reserved.

148 17 Operating System (15)

critical section problem (CSP).

shared char want[2] = {0,0};
shared int turn = 0;
1. P_i()
2. { while (1) {
3. turn = j;
4. want[i] = 1;
5. while (want[j] && turn!=i);
6. critical_section();
7. want[i] = 0;
8. remainder_section();
9. }
10. }

Show that the above scheme does not guarantee mutual exclusion by constructing an appropriate interleaved sequence of
instructions executed by two processes and .
Modify the above scheme so that it becomes a correct solution to the -process CSP.

isi2011-pcb-cs descriptive operating-system process-synchronization normal

17.7.3 Process Synchronization: ISI2012-PCB-CS-1b https://gateoverflow.in/47845

Two processes and have a common shared variable count. While increments it, decrements it. Given that
is a register, the corresponding assembly language codes are:
count-
count++
-
MOV MOV
ADD #1 SUB #1
MOV MOV

Give an example to justify whether a race condition may occur if and are executed simultaneously.

descriptive isi2012-pcb-cs operating-system process-synchronization

17.7.4 Process Synchronization: ISI2013-PCB-CS-5a https://gateoverflow.in/47639

Suppose that an operating system provides two functions, which puts the calling process on the blocked queue,
and which moves process to the runnable queue if it is currently on the blocked queue (otherwise, its
behaviour is unpredictable). Consider two processes and running the code given below. The intended behaviour of the
code is to have and run forever, alternately printing their names on the screen.

i. Construct a scenario in which the intended behaviour would not be observed.

ii. Redesign the code using semaphore(s) so that it works correctly. You should show the initialisation of the semaphore(s),
and the calls to and made by and .

descriptive isi2013-pcb-cs operating-system process-synchronization

© Copyright GATE Overflow. All rights reserved.

17 Operating System (15) 149

17.8 Resource Allocation (1)

17.8.1 Resource Allocation: ISI2013-PCB-CS-5b https://gateoverflow.in/47644

A system has processes , , , and allocatable resources . The maximum resource

requirement for each process and its current allocation are as follows:

Suppose the currently available count of resources is given by . What is the minimum value of for which this
is a safe state? Justify your answer.
descriptive isi2013-pcb-cs operating-system resource-allocation

17.9 Tlb (1)

17.9.1 Tlb: ISI2017-PCB-CS-5(b) https://gateoverflow.in/309308

Consider a paging system with the page table stored in memory. If a memory reference takes nanoseconds, how
long does a paged memory reference take? If we add a Translation Lookaside Buffer (TLB) and percent of all page-
table references are TLB hits, what will then be the effective memory reference time? Assume that finding a page-table entry in
the TLB takes nanoseconds, if the entry is present.
isi2017-pcb-cs operating-system paging tlb descriptive

© Copyright GATE Overflow. All rights reserved.

150 18 Programming and DS: DS (13)

18 Programming and DS: DS (13)

18.1 Arrays (1)

18.1.1 Arrays: ISI 2015 PCB C2 B https://gateoverflow.in/120886

You are given a array of size . Your are told that comprises three consecutive runs - first a run of 's, then a run
of 's and finally a run of 's. Moreover, you are provided an index of such that . Design an time
algorithm to determine the number of 's (i.e., length of the second run) in .
data-structures arrays isi2015

18.2 Avl Tree (1)

18.2.1 Avl Tree: ISI2012-PCB-CS-5b https://gateoverflow.in/48015

Let be an AVL tree for storing a set of integers. Insertions and deletions in can hence be done in time.
Given two integers and , you have to output nab, the number of integers in T whose value lies within
in time.

i. For this purpose, what modification of and its insertion algorithm are required?
ii. Give a pseudo-code for computing .

descriptive isi2012-pcb-cs data-structures avl-tree

18.3 Binary Search Tree (2)

18.3.1 Binary Search Tree: CMI2013-A-03 https://gateoverflow.in/46593

When a user submits a query, a search engine does the following. For every webpage that has been visited by the search
engine, it computes a score indicating how relevant that page is to the query. Finally, it reports the pages with the top k
scores on the screen, for a number specified by the user. A good data structure for accumulating the scores and ranking them
is:

A. a queue B. a heap C. a stack D. a binary search tree

cmi2013 data-structures binary-search-tree

18.3.2 Binary Search Tree: CMI2017-A-09 https://gateoverflow.in/203285

Suppose we constructed the binary search tree shown below by starting with an empty tree and inserting one element at
a time from an input sequence, without any rotations or other manipulations. Which of the following assertions about
the order of elements in the input sequence be true?

A. came after and came after . B. came before and came after .
C. came after and came before D. came before and came before
. .
cmi2017 data-structures binary-search-tree

18.4 Binary Tree (1)

18.4.1 Binary Tree: ISI2014-PCB-CS-2a https://gateoverflow.in/47437

Let be a rooted binary tree of nodes. Two nodes of are said to be a sibling pair if they are the children of the
same parent. For example, given the binary tree in Figure 1, the sibling pairs are (2, 3) and (6, 7). Design an time
algorithm that prints all the sibling pairs of .

© Copyright GATE Overflow. All rights reserved.

18 Programming and DS: DS (13) 151

descriptive isi2014-pcb-cs data-structures binary-tree

18.5 Heap (1)

18.5.1 Heap: ISI2014-PCB-CS-2b https://gateoverflow.in/47438

Let and be two complete binary trees that are heaps as well. Assume and are max-heaps, each of size .
Design and analyze an efficient algorithm to merge and to a new max-heap of size .
descriptive isi2014-pcb-cs algorithms binary-tree heap

18.6 Linked Lists (4)

18.6.1 Linked Lists: CMI2010-B-07a https://gateoverflow.in/46124

A finite sequence of bits is represented as a list with values from the set {0,1}—for example, [0,1,0], [1,0,1,1], . . . .
[ ] denotes the empty list, and [b] is the list consisting of one bit b. The function returns the length (number
of bits) in the list . For a nonempty list , returns the first element of l, and tail(l) returns the list obtained by removing
the first element from l. The operator ++ denotes list concatenation.
For example:
head([0,1,0]) = 0, tail([0,1,0]) = [1,0],
head([1]) = 1, tail([1]) = [ ], and
[0,1,0]++[1] = [0,1,0,1].
Consider the following functions:
takes as input two bits and returns a bit.
op(a,b)
if (a = b) return(0)
else return(1)
endif

takes as input two lists and returns a list.

mystery1(s,t)
if (length(s) != length(t)) then return(t)
else if (length(s) = 0) then return(s)
else return([op(head(s),head(t))] ++ mystery1(tail(s),tail(t)))
endif
endif

takes as input two lists and outputs a list.

mystery2(s,t)
if (length(t) = 0) then return(s)
else return( mystery1(mystery2(s,tail(t)),mystery2(s,tail(t))))
endif

i. What is the value of

in terms of
and
?

cmi2010 descriptive linked-lists

18.6.2 Linked Lists: CMI2011-B-07a https://gateoverflow.in/46306

A finite sequence of bits is represented as a list with values from the set —for example,
denotes the empty list, and is the list consisting of one bit . For a nonempty list
returns the first element of , and returns the list obtained by removing the first element from denotes
a new list formed by adding a at the head of list .
For example:
,

© Copyright GATE Overflow. All rights reserved.

152 18 Programming and DS: DS (13)

and
.
Consider the following functions:
takes takes as input two bits and returns a bit.
xor(a,b)
if (a == b) return(0)
else return(1)
endif

takes as input a list and returns another list.

f1(s)
if (s == []) then return([1])
else if (head(s) == 0) then return(1:tail(s))
else if (head(s) == 1) then return(0:f1(tail(s)))
endif

takes as input a bit and a list and returns a bit.

f2(b,s)
if (s == [ ]) then return(b)
else if (head(s) == 0) then return(f2(xor(b,1),tail(s)))
else if (head(s) == 1) then return(xor(b,1))
endif

takes as input a nonnegative number and returns a list.

g1(n)
if (n == 0) then return([0])
else return f1(g1(n-1))
endif

takes as input a nonnegative number and returns a bit.

g2(n)
if (n == 0) then return(0)
else return f2(g2(n-1),g1(n))
endif

What is the value of and ?

cmi2011 descriptive linked-lists

18.6.3 Linked Lists: CMI2012-B-07 https://gateoverflow.in/46590

We use the notation to denote a list of integers. denotes the empty list, and is the list consisting
of one integer . For a nonempty list l, returns the first element of , and returns the list obtained by
removing the first element from . The function returns the length of a list. For example,

.
.
.

We use or, and and not to denote the usual operations on boolean values and .
Consider the following functions, each of which takes a list of integers as input and returns a boolean value.
f(l)
if (length(l) < 2) then return(true)
else return(g(l) or h(l))
g(l)
if (length(l) < 2) then return(true)
else
if (head(l) < head(tail(l)) then return h(tail(l))
else return(false)
h(l)
if (length(l) < 2) then return(true)
else
if (head(l) > head(tail(l)) then return g(tail(l))
else return(false)

When does return the value true for an input ? Explain your answer.

cmi2012 descriptive data-structures linked-lists

© Copyright GATE Overflow. All rights reserved.

18 Programming and DS: DS (13) 153

18.6.4 Linked Lists: ISI2015-PCB-CS-3a https://gateoverflow.in/47273

Consider a linked list containing nodes, where each node contains two pointers and . For each node,
points to the next node of the list. Describe how pointer should be set up for each node so that you will be
able to locate the -th node from the start node in the list traversing no more than nodes.

descriptive isi2015-pcb-cs data-structures linked-lists

18.7 Queues (1)

18.7.1 Queues: CMI2018-B-7 https://gateoverflow.in/320456

A First In First Out queue is a data structure supporting the operation Enque, Deque, Print, Enque(x) adds the item
to the tail of the queue. Deque removes the element at the head of the queue and returns its value. Print prints the head
of the queue.

A. You are given a queue containing elements. Using a single additional temporary variable write down a sequence of
statements each being one of Enque, Deque, Print so that the output of the program results in the elements of the queue
being printed in reverse order.
B. If the queue had elements to begin with, how many statements would you need to print the queue in reverse order?

cmi2018 data-structures queues descriptive

18.8 Trees (2)

18.8.1 Trees: CMI2019-A-3 https://gateoverflow.in/320551

Suppose that the figure to the right is a binary search tree. The letters indicate the names of the nodes, not the values
that are stored. What is the predecessor node, in terms of value, of the root node

A. B. C. D.
cmi2019 data-structures trees binary-search-tree

18.8.2 Trees: ISI2016-PCB-CS-1 https://gateoverflow.in/244401

i. Consider the array that represents a heap. Draw the heap after removing the element
ii. List all the distinct integer keys such that, when is inserted in the Binary Search Tree of Figure its height increases.
Note that you are not allowed to insert an already existing key again. Justify your answer.

isi2016-pcb-cs trees binary-search-tree descriptive

© Copyright GATE Overflow. All rights reserved.

154 19 Programming and DS: Programming (14)

19 Programming and DS: Programming (14)

19.1 Identify Function (4)

19.1.1 Identify Function: CMI2016-A-6 https://gateoverflow.in/98373

In the code fragment given below, start and end are integer values and prime(x) is a function that returns true if x is a
prime number and false otherwise.
i:=0; j:=0; k:=0;
from (m := start;
m <= end;
m := m+1){
if (prime(m)){
i := i+m;
k := k-m;
}else{
j :=j-m;
k := k+m;
}
}

At the end of the loop:

A. B.
C. D. Depends on start and end
cmi2016 identify-function

19.1.2 Identify Function: CMI2018-A-10 https://gateoverflow.in/320483

What does the following function compute in terms of and , for integer value of and Note that
denotes the quotient(integer part) of for integers and . For instance is
function foo(n,d){
x := 0;
while (n >= 1) {
x := x+1;
n := n//d;
}
return(x);
}

A. The number of ways of choosing elements from a set of size

B. The number of ways of rearranging elements from a set of size
C. The number of digits in the base representation of
D. The number of ways of partitioning elements into groups of size

cmi2018 identify-function

19.1.3 Identify Function: CMI2019-A-10 https://gateoverflow.in/320544

The next two questions refer to the following program.

In the code below reverse takes an array indices and with and reverses the segment
For instance if then, after we apply reverse the contents of the
array will be
function mystery (A[0...99]) {
int i, j, m;
for (i = 0; i < 100; i++) {
m = i;
for (j = i; j < 100; j++) {
if (A[j] > A[m]) {
m = j;
}
}
reverse(A,i,m);
}
return;
}

The number of times the test is executed is:

A. B.

© Copyright GATE Overflow. All rights reserved.

19 Programming and DS: Programming (14) 155

C. D. Depends on the contents of

cmi2019 identify-function

19.1.4 Identify Function: CMI2019-A-9 https://gateoverflow.in/320545

The next two questions refer to the following program.

In the code below reverse takes an array indices and with and reverses the segment
For instance if then, after we apply reverse the contents of the
array will be
function mystery (A[0...99]) {
int i, j, m;
for (i = 0; i < 100; i++) {
m = i;
for (j = i; j < 100; j++) {
if (A[j] > A[m]) {
m = j;
}
}
reverse(A,i,m);
}
return;
}

When the procedure terminates, the array A has been:

A. Sorted in descending order B. Sorted in ascending order
C. Reversed D. Left unaltered
cmi2019 identify-function

19.2 Lifetime (1)

19.2.1 Lifetime: CMI2016-A-10 https://gateoverflow.in/98380

Which of the following relationships holds in general between the of a variable and the of a variable (in
a language like C or Java)?

A. The scope of a variable is contained in the lifetime of the variable

B. The scope of a variable is same as the lifetime of the variable
C. The lifetime of a variable is disjoint from the scope of the variable
D. None of the above

cmi2016 programming-in-c scoping-rule lifetime

19.3 Output (3)

19.3.1 Output: CMI2017-A-06 https://gateoverflow.in/203266

What does the following function compute in terms of and , for integer values of ? Note that the operation
denotes floating point division, even if the arguments are both integers.
function foo(n,d){
if (d == 0){
return 1;
}else{
if (d < 0){
return foo(n,d+1)/n;
}else{
return n*foo(n,d-1);
}}}

A. if , if . B. for all the values of .

C. if , if . D. for all the values of .
cmi2017 programming output

19.3.2 Output: CMI2017-A-07 https://gateoverflow.in/203275

Consider the following functions f() and g().

f(){ g(){
w=5; z=w+1;
w=2*z+2; z=3*z-w;

© Copyright GATE Overflow. All rights reserved.

156 19 Programming and DS: Programming (14)

} print(z);
}

We start with and set to and execute and in parallel—that is, at each step we either execute one statement from
or one statement from . Which of the following is not a possible value printed by ?

A. B. C. D.
cmi2017 programming output

19.3.3 Output: ISI2016-PCB-CS-5 https://gateoverflow.in/244397

What will be the output of the following C program? If you think it will give a runtime error, you need to mention it. In
either case, your answer must include proper justifications without which no credit will be given.
#include<stdio.h>
main()
{
unsigned char i, j, a[]={1, 2, 3, 4, 5};
int n;
i=j=n=5;
while(i-- !=0) n+=a[i];
while(j++ !=0) n+=2;
printf("i=%d, j=%d, n=%d\n", i, j, n);
while(j-- !=0) a[0]+=n;
printf("j=%d, a[0]=%d\n", j, a[0]);
}

isi2016-pcb-cs programming-in-c output non-gate descriptive

19.4 Programming In C (5)

19.4.1 Programming In C: ISI2015-PCB-CS-1a https://gateoverflow.in/47268

Consider the following C program.

#include <stdio.h>
main() {
int arr[] = {1, 1, 2, 4, 8, 16, 32, 64};
int i, j, val, t = 16;
unsigned char c;
for (i = 0; i < 256; i++) {
c = i;
val = 0;
for (j = 0; j < 8; j++)
val = val + ((c >> j) & 0x1)*arr[j];
if (val == t)
printf("%d\n", i);
}
}

Trace the execution of the code inside the for loop indexed by i when i = 35.

descriptive isi2015-pcb-cs programming-in-c

19.4.2 Programming In C: ISI2015-PCB-CS-1b https://gateoverflow.in/47269

Consider the following C program.

#include <stdio.h>
main() {
int arr[] = {1, 1, 2, 4, 8, 16, 32, 64};
int i, j, val, t = 16;
unsigned char c;
for (i = 0; i < 256; i++) {
c = i;
val = 0;
for (j = 0; j < 8; j++)
val = val + ((c >> j) & 0x1)*arr[j];
if (val == t)
printf("%d\n", i);
}
}

What will be the output of the program? Justify your answer.

© Copyright GATE Overflow. All rights reserved.

19 Programming and DS: Programming (14) 157

descriptive isi2015-pcb-cs programming-in-c

19.4.3 Programming In C: ISI2015-PCB-CS-1c https://gateoverflow.in/47270

Consider the following C program.

#include <stdio.h>
main() {
int arr[] = {1, 1, 2, 4, 8, 16, 32, 64};
int i, j, val, t = 16;
unsigned char c;
for (i = 0; i < 256; i++) {
c = i;
val = 0;
for (j = 0; j < 8; j++)
val = val + ((c >> j) & 0x1)*arr[j];
if (val == t)
printf("%d\n", i);
}
}

What will be the output of the program if t = 130 (instead of 16)? Justify.

descriptive isi2015-pcb-cs programming-in-c

19.4.4 Programming In C: ISI2017-PCB-CS-2(a) https://gateoverflow.in/245033

Write a complete ANSI C code using recursion to calculate the of the digits of an integer number (i) consisting
of maximum 5 digits. For example, (1) = if , then your program should print , (2) if , then
.
isi2017-pcb-cs programming programming-in-c descriptive

19.4.5 Programming In C: ISI2017-PCB-CS-2(b) https://gateoverflow.in/309303

Write a program to fins all permutations of a string (having at most 6 characters). For example, a string of
characters like has 6 possible permutations:
isi2017-pcb-cs programming programming-in-c descriptive

19.5 Recursion (1)

19.5.1 Recursion: ISICAL MTech 2014 CS https://gateoverflow.in/27885

How many asterisks in terms of will be printed by the following C function, when called as where
Justify your answer.
Assume that bytes are used to store an integer in C and is such that can be stored in bytes.
void count(int n){
printf("*");

if(n>1){
count(n/3);
count(n/3);
count(n/3);
}
}

programming-in-c recursion isi2014

© Copyright GATE Overflow. All rights reserved.

158 20 Theory of Computation (43)

20 Theory of Computation (43)

20.1 Closure Property (3)

20.1.1 Closure Property: CMI2016-A-3 https://gateoverflow.in/98365

For a regular expression , let be the language generated by . If is an expression that has no Kleene star
occurring in it, which of the following is true about in general?
A. is empty B. is finite
C. Complement of is empty D. B o t h and its complement are
infinite
cmi2016 regular-languages regular-expressions closure-property

20.1.2 Closure Property: CMI2016-B-4 https://gateoverflow.in/98501

Let . Let be arbitrary subsets of . We define the following operations on such sets:

Is it true that for all choices of and ? If yes, give a proof. If not,
provide suitable and for which this equation fails.

cmi2016 closure-property proof descriptive

20.1.3 Closure Property: CMI2019-A-1 https://gateoverflow.in/320553

Let and
The language is:
A. regular, but not context-free B. context-free, but not regular
C. both regular and context-free D. neither regular nor context-free
cmi2019 regular-languages context-free-languages closure-property

20.2 Conjugates (1)

20.2.1 Conjugates: CMI2019-B-2 https://gateoverflow.in/320521

Let us assume a binary alphabet Two words are said to be conjugates if there exist
such that and Prove that and are conjugates if and only if there exists
such that
cmi2019 theory-of-computation conjugates strings

20.3 Context Free Grammars (2)

20.3.1 Context Free Grammars: ISI2013-PCB-CS-4a https://gateoverflow.in/47637

Give a context-free grammar that generates .

Prove that .

descriptive isi2013-pcb-cs context-free-grammars theory-of-computation

20.3.2 Context Free Grammars: ISI2018-PCB-CS4 https://gateoverflow.in/311926

Let the valid moves along a staircase be (one step up) and (one step down). For example, the string
represents the sequence of moves as two steps up, then one step down, and then again one step up. Suppose a person is
initially at the base of the staircase. A string denoting a sequence of steps that takes the person below the base is invalid. For
example, the sequence is invalid. Let be the language defined by the set of valid strings which represent
scenarios in which the person never returns to the base of the staircase after the final step.

a. Show that is not regular

b. Write a context free grammar for accepting

© Copyright GATE Overflow. All rights reserved.

20 Theory of Computation (43) 159

isi2018-pcb-cs theory-of-computation context-free-grammars descriptive

20.4 Context Free Languages (2)

20.4.1 Context Free Languages: ISI 2013 Subjective https://gateoverflow.in/124331

Q C4 b) If it is known that the language L 1= is not a context free language (CFL). Now consider the
language L2= . We can prove that L 2 is not CFL by converting L 2 into L 1 by applying two operation,
both know to be closed on CFLs. What are two operation you will use for this construction.

isi2013 theory-of-computation context-free-languages

20.4.2 Context Free Languages: ISI2015-PCB-CS-5b https://gateoverflow.in/47330

Construct a context free grammar (CFG) to generate the following language:

descriptive isi2015-pcb-cs theory-of-computation context-free-languages

20.5 Context Sensitive (1)

20.5.1 Context Sensitive: CMI2011-A-09 https://gateoverflow.in/46196

You have a laptop with a fixed amount of memory and hard disk space and no external storage devices connected (CD,
USB drives, . . . ). Which of the following is the most accurate formal model of your laptop?
A. Turing machine B. Linear bounded automaton
C. Pushdown automaton D. Finite state automaton
cmi2011 theory-of-computation context-sensitive non-gate

20.6 Finite Automata (11)

20.6.1 Finite Automata: CMI2010-B-04a https://gateoverflow.in/46127

Indicate whether the following statements are true or false, providing a short explanation to substantiate your answers.
i. A DFA with states must accept at least one string of length greater than .

cmi2010 theory-of-computation finite-automata descriptive

20.6.2 Finite Automata: CMI2010-B-04b https://gateoverflow.in/47073

Indicate whether the following statement is true or false, providing a short explanation to substantiate your answers.

A DFA that has states and accepts an infinite language must accept at least one string such that , where
denotes the length of .
descriptive cmi2010 finite-automata

20.6.3 Finite Automata: CMI2010-B-04c https://gateoverflow.in/47074

Indicate whether the following statement is true or false, providing a short explanation to substantiate your answers.

If a language is accepted by an NFA with states then there is a DFA with no more than states accepting .
descriptive cmi2010 finite-automata

20.6.4 Finite Automata: CMI2012-B-02a https://gateoverflow.in/46562

For a binary string define to be

Let .

a. Construct a finite automaton that accepts the set of all strings such that
.

cmi2012 descriptive theory-of-computation finite-automata

© Copyright GATE Overflow. All rights reserved.

160 20 Theory of Computation (43)

20.6.5 Finite Automata: CMI2012-B-02b https://gateoverflow.in/47091

For a binary string define to be

Let .

A. Construct a finite automaton that accepts exactly those strings such that
.

descriptive cmi2012 theory-of-computation finite-automata

20.6.6 Finite Automata: CMI2013-B-01 https://gateoverflow.in/46611

For a binary string define to be the value of interpreted as a binary number, where is
the most significant bit. More formally, is given by

Design a finite automaton that accepts exactly the set of binary strings such that is divisible by either 4 or 5.

cmi2013 descriptive theory-of-computation finite-automata

20.6.7 Finite Automata: CMI2016-B-5 https://gateoverflow.in/98506

For a string over the alphabet , define to be the value of interpreted as a ternary
number, where is the most significant digit. More formally, is given by

Design a finite automaton that accepts exactly the set of strings such that is divisible by 4.

cmi2016 descriptive finite-automata

20.6.8 Finite Automata: CMI2017-B-1 https://gateoverflow.in/203307

Let . Let Leven be the set of all even length strings in

Construct a deterministic finite state automaton for .

) We consider an operation that takes as input a string and erases all occurrences of the pattern from
. Formally, it can be defined as follows:

Erase (w):=

For instance, , and .

For a language , we define to be the set of strings obtained by applying the operation to each string in

:=

Show that ) is a regular language.

cmi2017 theory-of-computation finite-automata

20.6.9 Finite Automata: CMI2017-B-3 https://gateoverflow.in/203313

Let . Given words , we say that extends if is of the form for some . Given
a fixed word , we are interested in identifying whether a finite state automaton accepts some word that extends .

Describe an algorithm that takes as input a finite state automaton (DFA or NFA) over and a word and
reports “Yes” if some word in the language of extends and “No” if no word in the language of extends .
cmi2017 theory-of-computation finite-automata descriptive

© Copyright GATE Overflow. All rights reserved.

20 Theory of Computation (43) 161

20.6.10 Finite Automata: ISI2014-PCB-CS-4a https://gateoverflow.in/47443

Construct a deterministic finite automaton accepting the following language:

. For example, is in the language because it contains
one instance of and one instance of as well.
descriptive isi2014-pcb-cs theory-of-computation finite-automata

20.6.11 Finite Automata: ISI2017-PCB-CS-1(a) https://gateoverflow.in/245034

Consider an alphabet Design a deterministic finite-state automaton (DFA) that accepts all strings in
in which the digits appear in non-decreasing sequence, from left to right. For example, the string and would
be accepted, whereas will not be accepted.
isi2017-pcb-cs theory-of-computation finite-automata

20.7 Identify Class Language (3)

20.7.1 Identify Class Language: CMI2010-A-01 https://gateoverflow.in/46131

Over the alphabet , consider the language

Which of the following is true about .

A. is not context free B. is regular
C. is not regular but it is context free D. is context free but not recursively
enumerable
cmi2010 theory-of-computation identify-class-language

20.7.2 Identify Class Language: CMI2013-A-04 https://gateoverflow.in/46594

Consider the set of all words over the alphabet where the number of ’s is not divisible by 2 or 7 and no
appears after a . This language is:
A. regular B. not known to be regular
C. context-free but not regular D. recursively enumerable but not
context-free
cmi2013 theory-of-computation identify-class-language

20.7.3 Identify Class Language: CMI2014-A-05 https://gateoverflow.in/46971

Let . For a word let denote the number of 's in and let denote the number of 's
in . Consider the following language:

What can we say about ?

A. is regular, but not context-free B. is context-free, but not regular
C. is D. None of these
cmi2014 theory-of-computation identify-class-language

20.8 Nfa Dfa (3)

20.8.1 Nfa Dfa: CMI2018-B-1 https://gateoverflow.in/320462

Consider the following non-deterministic finite automata(NFA) and

A. Give an example of a word which is accepted by both and

B. Give an example of a word which is accepted by but not by
C. Draw the deterministic finite automaton(DFA) equivalent to

© Copyright GATE Overflow. All rights reserved.

162 20 Theory of Computation (43)

cmi2018 finite-automata nfa-dfa descriptive

20.8.2 Nfa Dfa: CMI2019-A-2 https://gateoverflow.in/320552

Let be an with states. Which of the following is necessarily true?

A. The shortest word in has length at most

B. The shortest word in has length at least
C. The shortest word not in has length at most
D. The shortest word not in has length at least

cmi2019 finite-automata nfa-dfa

20.8.3 Nfa Dfa: CMI2019-B-1 https://gateoverflow.in/320522

Consider an alphabet
Let be the language given by the regular expression and let be the language
Define

A. Give an example of a word in

B. Give an example of a word not in
C. Construct an NFA for

cmi2019 regular-expressions regular-languages nfa-dfa

20.9 Pushdown Automata (1)

20.9.1 Pushdown Automata: ISI 2015 PCB C4 A https://gateoverflow.in/121031

Design a context free grammar for the language consisting of all strings over that are not the form for any
string
pushdown-automata theory-of-computation isi2015

20.10 Reduction (1)

20.10.1 Reduction: CMI2019-A-8 https://gateoverflow.in/320546

We have constructed a polynomial time reduction from problem A to problem B. Which of the following is not a
possible scenario?

A. We know of polynomial time algorithms for both A and B.

B. We only know of exponential time algorithms for both A and B.
C. We only know an exponential time algorithm for A, but we have a polynomial time algorithm for B.
D. We only know an exponential time algorithm for B, but we have a polynomial time algorithm for A.

cmi2019 reduction p-np-npc-nph

20.11 Regular Expressions (5)

20.11.1 Regular Expressions: CMI2017-A-01 https://gateoverflow.in/203254

The regular expression is equivalent to which of the following regular expressions:

a. b. c. d.
cmi2017 theory-of-computation regular-expressions

20.11.2 Regular Expressions: CMI2018-A-1 https://gateoverflow.in/320492

Which of the words below matches the regular expression ?

A. B. C. D.

© Copyright GATE Overflow. All rights reserved.

20 Theory of Computation (43) 163

cmi2018 regular-languages regular-expressions easy

20.11.3 Regular Expressions: ISI2011-PCB-CS-4c https://gateoverflow.in/48158

Recall that a typical URL has the following form. It starts with a protocol specifier, followed by a colon (:) and two
forward slashes (/), followed by a hostname and a domain name. This is followed by an optional path specifier. Some
example URLs are given below.
{http://www.isical.ac.in/}
{http://www.isical.ac.in/deanoffice/results.html}
{http://www.isical.ac.in/deanoffice/results/jrf/}
Assuming that A-Z, a-z, and are the only characters that can be used in a host / domain / file / directory name, write a
regular expression for URLs.
descriptive isi2011-pcb-cs regular-expressions

20.11.4 Regular Expressions: ISI2013-PCB-CS-4b https://gateoverflow.in/47638

Write a regular expression for all strings of ’s and ’s in which the total number of ’s to the right of each is even.
Justify your answer.
descriptive isi2013-pcb-cs theory-of-computation regular-expressions

20.11.5 Regular Expressions: ISI2016-PCB-CS-6 https://gateoverflow.in/244396

i. Let L be a regular language over . Define the reverse of the language to be the language
, where denotes the string in reverse. For example
. Show that is regular.
ii. Let , contains an odd number of and as a substring Construct a regular expression for
the language .

isi2016-pcb-cs regular-languages regular-expressions descriptive

20.12 Regular Languages (9)

20.12.1 Regular Languages: CMI2011-A-01 https://gateoverflow.in/46146

Let L be a language accepted by a finite automaton. Let be some subset of , containing 2011
strings. Which of the following statements is true? Justify your answer.

A. is always regular.
B. is regular only when —that is, when and do not have any common string.
C. is never regular.
D. is regular only if contains (the empty string).

cmi2011 theory-of-computation regular-languages

20.12.2 Regular Languages: CMI2011-B-04a https://gateoverflow.in/46209

Let Suppose is regular and there is a non-deterministic automaton which recognizes . Define the
reverse of the language to be the language - here denotes the
string read in reverse. For example .

i. Show that is regular, How can you use to construct an automata to recognize .

cmi2011 descriptive theory-of-computation regular-languages finite-automata

20.12.3 Regular Languages: CMI2011-B-04b https://gateoverflow.in/47080

Let Suppose is regular and there is a non-deterministic automaton which recognizes . Define the
reverse of the language to be the language - here denotes the
string read in reverse. For example .

i. Show that the language where is regular. How can you use to

© Copyright GATE Overflow. All rights reserved.

164 20 Theory of Computation (43)

construct an automata for ?

descriptive cmi2011 theory-of-computation regular-languages

20.12.4 Regular Languages: CMI2012-A-01 https://gateoverflow.in/46529

Let . Which of the following is true?

A. If is regular, all subsets of are regular.

B. If all proper subsets of are regular, then is regular.
C. If all finite subsets of are regular, then is regular.
D. If a proper subset of is not regular, then is not regular.

cmi2012 theory-of-computation regular-languages

20.12.5 Regular Languages: CMI2014-B-01 https://gateoverflow.in/46980

Let be a regular language. Consider the following operations on :

One of these operations necessarily leads to a regular language and the other may not. Identify which is which. For the regular
operation, give a proof that it is regular. For the non-regular operation, give an example of an
such that applying the operation on it results in a non-regular language.

cmi2014 theory-of-computation regular-languages descriptive

20.12.6 Regular Languages: CMI2015-A-09 https://gateoverflow.in/47046

Let and be languages over an alphabet such that . Which of the following is true:

A. If is regular, then must also be regular.

B. If is regular, then must also be regular.
C. Either both and are regular, or both are not regular.
D. None of the above.

cmi2015 theory-of-computation regular-languages

20.12.7 Regular Languages: ISI2011-PCB-CS-4a https://gateoverflow.in/48156

Let be the set of strings over containing an unequal number of s and s. Prove that

i. is not regular.
ii. is regular.

descriptive isi2011-pcb-cs theory-of-computation regular-languages

20.12.8 Regular Languages: ISI2014-PCB-CS-4b https://gateoverflow.in/47445

Consider the following statement:

Is the above statement true? Justify your answer.

descriptive isi2014-pcb-cs theory-of-computation regular-languages

20.12.9 Regular Languages: ISI2015-PCB-CS-5a https://gateoverflow.in/47327

Construct two nonregular languages and such that is regular.

Prove that the languages and constructed above are nonregular and is regular.
descriptive isi2015-pcb-cs theory-of-computation regular-languages

© Copyright GATE Overflow. All rights reserved.

20 Theory of Computation (43) 165

20.13 Turing Machine (1)

20.13.1 Turing Machine: ISI2012-PCB-CS-3 https://gateoverflow.in/47852

Design a Turing machine that recognizes the unary language consisting of all strings of 0’s whose length is a power of
2, i.e.,

descriptive isi2012-pcb-cs theory-of-computation turing-machine

© Copyright GATE Overflow. All rights reserved.