NTA UGC NET Computer Science and Applications Paper 2 Solved Question Paper 2013 December

Looking for NTA UGC NET Computer Science and Applications Paper 2 Solved Question Paper 2013 December? Here get Paper 2 Solved Question Paper 2013.

NTA UGC NET Computer Science and Applications Paper 2 Solved Question Paper 2013 DecemberNTA UGC NET Computer Science and Applications Paper 2 Solved Question Paper 2013 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 Question Paper 2 2013 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 provide you the complete guide on NTA UGC NET Computer Science and Applications Paper 2 Solved Question Paper 2013 December.

NTA UGC NET Computer Science and Applications Paper 2 Solved Question Paper 2013 December

NTA UGC NET Computer Science and Applications 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 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 2 Solved Question Paper 2013 December.


1. When data and acknowledgement are sent in the same frame, this is called as

(A) Piggy packing

(B) Piggy backing

(C) Back packing

(D) Good packing

Answer: (B)

 

2. Encryption and Decryption is the responsibility of _______ Layer.

(A) Physical

(B) Network

(C) Application

(D) Datalink

Answer: (C)

 

3. An analog signal carries 4 bits in each signal unit. If 1000 signal units are sent per second, then baud rate and bit rate of the signal are _______ and _______.

(A) 4000 bauds \ sec & 1000 bps

(B) 2000 bauds \ sec & 1000 bps

(C) 1000 bauds \ sec & 500 bps

(D) 1000 bauds \ sec & 4000 bps

Answer: (D)

 

4. The VLF and LF bauds use _______ propagation for communication.

(A) Ground

(B) Sky

(C) Line of sight

(D) Space

Answer: (A)

 

5. Using the RSA public key crypto system, if p = 13, q = 31 and d = 7, then the value of e is

(A) 101

(B) 103

(C) 105

(D) 107

Answer: (B)

 

6. FAN IN of a component A is defined as

(A) Number of components that can call or pass control to component A.

(B) Number of components that are called by component A.

(C) Number of components related to component A.

(D) Number of components dependent on component A.

Answer: (A)

 

7. The relationship of data elements in a module is called

(A) Coupling

(B) Modularity

(C) Cohesion

(D) Granularity

Answer: (C)

 

8. Software Configuration Management is the discipline for systematically controlling

(A) the changes due to the evolution of work products as the project proceeds.

(B) the changes due to defects (bugs) being found and then fixed. 

(C) the changes due to requirement changes

(D) all of the above

Answer: (D)

                       

9. Which one of the following is not a step of requirement engineering?

(A) Requirement elicitation

(B) Requirement analysis

(C) Requirement design

(D) Requirement documentation

Answer: (C)

 

10. Testing of software with actual data and in actual environment is called

(A) Alpha testing

(B) Beta testing

(C) Regression testing

(D) None of the above

Answer: (B)

 

11. The student marks should not be greater than 100. This is

(A) Integrity constraint

(B) Referential constraint

(C) Over-defined constraint

(D) Feasible constraint

Answer: (A)

 

12. GO BOTTOM and SKIP-3 commands are given one after another in a database file of 30 records. It shifts the control to

(A) 28th record

(B) 27th record

(C) 3rd record

(D) 4th record

Answer: (A)

 

13. An ER Model includes

I. An ER diagram portraying entity types.

II. Attributes for each entity type

III. Relationships among entity types.

IV. Semantic integrity constraints that reflects the business rules about data not captured in the ER diagram.

(A) I, II, III & IV

(B) I & IV

(C) I, II & IV 

(D) I & III

Answer: (A)

 

14. Based on the cardinality ratio and participation ________ associated with a relationship type, choose either the Foreign Key Design, the Cross Referencing Design or Mutual Referencing Design.

(A) Entity

(B) Constraints

(C) Rules

(D) Keys

Answer: (B)

 

15. Data Integrity control uses _______

(A) Upper and lower limits on numeric data.

(B) Passwords to prohibit unauthorised access to files.

(C) Data dictionary to keep the data

(D) Data dictionary to find last access of data

Answer: (B)

 

16. What does the following declaration mean?

int (*ptr) [10];

(A) ptr is an array of pointers of 10 integers.

(B) ptr is a pointer to an array of 10 integers.

(C) ptr is an array of 10 integers.

(D) none of the above.

Answer: (B)

 

17. Which of the following has compilation error in C?

(A) int n = 32 ;

(B) char ch = 65 ;

(C) float f = (float) 3.2 ;

(D) none of the above

Answer: (D)

 

18. Which of the following operators cannot be overloaded in C+ +?

(A) 

(B) + =

(C) = =

