Register
Filter

Answers by Kunal Kadian

1 votes
2
ME TEST SERIES
2 votes
3
made easy
A binary operator ⊕ on a set of R – {–1} is defined as x ⊕ y = x + y + xy. Which of the following statement is true about (S, ⊕)? A)(S, ⊕) is group but not abelian group B)(S, ⊕) is monoid but not group C)(S, ⊕) is semi-group but not monoid D)(S, ⊕) is abelian group
A binary operator ⊕ on a set of R – {–1} is defined as x ⊕ y = x + y + xy. Which of the following statement is true about(S, ⊕)?A)(S, ⊕) is group but not abel...
0 votes
4
MadeEasy Test Series: Probabilty - Probability
The probability of a man hitting a target in one fire is 1/6. The number of times at least he must fire at the target in order that his chance of hitting the target at least once will exceed 2/5 will be ?
The probability of a man hitting a target in one fire is 1/6. The number of times at least he must fire at the target in order that his chance of hitting the target at le...
1 votes
5
UPPCL
Which of following entry is same in both TCP header and UDP header Sequence number Acknowledgement number Checksum Urgent pointer
Which of following entry is same in both TCP header and UDP headerSequence numberAcknowledgement numberChecksumUrgent pointer
1 votes
7
UPPCL 2018 AE
Time complexity of this Recurrence relation T(n)=T(√n) +1 O(nlogn) O(log log n) O(n^2) n^2 logn
Time complexity of this Recurrence relation T(n)=T(√n) +1O(nlogn)O(log log n)O(n^2)n^2 logn
2 votes
8
made easy test
please explain this question
please explain this question
0 votes
10
ME Test Series
1 votes
11
Made easy Test
void foo(int n) { while (n! = 0) { if (!(n & 1)) printf(“*”); n = n >> 1 ; } } The number of times printf(“*”) is executed, when the value 2 raised to power 24 is passed to the function foo() is ?
void foo(int n){ while (n! = 0) { if (!(n & 1)) printf(“*”); n = n > 1 ; }} The number of times printf(“*”) is executed, whe...
0 votes
12
avl tree
what is the maximum possible hight of AVL tree with 54 node? is there any general method to solve this question?
what is the maximum possible hight of AVL tree with 54 node?is there any general method to solve this question?
2 votes
13
ACE Test Series question on CN
13 votes
15
GATE Overflow | Mock GATE | Test 1 | Question: 6
The remainder when $'m+n'$ is divided by $12$ is $8$, and the remainder when $'m-n'$ is divided by $12$ is $6$. If $m>n$, then what is the remainder when $'mn'$ is divided by $6$?
The remainder when $'m+n'$ is divided by $12$ is $8$, and the remainder when $'m-n'$ is divided by $12$ is $6$. If $m>n$, then what is the remainder when $'mn'$ is divide...
1 votes
16
Made Easy2019
The minimum size of stack required to evaluate given post fix expression is _____________ postfix :- 2 5 x 6 + 4 2 x - MY ANSWER IS 8.. CAN ANYONE TELL ME WHERE I AM WRONG…??
The minimum size of stack required to evaluate given post fix expression is _____________postfix :- 2 5 x 6 + 4 2 x - MY ANSWER IS 8..CAN ANYONE TELL ME WHERE I AM WRONG�...
2 votes
17
selfdoub
0 votes
18
ME Test Series
The calender for the year the year 2007 will be same for the year A 2016 B 2012 C 2014 D 2018
The calender for the year the year 2007 will be same for the yearA 2016B 2012C 2014D 2018
0 votes
19
Self doubt
Once we have assumed a don't care as '1' in SOP we can't use the same don't care for grouping zeros in POS and vice versa. Whether this statement is true or false.
Once we have assumed a don't care as '1' in SOP we can't use the same don't care for grouping zeros in POS and vice versa. Whether this statement is true or false.
0 votes
24
Test Series
My answer is B, but the provided answer is C.
My answer is B, but the provided answer is C.
0 votes
25
Test Series
Though n is finite, how we will compare a and c. My answer is D, but C is provided as the answer.
Though n is finite, how we will compare a and c. My answer is D, but C is provided as the answer.