Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged cmi2015
1
1 vote
1
1 answer
806
806 views
CMI2015-B-01
Let $\Sigma=\{a,b\}.$ Given a language $L\underline\subset \Sigma^{\ast}$ and a word $w\in\Sigma^{\ast}$, define the languages:$$Extend(L,w) :=\{xw\:|\:x\in L\}$$ $$Shrin...
soujanyareddy13
806
views
asked
May 10, 2021
Theory of Computation
cmi2015
regular-language
theory-of-computation
+
–
8
8 votes
2
answers
2 answers
2.1k
2.1k views
CMI2015-A-02
A binary relation $R ⊆ (S ×S)$ is said to be Euclidean if for every $a, b, c ∈ S, (a, b) ∈ R$ and $(a, c) ∈ R$ implies $(b, c) ∈ R$. Which of the following statements is ...
Mk Utkarsh
2.1k
views
asked
May 12, 2018
Set Theory & Algebra
cmi2015
relations
set-theory&algebra
+
–
3
3 votes
1
1 answer
902
902 views
CMI2015-B-07
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 si...
go_editor
902
views
asked
May 27, 2016
Algorithms
cmi2015
descriptive
algorithms
dynamic-programming
+
–
4
4 votes
2
2 answers
1.3k
1.3k views
CMI2015-B-06c
Consider the code below, defining the functions $f$ and $g$: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 ...
go_editor
1.3k
views
asked
May 27, 2016
Algorithms
cmi2015
descriptive
algorithms
time-complexity
+
–
5
5 votes
2
2 answers
993
993 views
CMI2015-B-06b
Consider the code below, defining the functions $f$ and $g$: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 ...
go_editor
993
views
asked
May 27, 2016
Algorithms
descriptive
cmi2015
algorithms
identify-function
+
–
2
2 votes
2
2 answers
1.0k
1.0k views
CMI2015-B-06a
Consider the code below, defining the functions $f$ and $g$: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 ...
go_editor
1.0k
views
asked
May 27, 2016
Algorithms
descriptive
cmi2015
algorithms
identify-function
+
–
2
2 votes
1
1 answer
801
801 views
CMI2015-B-05
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 ...
go_editor
801
views
asked
May 27, 2016
Algorithms
cmi2015
descriptive
algorithms
algorithm-design
+
–
16
16 votes
2
answers
2 answers
3.0k
3.0k views
CMI2015-B-04
You are given $n$ positive integers, $d_1, d_2 \dots d_n$, each greater than $0$. Design a greedy algorithm to test whether these integers correspond to the degrees of so...
go_editor
3.0k
views
asked
May 27, 2016
Algorithms
cmi2015
descriptive
algorithms
greedy-algorithms
+
–
2
2 votes
2
2 answers
1.0k
1.0k views
CMI2015-B-03b
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 th...
go_editor
1.0k
views
asked
May 27, 2016
Quantitative Aptitude
cmi2015
descriptive
quantitative-aptitude
+
–
3
3 votes
2
2 answers
723
723 views
CMI2015-B-03a
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 th...
go_editor
723
views
asked
May 27, 2016
Quantitative Aptitude
cmi2015
quantitative-aptitude
descriptive
+
–
2
2 votes
2
2 answers
995
995 views
CMI2015-B-02
Consider a social network with $n$ persons. Two persons $A$ and $B$ are said to be connected if either they are friends or they are related through a sequence of friends:...
go_editor
995
views
asked
May 27, 2016
Combinatory
descriptive
cmi2015
combinatory
+
–
6
6 votes
4
4 answers
1.3k
1.3k views
CMI2015-A-10
The school athletics coach has to choose $4$ students for the relay team. He calculates that there are $3876$ ways of choosing the team if the order in which the runners ...
go_editor
1.3k
views
asked
May 27, 2016
Combinatory
cmi2015
combinatory
+
–
13
13 votes
3
answers
3 answers
1.9k
1.9k views
CMI2015-A-09
Let $L_1$ and $L_2$ be languages over an alphabet $\Sigma$ such that $L_1 \subseteq L_2$. Which of the following is true:If $L_2$ is regular, then $L_1$ must also be regu...
go_editor
1.9k
views
asked
May 27, 2016
Theory of Computation
cmi2015
theory-of-computation
regular-language
+
–
13
13 votes
5
answers
5 answers
7.2k
7.2k views
CMI2015-A-08
How many times is the comparison $i \geq n$ performed in the following program?int i=85, n=5; main() { while (i >= n) { i=i-1; n=n+1; } }$40$$41$$42$$43$
go_editor
7.2k
views
asked
May 27, 2016
Algorithms
cmi2015
algorithms
time-complexity
+
–
11
11 votes
3
answers
3 answers
2.2k
2.2k views
CMI2015-A-07
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 $6$-sided die to make the choice, as follows.If you th...
go_editor
2.2k
views
asked
May 27, 2016
Probability
cmi2015
probability
+
–
7
7 votes
3
answers
3 answers
3.4k
3.4k views
CMI2015-A-06
Suppose we have constructed a polynomial time reduction from problem $A$ to problem $B$. Which of the following can we infer from this fact?If the best algorithm for $B$ ...
go_editor
3.4k
views
asked
May 27, 2016
Algorithms
cmi2015
algorithms
p-np-npc-nph
+
–
17
17 votes
2
answers
2 answers
3.1k
3.1k views
CMI2015-A-05
An undirected graph has $10$ vertices labelled $1, 2,\dots , 10$ and $37$ edges. Vertices $1, 3, 5, 7, 9$ have degree $8$ and vertices $2, 4, 6, 8$ have degree $7.$ What ...
go_editor
3.1k
views
asked
May 27, 2016
Graph Theory
cmi2015
graph-theory
degree-of-graph
easy
+
–
3
3 votes
1
1 answer
1.2k
1.2k views
CMI2015-A-04a
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 tim...
go_editor
1.2k
views
asked
May 27, 2016
Graph Theory
cmi2015
descriptive
graph-theory
minimum-spanning-tree
+
–
4
4 votes
2
answers
2 answers
990
990 views
CMI2015-A-03
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...
go_editor
990
views
asked
May 27, 2016
Graph Theory
cmi2015
graph-theory
graph-coloring
first-order-logic
mathematical-logic
+
–
8
8 votes
2
2 answers
3.3k
3.3k views
CMI2015-A-01
Twin primes are pairs of numbers $p$ and $p+2$ such that both are primes—for instance, $5$ and $7$, $11$ and $13$, $41$ and $43$. The Twin Prime Conjecture says that ther...
go_editor
3.3k
views
asked
May 27, 2016
Mathematical Logic
cmi2015
mathematical-logic
first-order-logic
+
–
To see more, click for the
full list of questions
or
popular tags
.