The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Recent questions tagged cmi2014
+2
votes
0
answers
1
CMI2014B07c
Consider the code below, defining the function $A$: 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,n1,p), p1); } Compute $A(2, 2, 3)$ and $A(2, 3, 3)$.
asked
May 27, 2016
in
Algorithms
by
jothee
Veteran
(
112k
points)

30
views
cmi2014
descriptive
algorithms
identifyfunction
+2
votes
1
answer
2
CMI2014B07b
Consider the code below, defining the function $A$: 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,n1,p), p1); } Express $A(m, n, 2)$ as a function of $m$ and $n$.
asked
May 27, 2016
in
Algorithms
by
jothee
Veteran
(
112k
points)

40
views
cmi2014
descriptive
algorithms
identifyfunction
+2
votes
1
answer
3
CMI2014B07a
Consider the code below, defining the function $A$: 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,n1,p), p1); } Express $A(m, n, 1)$ as a function of $m$ and $n$.
asked
May 27, 2016
in
Algorithms
by
jothee
Veteran
(
112k
points)

49
views
cmi2014
descriptive
algorithms
identifyfunction
+2
votes
0
answers
4
CMI2014B06b
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(n^2)$.
asked
May 27, 2016
in
Algorithms
by
jothee
Veteran
(
112k
points)

25
views
cmi2014
descriptive
algorithms
+2
votes
0
answers
5
CMI2014B06a
Let $A$ be an array of $n$ integers, sorted so that $A[1] \leq A[2] \leq \dots \leq A[n]$. You are given a number $x$x. 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)$.
asked
May 27, 2016
in
Algorithms
by
jothee
Veteran
(
112k
points)

14
views
cmi2014
descriptive
algorithms
+2
votes
0
answers
6
CMI2014B05
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 ... compute the Improvement Index for a batsman with an overall sequence of $n$ scores. Analyze the complexity of your algorithm.
asked
May 27, 2016
in
Algorithms
by
jothee
Veteran
(
112k
points)

53
views
cmi2014
algorithms
dynamicprogramming
+1
vote
0
answers
7
CMI2014B04
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.
asked
May 27, 2016
in
Algorithms
by
jothee
Veteran
(
112k
points)

