NIC-NIELIT STA 2020
Question 1 |
A is the father of B and C is the son of D. E is the brother of A. B is the sister of C. How is D related to E?
Daughter | |
Brother | |
Brother in Law | |
Sister in Law |
Question 1 Explanation:

Question 2 |
Pointing towards a picture, Ramesh said, “That picture is of the sister of the grandson of the father of my maternal uncle”. How is that lady in the picture related to Ramesh?
Mother’s sister | |
Cousin (maternal brother) | |
Cousin (maternal sister) | |
Father’s sister |
Question 2 Explanation:

Question 3 |
Refer the statement and solve the question according to the conclusions.
Statement:
Some Pigeons are Bird;
Some Birds are Alive
Conclusion:
(I) Some Pigeons are Alive
(II) Some Birds are Pigeons
Only (I) follows | |
Only (II) follows | |
Both (I) & (II) follows | |
None follows |
Question 3 Explanation:

Question 4 |
If ‘CONTEMPORARY’ is coded as NOCTEMROPARY then ‘BODARDSITAND’ is the code of which letter?
DOBARDTISAND | |
BODDRASITDNA | |
DOBDRATISDNA | |
DOBARDSITAND |
Question 4 Explanation:

Question 5 |
Find the number which does not fit into the series
8 12 20 32 50 68
20 | |
32 | |
68 | |
50 |
Question 5 Explanation:

Question 6 |
Directions - Question number 6 to 10 are based on following information:
There are twelve persons named O, P, Q, R, S, T, U, V, W, X, Y and Z who live in a multi-storey apartment. The apartment has three floors and each floor has four rooms. These 12 persons who live in a set of 12 Rooms can be represented by a Matrix of 3 rows and 4 columns.
→Q lives immediate left below diagonally of a person who lives immediate left below diagonally of T.
→S lives immediate left above diagonally of a person who lives immediate left above diagonally of Z.
→X lives immediate right above diagonally of a person who lives immediate right below diagonally of O.
→P lives immediate right above diagonally of a person who lives immediate right above diagonally of Y.
→T lives immediate left above diagonally of a person who lives third to the right of V.
→Q lives immediate left of a person who lives two rooms below W in the same column.
→R lives to the immediate right of a person who lives immediate right above diagonally of Q. Z is living to the immediate left of U who receives ₹46000 as salary.
→The person who live on one of the floors (left to right) receive salary in the same order ₹50000, ₹47000 and ₹46000.
→The person who live on one of the floors (right to left) receive salary in the same order ₹45000, ₹38000, ₹35000 and ₹40000.
→The person who live on one of the floors (left to right) receive salary in the same order ₹37000, ₹42000, ₹36000 and ₹43000.
What is the aggregate salary of people living at the right end of the apartment?
₹ 137000 | |
₹ 134000 | |
₹ 125000 | |
₹ 131000
|
Question 7 |
Directions - Question number 6 to 10 are based on following information:
There are twelve persons named O, P, Q, R, S, T, U, V, W, X, Y and Z who live in a multi-storey apartment. The apartment has three floors and each floor has four rooms. These 12 persons who live in a set of 12 Rooms can be represented by a Matrix of 3 rows and 4 columns.
→Q lives immediate left below diagonally of a person who lives immediate left below diagonally of T.
→S lives immediate left above diagonally of a person who lives immediate left above diagonally of Z.
→X lives immediate right above diagonally of a person who lives immediate right below diagonally of O.
→P lives immediate right above diagonally of a person who lives immediate right above diagonally of Y.
→T lives immediate left above diagonally of a person who lives third to the right of V.
→Q lives immediate left of a person who lives two rooms below W in the same column.
→R lives to the immediate right of a person who lives immediate right above diagonally of Q. Z is living to the immediate left of U who receives ₹46000 as salary.
→The person who live on one of the floors (left to right) receive salary in the same order ₹50000, ₹47000 and ₹46000.
→The person who live on one of the floors (right to left) receive salary in the same order ₹45000, ₹38000, ₹35000 and ₹40000.
→The person who live on one of the floors (left to right) receive salary in the same order ₹37000, ₹42000, ₹36000 and ₹43000.
What is the salary received by a person who lives second to the right of S?
₹ 35000 | |
₹ 45000 | |
₹ 37000 | |
₹ 38000 |
Question 8 |
Directions - Question number 6 to 10 are based on following information:
There are twelve persons named O, P, Q, R, S, T, U, V, W, X, Y and Z who live in a multi-storey apartment. The apartment has three floors and each floor has four rooms. These 12 persons who live in a set of 12 Rooms can be represented by a Matrix of 3 rows and 4 columns.
→Q lives immediate left below diagonally of a person who lives immediate left below diagonally of T.
→S lives immediate left above diagonally of a person who lives immediate left above diagonally of Z.
→X lives immediate right above diagonally of a person who lives immediate right below diagonally of O.
→P lives immediate right above diagonally of a person who lives immediate right above diagonally of Y.
→T lives immediate left above diagonally of a person who lives third to the right of V.
→Q lives immediate left of a person who lives two rooms below W in the same column.
→R lives to the immediate right of a person who lives immediate right above diagonally of Q. Z is living to the immediate left of U who receives ₹46000 as salary.
→The person who live on one of the floors (left to right) receive salary in the same order ₹50000, ₹47000 and ₹46000.
→The person who live on one of the floors (right to left) receive salary in the same order ₹45000, ₹38000, ₹35000 and ₹40000.
→The person who live on one of the floors (left to right) receive salary in the same order ₹37000, ₹42000, ₹36000 and ₹43000.
What is the sum of salaries of Y and P?
₹ 90000 | |
₹ 99000 | |
₹ 93000 | |
₹ 89000 |
Question 9 |
Directions - Question number 6 to 10 are based on following information:
There are twelve persons named O, P, Q, R, S, T, U, V, W, X, Y and Z who live in a multi-storey apartment. The apartment has three floors and each floor has four rooms. These 12 persons who live in a set of 12 Rooms can be represented by a Matrix of 3 rows and 4 columns.
→Q lives immediate left below diagonally of a person who lives immediate left below diagonally of T.
→S lives immediate left above diagonally of a person who lives immediate left above diagonally of Z.
→X lives immediate right above diagonally of a person who lives immediate right below diagonally of O.
→P lives immediate right above diagonally of a person who lives immediate right above diagonally of Y.
→T lives immediate left above diagonally of a person who lives third to the right of V.
→Q lives immediate left of a person who lives two rooms below W in the same column.
→R lives to the immediate right of a person who lives immediate right above diagonally of Q. Z is living to the immediate left of U who receives ₹46000 as salary.
→The person who live on one of the floors (left to right) receive salary in the same order ₹50000, ₹47000 and ₹46000.
→The person who live on one of the floors (right to left) receive salary in the same order ₹45000, ₹38000, ₹35000 and ₹40000.
→The person who live on one of the floors (left to right) receive salary in the same order ₹37000, ₹42000, ₹36000 and ₹43000.
Who among the following lives third to the left of U?
O | |
Q | |
T | |
S |
Question 10 |
Directions - Question number 6 to 10 are based on following information:
There are twelve persons named O, P, Q, R, S, T, U, V, W, X, Y and Z who live in a multi-storey apartment. The apartment has three floors and each floor has four rooms. These 12 persons who live in a set of 12 Rooms can be represented by a Matrix of 3 rows and 4 columns.
→Q lives immediate left below diagonally of a person who lives immediate left below diagonally of T.
→S lives immediate left above diagonally of a person who lives immediate left above diagonally of Z.
→X lives immediate right above diagonally of a person who lives immediate right below diagonally of O.
→P lives immediate right above diagonally of a person who lives immediate right above diagonally of Y.
→T lives immediate left above diagonally of a person who lives third to the right of V.
→Q lives immediate left of a person who lives two rooms below W in the same column.
→R lives to the immediate right of a person who lives immediate right above diagonally of Q. Z is living to the immediate left of U who receives ₹46000 as salary.
→The person who live on one of the floors (left to right) receive salary in the same order ₹50000, ₹47000 and ₹46000.
→The person who live on one of the floors (right to left) receive salary in the same order ₹45000, ₹38000, ₹35000 and ₹40000.
→The person who live on one of the floors (left to right) receive salary in the same order ₹37000, ₹42000, ₹36000 and ₹43000.
What is the sum of the salaries received by the persons living on the top floor of the apartment?
₹ 158000 | |
₹ 193000 | |
₹ 157000 | |
₹ 161000
|
Question 11 |
Directions for question number 11 and 12:
Study the following information carefully and answer the question:
Group of girl’s gossip with each other. All are sitting surrounding a round table. The names of the girls are Shiksha, Radha, Chinu, Snigdha and Rani. It is not necessary that they are sitting in the order of the name as mentioned here. Radha is second to the right of Shiksha. Shiksha doesn’t sit with Chinu. Rani is second to the right of Radha. Radha sits near Snigdha.
Q11. If Radha and Snigdha change their places then who will be second to the left of Rani?
Radha | |
Snigdha | |
Shiksha | |
None of the options |
Question 11 Explanation:
According to the given passage the seating order is