(D) : :

Answer: (D)

 

19. _________ allows to create classes which are derived from other classes, so that they automatically include some of its “parent’s” members, plus its own members.

(A) Overloading

(B) Inheritance

(C) Polymorphism

(D) Encapsulation

Answer: (B)

 

20. The correct way to round off a floating number x to an integer value is

(A) y = (int) (x + 0.5)

(B) y = int (x + 0.5)

(C) y = (int) x + 0.5

(D) y = (int) ((int)x + 0.5)

 

Answer: (A)

 

21. What is the value of the postfix expression?

a b c d + –  (where a = 8, b = 4, c = 2 and d = 5)

(A) –3/8

(B) –8/3

(C) 24

(D) –24

Answer: (D)

 

22. If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue?

(A) Neither of the pointers change

(B) Only front pointer changes

(C) Only rear pointer changes

(D) Both of the pointers changes

Answer: (C)

 

23. _______ is often used to prove the correctness of a recursive function.

(A) Diagonalization

(B) Communitivity

(C) Mathematical Induction

(D) Matrix Multiplication

Answer: (C)

 

24. For any B-tree of minimum degree t ≥ 2, every node other than the root must have atleast ________ keys and every node can have at most ________ keys.

(A) t – 1, 2t + 1

(B) t + 1, 2t + 1

(C) t – 1, 2t – 1

(D) t + 1, 2t – 1

Answer: (C)

 

25. Given two sorted list of size ‘m’ and ‘n’ respectively. The number of comparison needed in the worst case by the merge sort algorithm will be

(A) m × n

(B) max (m, n)

(C) min (m, n)

(D) m + n – 1

Answer: (D)

 

26. Given the following statements:

S1: SLR uses follow information to guide reductions. In case of LR and LALR parsers, the look-aheads are associated with the items and they make use of the left context available to the parser.

S2: LR grammar is a larger subclass of context free grammar as compared to that SLR and LALR grammars.

Which of the following is true?

(A) S1 is not correct and S2 is not correct.

(B) S1 is not correct and S2 is correct.

(C) S1 is correct and S2 is not correct.

(D) S1 is correct and S2 is correct.

Answer: (D)

 

27. The context free grammar for the language

L = {an bm | n ≤ m + 3, n ≥ 0, m ≥ 0} is

(A) S → aaa A; A → aAb | B, B → Bb | λ

(B) S → aaaA|λ, A → aAb | B, B → Bb | λ

(C) S → aaaA | aa A | λ, A → aAb | B, B → Bb| λ

(D) S → aaaA | aa A | aA | λ, A → aAb | B, B → Bb | λ

Answer: (D)

 

28. Given the following statements:

S1: If L is a regular language then the language {uv | u  L, v  LR} is also regular.

S2: L = {wwR} is regular language.

Which of the following is true?

(A) S1 is not correct and S2 is not correct.

(B) S1 is not correct and S2 is correct.

(C) S1 is correct and S2 is not correct.

(D) S1 is correct and S2 is correct.

Answer: (C)

 

29. The process of assigning load addresses to the various parts of the program and adjusting the code and data in the program to reflect the assigned addresses is called _______.

(A) Symbol resolution

(B) Parsing

(C) Assembly

(D) Relocation

Answer: (D)

 

30. Which of the following derivations does a top-down parser use while parsing an input string? The input is scanned from left to right.

(A) Leftmost derivation

(B) Leftmost derivation traced out in reverse

(C) Rightmost derivation traced out in reverse

(D) Rightmost derivation

Answer: (A)

 

31. The dual of a Boolean expression is obtained by interchanging

(A) Boolean sums and Boolean products

(B) Boolean sums and Boolean products or interchanging 0’s and 1’s

(C) Boolean sums and Boolean products and interchanging 0’s & 1’s

(D) Interchanging 0’s and 1’s

Answer: (C)

 

32. Given that (292)10 = (1204)x in some number system x. The base x of that number system is

(A) 2

(B) 8

(C) 10

(D) None of the above

Answer: (D)

 

33.

NTA UGC NET Computer Science and Applications Paper 2 Solved Question Paper 2013 December qn 33


Answer: (D)

 

34. Let P(m, n) be the statement

“m divides n” where the universe of discourse for both the variables is the set of positive integers. Determine the truth values of each of the following propositions:

I. n P(m, n),

II. n P(m, n)

(A) Both I and II are true

(B) Both I and II are false

(C) I – false & II – true

(D) I – true & II – false

Answer: (C)

 

35. Big – O estimate for

f(x) = (x + 1) log(x2 + 1) + 3x2 is given as

(A) O(x log x)