19
views
cmi2014
descriptive
algorithms
+1
vote
0
answers
8
CMI2014B03
$\text{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 ... cities connected by a route on which all connections are feasible within the same day. Analyze the complexity of your algorithm.
asked
May 27, 2016
in
Algorithms
by
jothee
Veteran
(
112k
points)

17
views
cmi2014
descriptive
algorithms
+1
vote
0
answers
9
CMI2014B02
There are $n$ students in a class. The students have formed $k$ 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.
asked
May 27, 2016
in
Numerical Ability
by
jothee
Veteran
(
112k
points)

40
views
cmi2014
descriptive
numericalability
pigeonhole
+1
vote
1
answer
10
CMI2014B01
Let $A$ be a regular language. Consider the following operations on $A$: $2A:=\{xy \mid x, \: y \in A \text{ and } x=y\}$ $A^2 :=\{xy \mid x, \: y \in A\}$ One of these operations necessarily leads to a regular ... is regular. For the nonregular operation, give an example of an $A$ such that applying the operation on it results in a nonregular language.
asked
May 27, 2016
in
Theory of Computation
by
jothee
Veteran
(
112k
points)

96
views
cmi2014
theoryofcomputation
regularlanguages
descriptive
+1
vote
2
answers
11
CMI2014A10
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? Vinay is taller than Avinash and Abhay is taller than Bharat. Avinash is taller than Vinay. Abhay is shorter than Vinay. None of the above.
asked
May 27, 2016
in
Numerical Ability
by
jothee
Veteran
(
112k
points)

63
views
cmi2014
logicalreasoning
+2
votes
0
answers
12
CMI2014A09
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 ... If the workers union resorted to a strike, then the number of voters was greater than or equal to the number of abstainers.
asked
May 27, 2016
in
Numerical Ability
by
jothee
Veteran
(
112k
points)

42
views
cmi2014
logicalreasoning
+1
vote
0
answers
13
CMI2014A08
What are the possible values of $gcd(7p + 94,\: 7p^2 + 97p + 47)$, where $p$ is an arbitrary integer? Either 1 or 94 Either 94 or 47 Either 1 or 47 None of these
asked
May 27, 2016
in
Numerical Ability
by
jothee
Veteran
(
112k
points)

29
views
cmi2014
numericalability
+1
vote
0
answers
14
CMI2014A07
Let $M$ be the maximum number of unit disks (disks of radius 1) that can be placed inside a disk of radius 10 so that each unit disk lies entirely within the larger disk and no two unit disks overlap. Then: $M < 25$ $25 \leq M < 40$ $40 \leq M < 55$ $M \geq 55$
asked
May 27, 2016
in
Numerical Ability
by
jothee
Veteran
(
112k
points)

17
views
cmi2014
numericalability
geometry
+4
votes
1
answer
15
CMI2014A06
Suppose we are working with a programming language that supports automatic garbage collection. This means that: Uninitialized variables are assigned null values. Unreferenced dynamically allocated memory is added back to free space. Unreachable $ifthenelse$ branches are pruned. Expressions where array indices exceed array bounds are flagged.
asked
May 27, 2016
in
Programming
by
jothee
Veteran
(
112k
points)

141
views
cmi2014
programming
runtimeenvironments
+2
votes
1
answer
16
CMI2014A05
Let $\Sigma = \{a, b\}$. For a word $w \: \: \in \Sigma^*$ let $n_a(x)$ denote the number of $a$'s in $w$ and let $n_b(x)$ denote the number of $b$'s in $w$. Consider the following language: $L:=\{ xy \mid x, \: y \in \ ... }$ What can we say about $L$? $L$ is regular, but not contextfree $L$ is contextfree, but not regular $L$ is $\Sigma^*$ None of these
asked
May 27, 2016
in
Theory of Computation
by
jothee
Veteran
(
112k
points)

50
views
cmi2014
theoryofcomputation
identifyclasslanguage
+1
vote
1
answer
17
CMI2014A04
Alan’s task is to design an algorithm for a decision problem $P$. He knows that there is an algorithm $A$ that transforms instances of P to instances of the Halting Problem such that $yes$ instances of $P$ map to $yes$ ... existence of $A$ says nothing about whether there is an algorithm for $P$. The Halting Problem can be solved using $A$.
asked
May 27, 2016
in
Algorithms
by
jothee
Veteran
(
112k
points)

34
views
cmi2014
algorithms
reduction
+1
vote
0
answers
18
CMI2014A03
In the code fragment on the right, start and end are integer values and $prime(x)$ is a function that returns true if $x$ is a prime number and $false$ otherwise. At the end of the loop: i := 0; j := 0; k := 0; for (m := start; m <= end; m := m+1){ k ... i := i + m; }else{ j := j + m; } } $k < i+j$ $k = i+j$ $k > i+j$ Depends on $start$ and $end$
asked
May 27, 2016
in
Algorithms
by
jothee
Veteran
(
112k
points)

24
views
cmi2014
algorithms
identifyfunction
+5
votes
1
answer
19
CMI2014A02
The 12 houses on one side of a street are numbered with even numbers starting at 2 and going up to 24. A free newspaper is delivered on Monday to 3 different houses chosen at random from these 12. Find the probability that at least 2 of these newspapers are delivered ... strictly greater than 14. $\frac{7}{11}$ $\frac{5}{12}$ $\frac{4}{11}$ $\frac{5}{22}$
asked
May 27, 2016
in
Probability
by
jothee
Veteran
(
112k
points)

200
views
cmi2014
probability
+8
votes
2
answers
20
CMI2014A01
For the interhostel sixaside football tournament, a team of 6 players is to be chosen from 11 players consisting of 5 forwards, 4 defenders and 2 goalkeepers. The team must include at least 2 forwards, at least 2 defenders and at least 1 goalkeeper. Find the number of different ways in which the team can be chosen. A.260 B.340 C.720 D.440
asked
May 27, 2016
in
Combinatory
by
jothee
Veteran
(
112k
points)

251
views
cmi2014
permutationsandcombinations
discretemathematics
normal
To see more, click for the
full list of questions
or
popular tags
.
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Applying to NUS
THANK U GO !!
need advice
A journey with GO from Air: 2494 to Air: 223
Thanks to GATE Overflow.
Follow @csegate
Gatecse
Recent questions tagged cmi2014
Recent Blog Comments
Congrats Bro :D
Thank You @gauravkc, @hacker16, @Sukannya ...
Congratulations Brother :) You've made it! ECE to ...
I am also thinking of applying to the same ...
34,215
questions
40,896
answers
116,102
comments
39,804
users