Which scheduling policy is most suitable for a time-shared operating systems?
Which of the following circuits come under the class of combinational logic circuits?
1. Full adder
2. Full subtractor
3. Half adder
4. J – K flop – flop
5. Counter
Select the correct answer from the codes given below –
What happens on compiling the code below?
#include<stdio.h>
int main()
{
unsigned short int i=0;
while(i>=0)
{
printf("%d",i++);
}
}
Which of the following statements is true in context of Banker’s algorithm?
The participation constraint associated with relationship set of a weak entity is always
Operating system provide memory management module to
If two equal forces of magnitude P acts at an angle θ, their resultant will be
Value of sinx + cosx is greatest when x is
If X and Y are two independent events with P(X∪Y) = 0.8 and P(Y) = 0.5 then P(X) =
What will be the output of the following program ?
main(){
int a = 4, b = 3;
printf("%d",a+++b);
}
Consider the following schedule.
In the above schedule transaction if T1 fails, then it will suffer which of the following problem.
The Logic gate that will have HIGH or “1” at its output when one of its inputs is high is
If the area of the square is increased by 69% the side of the square increase by