(B) O(x2)

(C) O(x3)

(D) O(x2 log x)

Answer: (B)

 

36. How many edges are there in a forest of t-trees containing a total of n vertices?

(A) n + t

(B) n – t

(C) n  t

(D) nt

Answer: (B)

 

37. Let f and g be the functions from the set of integers to the set integers defined by

f(x) = 2x + 3 and g(x) = 3x + 2

Then the composition of f and g and g and f is given as

(A) 6x + 7, 6x + 11

(B) 6x + 11, 6x + 7

(C) 5x + 5, 5x + 5

(D) None of the above

Answer: (A)

 

38. If n and r are non-negative integers and n ≥ r, then p(n + 1, r) equals to

(A)

(B)

(C)

(D)

Answer: (A)

 

39. A graph is non-planar if and only if it contains a subgraph homomorphic to

(A) K3, 2 or K5

(B) K 3, 3 and K6

(C) K 3, 3 or K5

(D) K2, 3 and K5

Answer: (C)

 

40. Which of the following statements are true?

I. A circuit that adds two bits, producing a sum bit and a carry bit is called half adder.

II. A circuit that adds two bits, producing a sum bit and a carry bit is called full adder.

III. A circuit that adds two bits and a carry bit producing a sum bit and a carry bit is called full adder.

IV. A device that accepts the value of a Boolean variable as input and produces its complement is called an inverter.

(A) I & II

(B) II & III

(C) I, II, III

(D) I, III & IV

Answer: (D)

 

41. Active X controls are Pentium binary programs that can be embedded in ________

(A) Word pages

(B) URL pages

(C) Script pages

(D) Web pages

Answer: (D)

 

42. Match the following:

List – I                                                                        List – II

a. Wireless Application Environment                         i. HTTP

b. Wireless Transaction Protocol                                 ii. IP

c. Wireless Datagram Protocol                                    iii. Scripts

d. Wireless                                                                  iv. UDP

Codes:

       a b c d

(A) ii iv i iii

(B) iv iii ii i

(C) iv iii i ii

(D) iii i iv ii

Answer: (D)

 

43. Which of the following is widely used inside the telephone system for long-haul data traffic?

(A) ISDN

(B) ATM

(C) Frame Relay

(D) ISTN

Answer: (B)

 

44. The document standards for EDI were first developed by large business house during the 1970s and are now under the control of the following standard organisation:

(A) ISO

(B) ANSI

(C) ITU-T

(D) IEEE

Answer: (B)

 

45. Electronic Data Interchange Software consists of the following four layers:

(A) Business application, Internal format conversion, Network translator, EDI envelope

(B) Business application, Internal format conversion, EDI translator, EDI envelope

(C) Application layer, Transport layer, EDI translator, EDI envelope

(D) Application layer, Transport layer, IP layer, EDI envelope

Answer: (B)

 

46. Consider a pre-emptive priority based scheduling algorithm based on dynamically changing priority. Larger priority number implies higher priority. When the process is waiting for CPU in the ready queue (but not yet started execution), its priority changes at a rate a = 2. When it starts running, its priority changes at a rate b = 1. All the processes are assigned priority value 0 when they enter ready queue. Assume that the following processes want to execute:

Process ID                   Arrival Time                            Service Time

P1                                            0                                              4

P2                                            1                                              1

P3                                            2                                              2

P4                                            3                                              1

The time quantum q = 1. When two processes want to join ready queue simultaneously, the process which has not executed recently is given priority. The finish time of processes P1, P2, P3 and P4 will respectively be

(A) 4, 5, 7 and 8

(B) 8, 2, 7 and 5

(C) 2, 5, 7 and 8

(D) 8, 2, 5 and 7

Answer: (B)

 

47. The virtual address generated by a CPU is 32 bits. The Translation Look-aside Buffer (TLB) can hold total 64 page table entries and a 4-way set associative (i.e. with 4-cache lines in the set). The page size is 4 KB. The minimum size of TLB tag is

(A) 12 bits

(B) 15 bits

(C) 16 bits

(D) 20 bits

Answer: (C)

 

48. Consider a disk queue with request for input/output to block on cylinders

98, 183, 37, 122, 14, 124, 65, 67

in that order. Assume that disk head is initially positioned at cylinder 53 and moving towards cylinder number 0. The total number of head movements using Shortest Seek Time First (SSTF) and SCAN algorithms are respectively

(A) 236 and 252 cylinders

(B) 640 and 236 cylinders

(C) 235 and 640 cylinders

(D) 235 and 252 cylinders

Answer: (A)

 

49. How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size?

(A) 332.8 KB

(B) 83.6 KB

