UGC NET Previous Year Papers
COMPUTER SCIENCE AND APPLICATIONS
Paper III – December 2012
1. Eco system is a Frame work for
(A) Building a Computer System
(B) Building Internet Market
(C) Building Offline Market
(D) Building Market
Ans: (B)
2. The efficiency (E) and speed up (sp) for Multiprocessor with p processors satisfies :
(A) E≤p and s_{p}≤p
(B) E≤1 and s_{p}≤p
(C) E≤p and s_{p}≤1
(D) E≤1 and s_{p}≤1
Ans: (B)
3. Match the following :
List – I 
List – II 
a. Critical region b. Wait/signal c. Working set d. Dead lock 
1. Hoares Monitor 2. Mutual exclusion 3. Principal of locality 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
Ans: (A)
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
Ans: (B)
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
Ans: (C)
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.
Ans: (A)
7. Which of the following features will characterize an OS as multiprogrammed 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
Ans: (D)
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
Ans: (D)
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.
Ans: (D)
10. Match the following :
List – I 
List – II 
a. Application layer b. Transport layer c. Network layer d. Data link layer 
1. TCP 2. HDLC 3. HTTP 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
Ans: (C)
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 b. Kruskals algorithm c. Floyd Warshall algorithm d. Topological sorting 
1. O (m log n) 2. O (n^{3}) 3. O(mn) 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
Ans: (A)
12. Let V_{1} = 2I – J + K and V_{2} = I + J – K, then the angle between V_{1} & V_{2} and a vector perpendicular to both V_{1} & V_{2} 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)
Ans: (D)
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) { }
Ans: (C)
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(log_{2}n)
(C) T(n)=O(n)
(D) T(n)=O(n^{2})
Ans: (C)
15. In classful addressing, an IP address 123.23.156.4 belongs to …………. class format.
(A) A
(B) B
(C) C
(D) D
Ans: (A)
16. The Mandelbrot set used for the construction of beautiful images is based on the following transformation :
x_{n+1}=x^{2}_{n}+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.
Ans: (B)
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
Ans: (C)
18. In a Linear Programming Problem, suppose there are 3 basic variables and 2 nonbasic variables, then the possible number of basic solutions are
(A) 6
(B) 8
(C) 10
(D) 12
Ans: (C)
19. Identify the following activation function :
(A) Step function
(B) Ramp function
(C) Sigmoid function
(D) Gaussian function
Ans: (C)
20. The no. of ways to distribute n distinguishable objects into k distinguishable boxes, so that n_{i} objects are placed into box i, i = 1, 2, …. k equals which of the following ?
Ans: (C)
21. How many solutions do the following equation have
x_{1}+x_{2}+x_{3}=11
where x_{1}≥1, x_{2}≥2, x_{3}≥3
(A) C(7, 11)
(B) C(11, 3)
(C) C(14, 11)
(D) C(7, 5)
Ans: (D)
22. Which provides an interface to the TCP/IP suit protocols in Windows95 and Windows NT ?
(A) FTP ActiveX Control
(B) TCP/IP ActiveX Control
(C) Calinsock ActiveX Control
(D) HTML ActiveX Control
Ans: (C)
23. What are the final values of Q_{1} and Q_{0 }after 4 clock cycles, if initial values are 00 in the sequential circuit shown below :
(A) 11
(B) 10
(C) 01
(D) 00
Ans: (D)
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
Ans: (A)
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
Ans: (C)
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.
Ans: (C)
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
Ans: (A)
28. The initial basic feasible solution to the following transportation problem using Vogel’s approximation method is

