• recategorized by
905 views

1 Answer

Position:
Show:

Related questions

2 2 votes
1 answers 1 answer
1.4k
1.4k views
LRU asked Nov 22, 2021
1,363 views
Number different of binary search trees which can be created with the elements {12, 34, 22, 43, 13, 45, 55, 94, 99, 23} with 45 as the root is___.
1 1 vote
1 1 answer
1.1k
1.1k views
Sagar475 asked Jan 21, 2022
1,108 views
A min heap of size 2048 is stored on an array with array indices [1..2048] is stored and the minimum number of comparisons required to determine the maximum of element i...
2 2 votes
1 answers 1 answer
1.3k
1.3k views
LRU asked Nov 3, 2021
1,336 views
The time required to determine the minimum element from the max heap of size O(log(n)) is given by
4 4 votes
2 2 answers
2.6k
2.6k views
rsansiya111 asked Nov 2, 2022
2,632 views
In the GO back N ARQ sender is sending the 15 packets to the destination with a window size of 5.Assume every sixth packet while transmission is lost. How many transmiss...