(C) 266.2 KB

(D) 256.6 KB

Answer: (A)

 

50. Linux operating system uses

(A) Affinity Scheduling

(B) Fair Preemptive Scheduling

(C) Hand Shaking

(D) Highest Penalty Ratio Next

 

Answer: (B)


 

Year Wise UGC NET Previous Year Question Papers Solved Computer Science and Applications

Year Wise NTA UGC NET Computer Science and Applications Solved question Papers from June 2006 till today are given below.

Download Year Wise NTA UGC NET Computer Science and Applications Paper 2 Solved Paper
UGC NET Computer Science and Applications Paper 2 Question Paper 2020 June
UGC NET Computer Science and Applications Paper 2 Question Paper 2019 December
UGC NET Computer Science and Applications Paper 2 Question Paper 2019 June
UGC NET Computer Science and Applications Paper 2 Question Paper 2018 December
UGC NET Computer Science and Applications Paper 2 Question Paper 2018 July
UGC NET Computer Science and Applications Paper 2 Question Paper 2017 November
UGC NET Computer Science and Applications Paper 2 Question Paper 2016 July
UGC NET Computer Science and Applications Paper 2 Question Paper 2015 June
UGC NET Computer Science and Applications Paper 2 Question Paper 2015 December
UGC NET Computer Science and Applications Paper 2 Question Paper 2014 June
UGC NET Computer Science and Applications Paper 2 Question Paper 2014 December
UGC NET Computer Science and Applications Paper 2 Solved Question Paper 2013 December
UGC NET Computer Science and Applications Paper 2 Solved Question Paper 2013 September
UGC NET Computer Science and Applications Paper 2 Solved Question Paper 2013 June
UGC NET Computer Science and Applications Paper 2 Solved Question Paper 2012 December
UGC NET Computer Science and Applications Paper 2 Solved Question Paper 2012 June
UGC NET Computer Science and Applications Paper 2 Question Paper 2011 June
UGC NET Computer Science and Applications Paper 2 Question Paper 2011 December
UGC NET Computer Science and Applications Paper 2 Question Paper 2010 June
UGC NET Computer Science and Applications Paper 2 Question Paper 2010 December
UGC NET Computer Science and Applications Paper 2 Question Paper 2009 June
UGC NET Computer Science and Applications Paper 2 Question Paper 2009 December
UGC NET Computer Science and Applications Paper 2 Question Paper 2008 June
UGC NET Computer Science and Applications Paper 2 Question Paper 2008 December
UGC NET Computer Science and Applications Paper 2 Question Paper 2007 June
UGC NET Computer Science and Applications Paper 2 Question Paper 2007 December
UGC NET Computer Science and Applications Paper 2 Question Paper 2006 June
UGC NET Computer Science and Applications Paper 2 Question Paper 2006 December
UGC NET Computer Science and Applications Paper 2 Question Paper 2005 June
UGC NET Computer Science and Applications Paper 2 Question Paper 2005 December
UGC NET Computer Science and Applications Paper 2 Question Paper 2004 December

We have covered the NTA UGC NET Computer Science and Applications Paper 2 Solved Question Paper 2013 December.

If you have any questions about NTA UGC NET Computer Science and Applications Solved Question Papers, please let us know in the comment section.

COMMENTS

Name

