UGC NET 2017 Paper 2 Computer Science Question Paper (05-Nov-2017); Download PDF

Home
Paper

UGC NET 2017 Paper 2 (Computer Science & Applications) was held on 5th November 2017 as part of the National Eligibility Test (NET) conducted by the University Grants Commission (UGC) to determine eligibility for Assistant Professorship and Junior Research Fellowship (JRF) in Indian universities and colleges. The exam followed a single-paper pattern (Paper 2 only), consisting of 100 multiple-choice questions (MCQs), each carrying 2 marks, with no negative marking. The paper tested in-depth knowledge of core Computer Science topics such as Data Structures, Algorithms, Database Management Systems (DBMS), Operating Systems, Computer Networks, Theory of Computation, and Software Engineering.

Free

UGC NET 2017 Paper 2 Computer Science Prev Year Paper (05-Nov-2017)

75 Minutes

50 Questions

100 Marks

English

Showing 1 - 5 of 50 questions

Page 1 of 10

Q1.

If the time is now 4 O’clock, what will be the time after 101 hours from now?

9 O’clock

8 O’clock

5 O’clock

4 O’clock

Q2.

Let m = (313) ₄and n = (322) ₄. Find the base 4 expansion of m + n.

(635) ₄

(32312) ₄

(21323) ₄

(1301) ₄

Q3.

Let \(A = \left[ {\begin{array}{*{20}{c}} 1&1&0\\ 0&1&0\\ 1&1&0\\ 0&0&1 \end{array}} \right]\) and \(B = \left[ {\begin{array}{*{20}{c}} 1&0&0&0\\ 0&1&1&0\\ 1&0&1&1\\ \end{array}} \right]\) Find the boolean product A ⊙ B of the two matrices.

\(\left[ {\begin{array}{*{20}{c}} 1&1&1&0\\ 0&1&1&0\\ 1&1&1&0\\ 1&0&1&1 \end{array}} \right]\)

\(\left[ {\begin{array}{*{20}{c}} 1&1&0&1\\ 0&1&0&1\\ 1&1&1&0\\ 1&0&1&1 \end{array}} \right]\)

\(\left[ {\begin{array}{*{20}{c}} 1&1&0&1\\ 0&1&1&0\\ 1&1&1&0\\ 1&0&1&1 \end{array}} \right]\)

\(\left[ {\begin{array}{*{20}{c}} 1&1&1&0\\ 0&1&1&0\\ 1&0&1&1\\ 1&0&1&1 \end{array}} \right]\)

Q4.

How many distinguishable permutations of the letters in the word BANANA are there?

720

120

360

Q5.

Consider the graph given below:

Use Kruskal’s algorithm to find a minimal spanning tree for the graph. The List of the edges of the tree in the order in which they are chosen is?

AD, AE, AG, GC, GB, BF

GC, GB, BF, GA, AD, AE

GC, AD, GB, GA, BF, AE

AD, AG, GC, AE, GB, BF

⋯

Page 1 of 10

Jump to:

Need Expert Advice?

Test Series

Teaching

UGC NET Library and Information Science 2024 - 2025 Mock Test Series

66 Tests 4 Tests Free

715 Attempts

4.4(17)

English, Hindi