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
Questions by suneetha
1
votes
1
answer
41
linear algebra
the product of the non-zero eigen values of the matrax 1 0 0 0 1 0 1 1 1 0 0 1 1 1 0 0 1 1 1 0 1 0 0 0 1 how can we solve this question?
the product of the non-zero eigen values of the matrax1 0 0 0 10 1 1 1 00 1 1 1 00 1 1 1 01 0 0 0 1how can we solve this question?
339
views
asked
Jul 2, 2018
Mathematical Logic
linear-algebra
eigen-value
+
–
0
votes
3
answers
42
linear algebra
Let A be the 2 × 2 matrix with elements a11 = a12 = a21 = +1 and a22 = −1. Then the eigenvalues of the matrix A19 are (a) 1024 and−1024 (b) 1024√2 and −1024√2 (c) 4√2 and−4√2 (d) 512√2 and−512√2
Let A be the 2 × 2 matrix with elements a11 = a12 = a21 = +1 and a22 = −1. Then the eigenvalues of the matrix A19 are(a) 1024 and−1024 (b) 1024√2 and −1024√2(c...
9.9k
views
asked
Jul 2, 2018
Linear Algebra
linear-algebra
+
–
0
votes
1
answer
43
time complexity
int Dosomething(int n) { if(n>=2) return 1; else return (floor(sqrt(n)))+n; } time complexity of the program?
int Dosomething(int n){if(n>=2)return 1;elsereturn (floor(sqrt(n)))+n;}time complexity of the program?
569
views
asked
Jun 25, 2018
Algorithms
time-complexity
+
–
0
votes
1
answer
44
time complexity
let n>=m int gcd(n,m) { if(n%m==0) return ml; n=n%m; return gcd(m,n); } how many recursive calls are made by this function?
let n>=mint gcd(n,m){if(n%m==0)return ml;n=n%m;return gcd(m,n);}how many recursive calls are made by this function?
544
views
asked
Jun 25, 2018
Algorithms
time-complexity
+
–
2
votes
3
answers
45
minimization
Let $‘1’$ and $‘0’$ denote the binary constants. Consider the following Boolean expression for $F$ over two variables $P$ and $Q$: $F(P, Q) = ( ( 1 \oplus P) \oplus (P \oplus Q) ) \oplus ( (P \oplus Q) \oplus (Q \oplus 0) ) $ The equivalent expression for $F$ is
Let $‘1’$ and $‘0’$ denote the binary constants. Consider the following Boolean expression for $F$ over two variables $P$ and $Q$:$F(P, Q) = ( ( 1 \oplus P) \oplu...
590
views
asked
May 30, 2018
Digital Logic
digital-logic
boolean-algebra
+
–
2
votes
1
answer
46
functions in c
#include <stdio.h> #include <stdarg.h> int fun(int n, ...) { int i, j = 1, val = 0; va_list p; va_start(p, n); for (; j < n; ++j) { i = va_arg(p, int); val += i; } va_end(p); return val; } int main() { printf("%d\n", fun(4, 1, 2, 3)); return 0; } will you explain the output for the program?
#include <stdio.h #include <stdarg.h int fun(int n, ...) { int i, j = 1, val = 0; va_list p; va_start(p, n); for (; j < n; ++j) { i = va_arg(p, int); val += i; } va_end(p...
1.1k
views
asked
Aug 31, 2017
1
votes
3
answers
47
increment and decrement operators
#include <stdio.h> void main() { int a = 3; int b = ++a + a++ + --a; printf("Value of b is %d", b); } after compiling on gcc compiler it gives 11.will you explain how is it possible?
#include <stdio.h void main() { int a = 3; int b = ++a + a++ + a; printf("Value of b is %d", b); }after compiling o...
2.3k
views
asked
Aug 22, 2017
0
votes
1
answer
48
GeeksforGeeks
#include <stdio.h> #define PRINT(i, limit) do \ { \ if (i++ < limit) \ { \ printf("GeeksQuiz\n"); \ continue; \ } \ }while(0) int main() { int i = 0; PRINT(i, 3); return 0; } How many times GeeksQuiz is printed in the above program ?
#include <stdio.h #define PRINT(i, limit) do \ { \ if (i++ < limit) \ { \ printf("GeeksQuiz\n"); \ continue; \ } \ }while(0) int main() { int i = 0; PRINT(i, 3); return 0...
1.4k
views
asked
Aug 22, 2017
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register