Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by suparna kar
3
answers
1
ISI2004-MIII: 13
Let $X =\frac{1}{1001}+\frac{1}{1002}+\frac{1}{1003}+\ldots+\frac{1}{3001}$. Then $X< 1$ $X>\frac{3}{2}$ $1< X< \frac{3}{2}$ none of the above
Let $X =\frac{1}{1001}+\frac{1}{1002}+\frac{1}{1003}+\ldots+\frac{1}{3001}$. Then$X< 1$$X>\frac{3}{2}$$1< X< \frac{3}{2}$none of the above
2.7k
views
commented
Aug 10, 2020
Calculus
isi2004
engineering-mathematics
integration
+
–
2
answers
2
ISI2015-MMA-1
Let $\{f_n(x)\}$ be a sequence of polynomials defined inductively as $ f_1(x)=(x-2)^2$ $f_{n+1}(x) = (f_n(x)-2)^2, \: \: \: n \geq 1$ Let $a_n$ and $b_n$ respectively denote the constant term and the coefficient of $x$ in $f_n(x)$. Then $a_n=4, \: b_n=-4^n$ $a_n=4, \: b_n=-4n^2$ $a_n=4^{(n-1)!}, \: b_n=-4^n$ $a_n=4^{(n-1)!}, \: b_n=-4n^2$
Let $\{f_n(x)\}$ be a sequence of polynomials defined inductively as$$ f_1(x)=(x-2)^2$$$$f_{n+1}(x) = (f_n(x)-2)^2, \: \: \: n \geq 1$$Let $a_n$ and $b_n$ respectively de...
1.4k
views
commented
Jul 2, 2020
Combinatory
isi2015-mma
recurrence-relation
non-gate
+
–
2
answers
3
GATE CSE 2016 Set 2 | Question: 39
The given diagram shows the flowchart for a recursive function $A(n)$. Assume that all statements, except for the recursive calls, have $O(1)$ time complexity. If the worst case time complexity of this function is $O(n^{\alpha})$, then the least possible value (accurate up to two decimal positions) of $\alpha$ is ________. Flow chart for Recursive Function $A(n)$.
The given diagram shows the flowchart for a recursive function $A(n)$. Assume that all statements, except for the recursive calls, have $O(1)$ time complexity. If the wor...
16.6k
views
commented
Jan 29, 2020
Algorithms
gatecse-2016-set2
algorithms
time-complexity
recurrence-relation
normal
numerical-answers
+
–
3
answers
4
breadth first search
The max possible height of BFS tree , if BFS is run on a complete bipartite graph Km,n where m>=1 , n>=1 with starting vertex S is
The max possible height of BFS tree , if BFS is run on a complete bipartite graph Km,n where m>=1 , n>=1 with starting vertex S is
2.7k
views
commented
Jan 18, 2020
Programming in C
breadth-first-search
bipartite-graph
+
–
0
answers
5
Generating Function- Where to start?
Hello can anyone suggest good video/book to learn generating functions from?..i tried the nptel lecture..it has some audio lag. and i could not make much out of it..I am well versed in combinatorics but my calculus is weak.. Please suggest some resource that teaches generating functions from scratch
Hello can anyone suggest good video/book to learn generating functions from?..i tried the nptel lecture..it has some audio lag. and i could not make much out of it..I am ...
2.2k
views
commented
Jan 17, 2020
Combinatory
generating-functions
preparation
+
–
9
answers
6
GATE CSE 2006 | Question: 20, ISRO2015-17
Consider the following log sequence of two transactions on a bank account, with initial balance $12000,$ that transfer $2000$ to a mortgage payment and then apply a $5\%$ interest. T1 start T1 B old $=12000$ new $=10000$ ... $3$ because transaction T1 has committed We can apply redo and undo operations in arbitrary order because they are idempotent
Consider the following log sequence of two transactions on a bank account, with initial balance $12000,$ that transfer $2000$ to a mortgage payment and then apply a $5\%$...
28.4k
views
commented
Dec 20, 2019
Databases
gatecse-2006
databases
transaction-and-concurrency
normal
isro2015
+
–
3
answers
7
GATE CSE 2003 | Question: 56
Consider the grammar shown below $S \rightarrow i E t S S' \mid a$ $S' \rightarrow e S \mid \epsilon$ $E \rightarrow b$ In the predictive parse table, $M,$ of this grammar, the entries $M[S' , e]$ and $M[S' , \$]$ respectively are $\{S' \ ... $\{S' \rightarrow \epsilon\}$ $\{S' \rightarrow e S, S' \rightarrow \varepsilon$} and $\{S' \rightarrow \epsilon\}$
Consider the grammar shown below$S \rightarrow i E t S S’ \mid a$$S’ \rightarrow e S \mid \epsilon$$E \rightarrow b$In the predictive parse table, $M,$ of this gramma...
13.6k
views
comment edited
Oct 31, 2019
Compiler Design
gatecse-2003
compiler-design
grammar
normal
parsing
+
–
1
answer
8
Back edge,tree edge,forward edges in BFS
Consider the following statements: 1. Let T be the DFS tree resulting from DFS traversal on a connected directed graph the root of the tree is an articulation point, iff it has at least two children. 2. When BFS is carried out on a directed ... back edge, or cross edge and not forward edge as in the case of DFS. Find TRUE or FALSE for both the statements
Consider the following statements:1. Let T be the DFS tree resulting from DFS traversal on a connected directed graph the root of the tree is an articulation point, iff i...
13.5k
views
commented
Oct 17, 2019
DS
algorithms
breadth-first-search
depth-first-search
graph-algorithms
programming-in-c
data-structures
+
–
8
answers
9
GATE CSE 1987 | Question: 10b
What is the generating function $G(z)$ for the sequence of Fibonacci numbers?
What is the generating function $G(z)$ for the sequence of Fibonacci numbers?
10.1k
views
commented
Sep 17, 2019
Combinatory
gate1987
combinatory
generating-functions
descriptive
+
–
0
answers
10
SQL query
which of the following sets of keywords constitutes a mapping in SQL a) select , from , table b)select , from where c)connect , table , create d)select , table , insert i cant understand what the question is trying to coney and the answer given is B
which of the following sets of keywords constitutes a mapping in SQLa) select , from , tableb)select , from wherec)connect , table , created)select , table , inserti cant...
1.3k
views
commented
Oct 26, 2018
3
answers
11
UGC NET CSE | June 2016 | Part 3 | Question: 23
The regular expression for the complement of the language $L=\{a^nb^m \mid n \geq 4, m \leq 3\}$ is: $(\lambda +a+aa+aaa)b^*+a^*bbbb^*+(a+b)^*ba(a+b)^*$ $(\lambda +a+aa+aaa)b^*+a^*bbbbb^*+(a+b)^*ab(a+b)^*$ $(\lambda +a+aa+aaa)+a^*bbbbb^*+(a+b)^*ab(a+b)^*$ $(\lambda +a+aa+aaa)b^*+a^*bbbbb^*+(a+b)^*ba(a+b)^*$
The regular expression for the complement of the language $L=\{a^nb^m \mid n \geq 4, m \leq 3\}$ is:$(\lambda +a+aa+aaa)b^*+a^*bbbb^*+(a+b)^*ba(a+b)^*$$(\lambda +a+aa+aaa...
4.2k
views
commented
Aug 30, 2018
Theory of Computation
ugcnetcse-june2016-paper3
theory-of-computation
regular-expression
+
–
2
answers
12
Engineering Maths
If A = $\begin{bmatrix} -1 & 1 & 0 \\ 0 & 2 &-2 \\ 0& 0 & 3 \end{bmatrix}$ then trace of the matrix 3A2 + adj A is ____
If A = $\begin{bmatrix} -1 & 1 & 0 \\ 0 & 2 &-2 \\ 0& 0 & 3 \end{bmatrix}$ then trace of the matrix 3A2 + adj A is ____
839
views
asked
Aug 23, 2018
Linear Algebra
engineering-mathematics
linear-algebra
+
–
1
answer
13
Gate 2014 CE set 2
A fair(unbiased) coin was tossed 4 times in succession and resulted in the following outcomes : I) head ii) head iii) head iv) head. The probability of obtaining a "tail" when the coin is tossed again is A) 0 B) 1/2 C) 4/5 D) 1/5
A fair(unbiased) coin was tossed 4 times in succession and resulted in the following outcomes : I) head ii) head iii) head iv) head. The probability of obtaining a "tail...
1.3k
views
asked
Aug 22, 2018
Probability
probability
+
–
1
answer
14
Gate 2015 CE set 2
The two eigen values of the matrix $\begin{bmatrix} 2 & 1\\ 1& p \end{bmatrix}$ have a ratio of 3:1 for p= 2. What is another value of p for which eigenvalues have the same ratio of 3:1? A)-2 b) 1 c) 7/3 d)14/3
The two eigen values of the matrix $\begin{bmatrix} 2 & 1\\ 1& p \end{bmatrix}$ have a ratio of 3:1 for p= 2.What is another value of p for which eigenvalues have the sam...
2.6k
views
asked
Aug 17, 2018
Linear Algebra
eigen-value
usergate2015
usermod
+
–
2
answers
15
Gate 2016 CE Set 1
If the entries in each column of a square matrix M add up to 1, then an eigen value of M is A) 4 B) 3 C) 2 D) 1
If the entries in each column of a square matrix M add up to 1, then an eigen value of M isA) 4 B) 3 C) 2 D) 1
3.6k
views
asked
Aug 17, 2018
Linear Algebra
eigen-value
+
–
2
answers
16
Engineering mathematics
if the sum of the diagonal elements of a 2x2 matrix is (-6) then the maximum possible value of determinant of the matrix is
if the sum of the diagonal elements of a 2x2 matrix is (-6) then the maximum possible value of determinant of the matrix is
2.2k
views
commented
Aug 11, 2018
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register