Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged cmi2010
6
6 votes
1
1 answer
4.8k
4.8k views
CMI2010 - 6
You are given a list of positive integers along with a sequence of operations from the set $\left \{ *,+\right \}$ .You construct expressions from these two lists so that...
Sammohan Ganguly
4.8k
views
asked
Apr 30, 2018
Algorithms
algorithms
descriptive
cmi2010
algorithm-design
+
–
7
7 votes
1
answers
1 answer
2.0k
2.0k views
CMI2010-B-07b
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], \dots [ \: ]$ denotes the empty list, and $[b]$ i...
go_editor
2.0k
views
asked
May 27, 2016
Algorithms
descriptive
cmi2010
algorithms
identify-function
+
–
11
11 votes
2
answers
2 answers
1.8k
1.8k views
CMI2010-B-04c
Indicate whether the following statement is true or false, providing a short explanation to substantiate your answers.If a language $L$ is accepted by an NFA with $n$ sta...
go_editor
1.8k
views
asked
May 27, 2016
Theory of Computation
descriptive
cmi2010
finite-automata
+
–
19
19 votes
6
answers
6 answers
7.5k
7.5k views
CMI2010-B-04b
Indicate whether the following statement is true or false, providing a short explanation to substantiate your answers.A DFA that has $n$ states and accepts an infinite la...
go_editor
7.5k
views
asked
May 27, 2016
Theory of Computation
descriptive
cmi2010
finite-automata
+
–
1
1 vote
2
2 answers
1.1k
1.1k views
CMI2010-B-01b
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 ...
go_editor
1.1k
views
asked
May 27, 2016
Algorithms
cmi2010
descriptive
algorithms
algorithm-design
+
–
2
2 votes
1
1 answer
1.1k
1.1k views
CMI2010-A-10
Consider the following statements.NP-complete problems are those that we know we can never solve efficiently.If we find an efficient algorithm for one NP-complete problem...
go_editor
1.1k
views
asked
May 19, 2016
Algorithms
cmi2010
algorithms
p-np-npc-nph
+
–
1
1 vote
3
3 answers
1.2k
1.2k views
CMI2010-A-09
Consider the following functions $f()$ and $g().$f(){ w = 3; w = 4; } g(){ z = w; z = z + 2*w; print(z); }We start with $w$ set to $0$ and execute $f()$ and $g()$ in para...
go_editor
1.2k
views
asked
May 19, 2016
Operating System
cmi2010
operating-system
concurrency
+
–
7
7 votes
1
answers
1 answer
2.2k
2.2k views
CMI2010-A-08
In programming language terminology, $\text{ call by value }$ refers to the fact that:A function call can return a value.When a function is called, arguments are copied i...
go_editor
2.2k
views
asked
May 19, 2016
Compiler Design
cmi2010
compiler-design
runtime-environment
parameter-passing
+
–
3
3 votes
2
answers
2 answers
1.5k
1.5k views
CMI2010-A-07
For integer values of $n$, the expression $\frac{n(5n + 1)(10n + 1)}{6}$Is always divisible by $5$.Is always divisible by $3$.Is always an integer.None of the above
go_editor
1.5k
views
asked
May 19, 2016
Quantitative Aptitude
cmi2010
quantitative-aptitude
numerical-computation
+
–
1
1 vote
0
0 answers
1.4k
1.4k views
CMI2010-A-06
A simple graph is one with no self-loops or multiple edges. Among the simple graphs with $n$ vertices and at most $20n − 3$ edges:There is always a graph with all vertice...
go_editor
1.4k
views
asked
May 19, 2016
Graph Theory
cmi2010
graph-theory
graph-connectivity
+
–
1
1 vote
1
1 answer
791
791 views
CMI2010-A-05
You have two normal, fair, dice, with faces labelled $1,2, \dots 6$. If you throw both dice, which of the following is true about the total value shown by the dice?The pr...
go_editor
791
views
asked
May 19, 2016
Probability
cmi2010
probability
+
–
5
5 votes
3
3 answers
1.8k
1.8k views
CMI2010-A-04
Let $m$ and $n$ range over natural numbers and let $\text{Prime}(n)$ be true if $n$ is a prime number. Which of the following formulas expresses the fact that the set of ...
go_editor
1.8k
views
asked
May 19, 2016
Mathematical Logic
cmi2010
first-order-logic
+
–
2
2 votes
2
2 answers
1.2k
1.2k views
CMI2010-A-03
The area of the largest square that can be drawn inside a circle with unit radius is$\sqrt{2}$$2$$1$None of the above
go_editor
1.2k
views
asked
May 19, 2016
Quantitative Aptitude
cmi2010
circle
+
–
21
21 votes
4
answers
4 answers
3.8k
3.8k views
CMI2010-A-02
We need to choose a team of $11$ from a pool of $15$ players and also select a captain. The number of different ways this can be done is$ \begin{pmatrix} 15 \\ 11 \end{pm...
go_editor
3.8k
views
asked
May 19, 2016
Combinatory
cmi2010
combinatory
normal
discrete-mathematics
+
–
8
8 votes
2
answers
2 answers
2.0k
2.0k views
CMI2010-A-01
Over the alphabet $\{0, 1\}$, consider the language$L = \{ w | \: w \text{ does not contain the substring } 0011\}$Which of the following is true about $L$.$L$ is not co...
go_editor
2.0k
views
asked
May 19, 2016
Theory of Computation
cmi2010
theory-of-computation
identify-class-language
+
–
3
3 votes
1
1 answer
1.7k
1.7k views
CMI2010-B-01a
An international cellphone company provides service on $7$ different frequencies. They wish to set up business in TamilNadu and have fixed the locations of $100$ towers f...
go_editor
1.7k
views
asked
May 19, 2016
Graph Theory
cmi2010
descriptive
graph-theory
graph-connectivity
+
–
2
2 votes
2
answers
2 answers
1.2k
1.2k views
CMI2010-B-02
Let $G$ be a graph in which each vertex has degree at least $k$. Show that there is a path of length $k$ in $G$—that is, a sequence of $k+1$ distinct vertices $v_0, v_1, ...
go_editor
1.2k
views
asked
May 19, 2016
Graph Theory
cmi2010
descriptive
graph-theory
graph-connectivity
+
–
2
2 votes
1
1 answer
1.3k
1.3k views
CMI2010-B-03
The Income-Tax Department had prepared a list D of names of defaulters on March $31$. However, the government extended the deadline to pay taxes till April $15$.The IT de...
go_editor
1.3k
views
asked
May 19, 2016
Algorithms
cmi2010
descriptive
algorithms
sorting
+
–
4
4 votes
1
answers
1 answer
2.9k
2.9k views
CMI2010-B-04a
Indicate whether the following statements are true or false, providing a short explanation to substantiate your answers.A DFA with $n$ states must accept at least one str...
go_editor
2.9k
views
asked
May 19, 2016
Theory of Computation
cmi2010
theory-of-computation
finite-automata
descriptive
+
–
4
4 votes
1
1 answer
1.0k
1.0k views
CMI2010-B-05
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 sen...
go_editor
1.0k
views
asked
May 19, 2016
Combinatory
cmi2010
descriptive
combinatory
+
–
1
1 vote
0
0 answers
739
739 views
CMI2010-B-07a
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...
go_editor
739
views
asked
May 19, 2016
Data Structures
cmi2010
descriptive
linked-list
+
–
To see more, click for the
full list of questions
or
popular tags
.