NTA UGC NET Computer Science and Applications Paper 3 Solved Question Paper 2012 December: To score better marks in the NTA UGC NET Computer Science and Applications, you should have depth knowledge of the entire subject.
You can boost your preparation by referring to NTA UGC NET Computer Science and Applications Paper 3 Solved Question Paper 2012 December. It will give you information about the important chapters and concepts covered in all chapters.
You must have NTA UGC NET Computer Science and Applications Solved Question Papers along with the latest Computer Science and Applications Syllabus to enhance your semester exam preparation.
Here we have provided you with the complete guide on NTA UGC NET Computer Science and Applications Paper 3 Solved Question Paper 2012 December.
NTA UGC NET Computer Science and Applications Paper 3 Solved Question Paper 2012 December
NTA UGC NET Computer Science and Applications Paper 3 Solved Question Papers are the best study materials to score good marks in the Computer Science and Applications exam.
Practicing these NTA UGC NET Computer Science and Applications paper 3 Previous Year Question papers assist the students in getting a clear idea about the question paper pattern and types of questions asked in the exam.
You can check the complete NTA UGC NET Computer Science and Applications Paper 3 Solved Question Paper 2012 December.
1. Eco system is a Frame work for
(A) Building a Computer System
(B) Building Internet Market
(C) Building Offline Market
(D) Building Market
Answer: (B)
2.
Answer: (B)
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
Answer: (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
Answer: (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
Answer: (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.
Answer: (A)
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
Answer: (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
Answer: (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.
Answer: (D)
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
Answer: (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 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
Answer: (A)
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)
Answer: (D)
Answer: (C)
Answer: (C)
15. In classful addressing, an IP address 123.23.156.4 belongs to ______ class format.
(A) A
(B) B
(C) C
(D) D
Answer: (A)
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.
Answer: (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
Answer: (C)
18. In a Linear Programming Problem, suppose there are 3 basic variables and 2 non-basic variables, then the possible numbers of basic solutions are
(A) 6
(B) 8
(C) 10
(D) 12
Answer: (C)
Answer: (C)
Answer: (C)
Answer: (D)
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
Answer: (C)
Answer: (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
Answer: (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
Answer: (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.
Answer: (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
Answer: (A)
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
Answer: (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
Answer: (D)
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
Answer: (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
Answer: (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
Answer: (B)
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
Answer: (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
Answer: (B)
35. In Win32, which function is used to create Windows Applications?
(A) Win APP
(B) Win API
(C) Win Main
(D) Win Void
Answer: (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.
Answer: (D)
37. Everything below the system call interface and above the physical hardware is known as ______.
(A) Kernel
(B) Bus
(C) Shell
(D) Stub
Answer: (A)
38. Which is not the correct statement?
(A) The class of regular sets is closed under homeomorphisms.
(B) The class of regular sets is not closed under inverse homomorphism.
(C) The class of regular sets is closed under quotient.
(D) The class of regular sets is closed under substitution.
Answer: (B)
39. When a programming Language has the capacity to produce new data type, it is called as,
(A) Overloaded Language
(B) Extensible Language
(C) Encapsulated Language
(D) Abstraction Language
Answer: (B)
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
Answer: (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
Answer: (D)
Answer: (B)
Answer: (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
Answer: (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*
Answer: (C)
Answer: (A)
Answer: (C)
48. Functions defined with class name are called as
(A) Inline function
(B) Friend function
(C) Constructor
(D) Static function
Answer: (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 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)]
Answer: (C)
Answer: (B)
Answer: (A)
52. Consider the program below in a hypothetical programming language which allows global variables and achoice 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
Answer: (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 2i+1
(B) No greater than 2i
(C) No greater than 2i–1
(D) No greater than i
Answer: (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.
Answer: (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
Answer: (D)
Answer: (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)
Answer: (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.
Answer: (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
Answer: (A)
60. The transform which possesses the “multi-resolution” property is
(A) Fourier transforms
(B) Short-time-Fourier transforms
(C) Wavelet transforms
(D) Karhunen-Loere transforms
Answer: (C)
61. Which one is a collection of templates and rules?
(A) XML
(B) CSS
(C) DHTML
(D) XSL
Answer: (D)
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%
Answer: (D)
63. Third normal form is based on the concept of ______.
(A) Closure Dependency
(B) Transitive Dependency
(C) Normal Dependency
(D) Functional Dependency
Answer: (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:
(A) 1/4 F(m/2 , n/2)
(B) 1/4 F (2m, 2n)
(C)1/4 F (m, n)
(D) 1/4 F (m/4 ,n/4)
Answer: (A)
65. ______ establishes information about when, why and by whom changes are made in software.
(A) Software Configuration Management.
(B) Change Control.
(C) Version Control.
(D) An Audit Trail.
Answer: (D)
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
Answer: (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
Answer: (A)
68. An example of a dictionary-based coding technique is
(A) Run-length coding
(B) Huffman coding
(C) Predictive coding
(D) LZW coding
Answer: (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 ( )
Answer: (A)
70. Referential integrity is directly related to
(A) Relation key
(B) Foreign key
(C) Primary key
(D) Candidate key
Answer: (B)
Answer: (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
Answer: (C)
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
Answer: (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.
Answer: (C)
Answer: (B)
Year Wise Solved UGC NET Computer Science and Applications Paper 3 Previous Year Question Papers
The old UGC NET Examination paper-3 in Computer Science and Applications was of descriptive type till December 2011.
paper-3 becomes objective type from June 2012 to November 2017. From July 2018 onward, paper-3 was stopped and becomes part of paper-2 itself.
So, the old questions for paper-3 from June 2012 to November 2017 which were of objective type (multiple choice questions) can be used by the UGC NET aspirants for their better preparation for paper 2.
Year Wise NTA UGC NET Computer Science and Applications Paper 3 Solved Question Papers are given below.
| Download Year Wise NTA UGC NET Computer Science and Applications paper 3 Solved Paper |
| UGC NET Computer Science and Applications Paper 3 Solved Question Paper 2017 November |
| UGC NET Computer Science and Applications Paper 3 Solved Question Paper 2016 July |
| UGC NET Computer Science and Applications Paper 3 Solved Question Paper 2015 June |
| UGC NET Computer Science and Applications Paper 3 Solved Question Paper 2015 December |
| UGC NET Computer Science and Applications Paper 3 Solved Question Paper 2014 June |
| UGC NET Computer Science and Applications Paper 3 Solved Question Paper 2014 December |
| UGC NET Computer Science and Applications Paper 3 Solved Question Paper 2013 December |
| UGC NET Computer Science and Applications Paper 3 Solved Question Paper 2013 September |
| UGC NET Computer Science and Applications Paper 3 Solved Question Paper 2013 June |
| UGC NET Computer Science and Applications Paper 3 Solved Question Paper 2012 December |
| UGC NET Computer Science and Applications Paper 3 Solved Question Paper 2012 June |
We have covered the NTA UGC NET Computer Science and Applications Paper 3 Solved Question Paper 2012 December.
If you have any questions about NTA UGC NET Computer Science and Applications Paper 3 Solved Question Papers, please let us know in the comment section.