Paper for UG NET Computer Science

Will you please give me question paper for National eligibility test computer science examination of UGC ?

Here I am giving you question paper for National eligibility test computer science examination of UGC in PDF file attached with it ..

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

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

14. Let T(n) be the function defined by
T(n) = 1 and T(n) = 2T (n/2) + n,
which of the following is TRUE ?
(A) T(n) = O( n)
(B) T(n) = O(log2n)
(C) T(n) = O(n)
(D) T(n) = O(n2)
15. In classful addressing, an IP address
123.23.156.4 belongs to ______ class
format.
(A) A
(B) B
(C) C
(D) D
16. The Mandelbrot set used for the
construction of beautiful images is
based on the following transformation :
xn + 1= x2n
+ z
Here,
(A) Both x & z are real numbers.
(B) Both x & z are complex numbers.
(C) x is real & z is complex.
(D) x is complex & z is real.
17. Which of the following permutations
can be obtained in the output using a
stack of size 3 elements assuming that
input, sequence is 1, 2, 3, 4, 5 ?
(A) 3, 2, 1, 5, 4
(B) 5, 4, 3, 2, 1
(C) 3, 4, 5, 2, 1
(D) 3, 4, 5, 1, 2
18. In a Linear Programming Problem,
suppose there are 3 basic variables and
2 non-basic variables, then the possible
number of basic solutions are
(A) 6
(B) 8
(C) 10
(D) 12
19. Identify the following activation
function :
(V) = Z +
1
1 + exp (– x * V + Y) ,
Z, X, Y are parameters
(A) Step function
(B) Ramp function
(C) Sigmoid function
(D) Gaussian function
20. The no. of ways to distribute n
distinguishable objects into k
distinguishable boxes, so that ni objects
are placed into box i, i = 1, 2, …. k
equals which of the following ?
(A)
n!
n1! + n2! + ..... + nk!
(B)
n1! + n2! + ..... + nk!
n1! n2! n3! ..... nk!
(C)
n!
n1! n2! n3! ..... nk!
(D)
n1! n2! ..... nk!
n1! – n2! – n3! ..... – nk!
21. How many solutions do the following
equation have
x1 + x2 + x3 = 11
where x1  1, x2  2, x3  3
(A) C(7, 11)
(B) C(11, 3)
(C) C(14, 11)
(D) C(7, 5)
22. Which provides an interface to the
TCP/IP suit protocols in Windows95
and Windows NT ?
(A) FTP Active-X Control
(B) TCP/IP Active-X Control
(C) Calinsock Active-X Control
(D) HTML Active-X Control

23. What are the final values of Q1 and Q0
after 4 clock cycles, if initial values are
00 in the sequential circuit shown
below :
(A) 11
(B) 10
(C) 01
(D) 00
24. If dual has an unbounded solution, then
its corresponding primal has
(A) no feasible solution
(B) unbounded solution
(C) feasible solution
(D) none of these
25. The number of distinct bracelets of five
beads made up of red, blue, and green
beads (two bracelets are
indistinguishable if the rotation of one
yield another) is,
(A) 243
(B) 81
(C) 51
(D) 47
26. Which are the classifications of data
used in Mobile Applications ?
(A) Private data, User data, Shared
data.
(B) Public data, User data, Virtual
data.
(C) Private data, Public data, Shared
data.
(D) Public data, Virtual data, User
data.
27. In an enhancement of a CPU design,
the speed of a floating point unit has
been increased by 20% and the speed
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
take twice the time taken by the fixed
point operation in original design ?
(A) 1.62
(B) 1.55
(C) 1.85
(D) 1.285
28. The initial basic feasible solution to the
following transportation problem using
Vogel’s approximation method is
D1 D2 D3 D4 Supply
S1 1 2 1 4 30
S2 3 3 2 1 50
S3 4 2 5 9 20
Demand 20 40 30 10
(A) x11 = 20, x13 = 10, x21 = 20,
x23 = 20, x24 = 10, x32 = 10,
Total cost = 180
(B) x11 = 20, x12 = 20, x13 = 10,
x22 = 20, x23 = 20, x24 = 10,
Total cost = 180
(C) x11 = 20, x13 = 10, x22 = 20,
x23 = 20, x24 = 10, x32 = 10,
Total cost = 180
(D) None of the above

