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
Recent activity by aditya333
0
answers
1
Binary Tree
I think its answer is 8 .Please ,can any one make it sure for me :)
I think its answer is 8 .Please ,can any one make it sure for me :)
658
views
commented
Jan 25, 2019
DS
data-structures
binary-tree
+
–
2
answers
2
Virtual Gate
A complete graph on n vertices is an undirected graph in which every pair of distinct vertices is connected by an edge. A simple path in a graph is one in which no vertex is repeated. Let G be a complete graph on 10 vertices. Let u, v, w be three distinct vertices in G. How many simple paths are there from u to v going through w?
A complete graph on n vertices is an undirected graph in which every pair of distinct vertices is connected by an edge. A simple path in a graph is one in which no vertex...
837
views
commented
Jan 24, 2019
Graph Theory
discrete-mathematics
graph-theory
test-series
+
–
1
answer
3
#Combinatorics
428
views
comment edited
Jan 24, 2019
1
answer
4
MADE EASY CBT-2
THEY GIVE OPTIONS ARE 0 1 2 3 WHAT I DO WAS I PUT P=8,Q=4,R=2 AND X=16 AND THEN GET RESULT ACCORDING TO THAT AND MY RESULT WAS CLOSE TO 1 BUT THEY ARE GIVING ANSWER 0 BY SOME THEOREM WHICH I DONT KNOW CORRECT OR NOT anyones result 0 plzz prove that
THEY GIVE OPTIONS ARE 0123WHAT I DO WAS I PUT P=8,Q=4,R=2 AND X=16 AND THEN GET RESULT ACCORDING TO THAT AND MY RESULT WAS CLOSE TO 1 BUT THEY ARE GIVING ANSWER 0 BY SOM...
636
views
commented
Jan 23, 2019
3
answers
5
probability
In a lottery, 10 tickets are drawn at random out of 50 tickets numbered from 1 to 50. What is the expected value of the sum of numbers on the drawn tickets?
In a lottery, 10 tickets are drawn at random out of 50 tickets numbered from 1 to 50. What is the expected value of the sum of numbers on the drawn tickets?
3.9k
views
commented
Jan 21, 2019
Mathematical Logic
probability
engineering-mathematics
conditional-probability
random-variable
+
–
0
answers
6
ME C programming
Let X be the number of times the comparison inside the while loop (i.e. m <= n ) is performed, when mystery(127, 255) is called. Then the value of X is, 125 65 64 66
Let X be the number of times the comparison inside the while loop (i.e. m <= n ) is performed, when mystery(127, 255) is called. Then the value of X is,125656466
511
views
commented
Jan 20, 2019
Programming in C
programming-in-c
+
–
1
answer
7
MADE ESY MOCK 1
consider R(A,B,C,D,E) with FDs AB->C,C->D,D->B,D->E if number of keys in relation R is ‘a’ and the number of relation in 3NF decomposition is ‘b’ what is the value of a-b? i am getting a=3,b=4 a-b=-1 am i correct?
consider R(A,B,C,D,E) with FDsAB->C,C->D,D->B,D->Eif number of keys in relation R is ‘a’ and the number of relation in 3NF decomposition is ‘b’ what is the value ...
280
views
commented
Jan 20, 2019
1
answer
8
probability
A player tosses two fair coins. He wins rs 2 if 2 heads occur and rs 1 if 1 head occurs. On the other hand, he loses rs 3 if no heads occur. if the player plays 100 times.then the amount he wins______________(RS).
A player tosses two fair coins. He wins rs 2 if 2 heads occur and rs 1 if 1 head occurs. On the other hand, he loses rs 3 if no heads occur. if the player plays 100 times...
659
views
answered
Jan 20, 2019
Mathematical Logic
probability
engineering-mathematics
random-variable
conditional-probability
+
–
0
answers
9
Self Doubt
3NF Decomposition for the relation R(A,B,C): A $\rightarrow$ BC B $\rightarrow$ C such that it is lossless and dependency preserving. [It is said that 3NF decomposition is possible for any relation but I couldn't find decomposition for the above]
3NF Decomposition for the relation R(A,B,C):A $\rightarrow$ BCB $\rightarrow$ Csuch that it is lossless and dependency preserving. [It is said that 3NF decomposition is p...
332
views
commented
Jan 20, 2019
2
answers
10
TOC-Turing Machine
Consider the given below Turing Machine and identify the correct language accepted: (a+b)*aa(a+b)* b*a(bb*a)*a b*ab*a None of these The answer is given as (1). But I think (3) is correct as well. Can anyone tell me why only (1) is correct.
Consider the given below Turing Machine and identify the correct language accepted:(a+b)*aa(a+b)*b*a(bb*a)*ab*ab*aNone of theseThe answer is given as (1). But I think (3)...
1.0k
views
commented
Jan 20, 2019
Theory of Computation
theory-of-computation
turing-machine
test-series
+
–
1
answer
11
ME & Deadlock - Semaphores
Will there be Mutual Exclusion & Deadlock ?
Will there be Mutual Exclusion & Deadlock ?
767
views
commented
Jan 20, 2019
Operating System
operating-system
semaphore
process-synchronization
deadlock-prevention-avoidance-detection
mutual-exclusion
+
–
1
answer
12
ME TEST SERIES QUESTION ON TIME COMPLEXITY
361
views
commented
Jan 20, 2019
Algorithms
made-easy-test-series
time-complexity
algorithms
+
–
0
answers
13
ACE - OS
Operating systems: which of the following scenarios guarantees deadlock free execution?
Operating systems: which of the following scenarios guarantees deadlock free execution?
554
views
commented
Jan 18, 2019
Operating System
operating-system
+
–
1
answer
14
Testbook Test Series: Computer Networks - Sliding Window
Frames of 20000 bytes are sent over 10 MBps full duplex link between 2 hosts. Propagation is 45 ms.Suppose that the sliding window protocol is used with the sender window size of 16 and acknowledgements are piggybacked.After sending 35 frames , what is the minimum time sender will have to wait before starting transmission of the next frame
Frames of 20000 bytes are sent over 10 MBps full duplex link between 2 hosts. Propagation is 45 ms.Suppose that the sliding window protocol is used with the sender window...
1.2k
views
commented
Jan 18, 2019
Computer Networks
testbook-test-series
computer-networks
sliding-window
+
–
4
answers
15
No. of View equivalent schedules
how many view equivalent schedules are possible for the Sch given below:
how many view equivalent schedules are possible for the Sch given below:
2.3k
views
commented
Jan 18, 2019
Databases
databases
view-serializable
transaction-and-concurrency
+
–
0
answers
16
Ace Academy Test series
If a 2 regular graph G has a perfect matching, then which of the following is NOT true? 1. G is a cycle graph 2. Chromatic number of G is 2 3. Every component of G is even cycle 4. G is a bipartite graph
If a 2 regular graph G has a perfect matching, then which of the following is NOT true?1. G is a cycle graph2. Chromatic number of G is 23. Every component of G is even c...
491
views
commented
Jan 16, 2019
0
answers
17
How to attempt such function questions. Always faces problem.
Let f(x, y) = (2x-y, x-2y), $\forall$(x, y) belongs $RxR$. Which of the following is true? f is one-to-one but not onto f is on-to but not one-to-one f is a bijection f is neither 1 – 1 nor onto
Let f(x, y) = (2x-y, x-2y), $\forall$(x, y) belongs $RxR$. Which of the following is true?f is one-to-one but not ontof is on-to but not one-to-one f is a bijectionf is n...
429
views
commented
Jan 16, 2019
1
answer
18
How to solve this question.
x = 5 + 2$\sqrt{6}$. Find $\frac{x-1}{\sqrt{x}}$
x = 5 + 2$\sqrt{6}$.Find $\frac{x-1}{\sqrt{x}}$
417
views
commented
Jan 16, 2019
Quantitative Aptitude
quantitative-aptitude
+
–
0
answers
19
Testbook.com Test Series
When searching for the key value 50 in a binary search tree, nodes containing the key values 10,15,20,30,60,80,89,90 are traversed, not necessarily in the given order. How many different orders are possible in which these key values can occur on the search path from the root to the node containing the value 50?
When searching for the key value 50 in a binary search tree, nodes containing the key values 10,15,20,30,60,80,89,90 are traversed, not necessarily in the given order. Ho...
509
views
commented
Jan 16, 2019
DS
binary-search-tree
+
–
0
answers
20
#madeeasy
{w/w€{0,1}^*; w has equal no. of occurrance of ‘001 and ‘010’} is regular or not??
{w/w€{0,1}^*; w has equal no. of occurrance of ‘001 and ‘010’} is regular or not??
458
views
commented
Jan 16, 2019
1
answer
21
Regular Expression
The answer given is none of these !! I think 1’st statement is the correct one, but still want to confirm
The answer given is none of these !!I think 1’st statement is the correct one, but still want to confirm
433
views
commented
Jan 16, 2019
Theory of Computation
theory-of-computation
regular-expression
+
–
1
answer
22
How to solve this question.
A schedule S contains three transactions $T_1$, $T_2$, $T_3$ and the oeprations sequence is given below: $T_1$: $Read$ $A$; $T_2$: $Write$ $A$; $T_3$: $Read$ $A$; $T_1$: $Write$ $A$; $T_3$: $Write$ $A$ and all ... above schedule is serializable or not? If yes it is equivalent to which serial schedule. Find the proper combination of the given alternatives from I to VII
A schedule S contains three transactions $T_1$, $T_2$, $T_3$ and the oeprations sequence is given below:$T_1$: $Read$ $A$; $T_2$: $Write$ $A$; $T_3$: $Read$ $A$; $T_1$: $...
1.4k
views
commented
Jan 16, 2019
Databases
databases
serializability
+
–
0
answers
23
How to solve this question
If seven colors are used to paint 50 bicycles then which of the following statements need not be true? at least eight bicycles are of the same color at least seven bicycles are of the same color at least nine bicycles are of the same color at most eight bicycles are of the same color
If seven colors are used to paint 50 bicycles then which of the following statements need not be true?at least eight bicycles are of the same colorat least seven bicycles...
4.6k
views
commented
Jan 16, 2019
Combinatory
pigeonhole-principle
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register