CurrentAffairsPDFDecember 2012 Page1

UGC NET/ JRF DECEMBER 2012

WWW.JAGRANJOSH.COM QUESTION PAPER III: COMPUTER
SCIENCE AND APPLICATIONS

www.jagranjosh.com SBI POEXAM 2013

Page 1
 PAPER-III
COMPUTER SCIENCE AND APPLICATIONS
Signature and Name of Invigilator
1. (Signature) __________________________ OMR Sheet No. : ...............................................
(Name) ____________________________ (To be filled by the Candidate)

2. (Signature) __________________________ Roll No.

(Name) ____________________________ (In figures as per admission card)
Roll No.________________________________
D 87 1 2 (In words)

Time : 2 1/2 hours] [Maximum Marks : 150

Number of Pages in this Booklet : 12 Number of Questions in this Booklet : 75
Instructions for the Candidates
1. Write your roll number in the space provided on the top of 1.
this page. 2. -
2. This paper consists of seventy five multiple-choice type of 3. , -
questions. -
3. At the commencement of examination, the question booklet , :
will be given to you. In the first 5 minutes, you are requested (i) -
to open the booklet and compulsorily examine it as below : -
(i) To have access to the Question Booklet, tear off the
paper seal on the edge of this cover page. Do not accept
a booklet without sticker-seal and do not accept an
(ii) -
open booklet.
(ii) Tally the number of pages and number of questions /
in the booklet with the information printed on the
cover page. Faulty booklets due to pages/questions
missing or duplicate or not in serial order or any -
other discrepancy should be got replaced immediately
by a correct booklet from the invigilator within the -
period of 5 minutes. Afterwards, neither the
Question Booklet will be replaced nor any extra (iii) OMR -
time will be given.
(iii) After this verification is over, the OMR Sheet Number 4. (A), (B), (C) (D)
should be entered on this Test Booklet.
4. Each item has four alternative responses marked (A), (B),

(C) and (D). You have to darken the circle as indicated below
on the correct response against each item. :
Example : (C)
where (C) is the correct response. 5. OMR
5. Your responses to the items are to be indicated in the OMR OMR
Sheet given inside the Booklet only. If you mark at any ,
place other than in the circle in the OMR Sheet, it will not be
evaluated. 6.
6. Read instructions given inside carefully. 7. (Rough Work)
7. Rough Work is to be done in the end of this booklet. 8. OMR ,
8. If you write your Name, Roll Number, Phone Number or ,
put any mark on any part of the OMR Sheet, except for the , ,
space allotted for the relevant entries, which may disclose ,
your identity, or use abusive language or employ any other
unfair means, you will render yourself liable to
disqualification.
9. - OMR
9. You have to return the test question booklet and Original
OMR Sheet to the invigilators at the end of the examination
compulsorily and must not carry it with you outside the OMR
Examination Hall. You are, however, allowed to carry
duplicate copy of OMR Sheet on conclusion of examination. 10. /
10. Use only Blue/Black Ball point pen. 11. ()
11. Use of any calculator or log table etc., is prohibited.
12. There is no negative marks for incorrect answers. 12.
D-87-12 1 P.T.O.
 COMPUTER SCIENCE AND APPLICATIONS
PAPER III
Note : This paper contains seventy five (75) objective type questions of two (2) marks each.
All questions are compulsory.

1. Eco system is a Frame work for 5. ______ is process of extracting

(A) Building a Computer System previously non known valid and
(B) Building Internet Market actionable information from large data
(C) Building Offline Market to make crucial business and strategic
decisions.
(D) Building Market
(A) Data Management
2. The efficiency (E) and speed up (sp) (B) Data base
for Multiprocessor with p processors (C) Data Mining
satisfies : (D) Meta Data
(A) E p and sp p
(B) E 1 and sp p 6. The aspect ratio of an image is defined
as
(C) E p and sp 1
(A) The ratio of width to its height
(D) E 1 and sp 1 measured in unit length.
(B) The ratio of height to width
3. Match the following : measured in number of pixels.
List I List II (C) The ratio of depth to width
a. Critical region 1. Hoares Monitor measured in unit length.
b. Wait/signal 2. Mutual exclusion (D) The ratio of width to depth
measured in number of pixels.
c. Working set 3. Principal of
locality
d. Dead lock 4. Circular wait 7. Which of the following features will
Codes : characterize an OS as multi-
programmed OS ?
a b c d
(a) More than one program may be
(A) 2 1 3 4
loaded into main memory at the
(B) 1 2 4 3 same time.
(C) 2 3 1 4 (b) If a program waits for certain
(D) 1 3 2 4 event another program is
immediately scheduled.
4. The technique of temporarily delaying
outgoing acknowledgements so that (c) If the execution of a program
they can be hooked onto the next terminates, another program is
outgoing data frame is known as immediately scheduled.
(A) Bit stuffing (A) (a) only
(B) Piggy backing (B) (a) and (b) only
(C) Pipelining (C) (a) and (c) only
(D) Broadcasting (D) (a), (b) and (c) only

Paper-III 2 D-87-12
8. Using RSA algorithm, what is the 11. The time complexities of some
value of cipher text C, if the plain text standard graph algorithms are given.
M = 5 and p = 3, q = 11 & d = 7 ? Match each algorithm with its time
(A) 33 complexity ? (n and m are no. of nodes
(B) 5 and edges respectively)
(C) 25 a. Bellman Ford 1. O (m log n)
(D) 26 algorithm
b. Kruskals algorithm 2. O (n3)
9. You are given an OR problem and a c. Floyd Warshall 3. O(mn)
XOR problem to solve. Then, which algorithm
one of the following statements is
true ? d. Topological sorting 4. O(n + m)
(A) Both OR and XOR problems Codes :
can be solved using single layer a b c d
perception. (A) 3 1 2 4
(B) OR problem can be solved using
(B) 2 4 3 1
single layer perception and XOR
problem can be solved using self (C) 3 4 1 2
organizing maps. (D) 2 1 3 4
(C) OR problem can be solved using
radial basis function and XOR
problem can be solved using 12. Let V1 = 2I J + K and V2 = I + J K,
single layer perception. then the angle between V1 & V2 and a
(D) OR problem can be solved using vector perpendicular to both V1 & V2
single layer perception and XOR shall be :
problem can be solved using
radial basis function. (A) 90 and (2I + J 3K)
(B) 60 and (2I + J + 3K)
10. Match the following : (C) 90 and (2I + J 3K)
List I List II (D) 90 and (2I J + 3K)
a. Application 1. TCP
layer
b. Transport 2. HDLC 13. Consider a fuzzy set A defined on the
layer interval X = [0, 10] of integers by the
membership Junction
c. Network 3. HTTP
layer x
A(x) = x + 2
d. Data link 4. BGP
layer Then the cut corresponding to
Codes : = 0.5 will be
a b c d (A) {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
(A) 2 1 4 3
(B) {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
(B) 3 4 1 2
(C) {2, 3, 4, 5, 6, 7, 8, 9, 10}
(C) 3 1 4 2
(D) 2 4 1 3 (D) { }

D-87-12 3 Paper-III
14. Let T(n) be the function defined by 19. Identify the following activation
T(n) = 1 and T(n) = 2T (n/2) + n, function :
which of the following is TRUE ? 1
(V) = Z + 1 + exp ( x V + Y) ,
(A) T(n) = O( n) *
(B) T(n) = O(log2n) Z, X, Y are parameters
(C) T(n) = O(n) (A) Step function
(D) T(n) = O(n2) (B) Ramp function
(C) Sigmoid function
15. In classful addressing, an IP address (D) Gaussian function
123.23.156.4 belongs to ______ class
format. 20. The no. of ways to distribute n
(A) A distinguishable objects into k
(B) B distinguishable boxes, so that ni objects
(C) C are placed into box i, i = 1, 2, . k
(D) D equals which of the following ?
n!
16. The Mandelbrot set used for the (A) n ! + n ! + ..... + n !
1 2 k
construction of beautiful images is
n1! + n2! + ..... + nk!
based on the following transformation : (B) n1! n2! n3! ..... nk!
xn + 1= x2n + z
Here, n!
(C) n1! n2! n3! ..... nk!
(A) Both x & z are real numbers.
(B) Both x & z are complex numbers. n1! n2! ..... nk!
(D) n1! n2! n3! ..... nk!
(C) x is real & z is complex.
(D) x is complex & z is real.
21. How many solutions do the following
17. Which of the following permutations equation have
can be obtained in the output using a
x1 + x2 + x3 = 11
stack of size 3 elements assuming that
input, sequence is 1, 2, 3, 4, 5 ? where x1 1, x2 2, x3 3
(A) 3, 2, 1, 5, 4 (A) C(7, 11)
(B) 5, 4, 3, 2, 1 (B) C(11, 3)
(C) 3, 4, 5, 2, 1 (C) C(14, 11)
(D) 3, 4, 5, 1, 2 (D) C(7, 5)

18. In a Linear Programming Problem,

22. Which provides an interface to the
suppose there are 3 basic variables and
TCP/IP suit protocols in Windows95
2 non-basic variables, then the possible
and Windows NT ?
number of basic solutions are
(A) 6 (A) FTP Active-X Control
(B) 8 (B) TCP/IP Active-X Control
(C) 10 (C) Calinsock Active-X Control
(D) 12 (D) HTML Active-X Control
Paper-III 4 D-87-12
23. What are the final values of Q1 and Q0 27. In an enhancement of a CPU design,
after 4 clock cycles, if initial values are the speed of a floating point unit has
00 in the sequential circuit shown been increased by 20% and the speed
below : of a fixed point unit has been increased
by 10%. What is the overall speed
achieved if the ratio of the number of
floating point operations to the number
of fixed point operations is 2 : 3 and
the floating point operation used to
(A) 11 take twice the time taken by the fixed
point operation in original design ?
(B) 10
(C) 01 (A) 1.62
(D) 00 (B) 1.55
(C) 1.85
24. If dual has an unbounded solution, then
its corresponding primal has (D) 1.285
(A) no feasible solution
(B) unbounded solution
28. The initial basic feasible solution to the
(C) feasible solution following transportation problem using
(D) none of these Vogels approximation method is
D1 D2 D3 D4 Supply
25. The number of distinct bracelets of five
beads made up of red, blue, and green S1 1 2 1 4 30
beads (two bracelets are S2 3 3 2 1 50
indistinguishable if the rotation of one
yield another) is, S3 4 2 5 9 20
(A) 243 Demand 20 40 30 10
(B) 81
(A) x11 = 20, x13 = 10, x21 = 20,
(C) 51
x23 = 20, x24 = 10, x32 = 10,
(D) 47
Total cost = 180

26. Which are the classifications of data (B) x11 = 20, x12 = 20, x13 = 10,
used in Mobile Applications ?
x22 = 20, x23 = 20, x24 = 10,
(A) Private data, User data, Shared
data. Total cost = 180
(B) Public data, User data, Virtual
(C) x11 = 20, x13 = 10, x22 = 20,
data.
x23 = 20, x24 = 10, x32 = 10,
(C) Private data, Public data, Shared
data. Total cost = 180
(D) Public data, Virtual data, User
data. (D) None of the above

D-87-12 5 Paper-III
29. 58 lamps are to be connected to a single 33. The Z-buffer algorithm is used for
electric outlet by using an extension Hidden surface removal of objects. The
board each of which has four outlets. maximum number of objects that can
The number of extension boards needed be handled by this algorithm shall
to connect all the light is (A) Depend on the application
(A) 29 (B) be arbitrary no. of objects
(B) 28 (C) Depend on the memory
(C) 20 availability
(D) 19 (D) Depend on the processor

30. Match the following with respect to the 34. The power set of AUB, where
Mobile Computing Architecture. A = {2, 3, 5, 7} and B = {2, 5, 8, 9} is
a. Downlink 1. 100 Mbps (A) 256
control (B) 64
b. Radio 2. Residency (C) 16
communication latency (RL) (D) 4
data rate
c. The average 3. Sending data
duration of users from a BS to 35. In Win32, which function is used to
create Windows Applications ?
stay in cell MD
(A) Win APP
d. FDDI 4. 2-Mbps
bandwidth (B) Win API
Codes : (C) Win Main
a b c d (D) Win Void
(A) 2 1 4 3
(B) 3 4 2 1 36. Suppose a processor does not have any
stack pointer registers, which of the
(C) 4 1 2 1
following statements is true ?
(D) 4 3 1 2
(A) It cannot have subroutine call
instruction.
31. Which of the following flags are set (B) It cannot have nested subroutine
when JMP instruction is executed ? calls.
(A) SF and CF (C) Interrupts are not possible.
(B) AF and CF (D) All subroutine calls and
(C) All flags interrupts are possible.
(D) No flag is set
37. Everything below the system call
32. A thread is a light weight process. In interface and above the physical
the above statement, weight refers to hardware is known as ______.
(A) time (A) Kernel
(B) number of resources (B) Bus
(C) speed (C) Shell
(D) All the above (D) Stub
Paper-III 6 D-87-12
38. Which is not the correct statement ? 42. The grammar G1
(A) The class of regular sets is closed S OSO| ISI | 0|1| and the grammar
under homomorphisms. G2 is
S as |asb| X, X Xa | a.
(B) The class of regular sets is not
Which is the correct statement ?
closed under inverse
homomorphisms. (A) G1 is ambiguous, G2 is
unambiguous
(C) The class of regular sets is closed (B) G1 is unambiguous, G2 is
under quotient. ambiguous
(D) The class of regular sets is closed (C) Both G1 and G2 are ambiguous
under substitution. (D) Both G1 and G2 are
unambiguous

39. When a programming Language has 43. Consider n processes sharing the CPU
the capacity to produce new datatype, in round robin fashion. Assuming that
it is called as, each process switch takes s seconds.
(A) Overloaded Language What must be the quantum size q such
that the overhead resulting from
(B) Extensible Language
process switching is minimized but, at
(C) Encapsulated Language the same time each process is
guaranteed to get its turn at the CPU at
(D) Abstraction Language
least every t seconds ?
t ns
(A) q n 1
40. Which of the following operating
system is better for implementing t ns
(B) q n 1
client-server network ?
(A) Windows 95 t ns
(C) q n + 1
(B) Windows 98 t ns
(D) q n + 1
(C) Windows 2000
(D) All of these
44. The Default Parameter Passing
Mechanism is called as
41. Consider a system having m resources (A) Call by Value
of the same type. These resources are (B) Call by Reference
shared by 3 processes A, B and C (C) Call by Address
which have peak demands of 3, 4 and 6 (D) Call by Name
respectively. For what value of m
deadlock will not occur ?
45. Which of the following regular
(A) 7 expression identities are true ?
(B) 9 (A) (r + s)* = r* s*
(B) (r + s)* = r* + s*
(C) 10
(C) (r + s)* = (r*s*)*
(D) 13 (D) r* s* = r* + s*
D-87-12 7 Paper-III
46. Two graphs A and B are shown below : 50. Which of the following definitions
Which one of the following statement generates the same Language as L,
is true ? where L = {WWR | W {a, b}*}
(A) S asb|bsa|
(B) S asa|bsb|
(C) S asb|bsa|asa|bsb|
(D) S asb|bsa|asa|bsb

51. Suppose there are logn sorted lists of n

(A) Both A and B are planar. logn elements each. The time
(B) Neither A nor B is planar.
complexity of producing a sorted list of
(C) A is planar and B is not. all these elements is
(D) B is planar and A is not. (use heap data structure)
(A) O (n log logn)
47. The minimum number of states of the
non-deterministic finite automation (B) (n logn)
which accepts the language (C) (n logn)
{a b a bn|n 0} {a b an|n 0} is (D) (n3/2)
(A) 3 (B) 4
(C) 5 (D) 6 52. Consider the program below in a
hypothetical programming language
48. Functions defined with class name are which allows global variables and a
called as choice of static or dynamic scoping
(A) Inline function int i;
(B) Friend function program Main( )
(C) Constructor {
(D) Static function i = 10;
call f ( );
}
49. Let f be the fraction of a computation
(in terms of time) that is parallelizable, procedure f( )
P the number of processors in the {
system, and sp the speed up achievable int i = 20;
call g ( );
in comparison with sequential }
execution then the sp can be
procedure g( )
calculated using the relation : {
1 print i;
(A) 1 f f/P
}
P Let x be the value printed under static
(B) scoping and y be the value printed
P f(P + 1)
under dynamic scoping. Then x and y
1 are
(C) 1 f + f/P (A) x = 10, y = 20
(B) x = 20, y = 10
P (C) x = 20, y = 20
(D) P + f(P 1)
(D) x = 10, y = 10
Paper-III 8 D-87-12
53. If the parse tree of a word w generated
by a Chomsky normal form grammar
has no path of length greater than i,
then the word w is of length
(A) no greater than 2i+1
(B) no greater than 2i
(C) no greater than 2i1
(D) no greater than i
54. The Object Modelling Technique
(OMT) uses the following three kinds
of model to describe a system
(A) Class Model, Object Model and
Analysis Model.
(B) Object Model, Dynamic Model,
and Functional Model.
(C) Class Model, Dynamic Model
and Functional Model.
(D) Object Model, Analysis Model
and Dynamic Model.
55. The factors that determine the quality
of a software system are
(A) correctness, reliability
(B) efficiency, usability, maintain-
ability
(C) testability, portability, accuracy,
error tolerances, expandability,
access control, audit.
(D) All of the above
56. If a relation with a Schema R is
decomposed into two relations R1 and
R2 such that (R1 R2) = R1 then
which one of the following is to be
satisfied for a lossless joint
decomposition ( indicates functional
dependency)
(A) (R1 R2) R1 or R1 R2 R2
(B) R1 R2 R1
(C) R1 R2 R2
(D) R1 R2 R1and R1 R2 R2
D-87-12
57. Given the following statements :
(i) Recursive enumerable sets are
closed under complementation.
(ii) Recursive sets are closed under
complementation.
Which is/are the correct statements ?
(A) only (i)
(B) only (ii)
(C) both (i) and (ii)
(D) neither (i) nor (ii)
58. Skolmization is the process of
(A) bringing all the quantifiers in the
beginning of a formula in FDL.
(B) removing all the universal
quantifiers.
(C) removing all the existential
quantifiers.
(D) all of the above.
59. Which level of Abstraction describes
how data are stored in the data base ?
(A) Physical level
(B) View level
(C) Abstraction level
(D) Logical level
60. The transform which possesses the
multi-resolution property is
(A) Fourier transform
(B) Short-time-Fourier transform
(C) Wavelet transform
(D) Karhunen-Loere transform
61. Which one is a collection of templates
and rules ?
(A) XML
(B) CSS
(C) DHTML
(D) XSL
9 Paper-III
62. A program P calls two subprograms P1 66. Match the following with respect to
and P2. P1 can fail 50% times and P2 HTML tags and usage.
40% times. Then P can fail a. CITE 1. Italic
representation
(A) 50%
b. EM 2. Represents output
(B) 60% from programmes
(C) 10% c. VAR 3. Represents to
(D) 70% other source
d. SAMP 4. Argument to a
programme
63. Third normal form is based on the Codes :
concept of ______.
a b c d
(A) Closure Dependency
(A) 3 1 4 2
(B) Transitive Dependency (B) 2 3 1 4
(C) Normal Dependency (C) 4 2 3 1
(D) Functional Dependency (D) 1 3 4 1

64. If the Fourier transform of the function 67. An expert system shell is an expert
f(x, y) is F(m, n), then the Fourier system without
transform of the function f(2x, 2y) is : (A) domain knowledge
1 m n (B) explanation facility
(A) 4 F 2 , 2
(C) reasoning with knowledge
1 (D) all of the above
(B) 4 F (2m, 2n)

1 68. An example of a dictionary-based

(C) 4 F (m, n) coding technique is
1 m n (A) Run-length coding
(D) 4 F 4 , 4
(B) Huffman coding
(C) Predictive coding
65. ______ establishes information about (D) LZW coding
when, why and by whom changes are
made in a software.
69. Which is the method used to retrieve
(A) Software Configuration the current state of a check box ?
Management.
(A) get State ( )
(B) Change Control.
(B) put State ( )
(C) Version Control. (C) retrieve State ( )
(D) An Audit Trail. (D) write State ( )
Paper-III 10 D-87-12
70. Referential integrity is directly related 73. Match the following :
to a. Supervised 1. The decision
learning system receives
(A) Relation key
rewards for its
(B) Foreign key action at the end
of a sequence of
(C) Primary key steps.
(D) Candidate key b. Unsupervised 2. Manual labels of
learning inputs are not
used.
c. Re- 3. Manual labels of
71. You are given four images represented inforcement inputs are used.
as learning
0 0 0 1 d. Inductive 4. System learns by
I1 = , I2 = , learning example
0 0 0 0
Codes :
0 1 1 1
I3 = , I4 = a b c d
1 0 1 0
(A) 1 2 3 4
The value of entropy is maximum for (B) 2 3 1 4
image
(C) 3 2 4 1
(A) I1 (D) 3 2 1 4

(B) I2
74. A* algorithm is guaranteed to find an
(C) I3 optimal solution if
(A) h' is always 0.
(D) I4 (B) g is always 1.
(C) h' never overestimates h.
(D) h' never underestimates h.
72. A cryptarithmetic problem of the type
SEND 75. Let (x, y, z) be the statement x + y = z
and let there be two quantifications
+ MORE
given as
MONEY (i) x y Z (x, y, z)
Can be solved efficiently using (ii) Z x y (x, y, z)
Where x, y, z are real numbers. Then
(A) depth first technique which one of the following is correct ?
(B) breadth first technique (A) (i) is true and (ii) is true.
(B) (i) is true and (ii) is false.
(C) constraint satisfaction technique (C) (i) is false and (ii) is true.
(D) bidirectional technique (D) (i) is false and (ii) is false.

D-87-12 11 Paper-III
 Space For Rough Work

Paper-III 12 D-87-12
PracticeheretheQuestion Papers in orderto excel in theUGC NET/ JRF/SLET eligibility examination

Find detailsabout NET, SLET, ARSexams, news, awards, fellowship, exam tips, previousyearquestion
papers, hereat UGC | SLET | CSIR| ICAR

Readjagranjosh.com to find information on admission alerts, job notification, etc