NTA UGC NET Adult Education Solved Question Papers,10,NTA UGC NET Anthropology Solved Question Papers,10,NTA UGC NET Arab Culture and Islamic Studies Solved Question Papers,10,NTA UGC NET Archaeology Solved Question Papers,10,NTA UGC NET Commerce Solved Question Papers,10,NTA UGC NET Comparative Literature Solved Question Papers,10,NTA UGC NET Comparative Study of Religions Solved Question Papers,10,NTA UGC NET Computer Science and Applications Solved Question Papers,10,NTA UGC NET Criminology Solved Question Papers,10,NTA UGC NET Defence and Strategic Studies Solved Question Papers,10,NTA UGC NET Economics Solved Question Papers,10,NTA UGC NET Education Solved Question Papers,10,NTA UGC NET Electronic Science Solved Question Papers,10,NTA UGC NET English Solved Question Papers,10,NTA UGC NET Environmental Sciences Solved Question Papers,10,NTA UGC NET Folk Literature Solved Question Papers,8,NTA UGC NET Forensic Science Solved Question Papers,10,NTA UGC NET Geography Solved Question Papers,10,NTA UGC NET History Solved Question Papers,10,NTA UGC NET Home Science Solved Question Papers,10,NTA UGC NET Human Rights and Duties Solved Question Papers,10,NTA UGC NET Indian Culture Solved Question Papers,10,NTA UGC NET International and Area Studies Solved Question Papers,10,NTA UGC NET Labour Welfare Solved Question Papers,10,NTA UGC NET Law Solved Question Papers,10,NTA UGC NET Library and Information Science Solved Question Papers,40,NTA UGC NET Linguistics Solved Question Papers,9,NTA UGC NET Management Solved Question Papers,10,NTA UGC NET Mass Communication and Journalism Solved Question Papers,10,NTA UGC NET Museology and Conservation Solved Question Papers,10,NTA UGC NET Music Solved Question Papers,10,NTA UGC NET Paper 1 Solved Question Papers,30,NTA UGC NET Performing Arts Solved Question Papers,10,NTA UGC NET Philosophy Solved Question Papers,10,NTA UGC NET Physical Education Solved Question Papers,10,NTA UGC NET Political Science Solved Question Papers,10,NTA UGC NET Population Studies Solved Question Papers,10,NTA UGC NET Psychology Solved Question Papers,10,NTA UGC NET Public Administration Solved Question Papers,10,NTA UGC NET Social Medicine and Community Health Solved Question Papers,10,NTA UGC NET Social Work Solved Question Papers,10,NTA UGC NET Sociology Solved Question Papers,10,NTA UGC NET Tourism Administration and Management Solved Question Papers,10,NTA UGC NET Tribal and Regional Languages Solved Question Papers,8,NTA UGC NET Visual Art Solved Question Papers,10,NTA UGC NET Women Studies Solved Question Papers,10,UGC NET Answer Key,82,UGC NET Books,82,UGC NET Exam,99,UGC NET Question Papers With Solutions,83,UGC NET Subjects,1,UGC NET Syllabus,82,Year Wise Solved NTA UGC NET Question Papers,82,
ltr
item
My Exam Notification - Free UGC NET Guide: NTA UGC NET Computer Science and Applications Paper 2 Solved Question Paper 2013 December
NTA UGC NET Computer Science and Applications Paper 2 Solved Question Paper 2013 December
Looking for NTA UGC NET Computer Science and Applications Paper 2 Solved Question Paper 2013 December? Here get Paper 2 Solved Question Paper 2013.
https://blogger.googleusercontent.com/img/a/AVvXsEgdSKB0Kz6M9MKdyvofH32q_zWI0Z04mdFkk-CFPBniZ0fC7wUnqAyfvCdy4C0o4z5Y8jbhh251uPbdCnZ3oFsL-tvnsNbaFrIUYLKFbTdIKxZjlp50P3C_7R9KFrFlropdNLl5KZjTyBqgtnHKV3FD9GxMt_Q8IkwB43HrudmiT5Yykfz4RH4e2AYWew=w320-h192
https://blogger.googleusercontent.com/img/a/AVvXsEgdSKB0Kz6M9MKdyvofH32q_zWI0Z04mdFkk-CFPBniZ0fC7wUnqAyfvCdy4C0o4z5Y8jbhh251uPbdCnZ3oFsL-tvnsNbaFrIUYLKFbTdIKxZjlp50P3C_7R9KFrFlropdNLl5KZjTyBqgtnHKV3FD9GxMt_Q8IkwB43HrudmiT5Yykfz4RH4e2AYWew=s72-w320-c-h192
My Exam Notification - Free UGC NET Guide
https://www.myexamnotification.com/2022/05/nta-ugc-net-computer-science-and-applications-paper-2-solved-question-paper-2013-december.html
https://www.myexamnotification.com/
https://www.myexamnotification.com/
https://www.myexamnotification.com/2022/05/nta-ugc-net-computer-science-and-applications-paper-2-solved-question-paper-2013-december.html
true
354141229938201693
UTF-8
Loaded All Posts Not found any posts VIEW ALL Readmore Reply Cancel reply Delete By Home PAGES POSTS View All RECOMMENDED FOR YOU LABEL ARCHIVE SEARCH ALL POSTS Not found any post match with your request Back Home Sunday Monday Tuesday Wednesday Thursday Friday Saturday Sun Mon Tue Wed Thu Fri Sat January February March April May June July August September October November December Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec just now 1 minute ago $$1$$ minutes ago 1 hour ago $$1$$ hours ago Yesterday $$1$$ days ago $$1$$ weeks ago more than 5 weeks ago Followers Follow THIS PREMIUM CONTENT IS LOCKED STEP 1: Share to a social network STEP 2: Click the link on your social network Copy All Code Select All Code All codes were copied to your clipboard Can not copy the codes / texts, please press [CTRL]+[C] (or CMD+C with Mac) to copy Table of Content