Gate
Gate
e
e
(B)
S Aa | b
A bdA' |
A' cA' | adA' |
e
e
(C) Both (A) and (B)
(D) None of these
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 9
21. Which of the following is an advantage of virtual memory?
(A) Faster access to memory on an average.
(B) Processes can be given protected address spaces.
(C) Linker can assign addresses independent of where the program will be loaded in physical
memory
(D) None of these
22. The output of a 3-input logic circuit f(x, y, z) is 1 if ax + by + cz < d and 0, otherwise (a, b, c, d) are
constant). For what values of a, b, c, d does this represent an implementation of the AND gate.
(A) a = b = c = 1; d = 5/2
(B) a = b = c = 1; d = 5/2
(C) a = b = c = 1; d = 3/2
(D) a = b = c = 1; d = 3/2
22. How many gate input are required to realize the following expression?
1
F ABC ABCD EF AD = + + +
(A) 14
(B) 11
(C) 13
(D) 15
24. Which of the following can be recognized by a Deterministic Finite-state Automation?
(A) The numbers, 1, 2, 4, ....z
n
...... written in binary.
(B) The numbers 1, 2, 4, ......, z
n
,.... written in un-binary.
(C) The set of binary string in which the number of zeros is the same as the number of ones.
(D) The set {1, 101, 11011, 1110111, ....}
25. What is the idea behind using insertion sort to sort, sub files generated by shell sort?
(A) Insertion sort works best for small files
(B) Insertion sort works well for nearly sorted files
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 10
(C) There is no such need for insertion sort; the sorts like selection sort that are simple to code may
also be used.
(D) Insertion sort is preferred because comparisons are not expensive.
26. What is the output of the following C program?
main()
{
Int x = 10, y = 10, z = 5, i;
i = x < y < z;
printf(\n%d, i);
(A) 1
(B) 0
(C) Error
(D) 5
27. T(n) = (n+1) + T(n 1) Then T(n) is equal to
(A) O(nlogn)
(B) O(logn)
(C) O(n
2
)
(D) None of these
28. What is the minimal expression for
f = tM(2, 3, 8, 12, 13), d(10, 14)?
(A) (A D) (A B C) (B C A) + + + + +
(B) (A D) (A B C) (A B C) + + + + +
(C) (A B) (B C A) (A B C) + + + + +
(D) (A B) (A C B) (A B C) + + + + +
29. Dividing (11101010)
2
by (1001)
2
will be
(A) 1100
(B) 1001
(C) 1101
(D) None of these
30. The control memory is
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 11
(A) RAM
(B) ROM
(C) Both A and B
(D) None of these
31. Consider a computer with 4 floating point processors. Suppose that each processor uses a cycle time
of 40nsec. How long will it take to perform 400 floating point operations? What is the time if the
operations are carried out on a single processor with cycle time of 10nsec?
(A) 400 n sec, 4000 n sec
(B) 4000 n sec, 4000 n sec
(C) 4000 n sec, 400 n sec
(D) None of these
32. In sign magnitude notation take an n-bit integer and store it in m bit, then
(A) m < n
(B) m = n
(C) m > n
(D) None of these
33. What would be the output of the following program?
int i = 4; printf (%d%d%d%, i ++,++ i, i) ;
(A) 5 5 4
(B) 4 garbage value garbage value
(C) 4 8 10
(D) 5 5 5
34. main ( ) {
unsigned i = 5;
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 12
clrscr( );
if (i > 1)
printf (Hell);
else
printf(Heaven);
}
The output will be:
(A) Heaven
(B) Hell
(C) Compiler error
(D) Unexpected results
35. Which of the following will represent correct expression for the given tree?
2
4
3
5 6
+
*
+
*
+
(A) 654321 + + * * +
(B) 1 + 2 * 3 + 4 * 5 + 6
(C) 12 + 34 + 56 + * *
(D) * + 12 * + 34 + 56
36. Which of the following statements is/are true ?
S1: Semaphores and monitors can be used in distributed system
S2: For distributed system one must use message passing
(A) Only S1
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 13
(B) Only S2
(C) Both S1 and S2
(D) None of these
37. Consider the page sequence 4,3,2,1,4,3,5,4,3,2,1,5.
If FIFO page replacement algorithm is used and frame size is 3, then the percentage of page fault is,
(A) 75%
(B) 85%
(C) 83%
(D) 77%
38. Consider relation schema R with set functional dependencies (F) as:
R(ABCDE) and F = {A BCDE, B C,D E }
The above relation is in
(A) 1NF
(B) 2NF
(C) 3NF
(D) BCNF
39. ( ) ( )
s _name, title card_no
title F53
supp book borrow book
=
| |
t t o
|
\ .
(A) Name of suppliers who have supplied at least one copy of all the titles which are issued to card no
F53
(B) Name of suppliers who have supplied all copies of at least one title issued to card no F53
(C) Name of suppliers who have supplied all copies of all titles which are issued under card no F53
(D) None of these
40. With regard to the expressive power of the formula relational Query languages which of the following
statements is TRUE?
(A) Relational algebra is more powerful than relational calculus
(B) Relational algebra has the same power as relational calculus
(C) Relational algebra has the same power as safe relational calculus
(D) None of these
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 14
41. Which of the following queries finds the client of banker Agassi and the city they live in?
(A) ( )
client _customer _name.customer _city client _customer name customer customer _name Banker_name " Agassi "
( ( Client Customer
= =
t o o
(B) ( )
customer _name.customer _ city Bankeer _name " Aggasi
( Client Customer
=
t o
(C)
Client.Customer _name.Customer _city Banker_name " Aggasi " client.Customer _name Customer.Customer _name
( ( (Client Customer)))
= =
t o o
(D)
Customer _name,Customer _city Banker_names " Aggasi "
( (Client Customer)
=
t o
42. Match the following
A. Secondary index I. functional dependency
B. Non-procedural II. B-Tree
Query language
C. Closure of a set of III. domain calculus
Attributes
D. Natural-join IV. Relational algebraic operations
Codes:
(A) AII, BIII, CI, DIV
(B) AIII, B-II, CIV, DI
(C) AIII, B-I, CII, DIV
(D) AII, B-I, DIV, CIII
43. In B
+
tree index file if there are K search keys and each leaf node contains n records then number of
nodes to be accessed
(A) log
2
n
k
(B) log
n
k
(C)
k
log n
(
(
(D)
n/ 2
log k
(
(
44. A decision table
(A) Documents rules that select one or more action based on one or more conditions from a set of
possible conditions
(B) Represents an information flow
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 15
(C) Show the decision path
(D) Gets an accurate picture of the system
45. The basic COCOMO model predicts an effort of 45PM for a development project. The effort
multipliers for the intermediate COCOMO model have nominal values except for following:
RELY = 1.15, STOR = 1.21 TIME = 1.11, TOL = 1.10
Estimate the adjusted effort?
(A) 70 PM
(B) 76 PM
(C) 80 PM
(D) 86 PM
46. Compute cyclometric complexity.
(A) 4
(B) 2
(C) 3
(D) 1
47. Link tag is used
(A) To inform the location of the based document location
(B) To inform the browser the banner
(C) To inform the banner
(D) None of these
COMMON DATA QUESTION 48 & 49:
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 16
Lets look about the algorithm
int temp, i, j;
for (i = 1; i< n; i + + )
{
temp = A[i];
for (j = i 1; j > i && (A [j] > temp); j --)
A[j + 1] = A[j];
A[j] = temp;
}
}
48. If the Array is sorted then the complexity is
(A) O(n)
(B) O(n
2
)
(C) O(nlog
2
n)
(D) O(log
2
n)
49. If the array is in reverse sorted order then time complexities will be
(A) O(n)
(B) O (nlog
2
n)
(C) O(n
2
)
(D) O(log
2
)
COMMON DATA QUESTION 50- 51
void x (int A [ ], int n)
{
int i, j;
for (i = 0; i < n ; i + + )
{
j = n 1;
while (j > i)
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 17
{
if (A [j] < A[j 1] )
{
swap (A[j], A [j 1]);
{
j --;
}
}
}
50. What will be time complexity of the above algorithm?
(A) O(n)
(B) O(n
2
)
(C) O(nlog
2
n)
(D) O(n
3
)
51. If the array is in sorted order then time complexity will be
(A) O (n)
(B) O(n
2
)
(C) O(nlog
2
n)
(D) O(log
2
n)
Statement for Linked Answer Questions: 52 & 53
Consider the following 5 processes with the length of CPU burst time given in milliseconds (assuming
their arrival time be 0).
Process Burst time
P
1
10
P
2
29
P
3
3
P
4
7
P
5
12
52. Which scheduling algorithm gives the minimal average waiting time?
(A) FCFS
(B) SJF
(C) RR (q = 10) (q : time quantum)
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 18
(D) Both (A) & (B)
53. The proper sequence of the execution of jobs is,
(A) P
1
, P
2
, P
3
, P
4
, P
5
(B) P
3
, P
4
, P
1
, P
5
, P
2
(C) P
1
, P
2
, P
3
,P
4
, P
5
, P
1
, P
2
(D) None of these
Statement for Linked Answer Questions: 54 & 55
Consider an 8085-microprocessor system.
The following program starts at location 0100H.
LXI SP, 00FF
LXI H, 0701
MVI A, 20H
SUB M
54. The content of accumulator when the program counter reaches 0109H is
(A) 20H
(B) 02H
(C) 00H
(D) FFH
55. If in addition following code exists from 0109H onwards.
OR 40H
ADD M
What will be the result in the accumulator after the last instruction is executed?
(A) 40H
(B) 20H
(C) 60H
(D) 42H
56. No doubt, it was our own government but it was being run on borrowed ideas, using
_________solutions.
(A) worn out
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 19
(B) second hand
(C) impractical
(D) appropriate
The question below consists of pair of related words followed by four pairs of words. Select the pair that
best expresses the relation in the original pair:
57. Ratify: Approval::
(A) mutate: change
(B) pacify : conquest
(C) duel: combat
(D) appeal : authority
58. A car goes 35 km in 1 hour, next 270 km in 3 hrs. and next 80 km in
1
2
2
hrs.Find the average speed
of the car
(A) 59.23 km/h.
(B) 61.5 km/h
(C) 80 km/h
(D)52.3km/h
59. Some critics believe that Satyajit Ray never quite came back to the great beginning he made in this
path breaking film Pather Panchali. ______have endured decades of well-traveled bad prints to
become a signpost in cinematic history.
(A) The bizarre history of its misty origins
(B) Its haunting images
(C) Its compelling munificence
(D) The breathtaking awe it inspires
Choose the most appropriate word from the options given below that is most nearly opposite in
meaning to the given word:
60. Valedictory
(A) sad
(B) collegiate
(C) derivative
(D) generosity
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 20
61. If the area of a given square ABCD is 3 find the total area of the entire figure?
(A) 45
2
(B) 45
(C) 48
(D) 31
62. The portion of the immunoglobulin molecule which binds the Specific antigen is formed by the amino
terminal portions of both the H and L chains.
(A) H chain
(B) L chain
(C) Both (a) and (b)
(D) None of these
63. In a certain code Language
134 means good and tasty
478 means see good picture
729 means picture are faint
Which number has been used here for faint?
(A) 9
(B) 2
(C) data are inadequate
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 21
(D) 253
64. A bag contains an equal number of one rupee, 50 paisa and 25 paisa coins. If the value of money in
the bag is Rs. 35, find the total number of coins of each type?
(A) 7
(B) 40
(C) 30
(D) 20
Profit to sale-Table for three companies A, B and C for 1996-97
Companies 1996 1997
Total units 300000 400000
Shares A 5% 25%
B 60% 40%
C 35% 35%
Price A 10% 8%
(per unit) B 7% 14%
(in rupees) C 9% 10%
Profit A 3% 1%
(per unit) B 0.5 5%
(in rupees) C 2% 2.5
65. What is the increase in the total profits of company B in 1997?
(A) 800%
(B) 900%
(C) 750%
(D) 789%
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 22
Answer key
Que Ans. Que Ans. Que Ans. Que Ans. Que Ans.
1 B 16 B 31 B 46 C 61 B
2 B 17 B 32 C 47 A 62 C
3 A 18 B 33 A 48 A 63 C
4 C 19 C 34 C 49 C 64 D
5 A 20 C 35 C 50 B 65 D
6 D 21 B 36 B 51 B
7 A 22 D 37 A 52 B
8 A 23 A 38 C 53 B
9 A 24 A 39 A 54 A
10 B 25 B 40 C 55 B
11 A 26 A 41 A 56 B
12 A 27 C 42 A 57 C
13 C 28 B 43 D 58 A
14 D 29 C 44 A 59 B
15 C 30 C 45 B 60 D
HINTS AND SOLUTIONS
1.(B) The minimum number of edges in a connected graph having 11 vertices is 10 because in a
connected graph the minimum number of edges in a connected graph is n-1 where n is no. of
vertices.
So n = 11
No. of edges = n 1
= 11 1
= 10
2.(B) If A be n n non-singular matrix then.
|adj (adj(A)| =
2
(n - 1)
|A|
or
det (adj A) =
n 1
(det(A))
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 23
3.(A) A =
3 0 0
0 6 2
0 2 6
(
(
(
(
A I = 0
3 0 0 0 0
0 6 2 0 0 0
0 2 6 0 0
( (
( (
=
( (
( (
3 0 0
0 6 2 0
0 2 6
(
(
=
(
(
(3 ) [(6 )
2
4] = 0
(3 ) (36 +
2
12 4) = 0
(3 ) (
2
12 + 32) = 0
3
2
36 + 96
2
+ 12
2
32 = 0
15
2
68
3
+ 96 = 0
Characteristics equation of
15A
2
68A A
3
+ 96 = 0
A(A
2
15A + 68I) = 96I
1 2
1
A (A 15A 68 )
96
= + I
4.(C)
n
n 1 n
n
f(X )
X X
f '(X )
+
=
Hint: If we have the successive approximations i.e. X
1
, X
2
, X
3
..X
n
, X
n + 1
, then we get the recursion
formula (iterative formula) i.e.
n
n 1 n
n
f(X )
X X ,
f '(X )
+
= Provided f(X
n
) = 0.
This is known as Newton-Raphson formula or simply Newtons formula
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 24
5.(A)
5.2
4
n x dx
}
b a 5.2 4
n 0.17
n 7
= = =
5.2
0 n 1 2 n 1
4
h
n x dx 1(y y ) 2(y y ......y )
2
( = + + + +
}
5.2
4
0.2
n x dx [(1.386 1.649) 2(1.435 1.482 1.526 1.569 1.609)]
2
= + + + + + +
}
=
0.17
[3.035 2(7.621)]
2
+
=
0.2
18.277
2
= 1.8277
6.(D)
dx x
tan a b
1 sin x 2
| |
= + +
|
+
\ .
}
2 2
dx 1 sin x 1 sin x
dx
1 sinx 1 sin x cos x
= =
+
} } }
2
[sec x sec x tanx] dx
}
2
sec x dx sec x tanx dx
} }
tanx sec x + c
Or
2
2 2
2
2
2tanxy (1 tan xy )
(1 tan xy )
+
2
2
2
2
(tan xy 1)
(1 tan xy )
2
2
2 2
(1 tan xy )
(1 tanxy ) (1 tan xy )
+
2
2
1 tan xy
1 tan xy +
x
tan c
2 4
t | |
= +
|
\ .
a , b constant
4
t
= =
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 25
C + 4C + 9C + 16C = 1
30C = 1
C =
1
30
9.(A) Given
2 r 2 r
cos i sin
n n
t t | | | |
+
| |
\ . \ .
2 r 2 r
cos i sin ( cos(-x) = cosx)}
n n
t t | |
+
|
\ .
1
2 r 2 r
cos i sin
n n
t t (
+
(
2 r 2 r
cos i sin
n n
t t | | | |
+
| |
\ . \ .
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 26
10.(B) E = xyz + xyz + xyz + xyz
f = m(0, 2, 6, 7)
Index Mint erm Binary disignation Pair ABCD
0 0 0 0 0 0 (0, 1) 0 0 0
1 2 0 0 10 (2, 6) 0 0
2 6 0 110 (6, 7) 0
3 7 0 111
So there are three prime implicant
(0, 1), (2, 6), (6, 7), = xy x z yz + +
11.(A) ABC
Hint: We have the following circuit i.e.
y = (F + G + H)
= (D E) (A A) (C * C) + + +
= AB BC A C + + +
= A B B C A C + + + + +
= A B C ABC + +
12.(A) Hint: We have = A (A B) +
= (A A) (A B) + +
= A + B
Hence the venn diagram will be
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 27
B
13.(C) Hint: We know that half adder is adding two single bit binary values, X, Y produces a sum S bit and a
carry out C out bit.
Also the full adder is adding two single bit binary values, X, Y with a carry input bit C-in produces a
sum bit S and a carry out C out bit.
So to add 16-bit number we need 1 half adder and 15 full adders. The one half adder can add the
least significant bit of the two numbers. Full adders are required to add the remaining 15 bits as they
all involve adding carries.
14.(D) In the figure we have the multiplexer 2 inputs say A and B as they vary with respect to carry at the
ports
I
0
+ I
3
.
So the output will be ABC ABC ABC ABC + + +
15.(C) D AB AB, X AB = + =
Hint: To prove this we have to make the truth table
A B X D
0 0 0 0
0 1 1 1
1 0 0 1
1 1 0 0
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 28
B
A
0 1
0
1
0 0
1 0
B
A
0 1
0
1
0 1
1 0
f = AB
f = AB + AB
So the answer will be AB AB + and
AB
16.(B) {C,D}
Hint:
= 7 6 + 2 = 3
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 34
47.(A) To inform the location of the based document location
48.(A) When array is sorted then complexity will be 0(n) to sort the n items.
49.(C) If the array is in reverse sorted order then time complexity will be O(n
2
) because it will require to two
array of size n.
50.(B) Complexity of algorithm is O(n
2
) because the algorithm has array A[ ] of size n and loop is process n
times so O(n
2
) is the complexity.
51.(B) If the array is in sorted order the time complexity will be O(n
2
)
52.(B) In SJF (Shortest Job scheduling)
In this shortest job means whose burst time is lower than other come first
3 4 1 5 2
P P P P P
0 3 10 20 32 61
Average waiting time =
0 3 10 20 32 65
13
5 5
+ + + +
= =
In FCFS (First Come First Serve)
1 2 3 4 5
P P P P P
0 61 10 39 42 49
Average waiting time
0 10 39 42 49
28
5
+ + + +
=
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 35
In round robin time quantum is must greater than the time of shortest job (3).
53.(B) The proper sequence of the execution of job is
P
3
,P
4
, P
1
, P
5
, P
2
in SJF scheduling
54.(A)
L , SP, 00FF
L , H, 0701
00 FF
01 07
I
I
FF 01
00 07
S B M S B 20H00
= 20H
55.(B) Accumulator content will not changed.
56.(B) No doubt, it was our own government but it was being run on borrowed ideas, using second hand
solutions.
57.(C) Ratify: Approval:: duel: combat
58.(A) Total distance covered
= 35 + 270 + 80 = 385 km.
= 1 + 3 +
1
2
2
hrs.
= 13/2 hrs
Average speed =
D 385 2
T 13
=
= 59.23 km/hr.
UGC NET, GATE, I I T- JAM, I BPS, CSAT/ I AS, CLAT, I SEET, SLET, CTET, TI FR, I I Sc, NI MCET, JEST et c.
Phone: 0744- 2429714 Mobile: 9001297111 , 9829567114, 9829597114, 9001297243
Websit e: www.vpmclasses. com E- Mail: vpmclasses@yahoo. com / info@vpmclasses. com
Address: 1- C- 8, Sheela Chowdhary Road, SFS, TALWANDI , KOTA, RAJASTHAN, 324005
Page 36
59.(B) Some critics believe that Satyajit Ray never quite came back to the great beginning he made in this
path breaking film Pather Panchali. Its haunting images have endured decades of well-travelled bad
prints to become a signpost in cinematic history.
60(D) Generosity is nearly opposite to Valedictory
61.(B) Count the number of squares in the figure and multiply it by 3.
62(C) The portion of the immunoglobulin molecule which binds the Specific antigen is formed by the Amino
terminal portions of both the H and L chains.
63.(C) 4 = good 7 = picture and 2 and 9 = are and faint respectively.so data is inadequate.
64.(D)
X X X
35 or
1 2 4
+ + =
7X
4
= 35 or
7X = 35 4 or X = 20
65(D) The increase in the total profits of company B in 1997 is 789%