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
Filter
User soujanyareddy13
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by soujanyareddy13
0
votes
91
CMI-2020-DataScience-B: 1
For any string $\text{str, length(str)}$ returns the length of the string, $\text{append(str1, str2)}$ concatenates $\text{str1}$ with another string $\text{str2}$, and $\text{trim(str)}$ removes any spaces that exist at the end of the string $\text{str}$ ... 1) { if(str[i] is ' ') { reverse(str, j, i-1); j = i + 1; } } trim(str); return str; }
answered
in
Algorithms
May 8, 2021
216
views
cmi2020-datascience
algorithms
identify-function
0
votes
92
CMI-2020-DataScience-A: 20
Which of the following inequalities are true? $e^x\geq(1+x)$ for $x\geq 0$ $e^x\leq(1+x)$ for $x<0$ $\text{In}(x)<(1+x)$ for $x>0$ $e^x<x^2$ for all real numbers $x$
answered
in
Others
May 8, 2021
71
views
cmi2020-datascience
0
votes
93
CMI-2020-DataScience-A: 19
Choose the conclusions that follow logically from the statements given below. Nobody who really appreciates A.R.Rahman fails to subscribe to his YouTube channel. Owls are hopelessly ignorant of music. No one who is hopelessly ignorant of music ever ... are not really appreciated by A.R.Rahman Anyone who really appreciates A.R.Rahman is not hopelessly ignorant of music
answered
in
Others
May 8, 2021
96
views
cmi2020-datascience
0
votes
94
CMI-2020-DataScience-A: 18
The sum and product of the roots of the polynomial $9x^2+171x-81$ are, respectively: $-19$ and $-9$ $19$ and $9$ $-9$ and $19$ $9$ and $-19$
answered
in
Others
May 8, 2021
103
views
cmi2020-datascience
0
votes
95
CMI-2020-DataScience-A: 17
The identity $\frac{1}{(1-2r)}=\displaystyle\sum^{\infty} _{k=0} (2r)^k $ is true if and only if $r\neq \frac{1}{2}$ if and only if $0\leq r < \frac{1}{2}$ if and only if $-\frac{1}{2} \leq r<\frac{1}{2}$ if and only if $-\frac{1}{2}<r<\frac{1}{2}$
answered
in
Others
May 8, 2021
80
views
cmi2020-datascience
0
votes
96
CMI-2020-DataScience-A: 16
Which of the following are true? $\frac {2019}{2020} < \frac {2020}{2021}$ $x+\frac{1}{x} \geq 2$ for all $x>0$ $2^{60} >5^{24}$ $2^{314} <31^{42}$
answered
in
Others
May 8, 2021
86
views
cmi2020-datascience
0
votes
97
CMI-2020-DataScience-A: 15
Let $f(x)$ be a real-valued function all of whose derivatives exist. Recall that a point $x_0$ in the domain is called an inflection point of $f(x)$ if the second derivative $f^ (x) $ changes sign at $x_0$ ... $x_0 =0$ and $x_0 =6$, both are inflection points The function does not have an inflection point
answered
in
Others
May 8, 2021
82
views
cmi2020-datascience
0
votes
98
CMI-2020-DataScience-A: 14
Suppose you roll two six-sided fair dice with faces numbered from $1$ to $6$ and take the sum of the two numbers that turn up. What is the probability that: the sum is $12;$ the sum is $12$, given that the sum is even; the sum is $12$, given that the sum is an ... $\frac {1}{14}$, respectively $\frac {1}{36}, \frac {1}{16} $, and $\frac {1}{12}$, respectively
answered
in
Others
May 8, 2021
118
views
cmi2020-datascience
probability
dice-rolling
0
votes
99
CMI-2020-DataScience-A: 13
It is mid-semester exam week at $CMI$ and first-year students from both $M.Sc.$ Data Science $(DS)$ and $M.Sc.$ Computer Science $(CS)$ have their exams scheduled for Monday from $10$ a.m. to $1$ p.m. in Lecture Hall $1$. The first row in Lecture ... in this row, in such a way that two students from the same course do not sit next to each other? $36$ $48$ $72$ $96$
answered
in
Others
May 8, 2021
98
views
cmi2020-datascience
0
votes
100
CMI-2020-DataScience-A: 12
How many squares are there on a $7\times 7$ chessboard? $49$ $204$ $203$ $140$
answered
in
Others
May 8, 2021
89
views
cmi2020-datascience
0
votes
101
CMI-2020-DataScience-A: 11
Out of a large number of cars produced by the automaker, the percentage of batteries that will last for more than $8$ years is $[ \int^8_0 \frac{\beta^{\alpha}}{\Gamma (\alpha)} e^{-\beta x} x^{\alpha -1} dx ] \times 100\%$ ... $[ \int^8_0 \frac{x \beta^{\alpha}}{\Gamma (\alpha)} e^{-\beta x} x^{\alpha -1} dx ] \times 100\%$
answered
in
Others
May 8, 2021
85
views
cmi2020-datascience
0
votes
102
CMI-2020-DataScience-A: 10
$\text{Description for the following question:}$ The lifespan of a battery in a car follows Gamma distribution with probability density function $f(x)=\frac{\beta^\alpha }{\Gamma(\alpha) } e^{-\beta x}x^{\alpha -1}, 0<x< \infty ,$ where $\alpha >0$ ... $\mathbb E(X^2 )= \frac {\alpha}{\beta}(\frac {1+\alpha}{\beta })$ $\mathbb E(X^2 )=18$
answered
in
Others
May 8, 2021
136
views
cmi2020-datascience
0
votes
103
CMI-2020-DataScience-A: 9
Let $A$ and $B$ be events such that $P(A)=0.4, P(B)=0.5$ and $P(A\cup B)=0.7$. Which of the following are true? (For sets $A,B,A\Delta B=(A^c\cap B)\cup (A\cap B^c))$. $A$ and $B$ are mutually exclusive $A$ and $B$ are independent $P(A\Delta B)= 0.1$ $P(A^c \cup B^c)=0.8$
answered
in
Others
May 8, 2021
72
views
cmi2020-datascience
0
votes
104
CMI-2020-DataScience-A: 8
Let $A=((a_{ij}))$ be a $7\times7$ matrix with $a_{i,i+1}=1$ for $1\leq i \leq 6$, $a_{7,1}=1$ and all the other elements of the matrix are zero. Which of the following statements are true? $|A|=1$ $\text{trace(A)}=0$ $A^{-1}=A$ $A^7 =I$, where $I$ is the identity matrix
answered
in
Others
May 8, 2021
83
views
cmi2020-datascience
1
vote
105
CMI-2020-DataScience-A: 7
Consider the following bar chart: Which of the following are true? Number of students who scored $A$ in Algebra is higher than the number of students who scored $A$ in Calculus Percentage of students who scored $A$ or $B$ in algebra is lower ... $B$ in calculus Calculus is easier than algebra Considering this data, the average percentage of students scoring $A$ is $12\%$
answered
in
Quantitative Aptitude
May 8, 2021
197
views
cmi2020-datascience
bar-graph
data-interpretation
0
votes
106
CMI-2020-DataScience-A: 6
Suppose that $A$ is an $n \times n$ matrix with $n=10$ and $b$ is an $n \times 1$ vector. Suppose that the equation $Ax=b$ for an $n \times 1$ vector does not admit any solution. Which of the following conclusions can be drawn from the given ... $Ax = c$ also does not admit a solution. Then the vector $c$ is a constant multiple of the vector $b$
answered
in
Others
May 8, 2021
121
views
cmi2020-datascience
0
votes
107
CMI-2020-DataScience-A: 5
As per the data released by the US Department of Health, Education and Welfare, the number of Ph.D. degrees conferred in Earth Sciences from the year $1948$ to $1954$ is as given in Table $5$ ... average is an average of a subset of data points. Choose the best answer. $900$ $9,000$ $9,00,000$ $90,00,000$
answered
in
Others
May 8, 2021
241
views
cmi2020-datascience
1
vote
108
CMI2013-B-07
Consider the code below, defining the function $\text{mystery}:$ 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)); } Express $\text{mystery}(1, \:n)$ ... of $n$. Express $\text{mystery}(2,\: n)$ as a function of $n$. Compute $\text{mystery}(3, \:2)$ and $\text{mystery}(3, 3)$.
answered
in
Algorithms
May 8, 2021
728
views
cmi2013
descriptive
recurrence-relation
0
votes
109
CMI2013-B-06b
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 ... dynamic programming to compute the maximum number of complete matches you can watch next week. Analyze the worse-case complexity of your algorithm.
answered
in
Algorithms
May 8, 2021
845
views
cmi2013
descriptive
algorithms
dynamic-programming
0
votes
110
CMI2013-B-06a
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 ... match whose starting time is strictly later than the finishing time of the current match? Analyze the worse-case complexity of your algorithm.
answered
in
Algorithms
May 8, 2021
513
views
cmi2013
descriptive
algorithms
algorithm-design
0
votes
111
CMI2013-B-05
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 ... . Model this problem formally using graphs. Describe an efficient algorithm for the problem and analyze the worst-case complexity of your algorithm.
answered
in
Algorithms
May 8, 2021
254
views
cmi2013
descriptive
algorithms
graph-algorithms
1
vote
112
CMI2013-B-04
You are given two sorted lists of integers of size $m$ and $n$. Describe a divide and conquer algorithm for computing the $k$-th smallest element in the union of the two lists in time $O(\log m + \log n)$.
answered
in
Algorithms
May 8, 2021
616
views
cmi2013
algorithms
sorting
divide-and-conquer
descriptive
0
votes
113
CMI2013-B-03
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.
answered
in
Graph Theory
May 8, 2021
533
views
cmi2013
descriptive
graph-theory
graph-connectivity
0
votes
114
CMI2013-B-02
A complete graph on $n$ 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 $G$ be a complete graph on $10$ vertices. Let $u$, $v$, $ w$ be three distinct vertices in $G$. How many simple paths are there from $u$ to $v$ going through $w$?
answered
in
Graph Theory
May 8, 2021
2.4k
views
cmi2013
descriptive
graph-theory
graph-connectivity
0
votes
115
CMI2013-B-01
For a binary string $x = a_0a_1 \dots a_{n−1}$ define $val(x)$ to be the value of $x$ interpreted as a binary number, where $a_0$ is the most significant bit. More formally, $val(x)$ is given by $\Sigma_{0 \leq i < n} 2^{n-1-i} .a_i$ Design a finite automaton that accepts exactly the set of binary strings $x$ such that $val(x)$ is divisible by either 4 or 5.
answered
in
Theory of Computation
May 7, 2021
313
views
cmi2013
descriptive
theory-of-computation
finite-automata
0
votes
116
CMI2013-A-10
The below question is based on 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]; ... endfor end The number of times the test $A[i] > A[\text{position}]$ is executed is: $100$ $5050$ $10000$ Depends on contents of $A$
answered
in
Algorithms
May 7, 2021
1.0k
views
cmi2013
algorithms
time-complexity
0
votes
117
CMI2013-A-09
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 ... A[position] := tmp; endfor end When the procedure terminates, the array A has been: Reversed Left unaltered Sorted in descending order Sorted in ascending order
answered
in
Algorithms
May 7, 2021
835
views
cmi2013
algorithms
identify-function
0
votes
118
CMI2013-A-08
In the passing out batch, $54$ students know Java, $39$ know Python and $43$ know C++. Of these, $15$ know both Java and Python, $17$ know both Python and C++ and $23$ know both Java and C++ and $11$ know all three languages. If there are $100$ students in the class, how many know none of these three languages? $3$ $8$ $17$ $19$
answered
in
Quantitative Aptitude
May 7, 2021
348
views
cmi2013
quantitative-aptitude
set-theory
0
votes
119
CMI2013-A-07
Consider the following two statements. There are infinitely many interesting whole numbers. There are finitely many uninteresting whole numbers. Which of the following is true? Statements $1$ and $2$ are equivalent. Statement $1$ implies statement $2$. Statement $2$ implies statement $1$. None of the above.
answered
in
Mathematical Logic
May 7, 2021
1.5k
views
cmi2013
mathematical-logic
logical-reasoning
0
votes
120
CMI2013-A-06
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 $G$ be a simple graph on $8$ vertices such that there is a vertex of degree $1$, a vertex of degree $2$, a vertex of degree $3$, a vertex ... degree $6$ and a vertex of degree $7$. Which of the following can be the degree of the last vertex? $3$ $0$ $5$ $4$
answered
in
Graph Theory
May 7, 2021
4.6k
views
cmi2013
graph-theory
normal
degree-of-graph
Page:
« prev
1
2
3
4
5
6
7
8
9
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(855)
Recent Blog Comments
Tests have been sent and all tests will be...
@GO Classes @Deepak Poonia @Sachin...
@GO Classes @Deepak Poonia sir...
Maximum age limit changed from 35 yrs. to 28...
Hmm, sir totally getting your point ☺️☺️....