D_{1} 
D_{2} 
D_{3} 
D_{4} 
Supply 
S_{1} 
1 
2 
1 
4 
30 
S_{2} 
3 
3 
2 
1 
50 
S_{3} 
4 
2 
5 
9 
20 
Demand 
20 
40 
30 
10 
(A) x_{11}=20, x_{13}=10, x_{21}=20,
x_{23}=20, x_{24}=10, x_{32}=10,
Total cost=180
(B) x_{11}=20, x_{12}=20, x_{13}=10,
x_{22}=20, x_{23}=20, x_{24}=10,
Total cost=180
(C) x_{11}=20, x_{13}=10, x_{22}=20,
x_{23}=20, x_{24}=10, x_{32}=10,
Total cost=180
(D) None of the above
Ans: (C)
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
Ans: (D)
30. Match the following with respect to the Mobile Computing Architecture.
a. Downlink control b. Radio communication data rate c. The average duration of user’s stay in cell d. FDDI bandwidth 
1. 100 Mbps 2. Residency latency (RL) 3. Sending data from a BS to MD 4. 2Mbps 
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
Ans: (B)
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
Ans: (D)
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
Ans: (B)
33. The Zbuffer 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
Ans: (B)
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
Ans: (B)
35. In Win32, which function is used to create Windows Applications ?
(A) Win APP
(B) Win API
(C) Win Main
(D) Win Void
Ans: (C)
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.
Ans: (D)
37. Everything below the system call interface and above the physical hardware is known as ………….
(A) Kernel
(B) Bus
(C) Shell
(D) Stub
Ans: (A)
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.
Ans: (B)
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
Ans: (B)
40. Which of the following operating system is better for implementing clientserver network?
(A) Windows 95
(B) Windows 98
(C) Windows 2000
(D) All of these
Ans: (C)
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
Ans: (D)
42. The grammar ‘G1’
S→OSOISI01ϵ and the grammar
‘G2’ is
S→asasbX, X→Xaa.
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
Ans: (B)
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 ?
Ans: (B)
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
Ans: (A)
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*
Ans: (C)
46. Two graphs A and B are shown below :
Which one of the following statement is true ?
(B) Neither A nor B is planar.
(C) A is planar and B is not.
(D) B is planar and A is not.
Ans: (A)
47. The minimum number of states of the nondeterministic finite automation which accepts the language
{a b a b^{n}n ≥ 0} U {a b a^{n}n ≥ 0} is
(A) 3
(B) 4
(C) 5
(D) 6
Ans: (C)
48. Functions defined with class name are called as
(A) Inline function
(B) Friend function
(C) Constructor
(D) Static function
Ans: (C)
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 s_{p} the speed up achievable in comparison with sequential execution – then the s_{p} can be calculated using the relation :
Ans: (C)
50. Which of the following definitions generates the same Language as L,
where L={WW^{R}Wϵ{a,b}*}
(A) S→asbbsaϵ
(B) S→asabsbϵ
(C) S→asbbsaasabsbϵ
(D) S→asbbsaasabsb
Ans: (B)
51. Suppose there are log_{n} sorted lists of n log_{n} elements each. The time complexity of producing a sorted list of all these elements is (use heap data structure)
(A) O(n log log_{n})
(B) θ(n log_{n})
(C) Ω(n log_{n})
(D) Ω(n^{3/2})
Ans: (A)
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
Ans: (D)
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 2^{i+1}
(B) no greater than 2^{i}
(C) no greater than 2^{i–1}
(D) no greater than i
Ans: (C)
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.
Ans: (B)
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
Ans: (D)
56. If a relation with a Schema R is decomposed into two relations R_{1} and R_{2} such that (R_{1}∪R_{2})=R_{1} then which one of the following is to be satisfied for a lossless joint decomposition (→ indicates functional dependency)
(A) (R_{1}∩R_{2})→R_{1} or R_{1}∩R_{2}→R_{2}
(B) R_{1}∩R_{2}→R_{1}
(C) R_{1}∩R_{2}→R_{2}
(D) R_{1}∩R_{2}→R_{1} and R_{1}∩R_{2}→R_{2}
Ans: (A)
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)
Ans: (B)
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.
Ans: (C)
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
Ans: (A)
60. The transform which possesses the “multiresolution” property is
(A) Fourier transform
(B) ShorttimeFourier transform
(C) Wavelet transform
(D) KarhunenLoere transform
Ans: (C)
61. Which one is a collection of templates and rules ?
(A) XML
(B) CSS
(C) DHTML
(D) XSL
Ans: (D)
62. A program P calls two subprograms P_{1} and P_{2}. P_{1} can fail 50% times and P_{2 }40% times. Then P can fail
(A) 50%
(B) 60%
(C) 10%
(D) 70%
Ans: (D)
63. Third normal form is based on the concept of ………….
(A) Closure Dependency
(B) Transitive Dependency
(C) Normal Dependency
(D) Functional Dependency
Ans: (B)
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 :
Ans: (A)
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.
Ans: (D)
66. Match the following with respect to HTML tags and usage.
a. CITE b. EM c. VAR d. SAMP 
1. Italic representation 2. Represents output from programmes 3. Represents to other source 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
Ans: (A)
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
Ans: (A)
68. An example of a dictionarybased coding technique is
(A) Runlength coding
(B) Huffman coding
(C) Predictive coding
(D) LZW coding
Ans: (D)
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()
Ans: (A)
70. Referential integrity is directly related to
(A) Relation key
(B) Foreign key
(C) Primary key
(D) Candidate key
Ans: (B)
71. You are given four images represented as
The value of entropy is maximum for image
(A) I_{1}
(B) I_{2}
(C) I_{3}
(D) I_{4}
Ans: (C)
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
Ans: (C)
73. Match the following :
a. Supervised learning b. Unsupervised learning c. Reinforcement learning d. Inductive learning 
1. The decision system receives rewards for its action at the end of a sequence of steps. 2. Manual labels of inputs are not used. 3. Manual labels of inputs are used. 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
Ans: (D)
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.
Ans: (C)
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.
Ans: (B)
———————————