29. 58 lamps are to be connected to a single
electric outlet by using an extension
board each of which has four outlets.
The number of extension boards needed
to connect all the light is
(A) 29
(B) 28
(C) 20
(D) 19
30. Match the following with respect to the
Mobile Computing Architecture.
a. Downlink
control
1. 100 Mbps
b. Radio
communication
data rate
2. Residency
latency (RL)
c. The average
duration of user’s
stay in cell
3. Sending data
from a BS to
MD
d. FDDI
bandwidth
4. 2-Mbps
Codes :
a b c d
(A) 2 1 4 3
(B) 3 4 2 1
(C) 4 1 2 1
(D) 4 3 1 2
31. Which of the following flags are set
when ‘JMP’ instruction is executed ?
(A) SF and CF
(B) AF and CF
(C) All flags
(D) No flag is set
32. A thread is a light weight process. In
the above statement, weight refers to
(A) time
(B) number of resources
(C) speed
(D) All the above
33. The Z-buffer algorithm is used for
Hidden surface removal of objects. The
maximum number of objects that can
be handled by this algorithm shall
(A) Depend on the application
(B) be arbitrary no. of objects
(C) Depend on the memory
availability
(D) Depend on the processor
34. The power set of AUB, where
A = {2, 3, 5, 7} and B = {2, 5, 8, 9} is
(A) 256
(B) 64
(C) 16
(D) 4
35. In Win32, which function is used to
create Windows Applications ?
(A) Win APP
(B) Win API
(C) Win Main
(D) Win Void
36. Suppose a processor does not have any
stack pointer registers, which of the
following statements is true ?
(A) It cannot have subroutine call
instruction.
(B) It cannot have nested subroutine
calls.
(C) Interrupts are not possible.
(D) All subroutine calls and
interrupts are possible.
37. Everything below the system call
interface and above the physical
hardware is known as ______.
(A) Kernel
(B) Bus
(C) Shell
(D) Stub

38. Which is not the correct statement ?
(A) The class of regular sets is closed
under homomorphisms.
(B) The class of regular sets is not
closed under inverse
homomorphisms.
(C) The class of regular sets is closed
under quotient.
(D) The class of regular sets is closed
under substitution.
39. When a programming Language has
the capacity to produce new datatype,
it is called as,
(A) Overloaded Language
(B) Extensible Language
(C) Encapsulated Language
(D) Abstraction Language
40. Which of the following operating
system is better for implementing
client-server network ?
(A) Windows 95
(B) Windows 98
(C) Windows 2000
(D) All of these
41. Consider a system having m resources
of the same type. These resources are
shared by 3 processes A, B and C
which have peak demands of 3, 4 and 6
respectively. For what value of m
deadlock will not occur ?
(A) 7
(B) 9
(C) 10
(D) 13
42. The grammar ‘G1’
S  OSO| ISI | 0|1| and the grammar
‘G2’ is
S  as |asb| X, X  Xa | a.
Which is the correct statement ?
(A) G1 is ambiguous, G2 is
unambiguous
(B) G1 is unambiguous, G2 is
ambiguous
(C) Both G1 and G2 are ambiguous
(D) Both G1 and G2 are
unambiguous
43. Consider n processes sharing the CPU
in round robin fashion. Assuming that
each process switch takes s seconds.
What must be the quantum size q such
that the overhead resulting from
process switching is minimized but, at
the same time each process is
guaranteed to get its turn at the CPU at
least every t seconds ?
(A) q 
t – ns
n – 1
(B) q 
t – ns
n – 1
(C) q 
t – ns
n + 1
(D) q 
t – ns
n + 1
44. The Default Parameter Passing
Mechanism is called as
(A) Call by Value
(B) Call by Reference
(C) Call by Address
(D) Call by Name
45. Which of the following regular
expression identities are true ?
(A) (r + s)* = r* s*
(B) (r + s)* = r* + s*
(C) (r + s)* = (r*s*)*
(D) r* s* = r* + s*

