Below is brief of PUBLIC NOTICE regarding University Grant Commission- National Eligibility Test (UGC-NET)- June 2019:
UGC-NET June 2019 Notification has been released. The National Testing Agency (NTA) will conduct UGC-NET (UGC National Eligibility Test) 2019 for ‘Junior Research Fellowship and Assistant Professor both’.
The test will consist of two papers. Both the papers will be conducted in a single three hour duration.
The details of the next UGC-NET are as given below:
Mode of examination: : Computer Based Registration Dates : 1 - 30 March 2019 Downloading of Admit Cards : 15 May 2019 Date of examinations : 20, 21, 24, 25, 26, 27 and 28 June 2019 Date of Announcing Results : By 9 July 2019
Download PDF of Updated Syllabi of UGC-NET (Applicable from June 2019 UGC-NET Onwards)
Find a nta net syllabus public notice by NTA NET regarding Updated Syllabus of NET subjects released on Date: 28th January 2019 OR
Visit NTA NET home page "CURRENT EVENT"for public notice-> Updated Syllabus of NET subjects for the same.
Politics including International Relations/International
Studies including Defence/Strategic Studies, West Asian Studies, South East
Asian Studies, African Studies, South Asian Studies, Soviet Studies,
American Studies.
3. What is the output of the following JAVA program ?
class simple
{
public static void main(String[ ] args)
{
simple obj = new simple( );
obj.start( );
}
void start( ){
long [ ] P= {3, 4, 5};
long [ ] Q= method (P);
System.out.print (P[0] + P[1] + P[2]+”:”);
System.out.print (Q[0] + Q[1] + Q[2]);
}
long [ ] method (long [ ] R)
{
R [1]=7;
return R;
}
} //end of class
4. What is the output of the following ‘C’ program ? (Assuming little - endian representation of multi-byte data in which Least Significant Byte (LSB) is stored at the lowest memory address.)
#include <stdio.h>
#include <stdlib.h>
/* Assume short int occupies two bytes of storage */
int main ( )
{
union saving
{
short int one;
char two[2];
};
union saving m;
m.two [0] = 5;
m.two [1] = 2;
printf(’’%d, %d, %d\n”, m.two [0], m.two [1], m.one);
}/* end of main */
6. In Java, which of the following statements is/are True ? S1 : The ‘final’ keyword applied to a class definition prevents the class from being extended through derivation. S2 : A class can only inherit one class but can implement multiple interfaces. S3 : Java permits a class to replace the implementation of a method that it has inherited. It is called method overloading.
7. Which of the following statements is/are True ? P : C programming language has a weak type system with static types. Q : Java programming language has a strong type system with static types.
A graphic display system has a frame buffer that is 640 pixels wide, 480 pixels high and 1 bit of color depth. If the access time for each pixel on the average is 200 nanoseconds, then the refresh rate of this frame buffer is approximately :
9. Which of the following statements is/are True regarding the solution to the visibility problem in 3D graphics ?
S1 : The Painter’s algorithm sorts polygons by depth and then paints (scan - converts) each Polygon on to the screen starting with the most nearest polygon.
S2 : Backface Culling refers to eliminating geometry with backfacing normals.
Answer: (2) M represents first, a translation of vector (1, 1) followed by scaling of vector (2, 1)
Question 11
Assume the following regarding the development of a software system P : - Estimated lines of code of P : 33, 480 LOC - Average productivity for P : 620 LOC per person-month - Number of software developers : 6 - Average salary of a software developer : ` 50,000 per month If E, D and C are the estimated development effort (in person-months), estimated development time (in months), and estimated development cost (in ` Lac) respectively, then (E, D, C) =_________.
14. A software system crashed 20 times in the year 2017 and for each
crash, it took 2 minutes to restart. Approximately, what was the
software availability in that year ?
16. Coupling is a measure of the strength of the interconnections between
software modules. Which of the following are correct statements with respect to module
coupling ?
P : Common coupling occurs when one module controls the flow of another
module by passing it information on what to do.
Q : In data coupling, the complete data structure is passed from one
module to another through parameters.
R : Stamp coupling occurs when modules share a composite data structure
and use only parts of it.
18. Reasons to re-engineer a software include : P : Allow legacy software to quickly adapt to the changing requirements Q : Upgrade to newer technologies/platforms/paradigm (for example, object-oriented) R : Improve software maintainability S : Allow change in the functionality and architecture of the software
P : Refactoring is the process of changing a software system in such a way that it does not alter the external behavior of the code yet improves the internal architecture.
Q : An example of refactoring is adding new features to satisfy a customer requirement discovered after a project is shipped.
22. Consider the array A=<4, 1, 3, 2, 16, 9, 10, 14, 8, 7>. After building heap from the array A, the depth of the heap and the right child of max-heap are _________ and _________ respectively. (Root is at level 0).
A hash function h defined h(key)=key mod 7, with linear probing, is used to insert the keys 44, 45, 79, 55, 91, 18, 63 into a table indexed from 0 to 6. What will be the location of key 18 ?
25. A text is made up of the characters A, B, C, D, E each occurring with the probability 0.08, 0.40, 0.25, 0.15 and 0.12 respectively. The optimal coding technique will have the average length of :
26. A binary search tree in which every non-leaf node has non-empty left and right subtrees is
called a strictly binary tree. Such a tree with 19 leaves :
29. A 5-ary tree is tree in which every internal node has exactly 5 children. The number of left (leaf) nodes in such a tree with 8 internal nodes will be :
40. Consider the following statements( ) :
S1 : There exists no algorithm for deciding if any two Turing machines M1 and M2 accept
the same language.
S2 : The problem of determining whether a Turing machine halts on any input is undecidable.
Which of the following options is correct ?
41. A slotted ALOHA network transmits 200-bit frames using a shared channel with a 200 Kbps bandwidth. Find the throughput of the system, if the system (all stations put together) produces 250 frames per second :
44. Which of the following statements are true ?
(a) Advanced Mobile Phone System (AMPS) is a second generation cellular phone system.
(b) IS - 95 is a second generation cellular phone system based on CDMA and DSSS.
(c) The Third generation cellular phone system will provide universal personnel
communication.
46. Which of the following statements are true ? (a) Three broad categories of Networks are (i) Circuit Switched Networks (ii) Packet Switched Networks (iii) Message Switched Networks (b) Circuit Switched Network resources need not be reserved during the set up phase. (c) In packet switching there is no resource allocation for packets.
51. At a particular time of computation, the value of a counting semaphore is 10. Then 12 P operations and “x” V operations were performed on this semaphore. If the final value of semaphore is 7, x will be :
52. In a paged memory, the page hit ratio is 0.40. The time required to access a page in secondary memory is equal to 120 ns. The time required to access a page in primary memory is 15 ns. The average time required to access a page is ______ .
53. In a multi-user operating system, 30 requests are made to use a particular resource per hour, on an average. The probability that no requests are made in 40 minutes, when arrival pattern is a poisson distribution, is ______ .
54. Normally user programs are prevented from handling I/O directly by I/O instructions in them. For CPUs having explicit I/O instructions, such I/O protection is ensured by having the I/O instructions privileged. In a CPU with memory mapped I/O, there is no explicit I/O instruction. Which one of the following is true for a CPU with memory mapped I/O ?
(1) I/O protection is ensured by operating system routines.
(2) I/O protection is ensured by a hardware trap.
(3) I/O protection is ensured during system configuration.
(a) External Fragmentation exists when there is enough total memory space to satisfy a
request but the available space is contiguous.
(b) Memory Fragmentation can be internal as well as external.
(c) One solution to external Fragmentation is compaction.
Code :
(1) (a) and (b) only (2) (a) and (c) only
(3) (b) and (c) only (4) (a), (b) and (c)
Answer: 3
57. Page information in memory is also called as Page Table. The essential contents in each entry
of a page table is/are ______ .
(1) Page Access information
(2) Virtual Page number
(3) Page Frame number
(4) Both virtual page number and Page Frame Number
Answer: 3
58. Consider a virtual page reference string 1, 2, 3, 2, 4, 2, 5, 2, 3, 4. Suppose LRU page replacement
algorithm is implemented with 3 page frames in main memory. Then the number of page
faults are_________.
(1) 5 (2) 7 (3) 9 (4) 10
Answer: 3
59. Consider the following three processes with the arrival time and CPU burst time given in
milliseconds :
Process Arrival Time Burst Time
P1 0 7
P2 1 4
P3 2 8
The Gantt Chart for preemptive SJF scheduling algorithm is _________.
(1)
(2)
(3)
(4)
Answer: 3
60. In which of the following scheduling criteria, context switching will never take place ?
62. Consider a relation book (title, price) which contains the titles and prices of different books.
Assuming that no two books have the same price, what does the following SQL query list ?
Select title
from book as B
where (select count (*)
from book as T
where T.price > B.price) < 7
(1) Titles of the six most expensive books.
(2) Title of the sixth most expensive books.
(3) Titles of the seven most expensive books.
(4) Title of the seventh most expensive books.
Answer: 3
63. In a Hierachical database, a hashing function is used to locate the ________.
(1) Collision (2) Root
(3) Foreign Key (4) Records
Answer: 3
64. Relations produced from E - R Model will always be in ________.
(1) 1 NF (2) 2 NF (3) 3 NF (4) 4 NF
Answer: 3
65. Consider the following schedules involving two transactions.
S1 : r1(X) ; r1(Y) ; r2(X) ; r2(Y) ; w2(Y) ; w1(X)
S2 : r1(X) ; r2(X) ; r2(Y) ; w2(Y) ; r1(Y) ; w1(X)
Which one of the following statements is correct with respect to above ?
(1) Both S1 and S2 are conflict serializable.
(2) Both S1 and S2 are not conflict serializable.
(3) S1 is conflict serializable and S2 is not conflict serializable.
(4) S1 is not conflict serializable and S2 is conflict serializable.
Answer: 3
66. For a database relation R(a, b, c, d) where the domains of a, b, c and d include only atomic
values, and only the following functional dependencies and those that can be inferred from
them hold :
a → c
b → d
The relation is in _________.
(1) First normal form but not in second normal form
(2) Second normal form but not in third normal form
(3) Third normal form
(4) BCNF
Answer: 3
67. A many-to-one relationship exists between entity sets r1 and r2. How will it be represented
using functional depedencies if Pk(r) denotes the primary key attribute of relation r ?
68. Database systems that store each relation in a separate operating system file may use the
operating system’s authorization scheme, instead of defining a special scheme themselves.
In this case, which of the following is false ?
(1) The administrator enjoys more control on the grant option.
(2) It is difficult to differentiate among the update, delete and insert authorizations.
(3) Cannot store more than one relation in a file.
(4) Operations on the database are speeded up as the authorization procedure is carried
out at the operating system level.
Answer: 3
69. Let R1(a, b, c) and R2(x, y, z) be two relations in which a is the foreign key of R1 that refers to
the primary key of R2. Consider following four options.
(a) Insert into R1 (b) Insert into R2
(c) Delete from R1 (d) Delete from R2
Which of the following is correct about the referential integrity constraint with respect to
above ?
(1) Operations (a) and (b) will cause violation.
(2) Operations (b) and (c) will cause violation.
(3) Operations (c) and (d) will cause violation.
(4) Operations (d) and (a) will cause violation.
Answer: 3
70. Consider a hash table of size seven, with starting index zero, and a hash function (7x+3)
mod 4. Assuming the hash table is initially empty, which of the following is the contents of
the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing ? Here
“__” denotes an empty location in the table.
71. In Artificial Intelligence (AI), an environment is uncertain if it is ________.
(1) Not fully observable and not deterministic
(2) Not fully observable or not deterministic
(3) Fully observable but not deterministic
(4) Not fully observable but deterministic
Answer: 3
72. In Artificial Intelligence (AI), a simple reflex agent selects actions on the basis of_________.
(1) current percept, completely ignoring rest of the percept history.
(2) rest of the percept history, completely ignoring current percept.
(3) both current percept and complete percept history.
(4) both current percept and just previous percept.
Answer: 3
73. In heuristic search algorithms in Artificial Intelligence (AI), if a collection of admissible
heuristics h1.......hm is available for a problem and none of them dominates any of the others,
which should we choose ?
74. Consider following sentences regarding A*, an informed search strategy in Artificial
Intelligence (AI).
(a) A* expands all nodes with f(n) < C*.
(b) A* expands no nodes with f(n) /C*.
(c) Pruning is integral to A*.
Here, C* is the cost of the optimal solution path.
Which of the following is correct with respect to the above statements ?
(1) Both statement (a) and statement (b) are true.
(2) Both statement (a) and statement (c) are true.
(3) Both statement (b) and statement (c) are true.
(4) All the statements (a), (b) and (c) are true.
Answer: 3
75. Consider a vocabulary with only four propositions A, B, C and D. How many models are
there for the following sentence ?
B w C
(1) 10 (2) 12 (3) 15 (4) 16
Answer: 3
76. Consider the following statements :
(a) False ?=True
(b) If α ?=(β ∧ γ) then α ?=β and α ?=γ.
Which of the following is correct with respect to the above statements ?
(1) Both statement (a) and statement (b) are false.
(2) Statement (a) is true but statement (b) is false.
(3) Statement (a) is false but statement (b) is true.
(4) Both statement (a) and statement (b) are true.
Answer: 3
77. Consider the following English sentence :
“Agra and Gwalior are both in India”.
A student has written a logical sentence for the above English sentence in First-Order Logic
using predicate In(x, y), which means x is in y, as follows :
In(Agra, India) w In(Gwalior, India)
Which one of the following is correct with respect to the above logical sentence ?
(1) It is syntactically valid but does not express the meaning of the English sentence.
(2) It is syntactically valid and expresses the meaning of the English sentence also.
(3) It is syntactically invalid but expresses the meaning of the English sentence.
(4) It is syntactically invalid and does not express the meaning of the English sentence.
Answer: 3
78. Consider the following two sentences :
(a) The planning graph data structure can be used to give a better heuristic for a planning
problem.
(b) Dropping negative effects from every action schema in a planning problem results in a
relaxed problem.
Which of the following is correct with respect to the above sentences ?
(1) Both sentence (a) and sentence (b) are false.
(2) Both sentence (a) and sentence (b) are true.
(3) Sentence (a) is true but sentence (b) is false.
(4) Sentence (a) is false but sentence (b) is true.
J-08718 !J-08718-PAPER-II! 19 Paper-II
Answer: 3
79. A knowledge base contains just one sentence, ∃x AsHighAs (x, Everest). Consider the
following two sentences obtained after applying existential instantiation.
(a) AsHighAs (Everest, Everest)
(b) AsHighAs (Kilimanjaro, Everest)
Which of the following is correct with respect to the above sentences ?
(1) Both sentence (a) and sentence (b) are sound conclusions.
(2) Both sentence (a) and sentence (b) are unsound conclusions.
(3) Sentence (a) is sound but sentence (b) is unsound.
(4) Sentence (a) is unsound but sentence (b) is sound.
Answer: 3
80. Consider the set of all possible five-card poker hands dealt fairly from a standard deck of
fifty-two cards. How many atomic events are there in the joint probability distribution ?
81. E is the number of edges in the graph and f is maximum flow in the graph. When the
capacities are integers, the runtime of Ford-Fulberson algorithm is bounded by :
(1) O (E∗f) (2) O (E2∗f)
(3) O (E∗f2) (4) O (E2∗f2)
Answer: 3
82. Which of the following statements is false about convex minimization problem ?
(1) If a local minimum exists, then it is a global minimum
(2) The set of all global minima is convex set
(3) The set of all global minima is concave set
(4) For each strictly convex function, if the function has a minimum, then the minimum is
unique
Answer: 3
83. The following LPP
Maximize z=100x1+2x2+5x3
Subject to
14x1+x2−6x3+3x4=7
32x1+x2−12x3≤10
3x1−x2−x3≤0
x1, x2, x3, x4/0
has
84. Digital data received from a sensor can fill up 0 to 32 buffers. Let the sample space be
S={0, 1, 2, .........., 32} where the sample j denote that j of the buffers are full and
1
p(i) (33 i)
561
= − . Let A denote the event that the even number of buffers are full. Then
p(A) is :
(1) 0.515 (2) 0.785 (3) 0.758 (4) 0.485
Answer: 3
85. The equivalence of
¬ ∃ x Q (x) is :
(1) ∃ x ¬ Q (x) (2) x ¬ Q (x) (3) ¬ ∃ x ¬ Q (x) (4) x Q (x)
Answer: 3
86. If Ai={−i, ... −2,−1, 0, 1, 2, . . . . . i}
then i
i 1
A
=
is :
(1) Z (2) Q (3) R (4) C
Answer: 3
87. Match the following in List - I and List - II, for a function f :
List - I List - II
(a) x y (f (x)=f (y) → x=y) (i) Constant
(b) y ∃ x (f (x)=y) (ii) Injective
(c) x f (x)=k (iii) Surjective
Code :
(a) (b) (c)
(1) (i) (ii) (iii)
(2) (iii) (ii) (i)
(3) (ii) (i) (iii)
(4) (ii) (iii) (i)
Answer: 3
88. Which of the relations on {0, 1, 2, 3} is an equivalence relation ?
89. Which of the following is an equivalence relation on the set of all functions from Z to
Z ?
(1) { (f, g) ? f (x)−g (x)=1 x e Z }
(2) { (f, g) ? f (0)=g (0) or f (1)=g (1) }
(3) { (f, g) ? f (0)=g (1) and f (1)=g (0) }
(4) { (f, g) ? f (x)−g (x)=k for some k e Z }
Answer: 3
90. Which of the following statements is true ?
(1) (Z, ≤ ) is not totally ordered
(2) The set inclusion relation ⊆ is a partial ordering on the power set of a set S
(3) (Z, ≠ ) is a poset
(4) The directed graph is not a partial order
Answer: 3
91. CMOS is a Computer Chip on the motherboard, which is :
(1) RAM (2) ROM
(3) EPROM (4) Auxillary storage
Answer: 3
92. In RS flip-flop, the output of the flip-flop at time (t+1) is same as the output at time t, after
the occurance of a clock pulse if :
(1) S=R=1 (2) S=0, R=1
(3) S=1, R=0 (4) S=R=0
Answer: 3
93. Match the terms in List - I with the options given in List - II :
List - I List - II
(a) Decoder (i) 1 line to 2n lines
(b) Multiplexer (ii) n lines to 2n lines
(c) De multiplexer (iii) 2n lines to 1 line
(iv) 2n lines to 2n−1 lines
Code :
(a) (b) (c)
(1) (ii) (i) (iii)
(2) (ii) (iii) (i)
(3) (ii) (i) (iv)
(4) (iv) (ii) (i)
Answer: 3
94. What does the following logic diagram represent ?
95. The hexadecimal equivalent of the binary integer number 110101101 is :
(1) D24 (2) 1 B D (3) 1 A E (4) 1 A D
Answer: 3
96. Perform the following operation for the binary equivalent of the decimal numbers
(−14)10+(−15)10
The solution in 8 bit representation is :
(1) 11100011 (2) 00011101
(3) 10011101 (4) 11110011
Answer: 3
97. Match the items in List - I and List - II :
List - I List - II
(a) Interrupts which can be delayed when a much highest (i) Normal
priority interrupt has occurred
(b) Unplanned interrupts which occur while executing (ii) Synchronous
a program
(c) Source of interrupt is in phase with the system clock (iii) Maskable
(iv) Exception
Code :
(a) (b) (c)
(1) (ii) (i) (iv)
(2) (ii) (iv) (iii)
(3) (iii) (i) (ii)
(4) (iii) (iv) (ii)
Answer: 3
98. Which of the following mapping is not used for mapping process in cache memory ?
99. Simplify the following using K-map :
F (A, B, C, D) = Σ (0, 1, 2, 8, 9, 12, 13)
d (A, B, C, D) = Σ (10, 11, 14, 15)
d stands for don’t care condition.
(1) A+B D + BC (2) A+B D + B C
(3) A+B C (4) A+B C+B D
Answer: 3
100. In 8085 microprocessor, what is the output of following program ?
LDA 8000H
MVI B, 30H
ADD B
STA 8001H
(1) Read a number from input port and store it in memory
(2) Read a number from input device with address 8000H and store it in memory at location 8001H
(3) Read a number from memory at location 8000H and store it in memory location 8001H
(4) Load A with data from input device with address 8000H and display it on the output
device with address 8001H
#include <stdio.h>#include <stdlib.h>
/* Assume short int occupies two bytes of storage */
int main ( )
{
union saving
{
short int one;
char two[2];
};
union saving m;
m.two [0] = 5;
m.two [1] = 2;
printf(’’%d, %d, %d\n”, m.two [0], m.two [1], m.one);
}/* end of main */