UTpaper

Free mock tests & test series

FreePrevious Year Paper· 2017

UGC NET Computer Science PYQ, June 2017 (Paper II & III, Selected Questions)

Attempt UGC NET Computer Science PYQ, June 2017 (Paper II & III, Selected Questions) online for free with the official answer key: 74 questions, 130 minutes, no negative marking. Questions with instant score, all-India rank and detailed solutions on UTpaper.

  • 74 Questions
  • 148 Marks
  • 130 Minutes
  • English
  • 1 attempts
Attempt test free →Questions with answers

About UGC NET Computer Science PYQ, June 2017 (Paper II & III, Selected Questions)

This is the actual UGC NET Computer Science PYQ, June 2017 (Paper II & III, Selected Questions) converted into an online test with the official answer key. Attempt it with the real time limit of 130 minutes to see exactly how you would score in the UGC NET exam, then go through the solutions to fix weak topics. It is one of 8 free tests in the UGC NET Computer Science Previous Year Papers & Mock Test.

Section-wise pattern

SectionQuestionsMarksCounts for merit?
Paper II4182Yes
Paper III3366Yes

Sample questions from this test

Q42
The general configuration of the micro programmed control unit is given below : (Diagram: External Conditions → Next Address Generator → B → C, with 'Next Address Information' fed back from C to the Next Address Generator.) What are blocks B and C in the diagram respectively?
  1. ABlock address register and cache memory
  2. BControl address register and control memory
  3. CBranch register and cache memory
  4. DControl address register and random access memory
Show answer
Q43
In 8085 microprocessor, the digit 5 indicates that the microprocessor needs
  1. A–5 volts, +5 volts supply
  2. B+5 volts supply only
  3. C–5 volts supply only
  4. D5 MHz clock
Show answer
Q44
In 8085, which of the following performs : load register pair immediate operation?
  1. ALDAS rp
  2. BLHLD addr
  3. CLXI rp, data
  4. DINS rp
Show answer
Q45
Any decision tree that sorts n elements has height ..............
  1. AΩ(lg n)
  2. BΩ(n)
  3. CΩ(n lg n)
  4. DΩ (n²)
Show answer
Q46
Red–black trees are one of many search tree schemes that are "balanced" in order to guarantee that basic dynamic-set operations take .............. time in the worst case.
  1. AO(1)
  2. BO(lg n)
  3. CO(n)
  4. DO(n lg n)
Show answer

Attempt the full test to answer all 74 questions under the real time limit, or read all 74 questions with answers.

How to attempt

  1. Click “Attempt test free” and sign in with Google or your UTpaper account.
  2. The timer starts at 130 minutes. Use the question palette to move between questions and mark questions for review.
  3. Submit when done. You get your score, accuracy, section-wise marks and all-India rank instantly, with the solution for every question.

Frequently asked questions

Is the UGC NET Computer Science PYQ, June 2017 (Paper II & III, Selected Questions) free to attempt?
Yes. The test is completely free on UTpaper. Sign in with Google or create a free account, click Attempt test, and your score, rank and solutions appear as soon as you submit.
How many questions and how much time does this test have?
The test has 74 questions for 148 marks and must be finished in 130 minutes. There is no negative marking.
Are the answers in this UGC NET previous year paper official?
Yes. The answer key follows the official final answer key released by the exam board. Where an official answer is debatable, the explanation says so.
What are the sections in this test?
The test has 2 sections: Paper II (41 questions) and Paper III (33 questions).
Can I reattempt the test and see solutions?
Yes. After submitting you see the correct answer and explanation for every question, your accuracy, section-wise marks and all-India rank. You can reattempt as many times as you like.

More in this series

Other UGC NET tests

View all 8