Time Left - 09:00 mins

UPPCL AE 2019: Technical Quiz 12

Attempt now to get your rank among 156 students!

Question 1

Which of the following technique cannot reduce cache hit time

Question 2

Consider a schema R(A,B,C,D) and functional dependencies A →B and C →D. Then the decomposition of R into R₁ (AB) and R₂(CD) is

Question 3

The result evaluating the prefix expression + + * 10 2 / 12 4 6 is

Question 4

#include <stdio.h>
void main(){
int k,s=0;
int arr[]={5,9,2,6,0,1,8};
char str[]={"Gradeup"};
for(int k=0;k<7;k++)
{
if(((int)str[k]%2)==0)
printf("%c%d",(int)str[k],arr[k]);
}
}
What will be output of above code?

Question 5

If f(n) = O(n) and g(n) = Ω(n) , then what can be correct about f(n).g(n) ?

Question 6

The worst case running time complexity to search for an element in a balanced binary search tree with elements n2ⁿ?

Question 7

Which is incorrect about Normal Forms?

Question 8

Consider the execution of a program of 10,000 instructions in a pipelined processor with a clock rate of 25 Mhz. The instruction pipeline has five stages. Efficiency and throughput of the system are respectively

Question 9

Consider the following grammar -
E -> EsEs/Bcc/cC/F
F -> a/adC
C -> b/epsilon
The number of productions in simplified CFG is _____. Fill in the blank -

Question 10

Find the type of error produced by the following program -
int main()
{
int b=10;
if(b==10)
printf("BYJUS);
printf("Compiler Design");
}

156 attempts
1 upvote
0 comments

Tags :

GATE & PSU CS General

Jul 21GATE & PSU CS