Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged cmi2010
6
votes
1
answer
1
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: The numbers in the expression are drawn from the first list, without repetition and ... assume that the length of the first list is more than the length of the second list. Describe an algorithm to solve this problem.
Sammohan Ganguly
asked
in
Algorithms
Apr 30, 2018
by
Sammohan Ganguly
2.3k
views
algorithms
descriptive
cmi2010
algorithm-design
7
votes
1
answer
2
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]$ is the list consisting of one bit $b$. The function $\text{length}(l)$ ... mystery1(mystery2(s,tail(t)),mystery2(s,tail(t)))) endif Suppose $s=t=110100100$. What are the first two bits of $\text{mystery2(s,t)}$?
go_editor
asked
in
Algorithms
May 27, 2016
by
go_editor
1.1k
views
descriptive
cmi2010
algorithms
identify-function
11
votes
2
answers
3
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$ states then there is a DFA with no more than $2^n$ states accepting $L$.
go_editor
asked
in
Theory of Computation
May 27, 2016
by
go_editor
1.1k
views
descriptive
cmi2010
finite-automata
18
votes
6
answers
4
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 language must accept at least one string $x$ such that $2n < |x| < 3n$, where $|x|$ denotes the length of $x$.
go_editor
asked
in
Theory of Computation
May 27, 2016
by
go_editor
3.9k
views
descriptive
cmi2010
finite-automata
1
vote
2
answers
5
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 their new service. The company has to ensure that two towers broadcasting on the same ... should say feasible if it is feasible, otherwise output the minimum number of frequencies needed to utilise all 100 towers.
go_editor
asked
in
Algorithms
May 27, 2016
by
go_editor
643
views
cmi2010
descriptive
algorithms
algorithm-design
2
votes
1
answer
6
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, then we can solve all NP-complete problems efficiently. Checking whether a number is a prime is an NP-complete ... are false but $2$ is true. $2$ and $3$ are true but $1$ is false. All three statements are false.
go_editor
asked
in
Algorithms
May 19, 2016
by
go_editor
761
views
cmi2010
algorithms
p-np-npc-nph
1
vote
3
answers
7
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 parallel-that is, at each step we either execute one statement from $f()$ or one statement from $g()$. What is the set of possible values printed by $g()?$ $0,9,12$ $0,8,9,12$ $0,6,8,9,11,12$ $0,4,6,9,10,12$
go_editor
asked
in
Operating System
May 19, 2016
by
go_editor
728
views
cmi2010
operating-system
concurrency
7
votes
1
answer
8
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 into local storage. Functions can indirectly modify the value of external variables. Every argument passed to a function must have a value.
go_editor
asked
in
Compiler Design
May 19, 2016
by
go_editor
1.2k
views
cmi2010
compiler-design
runtime-environment
parameter-passing
3
votes
2
answers
9
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
asked
in
Quantitative Aptitude
May 19, 2016
by
go_editor
851
views
cmi2010
quantitative-aptitude
numerical-computation
1
vote
0
answers
10
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 vertices connected to at least $42$ other vertices. For all such graphs the number of vertices ... some constant $c < 1$. There are no graphs with each vertex connected to at most $38$ other vertices. None of the above
go_editor
asked
in
Graph Theory
May 19, 2016
by
go_editor
946
views
cmi2010
graph-theory
graph-connectivity
1
vote
1
answer
11
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 probability that the total is $6$ is less than the probability that the total is $9$. ... total is $9$. The probability that the total is $6$ is greater than the probability that the total is $9$. None of the above.
go_editor
asked
in
Probability
May 19, 2016
by
go_editor
448
views
cmi2010
probability
4
votes
2
answers
12
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 prime numbers is infinite? $(\forall m) (\exists n) (n > m) \text{ implies Prime}(n)$ ... $(\exists n) (\forall m) (n > m) \wedge \text{Prime}(n)$
go_editor
asked
in
Mathematical Logic
May 19, 2016
by
go_editor
847
views
cmi2010
first-order-logic
2
votes
2
answers
13
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
asked
in
Quantitative Aptitude
May 19, 2016
by
go_editor
795
views
cmi2010
circle
19
votes
3
answers
14
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{pmatrix}$ $11$ . $ \begin{pmatrix} 15 \\ 11 \end{pmatrix}$ $15 . 14 . 13 . 12 . 11 .10 . 9 . 8 . 7 . 6 . 5$ $(15 . 14 . 13 . 12 . 11 .10 . 9 . 8 . 7 . 6 . 5) . 11$
go_editor
asked
in
Combinatory
May 19, 2016
by
go_editor
2.3k
views
cmi2010
combinatory
normal
discrete-mathematics
8
votes
2
answers
15
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 context free $L$ is regular $L$ is not regular but it is context free $L$ is context free but not recursively enumerable
go_editor
asked
in
Theory of Computation
May 19, 2016
by
go_editor
1.3k
views
cmi2010
theory-of-computation
identify-class-language
3
votes
1
answer
16
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 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. Model this problems using graphs.
go_editor
asked
in
Graph Theory
May 19, 2016
by
go_editor
962
views
cmi2010
descriptive
graph-theory
graph-connectivity
2
votes
2
answers
17
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, \dots , v_k$ such that for $0 \leq i < k,$ $v_i$ is connected to $v_{i+1}$ in $G$.
go_editor
asked
in
Graph Theory
May 19, 2016
by
go_editor
623
views
cmi2010
descriptive
graph-theory
graph-connectivity
2
votes
1
answer
18
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 department has now received two additional lists of names: a list B of names of people who ... m and k respectively and that $n > m > k$. Describe the running time of your algorithm in terms of these parameters.
go_editor
asked
in
Algorithms
May 19, 2016
by
go_editor
659
views
cmi2010
descriptive
algorithms
sorting
4
votes
1
answer
19
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 string of length greater than $n$.
go_editor
asked
in
Theory of Computation
May 19, 2016
by
go_editor
2.1k
views
cmi2010
theory-of-computation
finite-automata
descriptive
4
votes
1
answer
20
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 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 ...
go_editor
asked
in
Combinatory
May 19, 2016
by
go_editor
615
views
cmi2010
descriptive
combinatory
1
vote
0
answers
21
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 list consisting of one bit b. The function $length(l)$ returns the length (number of ... tail(t)),mystery2(s,tail(t)))) endif What is the value of $length(mystery2(s,t))$ in terms of $length(s)$ and $length(t)$?
go_editor
asked
in
DS
May 19, 2016
by
go_editor
431
views
cmi2010
descriptive
linked-list
To see more, click for the
full list of questions
or
popular tags
.
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged cmi2010
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...