If Radha and Snigdha change their places then Snigdha will be second to the left of Rani

If Radha and Snigdha change their places then Snigdha will be second to the left of Rani
Question 12 |
Directions for question number 11 and 12:
Study the following information carefully and answer the question:
Group of girl’s gossip with each other. All are sitting surrounding a round table. The names of the girls are Shiksha, Radha, Chinu, Snigdha and Rani. It is not necessary that they are sitting in the order of the name as mentioned here. Radha is second to the right of Shiksha. Shiksha doesn’t sit with Chinu. Rani is second to the right of Radha. Radha sits near Snigdha.
Q12. Who sits to the left of Shiksha?
Rani | |
Radha | |
Chinu | |
Snigdha |
Question 12 Explanation:

Question 13 |
Directions for question number 13 to 15:
Relationship between different elements is provided in the statements. The statements are followed by conclusions. Study the conclusions based on the given statement and choose the correct answer.
Q13: T >= U = V <= W < X; V >= Y
Conclusions:
(I) Y <= T
(II) U >= X
if only conclusion (I) follows | |
if only conclusion (II) follows | |
if neither (I) nor (II) conclusion follows | |
if both (I) and (II) conclusions follow |
Question 13 Explanation:
T >= U = V <= W < X; V >= Y
T>= U= V>= Y
Y <= T
T>= U= V>= Y
Y <= T
Question 14 |
Directions for question number 13 to 15:
Relationship between different elements is provided in the statements. The statements are followed by conclusions. Study the conclusions based on the given statement and choose the correct answer.
Q13: T >= U = V <= W < X; V >= Y
Q14. P <= Q <= R > S; T >= R; S >= U
Conclusions:
(I) T > S
(II) U < R
if only conclusion (I) follows | |
if only conclusion (II) follows | |
if neither (I) nor (II) conclusion follows | |
if both (I) and (II) conclusions follow |
Question 14 Explanation:
P <= Q <= R > S; T >= R; S >= U
T >= R > S R > S>=U
T>S U
T >= R > S R > S>=U
T>S U
Question 15 |
Directions for question number 13 to 15:
Relationship between different elements is provided in the statements. The statements are followed by conclusions. Study the conclusions based on the given statement and choose the correct answer.
Q13: T >= U = V <= W < X; V >= Y
Q15: A <= B < C >= D; C <= E <= F
Conclusions:
(I) F >= D
(II) A > E
if only conclusion (I) follows | |
if only conclusion (II) follows | |
if neither (I) nor (II) conclusion follows | |
if both (I) and (II) conclusions follow |
Question 15 Explanation:
A <= B < C >= D; C <= E <= F
D <= C <= E < F
F >= D
Question 16 |
Five people are standing in a row. Aman is standing next to Karan but not adjacent to Tanuj. Radhika is standing next to Priyanka who is standing on the extreme left and Tanuj is not standing next to Radhika. Who are Standing adjacent to Aman?
Radhika and Karan | |
Karan and Tanuj | |
Karan and Priyanka | |
Radhika and Tanuj |
Question 16 Explanation:

Question 17 |
Complete the following series
4, 27, 256, 3125, _____
46656 | |
6250 | |
800000 | |
1024 |
Question 17 Explanation:
22 = 4
33 = 27
44 = 256
55 = 3125
66 = 46656
33 = 27
44 = 256
55 = 3125
66 = 46656
Question 18 |
A Businessman purchases an item at a certain price and marks its price up by 30%. He sells the item at a certain discount on markup price and makes a net profit of 4% on the whole transaction. Find the discount given by a businessman on markup price.
10 | |
15 | |
26 | |
20 |
Question 19 |
Ramesh’s father is a paediatrician. Ram’s father is a trader. Krishan’s father is a school teacher. Krishan falls ill. Where should his father take him?
to home
| |
to school | |
to Ramesh’s father | |
to Ram’s father |
Question 19 Explanation:
Ramesh’s father is a paediatrician
Ram’s father is a trader
Krishan’s father is a school teacher
Krishan falls ill
According to the given input Ramesh's father is a paediatrician. So, they went to Ramesh’s father.
Ram’s father is a trader
Krishan’s father is a school teacher
Krishan falls ill
According to the given input Ramesh's father is a paediatrician. So, they went to Ramesh’s father.
Question 20 |
What is the total number of ways to reach A to B in the network given?

12 | |
16 | |
20 | |
22 |
Question 22 |
If 5% income of P is equal to 15% income of Q and 10% income of Q is equal to 20% income of R. If income of R is ₹ 2000, then what are the incomes of P and Q respectively?
₹ 4000 and ₹ 8000 | |
₹ 12000 and ₹ 4000
| |
₹ 15000 and ₹ 5000 | |
₹ 18000 and ₹ 6000 |
Question 22 Explanation:
5%P = (15/100)*Q
(10/100)*Q = (20/100)*R
(20/100)*2000
=4000
(10/100)*Q = 4000
Q = 4000
(5/100)*P = (15/100)*4000
=600
P = (600*100)/5
P=12000
(10/100)*Q = (20/100)*R
(20/100)*2000
=4000
(10/100)*Q = 4000
Q = 4000
(5/100)*P = (15/100)*4000
=600
P = (600*100)/5
P=12000
Question 23 |
Directions for question number 23 to 26:
Answer the questions on the basis of the data given below:
O is X’s father
Y is Z’s mother
P is O’s mother
X is Z’s sister
Q23. If P has a daughter Q, then how is Q related to Z?
Aunt | |
Mother | |
Sister | |
Daughter |
Question 23 Explanation:
If P has a daughter Q, then Q related to Z is Aunt.
Question 24 |
Directions for question number 23 to 26:
Answer the questions on the basis of the data given below:
O is X’s father
Y is Z’s mother
P is O’s mother
X is Z’s sister
Q24. How is Y related to O?
Wife | |
Sister | |
Mother | |
Daughter |
Question 24 Explanation:

Y related to O is wife.
Question 25 |
Directions for question number 23 to 26:
Answer the questions on the basis of the data given below:
O is X’s father
Y is Z’s mother
P is O’s mother
X is Z’s sister
Q25. How is O related to Z?
Brother | |
Cousin | |
Father | |
Uncle |
Question 25 Explanation:

O related to Z is father.
Question 26 |
Directions for question number 23 to 26:
Answer the questions on the basis of the data given below:
O is X’s father
Y is Z’s mother
P is O’s mother
X is Z’s sister
Q26. How is P related to X?
Mother | |
Grandmother | |
Sister | |
Daughter |
Question 26 Explanation:

P related to X is Grandmother.
Question 27 |
14, 28, 20, 20, 40, 32, 64, _______
52 | |
56 | |
96 | |
128 |
Question 27 Explanation:

Question 28 |
5 16 49 104 181 ______
271 | |
298 | |
280 | |
281 |
Question 28 Explanation:

Question 29 |
In a certain code, ‘CONSIDER’ is written as RMNBSFEJ, how is ‘MONOPOLY’ written in that code?
LNMNZMPQ | |
NMNLZMPQ | |
POPNXKNO | |
NMNLXKNO |
Question 29 Explanation:

Question 30 |
Directions for question number 30 to 31:
Two statements followed by four conclusions numbered from (I) to (IV) are given. You have to take the two statements to be true even if these seem to be at variance from the commonly known facts. Read all the conclusions and decide which of the given conclusions logically follow from the two given statements disregarding commonly known facts.
Q30. All Shoes are Socks
Some Socks are Gloves
Conclusions:
(I) Some Shoes are Gloves
(II) Some Socks are Shoes
(III) All Gloves are Shoes
(IV) No Shoes are Gloves
Only (I) follows | |
Only (II) follows | |
Only (III) follows
| |
Only (IV) follows |
Question 30 Explanation:

Question 31 |
Directions for question number 30 to 31:
Two statements followed by four conclusions numbered from (I) to (IV) are given. You have to take the two statements to be true even if these seem to be at variance from the commonly known facts. Read all the conclusions and decide which of the given conclusions logically follow from the two given statements disregarding commonly known facts.
Q31: All Sentences are Words
All Words are Alphabets
Conclusions:
(I) All words are sentences
(II) All sentences are alphabets
(III) All alphabets are words
(IV) Some alphabets are words
Only (I) and (III) follows | |
Only (II), (III) and (IV) follows | |
Only (II) and (IV) follows | |
All follows |
Question 31 Explanation:

Question 32 |
All Boys are Girls
No Girl is a Man
Conclusions:
(I) No Boy is a Man
(II) Some Boys are Man
(III) All Girls are Boys
(IV) Some Man are Boys
Only (III) follows | |
Only (I) follows | |
All follows | |
None follows
|
Question 32 Explanation:

Question 33 |
A Class has 100 students with roll number from 101 to 200. All the even numbered students study Physics, whose roll number are divisible by 5 study Chemistry & students with roll numbers divisible by 7 study Biology. How many students do not study any of the given subject Physics, Chemistry or Biology?
35 | |
45 | |
51 | |
62 |
Question 33 Explanation:

Question 34 |
Choose the alternative to decide whether the data given in the statements is/are sufficient to answer the question based on the following information.
Five persons A, B, C, D and E are sitting in a row. Who is sitting in the middle?
Statements:
(I) E is to the left of B.
(II) B is in-between C and E.
(III) D is in-between E and A.
Choose which of the following will be sufficient to find out who is sitting in the middle?
Only (I) and (II) | |
Only (II) and (III) | |
Only (I) and (III) | |
All (I), (II) and (III) |
Question 34 Explanation:
Here the question is only asking to find who is in the middle not for the exact pattern, so using only B we will get E in the middle and using D we will get only one pattern.
Question 35 |
Ram can do a piece of work in 5 days, and Sham can do the same in 10 days. With the help of Karan, they finished the work in 2 days. How many days would it take Karan to do the work?
5 days | |
10 days | |
15 days | |
20 days |
Question 35 Explanation:
Ram can do a piece of work = 5 days
Sham can do a piece of work = 10 days
Ram + Sham + Karan = 2 days
Karan= 5 days
Sham can do a piece of work = 10 days
Ram + Sham + Karan = 2 days
Karan= 5 days
Question 36 |
Considering 5 as the 1st element in the sequence 5, 11, 23, 47. What is the 6th element in the sequence?
191 | |
172 | |
342 | |
106 |
Question 36 Explanation:

Question 37 |
₹ 1000 doubled in 10 years when compounded annually. How many more years will it take to get another ₹ 2000 compound interest?
5 years | |
10 years | |
3 years | |
4 years |
Question 37 Explanation:
₹ 1000 invested in compound interest becomes ₹ 2000 in 10 years.
The amount will double again in another 10 years.
The amount will become ₹ 2000 in another 10 years.
So, to earn another ₹ 2000 interest, it will take another 10 years.
The amount will double again in another 10 years.
The amount will become ₹ 2000 in another 10 years.
So, to earn another ₹ 2000 interest, it will take another 10 years.
Question 38 |
Directions for question number 38 to 42:
Answer the questions on the basis of the following information provided:
The students of a school participates in various sports activities, the distribution of the same is given below:
Football - 17%
Handball - 26%
Badminton - 16%
Table Tennis - 22%
Basketball - 19%
Total number of students in the school are 800.
Q38. What is the respective ratio between the total number of students taking part in Badminton and Table Tennis together and those participating in Basketball and Football together?
11 : 13 | |
18 : 19 | |
19 : 18 | |
29 : 28 |
Question 38 Explanation:
Total number of students taking part in Badminton and Table Tennis together is =(0.16*800 + 0.22*800)
= 304
Total number of students taking part in Basketball and Football together is = (0.19*800 + 0.17*800)
=288
Ration= 304/16=19 : 288/16= 18
= 304
Total number of students taking part in Basketball and Football together is = (0.19*800 + 0.17*800)
=288
Ration= 304/16=19 : 288/16= 18
Question 39 |
Directions for question number 38 to 42:
Answer the questions on the basis of the following information provided:
The students of a school participates in various sports activities, the distribution of the same is given below:
Football - 17%
Handball - 26%
Badminton - 16%
Table Tennis - 22%
Basketball - 19%
Total number of students in the school are 800.
What is the number of girls who take part in handball, if the ratio of boys to girls is 3 : 10 respectively?
48 | |
80 | |
78 | |
160 |
Question 39 Explanation:
Total number of students in handball is 208
Ration is 3:10
48: 160
Boys = 48 and girls = 160
Ration is 3:10
48: 160
Boys = 48 and girls = 160
Question 40 |
Directions for question number 38 to 42:
Answer the questions on the basis of the following information provided:
The students of a school participates in various sports activities, the distribution of the same is given below:
Football - 17%
Handball - 26%
Badminton - 16%
Table Tennis - 22%
Basketball - 19%
Total number of students in the school are 800.
The number of students taking part in Basketball is approximately what percent more than those taking part in Football?
10.84% | |
9.92% | |
9.32% | |
None of the options |
Question 40 Explanation:
Y is what percentage more than X= Y-X/X * 100
Basketball is approximately what percent more than those taking part in Football = ((19-17) /17) *100.
Basketball is approximately what percent more than those taking part in Football = ((19-17) /17) *100.
Question 41 |
Directions for question number 38 to 42:
Answer the questions on the basis of the following information provided:
The students of a school participates in various sports activities, the distribution of the same is given below:
Football - 17%
Handball - 26%
Badminton - 16%
Table Tennis - 22%
Basketball - 19%
Total number of students in the school are 800.
If out of the number of students in Basketball, 69 are girls, what is the difference between the number of boys and girls taking part in Basketball?
17 | |
23 | |
86 | |
14 |
Question 41 Explanation:
Total number of Basket students = 152
Girls= 69
Boys= 152-69= 83
Difference= 83-69 = 14
Girls= 69
Boys= 152-69= 83
Difference= 83-69 = 14
Question 42 |
Directions for question number 38 to 42:
Answer the questions on the basis of the following information provided:
The students of a school participates in various sports activities, the distribution of the same is given below:
Football - 17%
Handball - 26%
Badminton - 16%
Table Tennis - 22%
Basketball - 19%
Total number of students in the school are 800.
What is the approximate average of the number of participants in Handball, Badminton and Basketball?
162 | |
163 | |
104 | |
169 |
Question 42 Explanation:
Total number of Basket students = 152
Total number of students in handball = 208
Total number of students in Badminton= 128
=(152+208+128)/3
=488/3
=162.66
Total number of students in handball = 208
Total number of students in Badminton= 128
=(152+208+128)/3
=488/3
=162.66
Question 43 |
What is the time complexity of the following recursive function?
int CompuFun (int n)
{
if(n<=2)
return
else
return (CompuFun (floor(sqrt(n)))+n);
}
θ(n) | |
θ(logn) | |
θ(nlogn) | |
θ(loglogn) |
Question 43 Explanation:
Recurrence relation should be T(n)=T(n^1/2)+1 where n>2.
Here only (√(n)) is in the recursion call parameter. (+n) is just addition and it is a dependent value on recursion. So, we will only consider the recursion part for the recurrence relation.
It is ComputeFun(sqrt(n)).
We are only returning ComputeFun(√n)+n.
(+n) is not in a recursion call.
So recursive equation is,
T(n) = T(√n) + c
Now apply Master's theorem,
a=1, b=2, k=0, p=0
a = bk, so Case-2 will be applied, and p>-1, so
Here only (√(n)) is in the recursion call parameter. (+n) is just addition and it is a dependent value on recursion. So, we will only consider the recursion part for the recurrence relation.
It is ComputeFun(sqrt(n)).
We are only returning ComputeFun(√n)+n.
(+n) is not in a recursion call.
So recursive equation is,
T(n) = T(√n) + c

Now apply Master's theorem,
a=1, b=2, k=0, p=0
a = bk, so Case-2 will be applied, and p>-1, so

Question 44 |
The static keyword word is used in public static void main() declaration in java:
To enable the JVM to make call to the main( ), as class has not been instantiated. | |
To enable the JVM to make call to the main( ), as class has not been inherited. | |
To enable the JVM to make call to the main( ), as class has not been loaded. | |
To enable the JVM to make call to the main( ), as class has not been finalized. |
Question 45 |
A software Requirements specification(SRS) document should avoid discussing which one of the following?
User interface issues | |
Non-functional requirements | |
Design solutions | |
Interfaces with third party software |
Question 45 Explanation:
SRS is a description of a software system to be developed, laying out functional & nonfunctional requirements and may include a set of use cases that describe interactions the user will have with the software.
Question 46 |
Changes are made to the system to reduce the future system failure chances is called___.
Preventive Maintenance | |
Adaptive Maintenance | |
Corrective Maintenance | |
Perfective Maintenance |
Question 46 Explanation:
Software maintenance in software engineering is the modification of a software product after delivery to correct faults, to improve performance or other attributes.
1. Corrective maintenance: Reactive modification of a software product performed after delivery to correct discovered problems. Corrective maintenance can be automated with automatic bug fixing.
2. Adaptive maintenance: Modification of a software product performed after delivery to keep a software product usable in a changed or changing environment.
3. Perfective maintenance: Modification of a software product after delivery to improve performance or maintainability.
4. Preventive maintenance: Modification of a software product after delivery to detect and correct latent faults in the software product before they become effective faults.
1. Corrective maintenance: Reactive modification of a software product performed after delivery to correct discovered problems. Corrective maintenance can be automated with automatic bug fixing.
2. Adaptive maintenance: Modification of a software product performed after delivery to keep a software product usable in a changed or changing environment.
3. Perfective maintenance: Modification of a software product after delivery to improve performance or maintainability.
4. Preventive maintenance: Modification of a software product after delivery to detect and correct latent faults in the software product before they become effective faults.
Question 47 |
Which among the following types of Server filters Website Traffic?
POP Server | |
Database Server | |
Proxy Server | |
Mail Server |
Question 47 Explanation:
A proxy server is a server application or appliance that acts as an intermediary for requests from clients seeking resources from servers that provide those resources. A proxy server thus functions on behalf of the client when requesting service, potentially masking the true origin of the request to the resource server.
Question 48 |
In the context of modular software design, which one of the following combinations is desirable?
High cohesion and high coupling | |
High cohesion and low coupling | |
Low cohesion and high coupling | |
Low cohesion and low coupling |
Question 48 Explanation:
→ Cohesion is a measure of internal strength within a module, whereas coupling is a measure of inter dependency among the modules.
→ So in the context of modular software design, there should be high cohesion and low coupling.
→ So in the context of modular software design, there should be high cohesion and low coupling.
Question 49 |
How many AND, OR and XOR gates are required for implementation of full adder?
1, 2, 2 | |
2, 2, 1
| |
3, 2, 2 | |
3, 0, 1 | |
None of the above |
Question 49 Explanation:

2-AND
1-OR
2-XOR
Question 50 |
Which of the following algorithms can be used to most efficiently find whether a cycle is present in a given graph?
Prim’s Minimum Spanning Tree | |
Breadth First Search | |
Depth First Search | |
Kruskal’s Minimum Spanning Tree Algorithm |
Question 50 Explanation:
DFS is the most efficient algorithm to find the cycle.
BFS, Prims and Kruskal's also find the cycle but DFS will give better results.
Both BFS and DFS will give answer in O(V+E) time.
BFS, Prims and Kruskal's also find the cycle but DFS will give better results.
Both BFS and DFS will give answer in O(V+E) time.
Question 51 |
Consider an array of positive integers between 123456 to 876543, which sorting algorithm can be used to sort these number in linear time?
Impossible to sort in linear time | |
Radix Sort | |
Insertion Sort | |
Bubble Sort |
Question 51 Explanation:
Radix Sort worst case time complexity is O(d(n+k)).
Even it gives linear time when the input array is 0 to n^6….
Even it gives linear time when the input array is 0 to n^6….
Question 52 |
In the Model-View-Controller (MVC) architecture, the model defines the ______.
Data-access layer | |
Presentation layer | |
Business-logic layer | |
Interface layer | |
A and C |
Question 52 Explanation:
Model : The central component of the pattern. It is the application's dynamic data structure, independent of the user interface. It directly manages the data, logic and rules of the application.
View : Any representation of information such as a chart, diagram or table. Multiple views of the same information are possible, such as a bar chart for management and a tabular view for accountants.
Controller : Accepts input and converts it to commands for the model or view.

