Time Left - 09:00 mins

UPPCL AE 2019: Technical Quiz 11

Attempt now to get your rank among 144 students!

Question 1

The statement “A Turing machine can solve a Halting problem (HP)” is undecidable.?

Question 2

For implementing priority queue which data structure is best regarding the time complexities of enqueue and dequeue operations in priority queue :

Question 3

Which of the following is not a valid Deadlock prevention scheme?

Question 4

The value of the following Boolean expression
a(a+b+c)(a'+b+c')(a+b+c')(a'+b'c)

Question 5

What is the number of labelled Binary trees possible with ‘3’ nodes.

Question 6

What does the following fragment of C program print?
char c[ ] = “GATE2011”;
char *p = c;
printf(“%s”, p + p [ 3 ] – p [ 1 ] ) ;

Question 7

Find number of page faults using LRU page replacement policy, for following string and number of Frames is 3
String: 2 3 2 1 5 2 4 5 3 2

Question 8

Identify the operation which is not closed for recursive languages.

Question 9

The Boolean expression B'+A'C is equivalent to which of the following expression -

Question 10

Consider the following C program:
float function(float a, int b){
float c, d;
int i;

for(d=1, c=1, i=1; i<b; i++)
{
c * = a / i;

d + = c;
}
return d;
}
What is the return value of function(2,3)?:
  • 144 attempts
  • 1 upvote
  • 0 comments
Apr 10GATE & PSU CS