Wednesday, 9 August 2017

TIPS AND TRICKS ON HOW TO PASS UGC NET EXAM WITH NEW PATTERN


Hello friends.
The  pattern of UGC NET exam has changed and here I am presenting you an article with tips and tricks on how to pass the UGC NET exam  easily.
Change number 1: Paper 1 will have only 50 questions and all are compulsory questions.
Till last year, there used to be 60 questions and out of which 50 questions were to be answered.
The advantage of having 60 questions is that you can easily leave those 10 questions which are doubtful.
But now you got to answer them all with the changed pattern.
So you got to hone and sharpen your reasoning, comprehension, divergent thinking and general awareness. The key here is solving as many questions as possible.
Change number 2: There is no individual cutoff for each paper as it used to be in the previous years.
There will be an aggregate cutoff of 40% marks of all three papers for general category and 35% aggregate cutoff marks for all other categories.
It is indeed a welcome step as even if a candidate does not perform well in any one of the papers, he/she has a greater chance of performing really well in other two papers and try  to fill the mark gap created by that one paper. It is indeed a win-win situation.

Tuesday, 8 August 2017

UGC NET EXAM IN NOVEMBER 2017

Hi friends.
Welcome back everyone.
Finally UGC has come out with the notification for UGC NET exam.
The exam will be held on 5th November 2017.
The link for applying online will be available from 11th Aug. 2017.
The last date to apply for the exam is 11th September 2017 and you can pay the fees upto 12th september 2017.

Sunday, 21 August 2016

UGC NET COMPUTER SCIENCE SOLVED MODEL PAPER FOR DECEMER 2016

UGC  NET COMPUTER SCIENCE SOLVED MODEL PAPER FOR DECEMER 2016
1. Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms  would minimize the average waiting time in the ready queue?
(a) Shortest remaining time first
(b) Round-robin with time quantum less than the shortest CPU burst
(c) Uniform random
(d) Highest priority first with priority proportional to CPU burst length
Ans.: a

2. Match the following :
List – I                        List - II
(A) Boot block (i) Information about file system
(B) Super block (ii) Information about file
(C) Inode table (iii) Storage space
(D) Data block (iv) Code for making OS ready
Which one is true?
(a) (A)-(iv), (B)-(i), (C)-(ii), (D)-(iii)
(b) (A)-(i), (B)-(ii), (C)-(iv), (D)-(iii)
(c) (A)-(iv), (B)-(ii), (C)-(i), (D)-(iii)
(d) (A)-(i), (B)-(iii), (C)-(ii), (D)-(iv)
Ans.:a

3. A page fault means that we referenced a page
(a) outside the memory boundaries (b) with an incorrect I/O request
(c) that was not insecondary storage (d) that was not in main memory
Ans.:d

Follow by Email