University Grants Commission NET Computer Science & Applications Model Question Paper : ugcnetonline.in

Name of the Organization : University Grants Commission
Type of the Exam : UGC National Eligibility Test NET
Subject : Computer Science and Applications
Year : 2014
Document Type : Model Question Paper

Website : http://www.ugcnetonline.in/question_papers_june2014.php
Download Model Question Paper :
Paper – II : https://www.pdfquestion.in/uploads/13012-ComputerII.pdf
Paper – III : https://www.pdfquestion.in/uploads/13012-ComputerIII.pdf

NET Computer Science & Applications Question Paper

Download Question Paper of UGC National Eligibility Test NET Computer Science and Applications Sample Question Paper is now available in the official website of University Grants Commission.

Related : University Grants Commission NET Forensic Science Model Question Paper : www.pdfquestion.in/13009.html

Instructions

Note :
** This paper contains fifty (50) objective type questions of two (2) marks each.
** All questions are compulsory

Model Questions

1. Infrared signals can be used for short range communication in a closed area using _______ propagation.
(A) ground
(B) sky
(C) line of sight
(D) space

2. A bridge has access to _______ address in the same network.
(A) Physical
(B) Network
(C) Datalink
(D) Application

3. The minimum frame length for 10 Mbps Ethernet is _______ bytes and maximum is _______ bytes.
(A) 64 & 128
(B) 128 & 1518
(C) 1518 & 3036
(D) 64 & 1518

4. The bit rate of a signal is 3000 bps. If each signal unit carries 6 bits, the baud rate of the signal is _______.
(A) 500 baud/sec
(B) 1000 baud/sec
(C) 3000 baud/sec
(D) 18000 baud/sec.

5. Match the following :
List – I List – II
a. Physical layer i. Allow resources to network access
b. Datalink layer ii. Move packets from one destination to other
c. Network layer iii. Process to process message delivery
d. Transport layer iv. Transmission of bit stream
e. Application Layer v. Formation of frames
Codes :
a b c d e
(A) iv v ii iii i
(B) v iv i ii iii
(C) i iii ii v iv
(D) i ii iv iii v

6. A grammar G is LL(1) if and only if the following conditions hold for two distinct productions A ® a | b
I. First (a) Ç First (b) {a} where a is some terminal symbol of the grammar.
II. First (a) Ç First (b) l
III. First (a) Ç Follow (A) = f if l Î First (b)
(A) I and II
(B) I and III
(C) II and III
(D) I, II and III

7. Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar ?
(A) Removing left recursion alone
(B) Removing the grammar alone
(C) Removing left recursion and factoring the grammar
(D) None of the above

8. A shift reduce parser suffers from
(A) shift reduce conflict only
(B) reduce reduce conflict only
(C) both shift reduce conflict and reduce reduce conflict
(D) shift handle and reduce handle conflicts

9. KPA in CMM stands for
(A) Key Process Area
(B) Key Product Area
(C) Key Principal Area
(D) Key Performance Area

10. Which one of the following is not a risk management technique for managing the risk due to unrealistic schedules and budgets ?
(A) Detailed multi source cost and schedule estimation.
(B) Design cost
(C) Incremental development
(D) Information hiding

11. _______ of a system is the structure or structures of the system which comprise software elements, the externally visible properties of these elements and the relationship amongst them.
(A) Software construction
(B) Software evolution
(C) Software architecture
(D) Software reuse

12. In function point analysis, the number of complexity adjustment factors is
(A) 10
(B) 12
(C) 14
(D) 20

13. Regression testing is primarily related to
(A) Functional testing
(B) Development testing
(C) Data flow testing
(D) Maintenance testing

14. How many different truth tables of the compound propositions are there that involve the propositions p & q ?
(A) 2
(B) 4
(C) 8
(D) 16

15. Which of the following statement(s) is (are) not correct ?
i. The 2’s complement of 0 is 0.
ii. In 2’s complement, the left most bit cannot be used to express a quantity.
iii. For an n-bit word (2’s complement) which includes the sign bit, there are 2n–1 positive integers, 2n+1 negative integers and one 0 for a total of 2n unique states.
iv. In 2’s complement the significant information is contained in the 1’s of positive numbers and 0’s of the negative numbers.
(A) i & iv
(B) i & ii
(C) iii
(D) iv