Register
Filter

Answers by Kaluti

1 votes
4
oops doubt
A default catch block catches, [A]. all thrown objects [B]. no thrown objects [C]. any thrown object that has not been caught by an earlier catch block [D]. all thrown objects that have been caught by an earlier catch block
A default catch block catches,[A]. all thrown objects[B]. no thrown objects[C]. any thrown object that has not been caught by an earlier catch block[D]. all thrown object...
0 votes
6
Linked List
What kind of linked list is best to answer question like “What is the item at position n?” a) Singly linked list b) Doubly linked list c) Circular linked list d) Array implementation of linked list
What kind of linked list is best to answer question like “What is the item at position n?”a) Singly linked listb) Doubly linked listc) Circular linked listd) Array im...
0 votes
7
Time Complexity
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list? a) O(1) b) O(n) c) θ(n) d) θ(1)
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?a) O(1)b) O(n)c)...
0 votes
8
Heapsort Comparisons
How many element comparisons would heap sort use to sort the integers $1$ to $8$ if they were initially in sorted order, initially in reverse sorted order?
How many element comparisons would heap sort use to sort the integers $1$ to $8$ if they wereinitially in sorted order, initially in reverse sorted order?
3 votes
9
Madeeasy workbook
Let $A$ be a $3\times 3$ matrix such that $\mid A-I \mid=0$.If trace of $A=13$ and $det A = 32$ then sum of squares of the eigen values of $A$ is ..... $82$ $13$ $169$ $81$
Let $A$ be a $3\times 3$ matrix such that $\mid A-I \mid=0$.If trace of $A=13$ and $det A = 32$ then sum of squares of the eigen values of $A$ is .....$82$$13$$169$$81$
4 votes
10
ISI2017-MMA-29
Suppose the rank of the matrix $\begin{pmatrix}1&1&2&2\\1&1&1&3\\a&b&b&1\end{pmatrix}$ is $2$ for some real numbers $a$ and $b$. Then $b$ equals $1$ $3$ $1/2$ $1/3$
Suppose the rank of the matrix$$\begin{pmatrix}1&1&2&2\\1&1&1&3\\a&b&b&1\end{pmatrix}$$is $2$ for some real numbers $a$ and $b$. Then $b$ equals$1$$3$$1/2$$1/3$
1 votes
11
Gate probability
A party of n persons take their seats at random at a round table,then the probability that two specified person do not sit together is $\left(\dfrac{2}{n-1}\right)$ $\left(\dfrac{n-3}{n-1}\right)$ $\left(\dfrac{n-2}{n-1}\right)$ $\left(\dfrac{1}{n-1}\right)$
A party of n persons take their seats at random at a round table,then the probability that two specified person do not sit together is$\left(\dfrac{2}{n-1}\right)$$\left(...
0 votes
13
Rosen (Graph)
Show that an edge in a simple graph is a cut edge if and only if this edge is not a part of any simple circuit in the graph.
Show that an edge in a simple graph is a cut edge if and only if this edge is not a part of any simple circuit in the graph.
0 votes
14
ISI-2014-11
Let $X_1,X_2,X_3,X_4$ be i.i.d. random variables each assuming the value $1$ and $-1$ with probability $\dfrac{1}{2}$ each. Then, the probability that the matrix $\begin{pmatrix}X_1 &X_2\\ X_3 &X_4\end{pmatrix}$ is nonsingular equals $1/2$ $3/8$ $5/8$ $1/4$
Let $X_1,X_2,X_3,X_4$ be i.i.d. random variables each assuming the value $1$ and $-1$ with probability $\dfrac{1}{2}$ each. Then, the probability that the matrix $\begin{...
1 votes
19
Transaction
How many concurrent schedules are conflict serializable of given transactions T1 and T2: T1 = r1(A) W1(A)R1(B)W1(B) T2 = R2(B)W2(B)R2(A)W2(A)
How many concurrent schedules are conflict serializable of given transactions T1 and T2:T1 = r1(A) W1(A)R1(B)W1(B)T2 = R2(B)W2(B)R2(A)W2(A)
0 votes
20
Identify the language
$L = \{ wcww^r |\ w,c\ \epsilon\ ( a + b\ )^* \}$ Identify the language.
$L = \{ wcww^r |\ w,c\ \epsilon\ ( a + b\ )^* \}$Identify the language.
0 votes
21
finite automata
If all state of DFA is final then it accpets $\sum$ (i.e) regular true or false
If all state of DFA is final then it accpets $\sum$ (i.e) regulartrue or false
0 votes
22
NYQUIST THEOREM
What should be the minimum & maximum sampling rate for NYQUIST THEOREM?
What should be the minimum & maximum sampling rate for NYQUIST THEOREM?
0 votes
23
turing machine - self
Turing machine can be constructed by FA with 2 stacks??
Turing machine can be constructed by FA with 2 stacks??
0 votes
24
TOC- regular languages
Let the homomorphism defined over alphabet Σ{0, 1} is h(0) = aa and h(1) = aba, and L = (ab + ba)*a then what is h-1(L)?
Let the homomorphism defined over alphabet Σ{0, 1} is h(0) = aa and h(1) = aba, and L = (ab + ba)*athen what is h-1(L)?
1 votes
26
BCD Adder
A decimal parallel adder that add n decimal digits needs how many BCD adder stages 1. n 2. 2n 3. 1 4 n^2
A decimal parallel adder that add n decimal digits needs how many BCD adder stages1. n 2. 2n3. 14 n^2
0 votes
27
practics paper
for fintie autometa of n state the max lenght of string that must be consider to distinguish two state is- 1. n 2. n-1 3 n-2 4.none
for fintie autometa of n state the max lenght of string that must be consider to distinguish two state is-1. n2. n-13 n-24.none
0 votes
28
TEST SERIES
This question I have many doubts like (1) what are those final states (2) what is the meaning of phyi here (3) from state q0 n q1 when EPSILON input is given what is its meaning (4) plz someone draw the PDA diag. (5) Plz give the language also (6) And lastly what the answar
This question I have many doubts like(1) what are those final states(2) what is the meaning of phyi here(3) from state q0 n q1 when EPSILON input is given what is its ...
Page: