Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.

com

1. Four of the following five are alike in a certain way and so form a group. Which is the one that
does not belong to that group?
A. 130 B. 131
C. 125 D. 138
Ans. B
Sol. As 131 is the alone prime number here, so it does not belong to this group.

2. Two Position of a dice are shown below as (i) and (i). When six is at the bottom, what number
will be at the top?

m
co
a.
iy
A. 1 B. 2
C. 4 D. 5
un

Ans. D
Sol. In a standard dice, 5 is opposite to 6.
D

3. Directions: Read the following information carefully and answer the questions given below.
ls

A family consists of six members P, Q, R, S, T and U. There are two married couples. Q is a
ria

doctor and the father of T. U is grandfather of R and is a contractor. S is grandmother of T and

is a housewife. There is one doctor, one contractor, one housewife and two students in the
to

family.
How many male members are there in a family?
Tu

A. Three B. Two
C. Four D. Data inadequate
Ans. D
Sol.

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

Here, we don’t know the gender of T and R. So, data is inadequate.

m
4. A person is walking at a speed of 6 km/hr along a railway track. If he is 200 m ahead of the

co
train which is 100 m long and runs at a speed of 60 km/hr in same direction, then what is the
time required to pass the person?
A. 5 sec B. 10 sec
a.
iy
C. 15 sec D. 20 sec
Ans. D
un

Sol. Given: Speed of the person = 6 km/hr, length of train = 100 m, speed of train = 60 km/hr
Speed of train relative to walking person = (60 – 6) = 54 km/hr
D

Convert km/hr into m/s:

ls

5
54km / hr = 54  = 15 m / s
18
ria

Distance to be covered by the train = 200 + 100 = 300 m

Therefore, time taken by the train to cross the person:
to

Dis tan ce 300

= sec = 20 sec
Speed 15
Tu

5. A boatman rows 2 km in 8 minutes, along the stream and 6 km in 1 hour against the stream.
The speed of the stream is:
A. 3.5 kmph B. 3 kmph
C. 4.5 kmph D. 2 kmph
Ans. C
2
Sol. Speed of downstream (x) =  60 = 15kmph
8

Speed of upstream (y) = 6 kmph

1 1 9
 speed of current = (x − y) = (15 − 6) = = 4.5kmph
2 2 2

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

Option C is correct.

6. A man crosses a 400 m long bridge in 8 minutes. What is his speed in km/h?
A. 3 km/h B. 50 km/h
C. 20 km/h D. 6 km/h
Ans. A
Sol. Speed = (Distance)/Time = 400/8 = 50 m/min
Speed in km/h = 50 × (60/1000) = 3 km/h

3
x + 3y
7.If (21x – 25y) : (4x + 5y) = 5 : 4, then one of the value of is.
3
x −3y

A. 6.5 B. 10

m
C. 8 D. 9

co
Ans. D
Sol. Given that –

a.
iy
4 × (21x – 25y) = 5 × (4x + 5y)
un

84x – 100y = 20x + 25y

64x = 125y
x/y = 125/64
D
ls
ria
to
Tu

= 9.

8. What number should be subtracted from x3+4x2-7x+12, so that it will be completely divisible
by (x+3)?
A. 24 B. 39
C. 42 D. 37

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

Ans. C
Sol. Let the required number is k. Then, x3+4x2-7x+12-k will be divisible by x+3
⟹ (-3)3+4(-3)2-7(-3)+12-k=0
⟹ -27+36+21+12-k=0
⟹ k=42

9. A rectangular field is to be fenced on three sides leaving a side of 20 feet uncovered. If the area
of the field is 680 sq. feet, how many feet of fencing will be required?
A. 34 B. 40
C. 68 D. 88
Ans. D
Sol. one side of rectangle= 20 and area= 680

m
so, other side be 680/20=34
total side to be fenced= 34+34+20= 88 feet

co
10. If the difference between a number and 1/5 th of it is 84, what is the number?
A. 115 B. 95
a.
iy
C. 105 D. 125
Ans. C
un

Sol. Let the number be x

x-x/5=84
D

4x/5=84
ls

x=84X5/4
x=105
ria

11. Find the missing series

to

13, 21, 48, 112?

A. 237 B. 280
Tu

C. 255 D. 290
Ans. A
Sol. The given sequence are:
13, 21, 48, 112,?
To find, the value of missing number =
The pattern follow:
Previous number +23, Previous number +33, Previous number +43, Previous number +53…,
21=13+23=13+8=21
48=21+33=21+27=48
112=48+43=48+64=112
Similarly,

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

?=112+53=112+125=237
The value of the missing number = 237
Hence, the value of "the missing number is equal to 237.

12. If the first two digits of each number are interchanged then the numbers are arranged in
increasing order from left to right then which of the following numbers in the newly formed
sequence will be second from right end?
A. 563 B. 218
C. 732 D. 491
Ans. A
Sol. The given sequence:
563 218 732 491 924

m
Interchanging first two digits of each number, we get:
653 128 372 941 294

co
Arranging the numbers in increasing order from left to right, we get:
128 294 372 653 941

a.
Here, the second number from right end in the newly formed sequence is 653.
iy
13. Two trains A and B of 150 m and 300 m, run at speed of 54 km/hr and 108 km/hr respectively,
un

in the direction opposite direction to each other. Find the time required to cross each other after
the moment they met?
D

A. 10 sec B. 11 sec
ls

C. 12 sec D. 13 sec
Ans. A
ria

Sol. Length of train A = 150 m, speed = 54 km/hr

Length of train B = 300 m, speed = 108 km/hr
to

1) Convert km/hr into m/s:

5
54Km / hr = 54  = 15 m / s
Tu

18
5
108Km / hr = 108  = 30 m / s
18

2) As both trains move opposite to each other, relative speed = 15 + 30 m/s

= 45 m/s
Distance = (Length of train A + Length of train B) = (150 + 300) = 450 m
We know,
Dis tan ce
Time =
Speed

450
Time = = 10 sec
45 sec

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

14. A train moves with a speed of 108 kmph. Its speed in metres per second is :
A. 10 B. 20
C. 30 D. 40
Ans. C
Sol. 108 kmph = 108*[5/18] m/sec = 30 m / s.

15. In a class of 100 students 70 are boys and rest are girls. mean of boy’s marks is 75 and that of
complete class is 72, What is the average of girl’s marks?
A. 65 B. 50
C. 60 D. 55
Ans. A
Sol. Sum of marks of all students = 100 × 72 = 7200

m
Sum of boy’s marks = 70 × 75 = 5250
Sum of girls marks = 7200 – 5250 = 1950

co
Average of girl’s marks = 1950/30 = 65

16.
a.
Alfred buys an old scooter for Rs. 4700 and spends Rs. 800 on its repairs. If he sells the scooter
iy
for Rs. 5800, his gain percent is:
A. 32/7 % B. 60/11 %
un

C. 10 % D. 12 %
Ans. B
D

Sol. Cost Price (C.P.) = Rs. (4700 + 800) = Rs. 5500

ls

Selling Price (S.P.) = Rs. 5800

Gain = (S.P.) - (C.P.) = Rs.(5800 - 5500) = Rs. 300
ria

Gain % =
300 5
 100 = 5
to

5500 11

= 60/11 %
Tu

17. Choose the odd numeral pair/group in each of the following options:
A. 14 : 9 B. 17 : 8
C. 21 : 6 D. 42 : 3
Ans. B
Sol. option B is different.
In all other pairs, the product of the two numbers is 126.
option A 14x9=126
option C 21x6=126
option D 42x3=126
option B 17x8=136

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

18. Direction: Have a word followed by four answer choices. You will choose the word that is a
necessary part of the word.
oligopoly
A. corrupt B. gigantic
C. market D. rich
Ans. C
Sol. oligopoly is a market form where market is dominated by small no of sellers.

19. A vendor sells 50 percent of apples he had and throws away 20 percent of the remainder. Next
day he sells 60 percent of the remainder and throws away the rest. What percent of his apples
does the vendor throw?
A. 26% B. 23%

m
C. 25% D. 27%
Ans. A

co
Sol. Let total apples be 100
first day he throws = 50*20/100 = 10 apples
next day he throws = 40*40/100 = 16 apples
a.
iy
so total = 26
un

20. The sum of ages of 5 children born at the intervals of 3 years is 50 years. What is the age of the
youngest child?
D

A. 4 years B. 8 years
ls

C. 10 years D. None of these

Ans. A
ria

Sol. Let the ages of children be x, (x + 3), (x + 6), (x + 9) and (x + 12) years.
Then, x + (x + 3) + (x + 6) + (x + 9) + (x + 12) = 50
to

5x = 20
x = 4.
Tu

Age of the youngest child = x = 4 years.

21. The average daily rainfall of town A is 105 for first 2 days of the week, 84 for next 3 days and
49 for the last 2 days of the week. The total weekly rainfall for town B is 455. What will be the
average daily rainfall of both the towns together?
A. 138 B. 152
C. 159 D. 145
Ans. D
Sol. Total weekly rainfall for town A = 2 × 105 + 3 × 84 + 2 × 49
= 210 + 252 + 98 = 560
Total weekly rainfall for town A and B = 560 + 455 = 1015

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

Average daily rainfall of both the towns together

Total weekly rainfall of both the towns together 1015
= = = 145
7 7
22. A man crosses a 400 m long bridge in 8 minutes. What is his speed in km/h?
A. 3 km/h B. 50 km/h
C. 20 km/h D. 6 km/h
Ans. A
Sol. Speed = (Distance)/Time = 400/8 = 50 m/min
Speed in km/h = 50 × (60/1000) = 3 km/h

23. A can complete a piece of work in 20 days and B can complete 20% of the work in 6 days. If
they work together in how many days can they finish 50% of the work, if they work together?

m
A. 12 B. 6
C. 8 D. 9

co
Ans. B
Sol. Let us suppose that A can do 100 units of work in 20 days
Then B will complete 20 units of work in 6 days.

a.
iy
20 1
Then A's 1 unit = = day
100 5
un

6 3
And B's 1 unit = = days
20 10
50% of work will be completed in:
D

1
ls

A = 50 units =  50 = 10 days
5
ria

3
B = 50 units =  50 = 15 days
10

xy
Together they can complete the work in days
to

x+y

15  10 150
Tu

 = = 6 days
15 + 10 25

24. The average of three numbers a, b and c is 2 more than c. The average of a and b is 48. If d is
10 less than c, then the average of c and d is:
A. 50 B. 35
C. 36 D. 40
Ans. D
Sol. Given: a + b = 2 × 48 = 96
a+b+c
And =c+2
3

⇒ a + b + c = 3c + 6

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

⇒ a + b = 2c + 6
⇒ 96 = 2c + 6
⇒ 2c = 96 – 6 = 90
90
⇒c= = 45
2
Now, d = c – 10 = 45 – 10 = 35
c + d 45 + 35 80
Hence, Average of c and d = = = = 40
2 2 2

25. Two trains for Mumbai leave Delhi at 6 am and 6:45 am and travel at 100 kmph and 136 kmph
respectively. Approx. how many km from Delhi will the two trains be together?
A. 283 km B. 285 km

m
C. 383 km D. 238 km
Ans. A

co
Sol. → In 45 min,
→ 1st train will cover = 100*[45/60] = 75 km distance.
→ Relative speed of trains = 136-100 = 36 kmph.

a.
→ 2nd train will catch up the 1st train in = (75/36) = (25/12) hours.
iy
→ Distance from Delhi = [25/12]*136 = 283 km approx.
un

26. If in the English alphabet, all the letters at odd-numbered positions are written in serial order
D

from left to right followed by the letters at even-numbered positions written in reverse order,
which letter will be sixth to the left of seventeenth letter from left
ls

A. D B. B
ria

C. U D. V
Ans. C
Sol. A C E G I K M O Q S U W Y Z X V T R P N L J H F D B
to

= (17 - 1) = 11th from left.

Tu

27. Irvin sold a book at a profit of 12%. If Irvin had sold it for ` 18 more, then 18% would have
been gained. Find the cost price.
A. Rs. 600 B. Rs. 300
C. Rs. 400 D. Rs. 200
Ans. B
Sol. Let the CP of the book be x. Then SP be 12% gain= 1.12x
SP+18= ((100+18)/100) * x)
SP+ 18 = 118x/100
1.12x+18=1.18x
x= 1800/6

10

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

x=300

28. When the sum of all possible two-digit numbers formed from three different one-digit natural
numbers are divided by sum of the original three numbers, the result is:
A. 26 B. 24
C. 20 D. 22
Ans. D
Sol. Let x,y, z is original three digits, then possible number of two digits number are
All possible Numerators are :
(10∗x)+y
(10∗x)+z
(10∗y)+x

m
(10∗y)+z
(10∗z)+x

co
(10∗x)+y
Sum of all these two numbers are 2*(x+y+z)*10+2*(x+y+z)

According to qn,
2* ( x + y + z ) *10 + 2* ( x + y + z )
= 22
a.
iy
x+y+z
un

29. A, B, N, C, D, O, E, F, P, ?, ?, ?
A. G, H, I B. G, H, J
D

C. G, H, Q D. J, K, L
ls

Ans. C
Sol. The series consists of 2 groups (A, B, C, D, E, F, ?, ?) and (N, O, P, ?). The series is made of two
ria

terms of first group followed by one term of second group.

to

30. Find the missing series:

BXM, EUP, HRS,?
Tu

A. XZY B. RPN
C. VTU D. KOV
Ans. D
Sol. The pattern is as follows,
B+3=E+3=H+3=K
X-3=U-3=R-3=O
M+3=P+3=S+3=V
So, the missing series is KOV.

31. Which of the following sorting algorithms does not have a worst-case running time of O(n2)?
A. Insertion sort B. Merge sort

11

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

C. Quicksort D. Bubble sort

Ans. B
Sol.

32. The Average case occurs in the linear search algorithm ……….
A. when the item is somewhere in the middle of the array
B. when the item is not the array at all

m
C. when the item is the last element in the array
D. Item is the last element in the array or item is not there at all

co
Ans. A
Sol. The Average case occurs in the linear search algorithm when the item is somewhere in the middle
of the array
a.
iy
33. If the array A contains the items 10, 4, 7, 23, 67, 12 and 5 in that order, what will be the
un

resultant array A after third pass of insertion sort?

A. 67, 12, 10, 5, 4, 7, 23 B. 4, 7, 10, 23, 67, 12, 5
D

C. 4, 5, 7, 67, 10, 12, 23 D. 10, 7, 4, 67, 23, 12, 5

ls

Ans. B
Sol. Given: 10,4,7,23,67,12,5
ria

Pass 1 will be applied on first 2 elements.

10,4 ∣ ,7,23,67,12,5
to

Pass 1: 4,10 ∣, 7 ,23,67,12,5

Pass 2: 4, 7, 10 ∣ , 23,67,12,5
Tu

Pass 3: 4, 7, 10, 23 ∣, 67,12,5

34. Match with the suitable one:

List-I
A) Multicast group membership
B) Interior gateway protocol
C) Exterior gateway protocol
D) RIP
List-II
1. Distance vector routing
2. IGMP

12

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

3. OSPF
4. BGP
A. A-2, B-3, C-4, D-1 B. A-2, B-4, C-3, D-1
C. A-3, B-4, C-1, D-2 D. A-3, B-1, C-4, D-2
Ans. A
Sol. IGMP→ Multicast group membership
OSPF→ Interior gateway protocol
BGP→ Exterior gateway protocol
Distance vector routing→ RIP

35. Which of the following are characteristics of packet switching?

A. Bandwidth divided, store and forward, good for bursty data

m
B. Bandwidth shared, queues at routers, different paths possible
C. Bandwidth shared, low transmission delay, routes may change during transmission

co
D. Bandwidth divided, translation tables for routing, destination address field in packet.
Ans. B

a.
Sol. Packet switching is a connectionless network switching technique. Here, the message is divided
iy
and grouped into a number of units called packets that are individually routed from the source
to the destination. There is no need to establish a dedicated circuit for communication. Therefore,
un

it has bandwidth shared, queues at routers, different paths possible.

D

36. Which of the following is true?

ls

A. ICMP error message generated only for the first fragment.

B. Distance vector is inter domain protocol.
ria

C. Link state routing uses Bellman Ford algorithm to compute distance.

D. OSPF is inter domain protocol.
to

Ans. A
Sol. ICMP error message generated only for the first fragment.
Tu

Distance vector is intra domain protocol, LSR uses Dijkstra’s algorithm.

OSPF is intra domain protocol based on link state routing.
So option (a) is correct.

37. Which of the following can be used during DMA transfer by Central Processing Unit?
A. Memory B. CPU register
C. System bus D. None of these
Ans. B
Sol. Direct memory access (DMA) is a feature of computer systems that allows certain hardware
subsystems (keyboard etc.) to access Main Memory (RAM), independent of the central
processing unit (CPU).

13

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

During DMA transfer, only CPU register is used while system bus and memory cannot be used
by CPU.

38. The multiplier is stored in ______

A. PC Register B. Shift register
C. Cache D. None of the above
Ans. B
Sol. The value is stored in a shift register so that each bit can be accessed separately.

39. The technique whereby the DMA controller steals the access cycles of the processor to operate
is called __________
A. Fast conning B. Memory Controller

m
C. Cycle stealing D. Memory stealing
Ans. C

co
Sol. The controller takes over the processor’s access cycles and performs memory operations. In
computing, traditionally cycle stealing is a method of accessing computer memory (RAM) or

a.
bus without interfering with the CPU. It is similar to direct memory access (DMA) for allowing
iy
I/O controllers to read or write RAM without CPU intervention.
un

40. The associativity of which of the following operators is Left to Right, in C++ ?
A. Unary Operator B. Logical not
D

C. Array element access D. address of

ls

Ans. C
Sol. Array element access has left to right associativity in C++.
ria

41. What data structure is used for depth first traversal of a graph?
to

A. Queue B. Stack
C. List D. None of above
Tu

Ans. B
Sol. DFS uses stack data structure. Depth First Search (DFS) algorithm traverses a graph in a
deathward motion and uses a stack to remember to get the next vertex to start a search, when
a dead end occurs in any iteration.

42. Assume breadth first search algorithm has been implemented using the queue data structure on
given graph :

14

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

Which of the following is possible order of visiting the nodes using BFS algorithm?
A. ACBDEF B. ECFDBA
C. CBAEDF D. BDCAEF
Ans. C
Sol. Considering each of the order,
ACBDEF- Since vertex C is traversed before vertex B, hence vertex E will be traversed before
vertex D.
ECFDBA- Since vertex C is traversed before vertex F, hence F can’t traverse before vertex A and
B.
BDCAEF- Since vertex D is traversed before vertex C, hence F should be traversed before vertex
E.

m
43. Which of the following is not valid Boolean algebra rule?
A. X.X = X B. (X + Y).X = X

co
C. X’ + XY = Y D. (X + Y).(X + Z) = X + YZ
Ans. C
Sol. i) X.X = X
a.
iy
ii) (X + Y).X
= X.X + X.Y
un

= X + X.Y
= X(1 + Y)
D

=X
ls

iii) X' + XY
= (X' + X)(X' + Y)
ria

= (1)(X' + Y)
= (X' + Y)
to

iv) (X + Y).(X + Z)
= X.X + X.Z + X.Y + Y.Z
Tu

= X(1 + Z + Y) + Y.Z
= X + Y.Z

44.

15

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

What will be the equation of simplification of the given K-Map?

A. A B' + B’ C D’ + A' B' C’ B. A B‘ + A’ B’ D' + A' B' C’
C. B' D’ + AB’ + B'C’ D. B'D' + A’ B'C + A B'
Ans. C
Sol.

m
co
45.
a.
Consider the following Boolean function of four variables,
iy
f (w, x, y,z) = Σ(1, 3, 4, 6, 9, 11, 12, 14], the function is?
A. Independent of one variable B. Independent of two variables
un

C. Independent of three variables D. Dependent on all variables

Ans. B
D

Sol. The K-Map for the Boolean function of four variables can be drawn as:
ls
ria
to
Tu

So, independent of two variables.

46. A machine produces 0, 1 or 2 defective pieces in a day with associated probability of 1/6, 2/3
and 1/6, respectively. The mean value and the variance of the number of defective pieces
produced by the machine in a day, respectively, are
A. 1 & 1/3 B. 1/3 & 1
C. 1 & 4/3 D. 1/3 & 4/3

16

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

Ans. A

Sol. Mean (  ) = E ( x ) = Σ  P ( x )

 1 2 1
= 0  + 1  + 2   = 1
 6 3 6

( )
E x2 = Σx2P ( x )

 1 2 1 4
= 0  + 1  + 4   =
 6 3 6 3

( )
Variance = E x2 − 

4 1
= −1 =
3 3

m
47. Let probabilities of solving a problem by students x,y,z are 1/3,1/4,1/5 respectively. What is the

co
probability that problem is solved by exactly one student?
A. 1/3 B. 13/30

a.
C. 3/5 D. 1/2
Ans. B
iy
Sol. P[problem is solved by exactly one]=P[x.y’.z’]+P[x’.y.z’]+P[x’.y’.z]
un

=(1/3).(3/4).(4/5)+(2/3).(1/4).(4/5)+(2/3).(3/4).(1/5)
=13/30
D

48. Which of the following is the recurrence relation for insertion sort?
ls

A. T(n) = T(n-1) + O(n) B. T(n) = T(n/2) + O(n)

ria

C. T(n) = T(n2) + O(log n) D. T(n) = T(n2) + O(n log n)

Ans. A
Sol. Insertion sort is a sorting algorithm in which the elements are transferred one at a time to the
to

right position. In other words, an insertion sort helps in building the final sorted list, one item at
a time, with the movement of higher-ranked elements.
Tu

The recursively sort A[1..n-1] part takes T(n-1) time, while the insert A[n] into the sorted array
A[1..n-1] part takes O(n) time. Add them together to get T(n) = T(n-1) + O(n).

49. How many passes does a Bubbles sort algorithm require for sorting a given list of ‘n’ items?
(n + 1)
A. n2 B.
2
C. n + 1 D. n – 1
Ans. D
Sol. Bubble sort is implemented using sorting two element at a time ⟶ bubble is a simple sorting
algorithm that works by repeatedly stepping through the list to be sorted, comparing each pair
of adjacent items swapping them if they are in wrong order,

17

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

NOTE- Regardless of how the items are arranged in the initial list, n−1 passes will be made to
sort a list of size n.

50. Selection sort algorithm design technique is an example of

A. Greedy method B. Divide-and-conquer
C. Dynamic Programming D. Backtracking

m
Ans. A

co
Sol. The selection sort algorithm sorts an array by repeatedly finding the minimum element
(considering ascending order) from unsorted part and putting it at the beginning. The algorithm

a.
maintains two subarrays in a given array.
1) The subarray which is already sorted.
iy
2) Remaining subarray which is unsorted.
un
In every iteration of selection sort, the minimum element (considering ascending order) from
the unsorted subarray is picked and moved to the sorted subarray. Clearly, it is a greedy
approach to sort the array.
D

Option A. is correct.
ls

51. Which of the following statement is true?

ria

A. Bellman ford algo is applied in Distance Vector Routing.

B. Count to infinity problem occurs in Distance vector Routing with split Horizon.
to

C. Distance Vector Routing works on OSPF protocol.

D. Link State Routing works on Routing Information Protocol.
Tu

Ans. A
Sol. Count to infinity problem occurs in Distance vector Routing without split horizon.
Distance Vector Routing works on Routing Information Protocol.
Link State Routing works on OSPF protocol.

52. In link state routing, after the construction of link state packets new routes are computed using
…………………
A. Bellman Ford algorithm B. DES algorithm
C. Dijkstra’s algorithm D. Leaky bucket algorithm
Ans. C

18

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

Sol. Link state routing is a technique in which each router shares the knowledge of its neighborhood
with every other router in the internetwork. Each node uses Dijkstra's algorithm on the graph to
calculate the optimal routes to all nodes.
o The Link state routing algorithm is also known as Dijkstra's algorithm which is used to find the
shortest path from one node to every other node in the network.
o The Dijkstra's algorithm is an iterative, and it has the property that after k th iteration of the
algorithm, the least cost paths are well known for k destination nodes.

53. When a host on network A sends a message to a host on network B, which address does the
router look at?
A. Port B. IP
C. Physical D. Subnet mask

m
Ans. B
Sol. Routing is done on the basis of IP addresses. A host on network A when sends the packet to the

co
host on network B, it checks the IP address of the receiving host and routes the packet to the
suitable hop.

a.
Physical address i.e. the MAC address is used to recognize a unique host over a network on in a
iy
LAN.
Port number is required to identify a specific process or application to which a message is to be
un

forwarded when it arrives at a server.

D

54. Which most popular input device is used today for interactive processing and for the one line
ls

entry of data for batch processing?

A. Mouse B. Magnetic disk
ria

C. Visual display terminal D. Card punch

Ans. A
to

Sol. In batch processing systems the processes are grouped into batches and they’re executed in
batches.
Tu

55. The register that stores all interrupt requests is:

A. Interrupt mask register B. Interrupt service register
C. Interrupt request register D. Status register
Ans. C
Sol. * The register that stores all interrupt requests is Interrupt request register.
* Interrupt mask register is a read and write register. This register enables or masks interrupts
from being triggered on the external pins of the Cache Controller.
* Interrupt service register handle the interrupt and service them according to priority and other
condition.
* Status register is a hardware register that contains information about the state of the processor

19

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

56. Consider a 33 MHz CPU based system. What is the number of wait states required if it is
interfaced with a 60 ns memory? Assume a maximum of 10 ns delay for additional circuitry like
buffering and decoding.
A. 0 B. 1
C. 2 D. 3
Ans. D
Sol. A wait state is a delay experienced by a computer processor when accessing external memory
or another device that is slow to respond.
Total memory access time = 60 ns + 10 ns = 70 ns.
Given, CPU frequency = 33 MHz
So,
1 clock time = 1 / (33 MHz) = (1/33)*10-6 = 30.30 ns.

m
Therefore,
Total number of wait states = Total number of cycle needed = 70 ns / (30.30 ns) = 2.31 ≈ 3

co
cycles.

57.
a.
Which of the following is correct output for the program code given below?
iy
un
D
ls
ria
to

A. 1 5 2 6 3 7 B. 2 6 3 7 4 8
Tu

C. 1 5 2 5 D. 1 5 2 5 3 5
Ans. C
Sol. An object whose storage class is auto, is reinitialized at every function call whereas an object
whose storage class static persist its value between different function calls.
When the function fun ( ) is called for the first time, values of i and j are printed and sequentially
incremented. During the second function call, i retains its incremented value whereas j is
reinitialized, hence i will print 2 and j will print 5 again.

58. What data structure would you choose to implement “undo” feature in a word processor?
A. Queue B. Dequeue
C. Stack D. None of the above

20

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

Ans. C
Sol. Stack is most suitable data structure since it works in LIFO ordering. All the actions are pushed
into stack and whatever action has to be reversed (undo) can be just popped off the top of stack.

59. Which of the following tree traversal technique is not based on depth first search?
A. Preorder traversal B. Level order traversal
C. Postorder traversal D. Inorder traversal
Ans. B
Sol. Level order traversal also known as breadth first search while other three are depth first search.

60. The characteristic equation of an SR flip-flop is given by

A. Qn+1 = S + RQn B. Qn+1= RQ’n + SQn

m
C. Qn+1= S’ + RQn D. Qn+1 = S + R’Qn
Ans. D

co
Sol. The characteristic table of an SR flip-flop is:

a.
iy
un
D
ls
ria

So, by simplifying using k-maps:

to

characteristic equation of an SR flip-flop = Qn+1 = S + R’Qn

Option d is correct.
Tu

61. How many Addition and Subtraction are requited if you perform multiplication of 5 (Multiplicand)
and -30 (Multiplier) using Booth Algorithm?
A. 2, 1 B. 1, 2
C. 1, 1 D. 2, 2
Ans. D
Sol. Multiplicand -
Decimal: 5
Binary: 00000101

Decimal: -30

21

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

Binary: 11100010
Two's Complement: 00011110
Steps -
Starting Out: 0000000000000101
Subtract: 0001111000000101
Shift: 0000111100000010
Add: 1111000100000010
Shift: 1111100010000001
Subtract: 0001011010000001
Shift: 0000101101000000
Add: 1110110101000000
Shift: 1111011010100000

m
Shift: 1111101101010000
Shift: 1111110110101000

co
Shift: 1111111011010100
Shift: 1111111101101010
Final Product (Binary): 1111111101101010
a.
iy
Final Product (Decimal): -150
2 subtraction, 2 addition
un

62. The Boolean function . The SOP and POS form will be?

A. Y = Σ(1, 2, 3, 6, 7) and Y = Π(0, 4, 5)

D

B. Y = Σ(1, 3, 4, 5, 6) and Y = Π(0, 2, 7)

ls

C. Y = Σ(0, 2, 5, 6) and Y = Π(1, 3, 4, 7)

D. None of these
ria

Ans. B

Sol.
to
Tu

So,
SOP = Σm (1, 3, 4, 5, 6)
POS = Π(0, 2, 7)

63. What is the probability of getting a sum of 9 from two throws of a dice?
A. 1/6 B. 1/8
C. 1/9 D. 1/12
Ans. C
Sol. Favourable outcomes = { (6,3), (3,6), (5,4), (4,5) }
Total possible outcomes = 36
Probability= 4/36 = 1/9

22

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

64. Let A and B be two given independent events such that P(A) =p and P(B) = q and P(exactly one
of A, B) = 2/3, then value of 3p + 3q – 6pq is
A. 2 B. -2
C. 4 D. -4
Ans. A

Sol. ( ) ( )
P ( A ) P B + P A P (B ) =
2
3

2
 p  (1 − q) + (1 − p ) q =
3

2
 p − pq + q − pq =
3

 3p + 3q − 6pq = 2

m
65. What is private cloud?

co
A. A standard cloud service offered via the Internet
B. A cloud architecture maintained within an enterprise data center

a.
C. A cloud service inaccessible to anyone but the cultural elite
iy
D. All of these
Ans. B
un

Sol. Private clouds are data center architectures owned by a single company that provides flexibility,
scalability, provisioning, automation and monitoring. The goal of a private cloud is not sell "as -
D

a-service" offerings to external customers but instead to gain the benefits of cloud architecture
without giving up the control of maintaining your own data center.
ls
ria

66. The phase of the SDLC in which an information system is systematically repaired and improved
is referred to as_
to

A. Analysis B. Implementation
C. Maintenance D. Testing
Tu

Ans. C
Sol. The Maintenance Phase occurs once the system is operational. It includes implementation of
changes that software might undergo over a period of time, or implementation of new
requirements after the software is deployed at the customer location.

67. Which of the following is a form of virus explicitly designed to hide itself from detection by
antivirus software.
A. Stealth Virus B. Macro Virus
C. Polymorphic Virus D. Parasitic Virus
Ans. A

23

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

Sol. A stealth virus is a hidden computer virus that attacks operating system processes and averts
typical anti-virus or anti-malware scans Stealth viruses hide in files, partitions and boot sectors
and are adept at deliberately avoiding detection.

68. Which of the following is NOT true of deadlock prevention and deadlock avoidance schemes?
A. In deadlock prevention, the request for resources is always granted if the resulting state is
safe
B. In deadlock avoidance, the request for resources is always granted if the result state is safe
C. Deadlock avoidance is less restrictive than deadlock prevention
D. Deadlock avoidance requires knowledge of resource requirements a priori
Ans. A
Sol. Deadlock Prevention: Deadlocks can be prevented by preventing at least one of the four

m
required- Mutual Exclusion, Hold and Wait, No Pre-emption, Circular Wait.
Option A In deadlock prevention, the request for resources is always granted if the resulting

co
state is safe. false, Deadlock prevention scheme handles deadlock by making sure that one of
the four necessary conditions don’t occur. In deadlock prevention, the request for a resource

a.
may not be granted even if the resulting state is safe.
iy
Option B In deadlock avoidance, the request for resources is always granted if the result state
is safe. true, As in Deadlock avoidance, if resultant state is safe than request for resource is
un

granted as being in a safe state, it can hold other resources now.

Option C Deadlock avoidance is less restrictive than deadlock prevention. true, As in Deadlock
D

prevention, request for a resource may not be granted even if the resulting state is safe. but in
ls

deadlock avoidance, request for a resource is granted if the resulting state is safe.
Option D Deadlock avoidance requires knowledge of resource requirements a priori
ria

true; deadlock avoidance checks any chance of deadlock means even if the system is in safe
state, it checks that after allocating requested resource, the system is not in deadlocked state.
to

So deadlock avoidance requires knowledge of resource requirements a priori.

Tu

69. In dining philosopher problem with 5 philosophers and 6 chopsticks:

A. Deadlock is possible but not starvation B. Neither Deadlock nor starvation is possible
C. No Deadlock but starvation is possible D. Both Deadlock & starvation is possible
Ans. C
Sol. Deadlock never happens in this situation. Starvation to a particular philosopher may happen.

70. Which of the following is true?

A. Secondary index must be dense B. Clustering index must be dense
C. Primary index must be sparse D. Both (a) and (c)
Ans. A
Sol. • Secondary index based on non key. So, must be dense.

24

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

• Clustering index based on key may be sparse also so, clustering index may be dense, but not
always.
• Primary index on key with non ordering may be dense. So false

71. In the indexed scheme of blocks to a file, the maximum possible size of the file depends on:
A. The number of blocks used for index and the size of index
B. Size of Blocks and size of Address
C. Size of index
D. Size of Block
Ans. A
Sol. In the indexed scheme of blocks to a file, the maximum possible size of the file depends on the
number of blocks used for index and the size of index.

m
72. For a database relation R (a, b, c, d) where the domains of a, b, c and d only include atomic

co
values, only the following functional dependency and those that can be inferred from them hold:
a → c , b→ d
The relation is in?
a.
iy
A. 1NF but not in 2NF B. 2NF but not in3NF
C. 3NF D. None of the above
un

Ans. A
Sol. Since, it is already mentioned that a, b, c, d are atomic values, so by definition of 1NF, it can be
D

inferred that it is already in 1NF.

ls

But a→ c
b→d, the candidate key is → {ab}
ria

So, all the non-key attributes only partially depend on the prime attributes of the candidate
key(a and b). So, it is not in 2NF.
to

73. What will be the equivalent hexadecimal code for (10111101100) 2?

Tu

A. 5AC16 B. 5BC16
C. 5DC16 D. 5EC16
Ans. D
Sol. The hexadecimal code for 0101, 1110, 1100 = 5EC16

74. When two numbers are added in excess-3 code and the sum is less than 9, then in order to get
the correct answer it is necessary to?
A. Subtract 0011 from the sum. B. Add 0011 to the sum.
C. Subtract 0110 from the sum. D. Add 0110 to the sum.
Ans. A

25

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

Sol. The excess-3 binary code is an unweighted self-complementary BCD code. It is an important
BCD code, is a 4-bit code and used with BCD numbers. Self-Complementary property means
that the 1’s complement of an excess-3 number is the excess-3 code of the 9’s complement of
the corresponding decimal number.
The excess-3 code for 3(0011) is 0110 and to find the excess-3 code of the complement of 3,
we just need to find the 1’s complement of 0110 -> 1001, which is also the excess-3 code for
the 9’s complement of 3 -> (9-3) = 6.

75. The number of digit 1 present in the binary representation of

3 × 512 + 7 × 64 + 5 × 8 + 3
A. 8 B. 9
C. 10 D. 12

m
Ans. B
Sol. 3 × 512 + 7 × 64 + 5 × 8 + 3

co
= (2 + 1)× 512 + (4 + 2 + 1)× 64 + (4 + 1)× 8 + 2 + 1
= 1024 + 512 + 64 x 4 + 64 x 2 + 64 + 32 + 8 + 2 + 1
= 1024 + 512 + 256 + 128 + 64 + 32 + 8 + 2 + 1
a.
iy
As 1024 has ten 0’s followed by 1, 512 has nine 0’s followed by 1 and so on..
So, the expression will contain total nine 1’s and will be be represented as 11111101011.
un

Option B. is correct.
D

76. A complete binary tree with the property that the value at each node is as least as large as the
ls

values at its children is known as

A. binary search tree B. AVL tree
ria

C. completely balanced tree D. Heap

Ans. D
to

Sol. In a Max. Binary Heap, the key value at each node is as least as large as the values at its
children. Similarly in Min Binary Heap, the key at root must be minimum among all keys present
Tu

in Binary Heap.

77. How many distinct binary trees can be constructed with three nodes?
A. 1 B. 2
C. 3 D. 5
Ans. D
Sol. Number of Distinct binary trees constructed with 3 nodes.
2n 6
Cn C3
= = =5
n+1 4

26

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

78. The keyword used to transfer control from a function back to the calling function is:
A. switch B. go to
C. go back D. return
Ans. D
Sol. The return statement terminates the execution of a function and it returns the control to the
calling function. The execution resumes in the calling function at a point immediately following
the call.

79. What is the time complexity of following code:

int a = 0;
for (i = 0; i < N; i++)
{

m
for (j = N; j > i; j--)
{

co
a = a + i + j;
}
}
a.
iy
A. O(N) B. O(N*log(N))

C. O(N * N)) D. O(N2)

un

Ans. D
Sol. The above code runs total no of times
D

= N + (N – 1) + (N – 2) + … 1 + 0
ls

= N * (N + 1) / 2
= 1/2 * N2 + 1/2 * N
ria

O(N2) times.
to

80. Which of the following sorting algorithm does not use recursion?
A. quick sort B. merge sort
Tu

C. heap sort D. bottom up merge sort

Ans. D
Sol. Bottom up merge sort uses the iterative method in order to implement sorting. It begins by
merging a pair of adjacent array of size 1 each and then merge arrays of size 2 each in the next
step and so on.

81. If x is the mean of data 3, x, 2 and 4, then the mode is _________

A. 1 B. 2
C. 3 D. 4
Ans. C

27

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

3+x+2+4
Sol. x=
4
4×x=3+x+2+4
4×x-x=3+2+4=9
x=3
Mode is 3. (Maximum repeated value)

82. What is the minimum number of two-input NAND gates used to perform the function of two input
OR gate
A. One B. Two
C. Three D. Four
Ans. C

m
Sol. 3 NAND gates are required in minimum to implement an OR gate.

co
a.
iy
83. For the logic circuit shown in the figure, the required input condition (A, B, C) to make the
un

output X = 1 is
D
ls
ria

A. 1, 0, 1 B. 0, 0, 1
C. 1, 1, 1 D. 0, 1, 1
to

Ans. D
Sol. For X = 1
Tu

A ⊕ B = 1 i.e. A = 0, B = 1
B ⊙ C = 1, i.e. B = 1, C = 1

84. Which of the following scheduling algorithms may cause convoy effect?
A. Round Robin B. First Come First Serve
C. Shortest Job First D. Highest Response Ratio Next
Ans. B
Sol. In convoy effect,
If a processes with higher burst time arrived before the processes with smaller burst time then,
smaller processes have to wait for a long time for longer processes to release the CPU. FCFS
shows convoy effect under such condition.

28

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

85.The output of the lexical analyser is

A. a set of regular expressions B. syntax tree
C. set of tokens D. string of characters
Ans. C
Sol. The output of the lexical analyser is set of tokens.

m
co
a.
iy
un

86. Which of the following is not available in activation record of a procedure?

A. Actual Parameters B. Direct Link
D

C. Control Link D. Temporaries

Ans. B
ls

Sol. Actual Parameters:

ria

The actual parameters used by the calling procedure. Commonly, these values are placed in the
activation record but rather in registers, when possible, for greater efficiency. However, space
to

is shown for them to be completely general.

Control Link:
Tu

A control link, pointing to the activation record of the caller.

Temporaries:
Temporary values, such as those arising from the evaluation of expressions, in cases where
those cannot be held in registers.
Therefore, Direct Link is not present in activation record of procedure.

87. What the checksum is used for?

A. Error correction B. Error detection
C. Both a & b D. None of these
Ans. B

29

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

Sol. The checksum is an error detection scheme, in which the data is divided into k segments each
of m bits. At the sender's end, the segments are added using 1's complement arithmetic to get
the sum. The sum is complemented to get the checksum. If the result is zero, the received data
is accepted; otherwise discarded.

88. The commonly used protocol for webpage transfer is ________

A. HTML B. HTTP
C. WML D. WTTP
Ans. B
Sol. HTTP means HyperText Transfer Protocol. HTTP is the underlying protocol used by the World
Wide Web and this protocol defines how messages are formatted and transmitted, and what
actions Web servers and browsers should take in response to various commands.

m
89. 10 people are seated in a row for a photograph. If there are 6 boys and 4 girls, in how many

co
ways can they be seated if all girls are to be seated together and all boys are to be seated
together?
A. 17280 B. 420
a.
iy
C. 34560 D. 840
Ans. C
un

Sol. 4 girls can be arranged among themselves in 4! ways, while the 6 boys can be arranged among
themselves in 6! ways. Considering them as two groups, they can be arranged in 2! ways.
D

∴ Required number of ways = 2 × 6P6 × 4P4 = 2 × 6! × 4! = 34560

ls

90. Find the number of ways in which 21 desktops can be distributed among 3 labs in a college such
ria

that each lab gets at least one desktop?

A. 190 B. 400
to

C. 816 D. 380
Ans. C
Tu

Sol. Since each labs must have atleast 1 computer, so give 1 to each , 21-3 =18 desktops left,
Number of ways of distributing 18 desktops among 3 labs, such that each gets at least one
18
C3 = 816 ways

91. Four jobs to be executed on a single processor system arrive at time 0 in the order A, B, C, D.
Their burst CPU time requirements are 4, 1, 8, 1 time units respectively. The completion time of
A under round robin scheduling with time slice of one time unit is-
A. 10 B. 4
C. 8 D. 9
Ans. D
Sol.

30

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

Gantt chart-
Ready Queue-
C, A, C, A, C, A, D, C, B, A

m
co
a.
Clearly, completion time of process A = 9 unit.
iy
92. All of the following problems are solvable by divide & conquer method except
un

A. Quick sort B. Merge sort

C. Matrix Multiplication D. Heap sort
Ans. D
D

Sol. option 4 -Heap sort is not based on Divide & conquer ,Heap sort is a comparison
ls

based sorting technique based on Binary Heap data structure. It is similar to

ria

selection sort where we first find the maximum element and place the maximum element at the
end.
Quicksort is a divide-and-conquer algorithm. It works by selecting a 'pivot' element from the
to

array and partitioning the other elements into two sub-arrays.

Tu

Merge sort is one of the most efficient sorting algorithms. It works on the principle of Divide
and Conquer.
Matrix Multiplication is Divide and Conquer using Block Partitioning.

93. Merge sort uses :

A. Divide-and-conquer B. Backtracking
C. Heuristic approach D. Greedy approach
Ans. A
Sol.

31

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

m
co
a.
iy
un
D
ls

94. What is the converse of the following assertion?

ria

“I can top the exam only if I study”

A. I can top the exam if I study
B. If I can top the exam then I study
to

C. If I do not study then I cannot top the exam

Tu

D. If I cannot top the exam then I study

Ans. A
Sol. Statement Says :
If I can top the exam then I study
i.e. P ONLY IF Q ≡ IF P then Q
So, converse of P → Q is Q → P
So, converse of above statement is
I can top the exam If I study.

32

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

95. The set of intelligent students in a class is

A. A null set B. A singleton set
C. A finite set D. Not a well-defined collection
Ans. D
Sol. Since, intelligence is not defined for students in a class i.e., Not a well-defined collection.

96. Without any additional circuitry, an 8 : 1 MUX can be used to obtain?

A. Some but not all functions of 3 variable.
B. None of the functions of 4 variables.
C. All functions of the 4 variables.
D. All functions of 3 variables and some but not all of 4 variables.
Ans. D

m
Sol. 8 : 1 MUX can be used to obtain
• All functions of 3 variables.

co
• Some but not all of 4 variables functions.

97.
a.
For the logic circuit shown in the figure, the required input condition (A, B, C) to make the
iy
output X = 1 is
un
D
ls

A. 1, 0, 1 B. 0, 0, 1
ria

C. 1, 1, 1 D. 0, 1, 1
Ans. D
to

Sol. For X = 1
A ⊕ B = 1 i.e. A = 0, B = 1
Tu

B ⊙ C = 1, i.e. B = 1, C = 1

98. When we mention the prototype of a function?

A. Defining B. Declaring
C. Prototyping D. Calling
Ans. B
Sol. A function prototype in C or C++ is a declaration of a function that omits the function body but
does specify the function's name, argument types and return type.
While a function definition specifies what a function does, a function prototype can be thought
of as specifying its interface.

33

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

99. Header files include?

A. Boolean function B. Void function
C. Library function D. All of the above
Ans. C
Sol. Header files include Library functions.
A header file is a file with extension .h which contains C function declarations and macro
definitions to be shared between several source files. There are two types of header files: the
files that the programmer writes and the files that come with your compiler.

100. 0.75 decimal system is equivalent to ____ in octal system

A. 0.60 B. 0.52
C. 0.54 D. 0.50

m
Ans. A
Sol. 0.75 = (0.110)2

co
= (0.6)8

a.
101. The total number of states and transitions required to form a Moore machine that will produce
iy
residue mod 3?
A. 3 and 6 B. 3 and 5
un

C. 2 and 4 D. 2 and 5
Ans. A
D

Sol. Moore machine is a finite state machine in which the next state is decided by the current state
ls

and current input symbol.

• In the given problem, we need to construct a Moore machine for “mod 3”. MOD 3 will generate
ria

three residues so, each state in the Moore machine represents a residue (0, 1, 2).
• State “Q0/0” will accept strings like {000, 011, 110, …}
to

• State “Q1/1” will accept strings like {001, 100, 111 …}

• State “Q2/2” will accept strings like {010, 101, 1000
Tu

For each state, we have 2 transition moves hence total of 3 states and 6 transitions.

102. Proxy Firewall operates at which layer of OSI Model?

A. Application layer B. Physical layer
C. Data Link layer D. Presentation layer
Ans. A

34

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

Sol. • A proxy firewall acts as an intermediary between in-house clients and servers on the Internet.
It operates at application layer.
• It is used when we want to filter a message on the basis of information contained in message
itself.

103. A partial ordered relation is transitive, reflexive and

A. antisymmetric B. bisymmetric
C. antireflexive D. asymmetric
Ans. A
Sol. The axioms for a non-strict partial order state that the relation ≤ is reflexive, antisymmetric,
and transitive. That is, for all a, b, and c in P, it must satisfy: a ≤ a (reflexivity: every element
is related to itself). To be a partial order, a binary relation must be reflexive (each element is

m
comparable to itself), antisymmetric (no two different elements precede each other), and
transitive

co
104. Each personal computer has a _________ that manages the computer’s arithmetical, logical and
control activities.
a.
iy
A. Microprocessor B. Assembler
C. Microcontroller D. Interpreter
un

Ans. A
Sol. Microprocessor handles all these activities. Each family of processors has its own set of
D

instructions for handling various operations like getting input from keyboard, displaying
ls

information on a screen and performing various other jobs.

ria

105. The prime implicant which has at least one element that is not present in any other implicant is
known as ___________
to

A. Essential Prime Implicant B. Implicant

C. Complement D. Prime Complement
Tu

Ans. A
Sol. Essential prime implicants are prime implicants that cover an output of the function that no
combination of other prime implicants is able to cover.

106.Given √224r = 13r the value of radix r is

A. 10 B. 8
C. 6 D. 5
Ans. D
Sol. √224r = 13r
Taking square on both sides:
2r2 + 2r + 4 = r2 + 6r + 9

35

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

= r2 - 4r - 5 = 0
= (r - 5)(r + 1) = 0
r = 5 // since it can't be -1

107. A set of FDs is given for a relation R (A, B, C, D)

A → AB
AC → D
ABD → C
Then number of elements in {A, C}+ closure?
A. 3 B. 4
C. 5 D. 6
Ans. B

m
Sol. The closure set of AC+ is as follows:
{A, C}+ = {A, C, B, D}.

co
It contains only 4 attributes.

108. What is the output of below program?

a.
iy
#include <stdio.h>
int foo(int* a, int* b)
un

{
int sum = *a + *b;
D

*b = *a;
ls

return *a = sum - *b;

}
ria

int main()
{
to

int i = 0, j = 1, k = 2, p;
p = i++ || foo(&j, &k);
Tu

printf("%d %d %d %d", i, j, k, p);

return 0;
}
A. 1 2 1 1 B. 1 1 2 1
C. 1 2 2 1 D. 1 2 2 2
Ans. A
Sol. The control in the logical OR goes to the second expression only if the first expression results in
FALSE.
The function foo() is called because i++ returns 0(post-increment) after incrementing the value
of i to 1

36

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

The foo() function actually swaps the values of two variables and returns the value of second
parameter.
So, values of variables j and k gets exchanged and OR expression evaluates to be TRUE.

109. Which of the following operations is performed more efficiently by doubly linked list than by
linear linked list?
A. Deleting a node before a node whose location is given
B. Searching an unsorted list for a given item
C. Inserting a node after the node with a given location
D. Traversing the list to process each node.
Ans. A
Sol. Deleting a node before a node whose location is given , it will be easier in DLL because back

m
pointer is provided.

co
110. In a conservative two-phase locking protocol, which of the following is true regarding a
transaction?

a.
A. Should release all the locks only at beginning of transaction
iy
B. Should release exclusive locks only after the commit operation
C. Should acquire all the exclusive locks at beginning of transaction
un

D. Should acquire all the locks at beginning of transaction

Ans. D
D

Sol. In Conservative 2-PL, a transaction should acquire all the locks before the transaction begins
ls

execution.
ria

111. The logic expression (A + B)(A + B) can be implemented by giving the inputs A and B to a two -

input?
to

A. NOR gate B. AND gate

C. XOR gate D. XNOR gate
Tu

Ans. C

Sol. (A + B)(A + B) = AA + AB + AB + BB = AB + AB = A  B

Hence correct answer is XOR gate.

112. The events A1 and A2 occur with probabilities 0.6 and 0.8 respectively. At least one of them
occurs with a probability of 0.9. The probability that both A1 and A2 will occur is ____.
A. 0.7 B. 0.5
C. 0.4 D. 0.3
Ans. B

Sol. P ( A2 ) = 0.6, P ( A2 ) = 0.8, P ( A1  A2 ) = 0.9

37

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

P ( A1  A2 ) = P ( A2 ) + P ( A2 ) − P ( A1  A2 )

= 0.6 + 0.8 - 0.9 = 0.5

113. What is the median of the data if its mode is 15 and the mean is 30?
A. 20 B. 25
C. 22.5 D. 27.5
Ans. B
Sol. 3 median – 2 mean = mode
3 median=15+2(30)
Median=75/3
Median=25

m
114. What is the assigned bandwidth of each of the channels in the AM broadcast band?

co
A. 5 KHz B. 10 KHz
C. 15 Khz D. 200 KHz

a.
Ans. B
Sol. 10 KHz channel BW is assigned for AM broadcast.
iy
un

115. A subnet has been assigned a subnet mask of 255.255.255.192 . What is the maximum number
of hosts that can belong to this subnet?
A. 32 B. 64
D

C. 62 D. 126
ls

Ans. C
ria

Sol. In a subnet mask, the the number of continuous 0’s are the subnet bits.
255.255.255.192 => 11111111.11111111.11111111.11000000
Since we have 6 subnet bits, we can make= 2 6 – 2 = (64–2) = 62 hosts.
to

116. What is recurrence for worst case of Quick Sort and what is the time complexity in Worst case?
Tu

A. Recurrence is T(n) = T(n-2) + O(n) and time complexity is O(n2)

B. Recurrence is T(n) = T(n-1) + O(n) and time complexity is O(n2)
n
C. Recurrence is T(n) = 2T   + O(n) and time complexity is O(nLogn)
2

 n   9n 
D. Recurrence is T(n) = T  + T  + O(n) and time complexity is O(nLogn)
 10   10 

Ans. B
Sol. The worst case of Quick Sort occurs when the picked pivot is always one of the end elements in
sorted array i.e. either minimum or maximum. In worst case, Quick Sort recursively calls one

38

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

subproblem with size 0 and other subproblem with size (n-1). So recurrence is T(n) = T(n-1) +
T(0) + O(n) The above expression can be rewritten as T(n) = T(n-1) + O(n)

117. A term saying that no two transactions to be executed concurrently is called as:
A. Atomicity B. Isolation
C. Durability D. None
Ans. B
Sol. Isolation is referred to as no two transactions to be executed concurrently. Every transaction
should be independent of the other.

118. Select ___________ dept_name

from instructor;

m
Here which of the following displays the unique values of the column?
A. All B. From

co
C. Distinct D. Name
Ans. C

a.
Sol. Distinct keyword selects only the entries that are unique.
iy
119. Ring counter is analogous to
un

A. Toggle Switch B. Latch

C. Stepping Switch D. S-R flip flop
D

Ans. C
ls

Sol. A ring counter is a type of counter composed of flip-flops connected into a shift register, with
the output of the last flip-flop fed to the input of the first, making a "ring" structure and for each
ria

clock pulse, counter advances switch by one step like in sequential gating systems. So, it works
similar as a Stepping Switch. Option C. is correct.
to

120. The race around condition occurs in a level trigger J-K flip-flop when
Tu

A. Both the inputs are 0 B. Both the inputs are 1

C. J = 1 and K = 0 D. J = 0 and K = 1
Ans. B
Sol. In J-K flip-flop

39

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

121. Consider an array contain n distinct elements. In array till ‘i’ location element are in increasing
order and after ‘i’ location all elements are in decreasing order. What is the time complexity to
find location of ith element?
A. O(log n) B. O(n)
C. O(n log n) D. O(log log n)
Ans. A
Sol. Since we have two sorted order of element, hence searching an element in the sorted order can
be done by binary search. Sequential application of modified binary search on the two sequences
will be,
(log n) + (log n) = O (log n)

122. The voltage across the open circuit is?

m
co
a.
iy
un

A. 100V B. Infinity
C. 90V D. 0V
D

Ans. A
Sol. The voltage across all branches in a parallel circuit is the same as that of the source voltage.
ls

Hence the voltage across the 10 ohm resistor and the open circuit is the same=100V.
ria

123. In a compiler, the data structure responsible for the management of information about variables
to

and their attributes is

A. Semantic stack B. Parser table
Tu

C. Symbol table D. Abstract syntax-tree

Ans. C
Sol. Symbol table is an important data structure created and maintained by compilers in order to
store information about the occurrence of various entities such as variable names, function
names, objects, classes, interfaces, etc. Symbol table is used by both the analysis and the
synthesis parts of a compiler.

124. Which addresses can be given to devices in network 131.107.0.0 with a standard class B subnet
mask?
(i) 131.107.255.255
(ii) 131.107.0.1

40

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

(iii) 131.107.1.0
(iv) 131.107.0.0
A. Only (i) B. Only (iii)
C. Only (ii) D. (ii) and (iii)
Ans. D
Sol. The IP address given, 131.107.0.0, is a class B network which has a default subnet mask of
255.255.0.0. The subnet mask used in this problem is 255.255.0.0, which means that we have
16 network bits and 16 host bits. Therefore, this network is not subnetted.
If we convert this subnet mask to binary, we would have the dotted binary representation as:
11111111.1111111111.00000000 00000000
To determine the number of subnets, use the 2 n – 2 formula on the number of host bits (16).
This yield

m
216 – 2 = 65536 – 2 = 65534 (hosts per subnet)
The IP address in the, 131.107.0.0 would therefore fall in the range between 131. 107.0.0 and

co
131.107.255.255.
There are 65534 usable IP addresses in this range.

a.
We cannot use the first, 131.107.0.0 because this is the network number itself. This
iy
number cannot be assigned to a host.
The last number in this subnet is 131.107.255.255, but this cannot be assigned to a host
un

because this the directed broadcast address (DBA) for that subnet.
This leaves us with the first usable IP addresses of 131.107.0.1,
D

and all addresses between it and the DBA are valid.

ls

The last IP address that can be assigned to a host would be 131.107.255.254.

ria

125. The situation wherein the data of operands are not available is called ______
A. Data hazard B. Stock
to

C. Deadlock D. Structural hazard

Ans. A
Tu

Sol. Data hazards are generally caused when the data is not ready on the destination side.

126. Which of the following is correct with regard to insertion sort?

A. insertion sort is stable and it sorts In-place
B. insertion sort is unstable and it sorts In-place
C. insertion sort is stable and it does not sort In-place
D. insertion sort is unstable and it does not sort In-place
Ans. A
Sol. During insertion sort, the relative order of elements is not changed. Therefore, it is a stable
sorting algorithm. And insertion sort requires only O(1) of additional memory space. Therefore,
it sorts In-place.

41

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

127. Which of the following has best lower bound time complexity?
A. Merge sort B. Quick sort
C. Selection sort D. Insertion sort
Ans. D
Sol. In best case merge sort time complexity = O(n logn)
For Quick sort in best case = O(n logn)
For Selection sort = O(n 2)
For insertion sort = O(n)

128. What are the ACID properties of a transaction:

A. Atomicity, Consistency, Inconsistency, Durability

m
B. Automatically, Consistency, Inconsistency, Durability
C. Atomicity, Consistency, Isolation, Durability

co
D. Atomicity, Consistency, Inconsistency, Dependency
Ans. C

a.
Sol. The property of transactions are: Atomicity, Consistency, Isolation, Durability
iy
129. Which of the following is the correct order of keywords for SQL SELECT statements?
un

A. SELECT, FROM, WHERE B. FROM, WHERE, SELECT

C. WHERE, FROM, SELECT D. SELECT, WHERE, FROM
D

Ans. A
ls

Sol. Correct order is

SELECT, FROM, WHERE
ria

1 
130. Consider a matrix P whose only eigenvectors are the multiples of   .
to

4

Consider the following statements:

Tu

I. P does not have an inverse.

II. P has a repeated eigenvalue.
III. P cannot be diagonalized.
Which one of the following options is correct?
A. Only I and II are necessarily true B. Only II is necessarily true
C. Only I and III are necessarily true D. Only II and III are necessarily true
Ans. D

1 
Sol. Only Eigen vector is   multiples means that eigen value is repeated since if eigen values were
4

distinct we will get one more independent eigen vector. So, II P has repeated eigen value is true.

42

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

2 0 
I need not be true since   has repeated eigen values and yet it is invertible. III is true since
0 2 

if matrix has repeated eigen values then it cannot be diagonalizable.

 4 5
131. The larger of the two Eigen values of the matrix   is _____.
2 1 

A. 5 B. 6
C. 7 D. 8
Ans. B
Sol. The character equation for given matrix is
|4-λ 5|=0
|2 1- λ|

m
(4- λ)*(1- λ)-10=0

co
λ2-5λ-6=0
(λ+1)*(λ-6)=0

a.
λ =-1, 6
Greater of two Eigen values are 6
iy
un
132. A determinant of the second order is made with the elements 0 and 1. What is the probability
that the determinant made is positive?
A. 3/16 B. 13/16
D

C. 15/16 D. 14/6
ls

Ans. A
Sol. Total number of determinants that can be formed using 0 and 1 = 16(4 × 4)
ria

1 0 1 0 1 1
The positive determinants are ,  , ,  i.e, 3 in number.
1 1  0 1  0 1
to

∴ Required probability =3/16

Tu

133. A3 × 3 matrix is defined as

3 − x 2 2 
 
A= 2 4−x 1 
 −2 −4 −1 − x 

The values of x required for which A-1 can’t be determined will be?
A. 0, 3, 3 B. 0, 1 , 3
C. 0, 1, 4 D. 1, 1, 3
Ans. A
Sol. For A–1 to be non existent, |A| = 0

43

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

3−x 2 2
A = 2 4−x 1 =0
−2 −4 −1 − x

R2 → R2 + R3

3−x 2 2
0 −x −x = 0
−2 −4 −1 − x

3−x 2 2
( −x ) 0 1 1 =0
−2 −4 −1 − x

R1 → R1 − 2R 2

m
3−x 0 0
( −x ) 0 1 1 =0

co
−2 −4 −1 − x

(– x) (3 – x(– 1 – x + 4)) = 0
(– x) (3 – x) (3 – x) = 0
x = 0, 3, 3 a.
iy
un

1 1 1
 
134. The rank of the matrix 1 −1 0 is _____.
1 1 1
D

A. 3 B. 2
ls

C. 1 D. 0
ria

Ans. B
Sol. R3 ← R1 – R3
to

1 1 1
 
1 −1 0
1 1 1
Tu

Rank = 2
Alternative way: Rank of the matrix is nothing but the number of unique rows in the matrix

135. A bag contains 15 defective items and 35 non defective items. If three items are selected at
random without replacement, what will be the probability that all three items are defective?

A. B.

C. D.

Ans. B

44

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

Sol.

Probability of first item being defective,

Probability of second item being defective,

Probability of third item being defective,

Probability that all three are defective,

m
P = P1 × P2 × P3

co
=

a.
136. A packet of 20 batteries is known to include 4 batteries that are defective. If 8 batteries are
randomly chosen and tested, the probability of finding among them not more than 1 defective
iy
battery is
un

A. 0.5033 B. 0.4905
C. 0.5125 D. 0.5205
D

Ans. A
ls

Sol. Probability of choosing a defective battery

ria

Probability of choosing a non-defective battery

p (not more than 1 out of 8) = p (0 defective out of 8) + p (1 defective out of 8)

to
Tu

137. Consider there are 5 fair coins and 4 unfair coins where we toss unfair coin then probability of
getting heads is 1/3. We put these 9 coins in a bag. The probability of getting fair coin if tail is
already shown
A. 5/18 B. 15/31
C. 23/31 D. None of the above
Ans. B
Sol. The probability of getting fair coin if tail is already shown

45

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

=P(F/T) =P(FꓵT)/P(T) = P(F)*P(T/F) / P(T) = ( P(F)*P(T/F))/( P(F)*P(T/F)+ P(U)*P(T/U))

Where F denotes fair coin and T denotes tail.
According to , P(F) = 5/9, P(T/F) =1/2, P(U) = 4/9, P(T/U)=2/3
After putting these value, probability of getting fair coin if tail is already shown =15/31

138. Match the following Lists.

List-I

n
A-    Px (1 − P)n − x
x

e−  x
B-
x!

C-   e−ix

m
1
D-

co
b−a

List-II

a.
1- Discrete distribution
2- Continuous distribution
iy
A. A-1, B-2, C-1, D-2 B. A-2, B-1, C-2, D-1
un

C. A-1, B-1, C-2, D-2 D. A-2, B-2, C-1, D-1

Ans. C
Sol. A. Binomial distribution (discrete)
D

n 
P ( x ) =    P x  (1 − P)n − x , x  0
ls

x
B. Poisson distribution (discrete)
ria

e− x
P (x) = ,x  1
x!
to

C. Exponential distribution (continuous)

Tu

f ( x ) =   e−ix , 0  x  

D. Uniform distribution (continuous)

1
f (x) = for a  x  b
b−a

139. What is the output of the following program-

main ()
{
int a = 324;
char * b = (char *) & a;

46

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

b++;
*b = 2;
printf("%d”, a);
}
A. 540 B. 590
C. 580 D. 510
Ans. C
Sol. A in memory is stored is-

m
co
a = 512 + 68 = 580.

140. The Output of below code is-

a.
iy
un
D
ls
ria

A. 2 B. 3
C. 4 D. 1
Ans. A
to

Sol. It is possible to assign an array to a pointer. so, when ptr = a; is executed the address of element
Tu

a[0] is assigned to ptr and *ptr gives the value of element a[0]. When *(ptr + n) is executed
the value at the nth location in the array is accessed.

141. Consider the following C program.

#include < stdio.h>
void mystery(int * ptra, int * ptrb) {
int *temp;
temp = ptrb;
ptrb = ptra;

47

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

ptra = temp;
3
int main() {
int a=2016,b=0,c=4,d=42;
mystery (&a, &b);
if (a<c)
mystery(&c, &a);
mystery(&a, &d);
printf("%d \n", a);
}
The output of the program is ______.
A. 201 B. 2016

m
C. 016 D. 6
Ans. B

co
Sol. Output is not affected by the function mystery () as it is just taking the address of a&b into ptra
& ptrb and contents of ptra & ptrb are swapped leaving a & b as it is. Option B is the correct
answer.
a.
iy
142. Consider the following C function:
un
D
ls
ria

What will the function return when x=4 and y = 2?

A. 16 B. 8
to

C. 6 D. 2
Ans. B
Tu

Sol. f(4,2) -> 4 + f(4,1) -> 4 + 4 = 8

143. Consider a 2D array A[-5….5][10……15], the base address is 100 and word length 2B find the
address of the element A[2][13] using Row major order?
A. 190 B. 200
C. 176 D. 180
Ans. A
Sol. In row major order A[i][j] = Base address + W*[(i - L1) * (U2- L2 + 1) + ( j - L2)]
Here values are :-
Base address = 100
W=2B

48

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

i=2
j = 13
L1 = -5
U1 = 5
L2 = 10
U2 = 15
On substituting values
A[2][13] = 100 + 2*[ ( 2 - ( -5 ) ) * (15-10+1) + (13 - 10)]
A[2][13] = 190

144. Match the following data structures and their applications?

1) Stack

m
2) Queue
3) Linked list

co
4) Trees
List-I
p. Serving request of singled shared resource
a.
iy
q. Implementing other data structures
r. Recursive function
un

s. Implementing algorithms
A. 1-s 2-q 3-p 4 -r B. 1-r 2- p 3-s 4 - q
D

C. 1- r 2- s 3- q 4 – p D. 1-r 2-p 3-q 4 - s

ls

Ans. D
Sol. Correct order is
ria

1. Stack : Recursive function

2. Queue : Serving request of singled shared resource
to

3. Linked list : Implementing other data structures

4. Trees : Implementing algorithms
Tu

145. Consider the following code which is implemented on a linked list :

Struct node *ABC(Struct node *S)
{
Struct node *p,*q;
p = q = S;
while(q!=null && q->next !=null && q->next->next !=null)
{
p = p->next;
q = q->next->next;
}

49

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

return p;
}
What does the code return when the head of a linked list is passed as an argument to the code
?
A. Returns the third element from last
B. Returns the second element from last
C. Returns the middle element of linked list
D. Returns the last element of linked list
Ans. C
Sol. We are maintaining two pointers P and Q. P is always incremented by 1 and Q is always
incremented by 2 Hence when Q reaches last, P will be at middle. Hence the code finds out the
middle element of the linked list.

m
146. A machine needs a minimum of 100 sec to sort 1000 names by quick sort. The minimum time

co
needed to sort 100 names will be approximately _____ sec
A. 4.6 B. 6.64
C. 2 D. 7
a.
iy
Ans. B
Sol. Running time of quick sort = c n lg n
un

For n = 1000, we get

100 = c * 1000 * lg 1000 => c = 0.01
D

So, for n = 100, we get running time = 0.01*100*log100=6.64 because log is base 2
ls

147. The worst case running time of Insertion sort, Merge sort and Quick sort, respectively, are:
ria

A. B.

C. D.
to

Ans. D
Tu

Sol. Merge sort in all the cases

Quick sort best case and worst cases

Insertion sort best case and worst case

148. Consider an array consisting of the following elements in unsorted order (placed randomly), but
60 as first element.
60, 80, 15, 95, 7, 12, 35, 90, 55
Quick sort partition algorithm is applied by choosing first element as pivot element. How many
total number of arrangements of array integers is possible preserving the effect of first pass of
partition algorithm.

50

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com
Download FREE BEL last 10 Years Question Papers with Solutions from TutorialsDuniya.com

A. 718 B. 720
C. 724 D. 728
Ans. B
Sol. We have to choose first element as pivot.
Here 60 is given as first element.
After first pass, the pivot element goes to it’s exact location.
Here 60 goes to 6th place.
All the elements less than 60 go to left of 60 and all the elements greater than 60 go to right of
60.
After 1st pass

m
⟹ 720 possible arrangements.

co
149. The Boolean expression Y = (A + B’ + A’B) C’ is given by?
A. A'C’
C. C’
B. BC’
D. AB a.
iy
Ans. C
un

Sol. Y = (A + B' + A'B)C'

Y = AC' + B'C' + A'BC'
D

Y = (A + A'B)C' + B'C'
Y = (A + B)C' + B'C'
ls

Y = AC' + BC' + B'C'

ria

Y = AC' + C'(B + B') // B + B' = 1

Y = AC' + C'
to

Y = C'
So, option C is correct.
Tu

150. With 3 Boolean variables, how many Boolean expressions can be formed.
A. 128 B. 256
C. 64 D. 512
Ans. B
Sol. Number of possible functions with n variable.
n
= 22
Here n=3.
3
22 = 28 = 256
****

51

Download FREE Govt Exams Previous Year Question Papers with Solutions from TutorialsDuniya.com