0 of 20 questions completed
Questions:
General instruction:
1. The clock will be set at the server. The countdown timer at the top right corner of screen will display the remaining time available for you to complete the examination. When the timer reaches zero, the examination will end by itself. You need not terminate the examination or submit your paper.
2. The Question Palette displayed on the right side of screen will show the status of each question using one of the following symbols.
(White)You have not answered the question
(Green)You have answered the question
(Orange)You have NOT answered the question, but have marked the question for review.
The Mark for Review status for a question simply indicates that you would like to look0 at that question again. If a question is answered, but marked for review, then the answer will be considered for evaluation unless the status is modified by the candidates.
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading…
You must sign in or sign up to start the quiz.
You must first complete the following:
0 of 20 questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 marks, (0)
Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)
A decimal number has 25 digits. The number of bits needed for its equivalent binary representation is, approximately, Explain??
a) 50
b) 55
c) 80
d) 75
Which of the following is minimum error code?
Match List I with List II and select the correct answer using the codes given below the list.
List I List II
A. 1 address instruction T=TOP(n-1)
B. 2 address instruction y=y+x
C. 3 address instruction Y=A-B
D. 4 address instruction ACC=ACC-X
IF a processor has 32-bit virtual addresses, 28-bit physical addresses, 2 KB pages.How many bits are required for virtual, physical page number?
A binary search tree contains the value 1,2,3,4,5,6,7,8. The tree is traversed in pre-order and the values are printed out. Which of the following sequences is a valid output?
The question is based on the following program fragment
f(int Y[10], int x)
{
int u,j,k;
i=0;j=9;
do
{
k=(i+j)/2;
if(Y[k]
The number of edges in a regular graph of degree: d and n vertices is:
Consider the following C code segment:
int IsPrime(n)
{
int i,n;
for(i=2;i<=sqrt(n);i++)
if(n%i == 0)
{printf(“Not Prime\n”); return 0;}
return 1;
}
Let T(n) denotes the number of times the for loop is executed by the program on input n. Which of the following is TRUE?
A Language L for which there exist a Turing machine ‘T’, that accept every word in L and either rejects or loops for every word that is not in L, is said to be
Consider an ε- tree CFG. For which every pair of production A->u and A->v
Synthesized attribute can be easily simulated by
The logic of pumping lemma is a good example of
Given relations r(w, x) and s(y, z) the result of
select distinct w, x
from r, s
is guaranteed to be same as r, provided.
E-R model uses this symbol to represent weak entity set ?
By open-domain case tools we mean
If P is risk probability, L is loss, then Risk Exposure(RE) is computed as
A Can is filled with 5 paise coins. Another can is filled with 10 paise coins. Another can is filled with 25 paise coins.All the cans are given wrong labels. If the can labeled 25 paise is not having the 10 paise coins, what will the can, labeled 10 paise have?
what is the maximum value of the function f(x) = 2x^{2} – 2x + 6 in the interval [0 ,2] ?
The value of the Integral I= \( \int_{0}^{\frac{\pi}{2}}x^{2} sinx dx \) is
The possible number of Boolean function of 3 variables X,Y and Z such that
f(X,Y,Z) =F(X’,Y’,Z’)