Skip to content

Category Archives: UGC-NET

Consider the following JAVA program : public class First { public static int CBSE (int x) { if (x < 100) x = CBSE (x… Read More
Given the array of integers ‘array’ shown below : 13, 7, 27, 2, 18, 33, 9, 11, 22, 8. What is the output of the… Read More
Abstraction and encapsulation are fundamental principles that underlie the object oriented approach to software development. What can you say about the following two statements ?… Read More
Match the following with respect to algorithm paradigms :    (A) (1) (B) (2) (C) (3) (D) (4) Answer: (D)Explanation: Merge sort is a Divide… Read More
Dijkstra’s algorithm is based on (A) Divide and conquer paradigm (B) Dynamic programming (C) Greedy Approach (D) Backtracking paradigm Answer: (C)Explanation: Dijkstra’s algorithm is based… Read More
The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose sequence of dimensions for four matrices is is (A) 630 (B)… Read More
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… Read More
Any decision tree that sorts n elements has height ________. (A) Ω(log n) (B) Ω(n) (C) Ω(n log n) (D) Ω(n2) Answer: (C)Explanation:Quiz of this… Read More
The asymptotic upper bound solution of the recurrence relation given by Recurrence relation (A) O(n2) (B) O(n log n) (C) O(n log log n) (D)… Read More
A node X on a 10 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2 Mbps.… Read More
In RSA public key cryptosystem suppose n = p ∗ q where p and q are primes. (e, n) and (d, n) are public and… Read More
In a packet switching network, if the message size is 48 bytes and each packet contains a header of 3 bytes. If 24 packets are… Read More
Let G(x) be generator polynomial used for CRC checking. The condition that should be satisfied by G(x) to correct odd numbered error bits, will be:… Read More
Station A uses 32 byte packets to transmit messages to station B using sliding window protocol. The round trip delay between A and B is… Read More
Suppose there are n stations in a slotted LAN. Each station attempts to transmit with a probability P in each time slot. The probability that… Read More