In addition to dividing the application into these components, the model–view–controller design defines the interactions between them.
1. The model is responsible for managing the data of the application. It receives user input from the controller.
2. The view means presentation of the model in a particular format.
3. The controller responds to the user input and performs interactions on the data model objects. The controller receives the input, optionally validates it and then passes the input to the model.
Both A and C seem to be correct, but to choose single , option C is the more accurate option.
View : Any representation of information such as a chart, diagram or table. Multiple views of the same information are possible, such as a bar chart for management and a tabular view for accountants.
Controller : Accepts input and converts it to commands for the model or view.

In addition to dividing the application into these components, the model–view–controller design defines the interactions between them.
1. The model is responsible for managing the data of the application. It receives user input from the controller.
2. The view means presentation of the model in a particular format.
3. The controller responds to the user input and performs interactions on the data model objects. The controller receives the input, optionally validates it and then passes the input to the model.
Both A and C seem to be correct, but to choose single , option C is the more accurate option.
Question 53 |
The default character encoding in HTML5 is ______.
UTF-16 | |
UTF-32 | |
UTF-8 | |
ISO-8859-1 |
Question 53 Explanation:
For HTML5, the default character encoding is UTF-8.
This has not always been the case. The character encoding for the early web was ASCII.
This has not always been the case. The character encoding for the early web was ASCII.
Question 54 |
In Java, for ensuring the persistence property, the class must implements:
Serializable Interface | |
Utilization Interface | |
Threadable Interface | |
Recognizable Interface |
Question 55 |
In the given Program:
class Dialog1
{
public static void main(String args[])
{
Frame f1=new Frame("INDIA");
f1.setSize(300,300);
f1.setVisible(true);
FileDialog d=new FileDialog(f1, "MyDialog");
d.setVisible(true);
String fname=d.getDirectory()+d.getFile();
System.out.println("The Selection is"+fname);
}
}
To make the Frame visible, which of the following statements are true?
f1.setClear(true); | |
f1.setVisible(true); | |
f1.setlook(true); | |
f1.setclean(true); |
Question 56 |
The router table contains addresses belonging to _______ protocol(s).
a single | |
two | |
multiple | |
none of the options |
Question 57 |
Which of the following scenarios may lead to an irrecoverable error in a database system?
A transaction writes a data item after it is read by an uncommitted transaction | |
A transaction reads a data item after it is read by an uncommitted transaction | |
A transaction reads a data item after it is written by a committed transaction | |
A transaction reads a data item after it is written by an uncommitted transaction |
Question 58 |
A stack can be implemented using queue, but then we need to use at least:
3 queues | |
2 queues | |
only one queue is sufficient | |
none of the options |
Question 58 Explanation:
A stack can be implemented using a queue, but then we need to use at least 2 queues.
Question 59 |
A minimal super key (i.e, one of the super keys for which no proper subset is a super key) is called:
Super Key | |
Candidate Key | |
Primary Key | |
Candidate and Primary Key | |
B and D |
Question 59 Explanation:
A minimal superkey is a candidate key but as per the options it suited as Candidate and primary key.
Question 60 |
During exception handling, which of the following statements hold true?
Single try can have multiple associated catch with it | |
A Single Catch can have multiple try associated with it | |
Finally block execute only when the class is inherited | |
For a given exception, multiple catch can execute |
Question 61 |
Which of the following problems is not NP complete but undecidable?
Partition Problem | |
Halting Problem | |
Hamiltonian Circuit | |
Bin Packing |
Question 61 Explanation:
NP Complete problems:
1. Partition Problem
2. Hamiltonian Circuit
3. Bin Packing
4. Travelling salesman problem.
Question 62 |
Which of the following is not a part of the Test Implementation and Execution Phase?
Creating test suites from the test cases | |
Executing test cases either manually or by using test execution tools | |
Comparing actual results | |
Designing the tests |
Question 62 Explanation:
TRUE: Creating test suites from the test cases
TRUE: Executing test cases either manually or by using test execution tools
TRUE: Comparing actual results
FALSE: Designing the tests
TRUE: Executing test cases either manually or by using test execution tools
TRUE: Comparing actual results
FALSE: Designing the tests
Question 63 |
Consider the following C program segment.
while (first <= last)
{
if (array[middle] < search)
first = middle + 1;
else if (array[middle] == search)
found = TRUE;
else last = middle - 1;
middle = (first + last)/2;
}
if (first < last) not Present = TRUE;
The cyclomatic complexity of the program segment is_______.
3 | |
4 | |
5 | |
6 |
Question 63 Explanation:
some coaching institutes are giving B as the correct answer.
To find the cyclomatic complexity using three formulas.
1. The number of regions
2. Predicate(P) + 1 [ Predicate divides minimum 2 or more ]
3. E-V+2
According to given question, we can use Predicate(P) + 1
while (first <= last) → P1
{
if (array[middle] < search) → P2
first = middle + 1;
else if (array[middle] == search) → P3
found = TRUE;
else
last = middle - 1;
middle = (first + last)/2;
}
if (first < last) not Present = TRUE; → P4
→ P+1 = 4+1 = 5
To find the cyclomatic complexity using three formulas.
1. The number of regions
2. Predicate(P) + 1 [ Predicate divides minimum 2 or more ]
3. E-V+2
According to given question, we can use Predicate(P) + 1
while (first <= last) → P1
{
if (array[middle] < search) → P2
first = middle + 1;
else if (array[middle] == search) → P3
found = TRUE;
else
last = middle - 1;
middle = (first + last)/2;
}
if (first < last) not Present = TRUE; → P4
→ P+1 = 4+1 = 5
Question 64 |
Let R and S be two relations with the following schema
R (P, Q, R1, R2, R3)
S (P, Q, S1, S2)
Where (P, Q) is the key for both schemas. Which of the following queries are equivalent?


