1 answer
4
You are given a 1 billion numbers. The time require in seconds to sort them provided sorting thousand numbers takes 100 microseconds will be _______10,00051230065536
1 answer
5
What will be the output of the following C program? If you think it will give a runtime error, you need to mention it. In either case,your answer must include proper just...
3 answers
8
1 answer
9
1. Does starvation freedom imply bounded- waiting ?2. Does bounded- waiting imply starvation freedom ?Explain with example.
1 answer
13
Let there are n elements in array and number of sorted subarray is log n of size n/ log n each thenwhat is the time complexity to sort given array
4 answers
14
The next state table of a $2-$bit saturating up-counter is given below.$\begin{array}{cc|cc} Q_1 & Q_0 & Q_1^+ & Q_0^+ \\ \hline 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 0 \\ 1 & 0...
1 answer
17
Reply with solution @Arjun sir,@habibkhan,@vijaycs
0 answers
20
here SJF is given as well as priorities are given, given answer followes only priority schedulingbut i think priority is used in case where there is a tie between two pro...
1 answer
22
What is the difference betwen 2s complent of a number and 2s complement representation of a number .
3 answers
25
int loop(int n) { for(int i=1;i<=n;i++) { for(int j=1;j<n;j+=i) { -O(1) - } } }What is the time complexity of above code segment?
1 answer
26
#include <stdio.h int main(void) { for(i=1;i<=n;i*=2) { for(j=0;j<=i;j++) { for(k=0;k<=n;k++) { ..... O(1)....; } } } return 0; }What is the time complexity of given code...
2 answers
27
Here loading result should take in ALU ,rt?