1 answer
1
Does non preemptive CPU scheduling needs hardware support.kindly explain.
1 answer
3
Please help me understand this question. I have searched on internet, but not avail. Click this to see the question
3 answers
4
I'm so confused what happens when you concatenate/MUL Epsilon ε with any input symbol?What is ε.a = ?and what is ε.0 = ?what is ε.1= ?
1 answer
6
Hello may someone tell me what trees need to be studied in Data Structures subject.
1 answer
8
what is the difference between round trip time and propagation delay in tcp/ip protocol? is RTT = 2 * TP ?
9 answers
12
What is the worst case time complexity of inserting $n$ elements into an empty linked list, if the linked list needs to be maintained in sorted order?$\Theta(n)$$\Theta(n...
1 answer
15
10 answers
21
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time$\Theta (n \log n)$$\Theta (n)$$\Theta(\log n)$$\...
1 answer
23
what is the best standard book forComputer Networks –II .Objectives: The objective of the course is to offer good understanding of the concepts of network security, wir...
1 answer
28
I’ve seen this wikipedia article – https://en.wikipedia.org/wiki/Comparison_sortAlso see this link – https://gateoverflow.in/32948/minimum-number-of-comparisonshttp...
2 answers
29
I did Google and found out that Quicksort is better then Mergesort, but my question is which is faster among both?
1 answer
30
You have an array of n elements. Suppose you implement quick sort by always choosing the central element of the array as the pivot. Then the tightest lower bound for the...