Only (I) and (II) | |
Only (I) and (III) | |
Only (I), (II) and (III) | |
Only (I), (III) and (IV) |
Question 64 Explanation:
Natural join is based on the common columns of the two tables.
We have two common columns in 'R' and 'S' which are 'P' and 'Q'.
(I) Both P and Q are used while doing the join, i.e., both P and Q are used to filter.
(II) Q is not used here for filtering. Natural join is done on all P's from R and all P's from S. So different from option (I).
(III) Through venn diagram it can be proved that A∩B = A - (A-B).
So through the above formula we can say that (III) and (IV) are equivalent.
So, finally (I), (III) and (IV) are equivalent.
We have two common columns in 'R' and 'S' which are 'P' and 'Q'.
(I) Both P and Q are used while doing the join, i.e., both P and Q are used to filter.
(II) Q is not used here for filtering. Natural join is done on all P's from R and all P's from S. So different from option (I).
(III) Through venn diagram it can be proved that A∩B = A - (A-B).
So through the above formula we can say that (III) and (IV) are equivalent.
So, finally (I), (III) and (IV) are equivalent.
Question 65 |
Anomalies are avoided by splitting the offending relation into multiple relations, also known as ________.
Acupressure | |
Decomposition | |
Precomposition | |
Both decomposition & precomposition |
Question 65 Explanation:
Anomalies are avoided by splitting the offending relation into multiple relations, also known as Decomposition.
Question 66 |
Which one of the following statements is FALSE?
Context-free grammar can be used to specify both lexical and syntax rules. | |
Type checking is done before parsing. | |
High level language programs can be translated to different Intermediate Representations. | |
Arguments to a function can be passed using the program stack. |
Question 66 Explanation:
TRUE: Context-free grammar can be used to specify both lexical and syntax rules.
FALSE: Type checking is done before parsing.
TRUE: High level language programs can be translated to different Intermediate Representations.
TRUE: Arguments to a function can be passed using the program stack.
FALSE: Type checking is done before parsing.
TRUE: High level language programs can be translated to different Intermediate Representations.
TRUE: Arguments to a function can be passed using the program stack.
Question 67 |
Encoders are made by three ______ gates.
AND | |
OR | |
NAND | |
XOR |
Question 67 Explanation:
Encoders are made by three OR gates
Encoder may also be designed by using 3 NAND gates. Thus both option B,C are correct.
Encoder may also be designed by using 3 NAND gates. Thus both option B,C are correct.
Question 68 |
_____ CSS property allows you to wrap a block of text around an image.
wrap | |
push | |
float | |
align |
Question 69 |
What does < main > include?
Header | |
Sidebar | |
Article | |
Footer |
Question 69 Explanation:
Answer can be option A also. Main tag contains the content that is main and unique to the document and is not repeated such as sidebar etc. Header can be in the main tag.
Question 70 |
Let R = (A, B, C, D, E) having following FD's.
F = {A → BC, CD → E, B → D, E → A}
Which of the following is not a Candidate key?
A | |
B | |
E | |
BC |
Question 70 Explanation:
Closure(A)+ = { A, B, C, D, E }
Closure(B)+ = { B, D }
Closure(E)+ = { A, B, C, D, E }
Closure(BC)+ = { A, B, C, D, E }
Question 71 |
In Java, the Dynamic Array are known as :
Vectors | |
Cycle | |
Remote | |
Kubernotos |
Question 71 Explanation:
In Java, the Dynamic Array are known as Vectors
Question 72 |
In ICMP, in case of time exceeded error, when the datagram visits a router, the value of time to live field is ______.
Remains constant | |
Decremented by 2 | |
Incremented by 1 | |
Decremented by 1 |
Question 72 Explanation:
In ICMP, in case of time exceeded error, when the datagram visits a router, the value of time to live field is decremented by 1.
Question 73 |
A 26-bit address bus has maximum accessible memory capacity of _____.
64 MB | |
16 MB | |
1 GB
| |
4 GB |
Question 73 Explanation:
The maximum accessible memory capacity of 226 = 64 MB
Question 74 |
Software consists of ______.
Set of instructions + operating procedures | |
Programs + documentation + operating procedures | |
Programs + hardware manuals | |
Set of programs |
Question 74 Explanation:
A software consists of Programs + documentation + operating procedures
Question 75 |
To guarantee correction of upto 5 errors in all cases, the minimum Hamming distance in a block code must be _______.
11 | |
6 | |
5 | |
2 |
Question 75 Explanation:
To guarantee correction of up to “t” errors in all cases, the minimum Hamming distance in a block code must be dmin = 2t + 1.
t=5
= 2*5+1
=11
t=5
= 2*5+1
=11
Question 76 |
Which of the following is not true for tree and graph?
A tree is a graph | |
A graph is a tree | |
Tree can have a cycle | |
Tree is a DAG |
Question 76 Explanation:
All are correct except Tree can have a cycle
Question 77 |
(< ALL) comparison operator means :
more than the maximum value in the subquery | |
less than the minimum value in the subquery | |
in equivalent to IN | |
none of the options |
Question 78 |
Shift reduce parsing can also be called as :
Reverse of the Right Most Derivation | |
Right Most Derivation | |
Left Most Derivation | |
None of the options |
Question 78 Explanation:
Shift reduce parsing can also be called as Reverse of the Right Most Derivation.
It is a bottom up parsing technique.
It is a bottom up parsing technique.
Question 79 |
Which of the following constructs is not supported by Java Server Pages?
JSP Directives | |
JSP Scriptlets | |
JSP Actions | |
JSP Reaction |
Question 80 |
The number of tokens in the following C/C++ statement is:
printf(i=%d, &i=%xx, i&i);
printf(i=%d, &i=%xx, i&i);
9 | |
6 | |
10 | |
12 |
Question 80 Explanation:

Question 81 |
In CRC calculation if divisor is 1011 and dataword is 1001 what will be the CRC?
111 | |
101 | |
110 | |
100 |
Question 81 Explanation:

Question 82 |
Find the mode of the following data:

20.22 | |
19.47 | |
21.12 | |
20.14 |
Question 83 |
Some code optimization are carried out on the intermediate code because:
they enhance the probability of the compiler to other target processors | |
program analysis is more accurate on intermediate code than on machine code | |
the information from data flow analysis cannot otherwise be used for optimization | |
the information from the front end cannot otherwise be used for optimization |
Question 83 Explanation:
The code-optimization on intermediate code generation will always enhance the portability of the compiler to target processors. The main reason behind this is, as the intermediate code is independent of the target processor on which the code will be executed, so the compiler is able to optimize the intermediate code more conveniently without bothering the underlying architecture of the target processor.
Question 84 |
A program P reads in 500 integers in the range [0..100] representing the scores of 500 students. It then prints the frequency of each score above 50. What would be the best way for P to store the frequencies?
An array of 50 numbers | |
An array of 100 numbers | |
An array of 500 numbers
| |
A dynamically allocated array of 550 numbers |
Question 84 Explanation:
→ Here we are storing values above 50 and we are ignoring the scores which are less than 50.
→ Then using an array of 50 numbers is the best way to store the frequencies.
→ Then using an array of 50 numbers is the best way to store the frequencies.
Question 85 |
Which of the following are two main types of overloading in Java?
Overloading and linking | |
Overriding and linking | |
Reusability and data-hiding | |
Overloading and Overriding |
Question 85 Explanation:
Overloading occurs when two or more methods in one class have the same method name but different parameters.
Overriding occurs when two methods have the same method name and parameters. One of the methods is in the parent class, and the other is in the child class. Overriding allows a child class to provide the specific implementation of a method that is already present in its parent class.
Overriding occurs when two methods have the same method name and parameters. One of the methods is in the parent class, and the other is in the child class. Overriding allows a child class to provide the specific implementation of a method that is already present in its parent class.
Question 86 |
A recursive problem like tower of hanoi can be rewritten without recursion using:
stack | |
priority queue | |
graph | |
cycles |
Question 86 Explanation:
A recursive problem like tower of hanoi can be rewritten without recursion using stack.
Question 87 |
SRD stands for _____.
Software Requirements Definition | |
Structured Requirements Definition | |
Software Requirements Diagram | |
Structured Requirements Diagram | |
A and B |
Question 88 |
Black Box Software Testing method focuses on the:
Boundary condition of the software | |
Control structure of the software | |
Testing of User Interface only | |
Cyclomatic Complexity |
Question 88 Explanation:
Black Box Software testing method focuses on the functional requirement of the software.
Note: The question is ambiguous. We marked the answer according to official key.
Question 89 |
The LL(1) and LR(0) techniques are ______.
Both same in power | |
Both simulate reverse of rightmost derivation | |
Both simulate reverse of left most derivation | |
Incomparable |
Question 89 Explanation:
LL(1) is a Top down parser that parsers the leftmost derivation.
LL(0) is a Bottom up parser that parses the reverse of rightmost derivation.
LL(0) is a Bottom up parser that parses the reverse of rightmost derivation.
Question 90 |
You have a network ID of 192.168.10.0 and require at least 25 host IDs for each subnet, with the largest amount of subnets available. Which subnet mask should you assign?
255.255.255.192 | |
255.255.255.224 | |
255.255.255.240 | |
255.255.255.248 |
Question 90 Explanation:
Given ID belongs to Class C, so default mask for class C is 255.255.255.0, from the last octet 256 hosts are possible, from the 256 we need to fix the bits to create a number of subnets and hosts . But in question we have given that 26 hosts require each subnet, so for 26 hosts we require 5-bits bcz with 4- bit we can make maximum 16 hosts. So, in the last octet first 3 bits are fixed and others are for hosts. Subnet Mask for 3bits in decimal is 128+64+32=224. So, overall subnet mask is 255.255.255.224
Question 91 |
With the following syntax
INSERT INTO table [(column [, column…])]
VALUES (value [, value…]);
you can:
INSERT INTO table [(column [, column…])]
VALUES (value [, value…]);
you can:
Insert one row at a time. | |
Insert multiple rows at a time. | |
Insert one column at a time. | |
Insert multiple columns at a time. |
Question 92 |
Which flip-flop is used to make all types of shift registers?
JK flip-flop | |
D flip-flop | |
T flip-flop | |
All the options |
Question 92 Explanation:
Using synchronous counter (Ring counter )we can develop shift registers (Serial in Serial out (SISO), SIPO (serial in parallel out), ..etc). In synchronous counter D-FF used to design shift registers. The characteristic of D FF takes previous state value as present value input. Below figure shows the design and example of shift register.
Registers:
Ring counter (also called Shift counter) → Diffused
Johnson counter Ring counter:
Registers:
Ring counter (also called Shift counter) → Diffused
Johnson counter Ring counter:

