Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
vivek_mishra
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by vivek_mishra
3
votes
3
answers
1
JEST2020
Let G(V,E) be a simple graph. Let G’(V,E’) be a graph obtained from G such that (u,v) is an edge in G’ if (u,v) is not an edge in G. Which of the following is true? At least one of G or G’ are connected. G is necessarily disconnected. Both G and G’ are disconnected. None of the above.
Let G(V,E) be a simple graph. Let G’(V,E’) be a graph obtained from G such that (u,v) is an edge in G’ if (u,v) is not an edge in G. Which of the following is true?...
556
views
asked
Feb 15, 2021
1
votes
0
answers
2
JEST2020
For two n-bit strings x, y ∈ {0, 1}n, define z := x ⊕ y to be the bitwise XOR of the two strings (that is, if xi, yi, zi denote the i-th bits of x, y, z respectively, then zi = xi + yi mod 2). A function h : {0, 1}n → {0, 1}n is called linear if h(x ⊕ y) = h(x) ⊕ h(y), for every x, y ∈ {0, 1}n. The number of such linear functions for n ≥ 2: 2^n 2^2n 2^(n+1) n
For two n-bit strings x, y ∈ {0, 1}n, define z := x ⊕ y to be the bitwise XOR of the two strings (that is, if xi, yi, zi denote the i-th bits of x, y, z respectively,...
486
views
asked
Feb 15, 2021
5
votes
3
answers
3
CIL2020
#include int main( ) { int x=5, y=9; x=(x= x+y)-(y= x-y); printf("%d %d ", x, y); return 0; } A. 9 5 B. 5 14 C. 14 5 D. 5 9
#includeint main( ){int x=5, y=9;x=(x= x+y)-(y= x-y);printf("%d %d ", x, y);return 0;} A. 9 5B. 5 14C. 14 5D. 5 9
733
views
asked
Mar 5, 2020
Programming in C
cprogramming
programming
output
+
–
1
votes
1
answer
4
JEST 2020
X AND Y is an arbitrary sets, F: $X\rightarrow Y$ show that a and b are equivalent F is one-one For all set Z and function g1: $Z\rightarrow X$ and g2: $Z\rightarrow X$, if $g1 \neq g2$ implies $f \bigcirc g1 \neq f \bigcirc g2$ Where $\bigcirc$ is a fucntion composition.
X AND Y is an arbitrary sets, F: $X\rightarrow Y$ show that a and b are equivalent F is one-oneFor all set Z and function g1: $Z\rightarrow X$ and g2: $Z\rightarrow X$, ...
841
views
asked
Feb 17, 2020
Set Theory & Algebra
jest
functions
set-theory
+
–
2
votes
0
answers
5
JEST 2019
Let ${(0,1)}^n$ set of all binary string of length n. Hamming sphere of radius around a string C in ${(0,1)}^n$ is the set of all strings d$\epsilon$ ${(0,1)}^n$ that differ from C in at most r of n position, S(C,r) for n=2k+1 For C,C’ $\epsilon$ ${(0,1)}^n$ S(C,k) and S(C’,k) are disjoint couldn't remember rest of the options.
Let ${(0,1)}^n$ set of all binary string of length n. Hamming sphere of radius around a string C in ${(0,1)}^n$ is the set of all strings d$\epsilon$ ${(0,1)}^n$ that dif...
476
views
asked
Feb 17, 2019
Set Theory & Algebra
jest
2019
discrete-mathematics
+
–
1
votes
1
answer
6
JEST 2019
Solve the recurrence relation given as: T(n)=2T(n-2)+n; where T(2)=2 and T(1)=0 What is the solution?
Solve the recurrence relation given as: T(n)=2T(n-2)+n; where T(2)=2 and T(1)=0What is the solution?
935
views
asked
Feb 17, 2019
Algorithms
jest-2019
jest
algorithms
recurrence-relation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register