Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
vijaycs
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by vijaycs
1
votes
91
sets
334
views
answered
Jun 2, 2016
0
votes
92
Calculate address
Consider 3 dimensional array A[90][30][40] stored in a linear array in column major order. If the base address starts at 10, what is the location of A[20][20][30]? Assume the first element us stored at A[1][1][1].
Consider 3 dimensional array A[90][30][40] stored in a linear array in column major order. If the base address starts at 10, what is the location of A[20][20][30]? Assume...
7.5k
views
answered
Jun 2, 2016
3
votes
93
a graph with n vertices and n-1 edges that is not a tree is called
12.3k
views
answered
Jun 2, 2016
Graph Theory
graph-theory
tree
+
–
6
votes
94
ISRO2007-07
If a graph requires $k$ different colours for its proper colouring, then the chromatic number of the graph is $1$ $k$ $k-1$ $k/2$
If a graph requires $k$ different colours for its proper colouring, then the chromatic number of the graph is$1$$k$$k-1$$k/2$
3.9k
views
answered
Jun 2, 2016
Graph Theory
isro2007
graph-theory
graph-coloring
+
–
4
votes
95
What is the size of stack?
Consider the following infix expression which is to be converted to postfix expression using stack. (((P+Q)*(R+S))/T)+(A*(B+C))
Consider the following infix expression which is to be converted to postfix expression using stack.(((P+Q)*(R+S))/T)+(A*(B+C))
1.8k
views
answered
Jun 2, 2016
3
votes
96
How to eliminate indirect left recursion ?
J -> Lx K -> Ly L -> J | K | f Whoever Answers Please Explain Methods solving such Questions .
J - Lx K - Ly L - J | K | fWhoever Answers Please Explain Methods solving such Questions .
983
views
answered
May 31, 2016
Compiler Design
compiler-design
parsing
recurrence-relation
grammar
+
–
1
votes
97
What is the time complexity of the function?
void fun(int n, int k) { for (int i=1; i<=n; i++) { int p = pow(i, k); for (int j=1; j<=p; j++) { // Some O(1) work } } }
void fun(int n, int k) { for (int i=1; i<=n; i++) { int p = pow(i, k); for (int j=1; j<=p; j++) { // Some O(1) work } }}
1.9k
views
answered
May 31, 2016
Algorithms
algorithms
time-complexity
+
–
7
votes
98
ISI2014-PCB-CS-4b
Consider the following statement: $\text{ For all languages }L \subseteq \{0, 1\}^*, \text{ if }L^* \text{ is regular then L is regular.}$ Is the above statement true? Justify your answer.
Consider the following statement:$\text{ For all languages }L \subseteq \{0, 1\}^*, \text{ if }L^* \text{ is regular then L is regular.}$Is the above statement true? Just...
1.9k
views
answered
May 29, 2016
Theory of Computation
descriptive
isi2014-pcb-cs
theory-of-computation
regular-language
+
–
0
votes
99
TOC
Given Language L1 is DCFL and L2 is DCFL ? Then (L1$\cap$L2)c will be Regular DCFL CFL CSL but not CFL
Given Language L1 is DCFL and L2 is DCFL ? Then (L1$\cap$L2)c will beRegularDCFLCFLCSL but not CFL
1.1k
views
answered
May 29, 2016
3
votes
100
GATE1991-15,a
<p><span style="line-height: 1.6;">Show that the product of the least common multiple and the greatest common </span><span style="line-height: 1.6;">divisor of two positive integers $a$ and $b$ is $a\times b$.</span></p> <p> </p>
<p><span style="line-height: 1.6;">Show that the product of the least common multiple and the greatest common </span><span style="line-height: 1.6;">divisor of two p...
1.9k
views
answered
May 29, 2016
Set Theory & Algebra
gate1991
mathematical-logic
normal
+
–
6
votes
101
train problem
Two, trains, one from Howrah to Patna and the other from Patna to Howrah, start simultaneously. After they meet, the trains reach their destinations after 9 hours and 16 hours respectively. The ratio of their speeds is ??
Two, trains, one from Howrah to Patna and the other from Patna to Howrah, start simultaneously. After they meet, the trains reach their destinations after 9 hours and 16 ...
1.7k
views
answered
May 28, 2016
13
votes
102
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 throw $2$ or $6$ you order a lime juice. If you throw a $4$, you order a lassi. Otherwise, you throw ... is the probability that you end up ordering a lime juice? $\frac{1}{3}$ $\frac{1}{2}$ $\frac{2}{3}$ $\frac{3}{4}$
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 ...
1.2k
views
answered
May 27, 2016
Probability
cmi2015
probability
+
–
7
votes
103
CMI2012-B-03b
Let $A$ be an array of $n$ integers, sorted so that $A[1] \leq A[2] \leq \dots A[n]$. Suppose you are given a number $x$ and you wish to find out if there exist indices $k$ and $l$ such that $A[k]+A[l] = x$. Design an $O(n)$ algorithm for this problem.
Let $A$ be an array of $n$ integers, sorted so that $A \leq A \leq \dots A[n]$. Suppose you are given a number $x$ and you wish to find out if there exist indices $k$ a...
1.4k
views
answered
May 27, 2016
Algorithms
descriptive
cmi2012
algorithms
algorithm-design
+
–
17
votes
104
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 regular. If $L_1$ is regular, then $L_2$ must also be regular. Either both $L_1$ and $L_2$ are regular, or both are not regular. None of the above.
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...
1.2k
views
answered
May 27, 2016
Theory of Computation
cmi2015
theory-of-computation
regular-language
+
–
11
votes
105
UGC NET CSE | June 2012 | Part 2 | Question: 30
In round robin CPU scheduling as time quantum is increased the average turn around time increases decreases remains constant varies irregularly
In round robin CPU scheduling as time quantum is increased the average turn around timeincreasesdecreasesremains constantvaries irregularly
9.8k
views
answered
May 25, 2016
Operating System
ugcnetcse-june2012-paper2
operating-system
process-scheduling
+
–
2
votes
106
DM/ Set Problem
S1: There exists infinite sets A, B, C such that A ∩ (B ∪ C) is finite. S2: There exists two irrational numbers x and y such that (x+y) is rational. Which of the following is true about S1 and S2? (A) Only S1 is correct and S2 is incorrect (B) Only S2 ... and S1 is not correct (C) S1 and S2 both are correct (D) S1 and S2 both are not correct (E) If you think any other options.
S1: There exists infinite sets A, B, C such that A ∩ (B ∪ C) is finite.S2: There exists two irrational numbers x and y such that (x+y) is rational.Which of the follow...
474
views
answered
May 25, 2016
Set Theory & Algebra
set-theory&algebra
finite-infinite-set
closure-property
+
–
1
votes
107
Logic
p:grizzly bears have been seen in the area q:hiking is safe on the trail r:berries are ripe along the trail write the question using p,q,r and logical connectives Q--FOR HIKING ON THE TRAIL TO BE SAFE,IT IS NECESSERY BUT NOT SUFFICIENT THAT BERRIES NOT BE RIPE ALONG THE TRAIL AND FOR GRIZZLY BEARS NOT TO HAVE BEEN SEEN IN THE AREA
p:grizzly bears have been seen in the areaq:hiking is safe on the trailr:berries are ripe along the trailwrite the question using p,q,r and logical connectivesQ FOR HIKIN...
403
views
answered
May 24, 2016
24
votes
108
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.
Consider the following two statements.There are infinitely many interesting whole numbers.There are finitely many uninteresting whole numbers.Which of the following is tr...
2.3k
views
answered
May 24, 2016
Mathematical Logic
cmi2013
mathematical-logic
logical-reasoning
+
–
11
votes
109
ISRO-2013-72
How many diagonals can be drawn by joining the angular points of an octagon? $14$ $20$ $21$ $28$
How many diagonals can be drawn by joining the angular points of an octagon?$14$$20$$21$$28$
4.9k
views
answered
May 24, 2016
Quantitative Aptitude
isro2013
quantitative-aptitude
geometry
+
–
1
votes
110
isro 2008
719
views
answered
May 23, 2016
5
votes
111
Kenneth Rosen Edition 6th Exercise 1.2 Question 30 (Page No. 29)
Show that (p ∨ q) ∧ (¬p ∨ r) → (q ∨ r) is a tautology. Prove it without Truth tables.
Show that (p ∨ q) ∧ (¬p ∨ r) → (q ∨ r) is a tautology. Prove it without Truth tables.
853
views
answered
May 23, 2016
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
+
–
3
votes
112
Find the total number of ways in which the vowels in the word ' PERMUTATION ' appears in alphabetical order .
2.3k
views
answered
May 23, 2016
Combinatory
combinatory
+
–
0
votes
113
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)$.
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.1k
views
answered
May 23, 2016
Algorithms
cmi2013
descriptive
recurrence-relation
+
–
11
votes
114
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$
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 ...
1.3k
views
answered
May 23, 2016
Algorithms
cmi2013
algorithms
time-complexity
+
–
12
votes
115
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
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 :...
1.1k
views
answered
May 23, 2016
Algorithms
cmi2013
algorithms
identify-function
+
–
0
votes
116
CMI2013-A-05
You have $n$ lists, each consisting of $m$ integers sorted in ascending order. Merging these lists into a single sorted list will take time: $O(nm \log m)$ $O(mn \log n)$ $O(m + n)$ $O(mn)$
You have $n$ lists, each consisting of $m$ integers sorted in ascending order. Merging these lists into a single sorted list will take time:$O(nm \log m)$$O(mn \log n)$...
6.6k
views
answered
May 23, 2016
Algorithms
cmi2013
algorithms
sorting
+
–
17
votes
117
CMI2012-B-03a
Let $A$ be an array of $n$ integers, sorted, so that $A[1] \leq A[2] \leq \dots A[n]$. Suppose you are given a number $x$ and you wish to find out if there are indices $k$ and $l$ such that $A[k]+A[l] = x$. Design an $O(n \log n)$ time algorithm for this problem.
Let $A$ be an array of $n$ integers, sorted, so that $A \leq A \leq \dots A[n]$. Suppose you are given a number $x$ and you wish to find out if there are indices $k$ an...
961
views
answered
May 23, 2016
Algorithms
cmi2012
descriptive
algorithms
algorithm-design
+
–
16
votes
118
GATE2010 ME
The function $y=|2 - 3x|$ is continuous $∀ x ∈ R$ and differentiable $∀ x ∈ R$ is continuous $∀ x ∈ R$ and differentiable $∀ x ∈ R$ except at $x=\frac{3}{2}$ is continuous $∀ x ∈ R$ and differentiable $∀ x ∈ R$ except at $x=\frac{2}{3}$ is continuous $∀ x ∈ R$ except $x=3$ and differentiable $∀ x ∈ R$
The function $y=|2 - 3x|$is continuous $∀ x ∈ R$ and differentiable $∀ x ∈ R$is continuous $∀ x ∈ R$ and differentiable $∀ x ∈ R$ except at $x=\frac{3}...
5.5k
views
answered
May 22, 2016
Calculus
calculus
gate2010me
engineering-mathematics
continuity
+
–
1
votes
119
isro
873
views
answered
May 22, 2016
Page:
« prev
1
2
3
4
5
6
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register