Register
Filter

Answers by IamRishabh

1 votes
2
sum of n terms
find sum of n terms 1^2 - 2^2 + 3^2 - 4^2 + 5^2 - 6^2 + ................... can anyone explain me this how to solve this
find sum of n terms 1^2 - 2^2 + 3^2 - 4^2 + 5^2 - 6^2 + ................... can anyone explain me this how to solve this
0 votes
5
linearalgebra
if $A = \begin{bmatrix} 2 &3 &4 \\ 3 & -1 &2 \\ -1& 4 & 5 \end{bmatrix}$ then rank of the matrix $(A-A^T)$ is _____ (A) $1$ (B) $2$ (C) $3$ (D) $0$
if $A = \begin{bmatrix} 2 &3 &4 \\ 3 & -1 &2 \\ -1& 4 & 5 \end{bmatrix}$ then rank of the matrix $(A-A^T)$ is _____(A) $1$ (B) $2$ (C...
0 votes
8
minimum expression
0 votes
9
combinational circuits
1 votes
10
ace mock logic
1 votes
12
switch case output in case of expressions
#include int main() { char check = 'a'; switch (check) { case 'a' || 1: printf("Gates "); case 'b' || 2: printf("Quiz "); break; default: printf("GatesQuiz"); } return 0; } (a) Gates (b) Gates Quiz (c) Gates Quiz GatesQuiz (d) Compile-time error
#includeint main(){ char check = 'a';switch (check){case 'a' || 1: printf("Gates ");case 'b' || 2: printf("Quiz ");break;default: printf("GatesQuiz");} return 0; }(a) Gat...
2 votes
13
hashing
pls explain..
pls explain..
0 votes
14
Madeeeasy DE test
Test 2 ques 12
Test 2 ques 12
0 votes
15
ACE test
Qus 12. A magnitude comparator consists of inputs A[A3 A2 A1 A0] and B[B3 B2 B1 B0]. The total number of comparisons performed for A>B is ______________
Qus 12. A magnitude comparator consists of inputs A[A3 A2 A1 A0] and B[B3 B2 B1 B0]. The total number of comparisons performed for A>B is ______________
1 votes
16
General doubt on calculating the Time complexity for the given Insertion Sort Algorithm in the worst and average case
INSERTION-SORT (A, n) ⊳ A[1 . . n]for (j ← 2 to len(A) ){key ← A[ j];i ← j – 1 ; while (i 0 and A[i] key) { A[...
1 votes
17
OS Test -1
A computer has 20 tape drivers, with n processes competing for them. Each process may need five drivers. What is the maximum value of n for the system to be deadlock free?
A computer has 20 tape drivers, with n processes competing for them. Each process may need five drivers. What is the maximum value of n for the system to be deadlock free...
0 votes
18
If L=(a+b)* and R=a*b*a* then L intersection R=?
We know, here R subset L so by formula R intersection L= R, but for any string R=L( both language are same) R intersection L can be R or L? Correct me!
We know, here R subset L so by formula R intersection L= R, but for any string R=L( both language are same) R intersection L can be R or L?Correct me!