Register
Filter

Recent activity by Onika

1 answer
2
regular expressions
{(a* b)a } intersection {a*b*}, is this considered a regular language ? or not and how do i know ?
{(a* b)a } intersection {a*b*}, is this considered a regular language ? or not and how do i know ?
2 answers
5
CRC
0 answers
6
CBRT Computer Engineering Paper
1 answer
9
Computer Networks
Question from PW Answer given is a Somebody please explain.
Question from PWAnswer given is aSomebody please explain.
2 answers
12
Self Doubt
Why is the vertex connectivity of a graph always less than or equal to its edge connectivity?
Why is the vertex connectivity of a graph always less than or equal to its edge connectivity?
1 answer
13
Testbook Test Series
3 answers
14
Applied Mock Test
Host A is connected to host B with a 100 Mbps link that has a 200 ms one-way latency and transmission delay of 10 sec. How much data can A send to B before B’s first acknowledgement reaches A?
Host A is connected to host B with a 100 Mbps link that has a 200 ms one-way latency and transmission delay of 10 sec. How much data can A send to B before B’s first ac...
1 answer
15
ACE academy Test series : Computer networks
At a transmission rate of 20Mbps and propagation speed of 2*10^8m/s. How many meters of the cable is one-bit delay in an Ethernet interface equivalent?
At a transmission rate of 20Mbps and propagation speed of 2*10^8m/s. How many meters of the cable is one-bit delay in an Ethernet interface equivalent?
0 answers
17
Testbook Test Series
2 answers
19
#Selfdoubt How L-attributed semantic rules are evaluated? Whether they are evaluated simultaneously during parsing?
If the grammar has only S-attributed semantic definitions, in a top down parser we will add the semantic action at the end of production and it will we executed when we...
3 answers
21
QUICK SORT- SELF DOUBT
In quick sort for sorting of n Numbers, the 75th greatest Element is selected as pivot using $O(n^2)$ time complexity algorithm than what is the worst case time complexity of quick sort. O($n^2$) O($n^3$) O(nlogn) O(n)
In quick sort for sorting of n Numbers, the 75th greatest Element is selected as pivot using $O(n^2)$ time complexity algorithm than what is the worst case time complexit...
1 answer
23
merge sort
given n elements merge them into one sorted list using merge procedure then what is the time complexity for this ? explain with example
given n elements merge them into one sorted list using merge procedure then what is the time complexity for this ?explain with example
2 answers
26
Applied Test Series
A large bowl contains 15 balls that are identical except for their colors 6 are colored red, 5 are colored blue and 4 are colored green. What is the probability that two balls selected at random from the bowl have the same color_____
A large bowl contains 15 balls that are identical except for their colors 6 are colored red, 5 are colored blue and 4 are colored green. What is the probability that two ...
3 answers
28
Applied Test Series
The number of possible ways in which 5 identical helicopters can take off given that we are having 5 helipads.____
The number of possible ways in which 5 identical helicopters can take off given that we are having 5 helipads.____