UGC – NET Computer Science June 2012 Question Paper– Paper – III
UGC – NET Computer Science June 2012 Question Paper– Paper – III Read More »
Previous Papers
UGC – NET Computer Science June 2012 – Paper – II
1. The postfix expression AB + CD – * can be evaluated using a 2. The post order traversal of a binary tree is DEBFCA. Find out the pre-order traversal. 3. The branch logic that provides making capabilities in the control unit is known as 4. The number of colours required to properly colour the
UGC – NET Computer Science June 2012 – Paper – II Read More »
EMRS PGT Computer Science – General Paper(Common Paper) – 2023
EMRS conducted examination for selection of PGTs into various EMRS schools across the India. The test has six parts consisting of 150 objective type questions.
PART – I : GENERAL AWARENESS
PART – II : REASONING ABILITY
PART – III : KNOWLEDGE OF ICT
PART – IV : TEACHING APTITUDE
PART – V : SUBJECT KNOWLEDGE
LANGUAGE COMPETENCY PART
PART – VI : GENERAL ENGISH
PART – VII : GENERAL HINDI
Language competency parts are qualifying in nature only with minimum 40% marks in each language. Part I to V of the candidate will not be evaluated, if candidate fails to attain qualifying marks in Language competency test
EMRS PGT Computer Science – General Paper(Common Paper) – 2023 Read More »
UGC – NET Computer Science December 2011 – Paper – II
1. Which of the following data structure is Non – linear type? 2. The total number of comparisons in a bubble sort is 3. Which of the following is a bad example of recursion? 4. Domain and Range of the function 5. Maximum number of edges in a n-Node undirected graph without self loop is
UGC – NET Computer Science December 2011 – Paper – II Read More »
UGC – NET Computer Science June 2011 – Paper – II
1. Any integer composed of 3n identical digits divisible by 2. The circumference of the two concentric disks are divided into 100 sections each. For the outer disk, 100 sections each. For the outer disk, 100 of the sections are painted red and 100 of the section are painted blue. for the inner disk, the
UGC – NET Computer Science June 2011 – Paper – II Read More »
UGC – NET Computer Science December 2010 – Paper – II
1. The number of integers between 1 and 250 that are divisible by 2,5 and 7 is 2. An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices are 3. A partially ordered set is said to be a lattice if every two elements in the set have
UGC – NET Computer Science December 2010 – Paper – II Read More »