46. Two graphs A and B are shown below :
Which one of the following statement
is true ?
(A) Both A and B are planar.
(B) Neither A nor B is planar.
(C) A is planar and B is not.
(D) B is planar and A is not.
47. The minimum number of states of the
non-deterministic finite automation
which accepts the language
{a b a bn|n  0}  {a b an|n  0} is
(A) 3 (B) 4
(C) 5 (D) 6
48. Functions defined with class name are
called as
(A) Inline function
(B) Friend function
(C) Constructor
(D) Static function
49. Let f be the fraction of a computation
(in terms of time) that is parallelizable,
P the number of processors in the
system, and sp the speed up achievable
in comparison with sequential
execution – then the sp can be
calculated using the relation :
(A)
1
1 – f – f/P
(B)
P
P – f(P + 1)
(C)
1
1 – f + f/P
(D)
P
P + f(P – 1)
50. Which of the following definitions
generates the same Language as L,
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
logn elements each. The time
complexity of producing a sorted list of
all these elements is
(use heap data structure)
(A) O (n log logn)
(B)  (n logn)
(C)  (n logn)
(D)  (n3/2)
52. Consider the program below in a
hypothetical programming language
which allows global variables and a
choice of static or dynamic scoping
int i;
program Main( )
{
i = 10;
call f ( );
}
procedure f( )
{
int i = 20;
call g ( );
}
procedure g( )
{
print i;
}
Let x be the value printed under static
scoping and y be the value printed
under dynamic scoping. Then x and y
are
(A) x = 10, y = 20
(B) x = 20, y = 10
(C) x = 20, y = 20
(D) x = 10, y = 10

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 2i–1
(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, maintainability
(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
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

62. A program P calls two subprograms P1
and P2. P1 can fail 50% times and P2
40% times. Then P can fail
(A) 50%
(B) 60%
(C) 10%
(D) 70%
63. Third normal form is based on the
concept of ______.
(A) Closure Dependency
(B) Transitive Dependency
(C) Normal Dependency
(D) Functional Dependency
64. If the Fourier transform of the function
f(x, y) is F(m, n), then the Fourier
transform of the function f(2x, 2y) is :
(A)
14
F   
  
m2
,
n2
(B)
14
F (2m, 2n)
(C)
14
F (m, n)
(D)
14
F   
  
m4
,
n4
65. ______ establishes information about
when, why and by whom changes are
made in a software.
(A) Software Configuration
Management.
(B) Change Control.
(C) Version Control.
(D) An Audit Trail.
66. Match the following with respect to
HTML tags and usage.
a. CITE 1. Italic
representation
b. EM 2. Represents output
from programmes
c. VAR 3. Represents to
other source
d. SAMP 4. Argument to a
programme
Codes :
a b c d
(A) 3 1 4 2
(B) 2 3 1 4
(C) 4 2 3 1
(D) 1 3 4 1
67. An expert system shell is an expert
system without
(A) domain knowledge
(B) explanation facility
(C) reasoning with knowledge
(D) all of the above
68. An example of a dictionary-based
coding technique is
(A) Run-length coding
(B) Huffman coding
(C) Predictive coding
(D) LZW coding
69. Which is the method used to retrieve
the current state of a check box ?
(A) get State ( )
(B) put State ( )
(C) retrieve State ( )
(D) write State ( )

70. Referential integrity is directly related
to
(A) Relation key
(B) Foreign key
(C) Primary key
(D) Candidate key
71. You are given four images represented
as
I1
=   
  
0 0
0 0 , I2 =   
  
0 1
0 0 ,
I3
=   
  
0 1
1 0 , I4 =   
  
1 1
1 0
The value of entropy is maximum for
image
(A) I1
(B) I2
(C) I3
(D) I4
72. A cryptarithmetic problem of the type
SEND
+ MORE
MONEY
Can be solved efficiently using
(A) depth first technique
(B) breadth first technique
(C) constraint satisfaction technique
(D) bidirectional technique
73. Match the following :
a. Supervised
learning
1. The decision
system receives
rewards for its
action at the end
of a sequence of
steps.
b. Unsupervised
learning
2. Manual labels of
inputs are not
used.
c. Reinforcement
learning
3. Manual labels of
inputs are used.
d. Inductive
learning
4. System learns by
example
Codes :
a b c d
(A) 1 2 3 4
(B) 2 3 1 4
(C) 3 2 4 1
(D) 3 2 1 4
74. A* algorithm is guaranteed to find an
optimal solution if
(A) h' is always 0.
(B) g is always 1.
(C) h' never overestimates h.
(D) h' never underestimates h.
75. Let (x, y, z) be the statement “x + y = z”
and let there be two quantifications
given as
(i) x y Z (x, y, z)
(ii) Z x y (x, y, z)
Where x, y, z are real numbers. Then
which one of the following is correct ?
(A) (i) is true and (ii) is true.
(B) (i) is true and (ii) is false.
(C) (i) is false and (ii) is true.
(D) (i) is false and (ii) is false.

Attached Files Available for Download

	UGC NET computer science paper.pdf (240.7 KB, 50 views)
	UGC NET computer science paper-1.pdf (111.3 KB, 80 views)

__________________
Answered By StudyChaCha Member