Question 93 |
Domain constraints, functional dependency and referential integrity are special forms of ______.
Foreign key | |
Primary key | |
Assertion | |
Referential constraint |
Question 93 Explanation:
Domain constraints, functional dependency and referential integrity are special forms of assertion.
Question 94 |
Peephole optimization is a:
Loop optimization | |
Local optimization | |
Constant folding | |
Data flow analysis |
Question 94 Explanation:
Peephole optimization is a Local optimization.
Question 95 |
A bag contains 10 white balls and 5 blue balls. A ball is drawn from the bag and its color is noted. This ball is put back in the bag along with 3 more balls of the same color. A ball is drawn again from the bag at random. The probability that the first ball drawn is blue, given that the second ball drawn is blue, is:
1/3 | |
3/4 | |
8/9 | |
4/9 |
Question 96 |
If we don’t want to allow a floating div to the left side of an element, ______ CSS property will we use.
margin | |
clear | |
float | |
padding |
Question 96 Explanation:
The clear property specifies on which sides of an element floating elements are not allowed to float.
Syntax: clear: none|left|right|both|initial|inherit;
Syntax: clear: none|left|right|both|initial|inherit;
Question 97 |
Which of the following Interface is not supported by JDBC for connecting to Database in Java Programming language?
Statement Interface | |
Prepared Statement Interface | |
Callable Statement Interface | |
Database Interface |
Question 97 Explanation:
DBC connections support creating and executing statements. These may be update statements such as SQL's CREATE, INSERT, UPDATE and DELETE, or they may be query statements such as SELECT. Additionally, stored procedures may be invoked through a JDBC connection. JDBC represents statements using one of the following classes:
1. Statement – the statement is sent to the database server each and every time.
2. PreparedStatement – the statement is cached and then the execution path is pre-determined on the database server allowing it to be executed multiple times in an efficient manner.
3. CallableStatement – used for executing stored procedures on the database.
1. Statement – the statement is sent to the database server each and every time.
2. PreparedStatement – the statement is cached and then the execution path is pre-determined on the database server allowing it to be executed multiple times in an efficient manner.
3. CallableStatement – used for executing stored procedures on the database.
Question 98 |
When we perform an order traversal on a binary tree, we get the ascending order array. The tree is:
Heap tree | |
Almost complete binary tree | |
Binary search tree | |
Cannot be determined |
Question 98 Explanation:
Binary search tree gives the ascending order array.
Question 99 |
Why does congestion occur?
Because the routers and switches have tables | |
Because the routers and switches have queues | |
Because the routers and switches have cross-points | |
None of the options |
Question 100 |
Adding the style attributes in HTML elements, is known to be ______.
Internal | |
Inline | |
Outline | |
External |
Question 100 Explanation:
CSS can be added to HTML documents in 3 ways:
Inline - by using the style attribute inside HTML elements
Internal - by using a < style > element in the < head > section
External - by using a < link > element to link to an external CSS file
The most common way to add CSS, is to keep the styles in external CSS files.
Inline - by using the style attribute inside HTML elements
Internal - by using a < style > element in the < head > section
External - by using a < link > element to link to an external CSS file
The most common way to add CSS, is to keep the styles in external CSS files.
Question 101 |
Assembly line scheduling and Longest Common Subsequence problems are an example of ______.
Dynamic Programming | |
Greedy Algorithms | |
Greedy Algorithms and Dynamic Programming respectively | |
Dynamic Programming and Branch and Bound respectively |
Question 101 Explanation:
Assembly line scheduling and Longest Common Subsequence problems are an example of Dynamic Programming.
Question 102 |
Term in the MVC architecture that receives events is called ______.
Receiver | |
Controller | |
Transmitter | |
Modulator |
Question 102 Explanation:
Term in the MVC architecture that receives events is called Controller.
Question 103 |
What is meant by the following relational algebra statement : STUDENT × COURSE?
Compute the natural join between the STUDENT and COURSE relations | |
Compute the left outer join between the STUDENT and COURSE relations | |
Compute the cartesian product between the STUDENT and COURSE relations | |
Compute the outer join between the STUDENT and COURSE relations |
Question 103 Explanation:
The Cartesian product of two sets A and B, denoted A×B, is the set of all ordered pairs (a, b) where a is in A and b is in B.
FALSE: Compute the natural join between the STUDENT and COURSE relations
FALSE: Compute the left outer join between the STUDENT and COURSE relations
TRUE: Compute the cartesian product between the STUDENT and COURSE relations
FALSE: Compute the outer join between the STUDENT and COURSE relations
FALSE: Compute the natural join between the STUDENT and COURSE relations
FALSE: Compute the left outer join between the STUDENT and COURSE relations
TRUE: Compute the cartesian product between the STUDENT and COURSE relations
FALSE: Compute the outer join between the STUDENT and COURSE relations
Question 104 |
Which of the following is a correct time complexity to solve the 0/1 knapsack problem where n and w represents the number of items and capacity of knapsack respectively?
O(n) | |
O(w) | |
O(nw) | |
O(n + w) |
Question 104 Explanation:
0/1 knapsack problem takes O(nw) time complexity using dynamic programming.
Question 105 |
In an undirected graph, if we add the degrees of all vertices, it is:
odd | |
even | |
cannot be determined | |
always n+1, where n is number of nodes |
Question 105 Explanation:
In an undirected graph, if we add the degrees of all vertices, it is even.
Question 106 |
Type of conflicts that can arise in LR(0) techniques are ______.
Shift-reduce conflict | |
Shift-Shift conflict | |
Both Shift-reduce conflict & Shift-Shift conflict | |
None of the options |
Question 106 Explanation:
Type of conflicts that can arise in LR(0) techniques are Shift-reduce or Reduce-reduce conflicts:
Question 107 |
When retrieving data in a particular table in PostgreSQL, we use the ______ statement.
\dt | |
ORDER BY | |
SELECT FROM | |
\i |
Question 107 Explanation:
When retrieving data in a particular table in PostgreSQL, we use the SELECT FROM statement.
Question 108 |
A computer has a single cache (off-chip) with a 3 ns hit time and a 95% hit rate. Main memory has a 50 ns access time. If we add an on-chip cache with a 0.6 ns hit time and a 98% hit rate, the computer’s effective access time:
2.8 ns | |
5.5 ns | |
0.7 ns | |
None of the options |
Question 108 Explanation:
Single off-chip hit time = 3 ns
Hit rate = 95% = 0.95
Miss rate = 0.05
Main Memory= 50 ns
Access time = 3 ns + 0.05 * 50 ns
= 2.5 ns
Add on-chip cache hit time= 0.6 ns
Hit rate = 98% = 0.98
Miss rate = 0.02
Effective access time = 0.6 ns + 0.02 * ( 3 ns + 0.05 * 50 ns)
= 0.71
Hit rate = 95% = 0.95
Miss rate = 0.05
Main Memory= 50 ns
Access time = 3 ns + 0.05 * 50 ns
= 2.5 ns
Add on-chip cache hit time= 0.6 ns
Hit rate = 98% = 0.98
Miss rate = 0.02
Effective access time = 0.6 ns + 0.02 * ( 3 ns + 0.05 * 50 ns)
= 0.71
Question 109 |
Which of the following is the correct recurrence for the worst case of QuickSort?
T(n) = T(n - 4) + T(n - 2) + O(1) | |
T(n) = T(n - 1) + T(0) + O(n) | |
T(n) = 2T(n/2) + O(n) | |
T(n) = 4T(n/2) + O(n) |
Question 109 Explanation:
T(n) = T(n-1) + n
T(n-1) = (n-1) + T(n-2)
T(n-2) = (n-2) + T(n-3)
...
T(3) = T(2) + 3
T(2) = T(1) + 2
T(1) = 0
Hence,
T(n) = n + (n-1) + (n-2) ... + 3 + 2
=n2 /2
=O(n2)
T(n-1) = (n-1) + T(n-2)
T(n-2) = (n-2) + T(n-3)
...
T(3) = T(2) + 3
T(2) = T(1) + 2
T(1) = 0
Hence,
T(n) = n + (n-1) + (n-2) ... + 3 + 2
=n2 /2
=O(n2)
Question 110 |
In case of the dynamic programming approach the value of an optimal solution is computed in:
Top down fashion | |
Bottom up fashion | |
Left to Right fashion | |
Right to Left fashion |
Question 110 Explanation:
In case of the dynamic programming approach the value of an optimal solution is computed in Bottom up fashion.
Question 111 |
What is the output of the following program?
abstract class Sum
{
public abstract int sumOfTwo(int n1, int n2);
public abstract int sumOfThree(int n1, int n2, int n3);
public void disp() {
System.out.println(Method of class Sum);
}
}
class DemoAbstract[] extends Sum
{
public int sumOfTwo(int num1, int num2)
{
return num1+num2;
public int sumOfThree(int num1, int num2, int num3)
{
return num1 + num2 + num3;
}
public static void main(String args[]) {
Sum.obj = new DemoAbstract1();
System.out.println(obj.sumOfTwo(3, 7));
System.out.println(obj.sumOfThree(4, 3, 19));
obj.disp();
}
}
abstract class Sum
{
public abstract int sumOfTwo(int n1, int n2);
public abstract int sumOfThree(int n1, int n2, int n3);
public void disp() {
System.out.println(Method of class Sum);
}
}
class DemoAbstract[] extends Sum
{
public int sumOfTwo(int num1, int num2)
{
return num1+num2;
public int sumOfThree(int num1, int num2, int num3)
{
return num1 + num2 + num3;
}
public static void main(String args[]) {
Sum.obj = new DemoAbstract1();
System.out.println(obj.sumOfTwo(3, 7));
System.out.println(obj.sumOfThree(4, 3, 19));
obj.disp();
}
}
10 26 Method of class Sum | |
26 10 Method of class Sum | |
Method of class Sum 26 10 | |
Error |
Question 111 Explanation:
The output is
10
26
Method of class Sum
10
26
Method of class Sum
Question 112 |
Given r12=0.6, r13=0.5 and r23=0.8, the value of r123is:
0.47 | |
0.40 | |
0.74 | |
0.64 | |
None of the above |
Question 112 Explanation:
r value is 0.38
Question 113 |
What is the product of the following matrix using Strassen’s matrix multiplication algorithm?

C11=80; C12=07; C21=15; C22=34
| |
C11=82; C12=26; C21=10; C22=34 | |
C11=15; C12=07; C21=80; C22=34
| |
C11=26; C12=10; C21=82; C22=34
|
Question 114 |
Finding the location of the element with a given value is:
Traversal | |
Search | |
Sort | |
None of the options |
Question 114 Explanation:
Finding the location of the element with a given value is search.
Question 115 |
The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many passes will be done to sort the array?
4 | |
2 | |
1 | |
3 |
Question 115 Explanation:
Bubble sort will take the worst case in n-1 comparisons but as per the input it takes only one pass.
Note: Official answer key given, Option-D as the correct answer.

Note: Official answer key given, Option-D as the correct answer.
Question 116 |
A digital signature is required:
for non-repudiation of communication by a sender | |
for all email sending | |
for all DHCP server | |
for FTP transactions |
Question 116 Explanation:
A digital signature is required for non-repudiation of communication by a sender.
Question 117 |
Priority queue is implemented by:
Doubly link list | |
Graph | |
Heap | |
Stack |
Question 117 Explanation:
Priority queue is implemented by heap.
Question 118 |
In the following addressing mode, which of them performs better for accessing array?
Register addressing mode | |
Direct addressing mode | |
Displacement addressing mode | |
Index addressing mode |
Question 118 Explanation:
Index addressing mode performs better for accessing arrays.
Question 119 |
Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states. The relationship between n1 and n2 is:
n1 is necessarily less than n2 | |
n1 is necessarily equal to n2 | |
n1 is necessarily greater than n2 | |
none of the options |
Question 119 Explanation:
No. of states in SLR and LALR are equal and no. of states in SLR and LALR are less than or equal to LR(1).
Question 120 |
The _____ field in IPv4 datagram is not related to fragmentation.
Flag | |
Offset | |
TOS | |
Identifier |
Question 120 Explanation:
IPv4 datagram requires Flag, Offset and Identifier.
There are 120 questions to complete.