Category Archives: UGC-NET

Consider a hash table of size m = 100 and the hash function h(k) = floor(m(kA mod 1)) for Compute the location to which the… Read More

Which of the following is asymptotically smaller? (A) log(n) (B) log(log n) (C) log(n!) (D) n Answer: (B)Explanation: log( log n ) is asymptotically smaller… Read More

The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound algorithm (C) Exponential time using… Read More

An all-pairs shortest-paths problem is efficiently solved using: (A) Dijkstra\’ algorithm (B) Bellman-Ford algorithm (C) Kruskal algorithm (D) Floyd-Warshall algorithm Answer: (D)Explanation: An all-pairs shortest-paths… Read More

The maximum payload of a TCP segment is: (A) 65,535 (B) 65,515 (C) 65,495 (D) 65,475 Answer: (C) Explanation: In TCP segment maximum size of… Read More

Suppose a digitized voice channel is made by digitizing 8 kHz bandwidth analog voice signal. It is required to sample the signal at twice the… Read More

A message “COMPUTERNETWORK” encrypted (ignore quotes) using columnar transposition cipher with a key “LAYER”. The encrypted message is : (A) CTTOEWMROPNRUEK (B) MROUEKCTTPNROEW (C) OEWPNRCTTUEKMRO… Read More

Which are the two modes of IP security? (A) Transport and certificate (B) Transport and tunnel (C) Certificate and tunnel (D) Preshared and transport Answer:… Read More

Which of the following control fields in TCP header is used to specify whether the sender has no more data to transmit? (A) FIN (B)… Read More

Which transmission technique guarantees that data packets will be received by the receiver in the same order in which they were sent by the sender?… Read More

Which one of the following is true? (A) The resolvent of two Horn clauses is not a Horn clause (B) The resolvent of two Horn… Read More

Which of the following is false for the programming language PROLOG? (A) A PROLOG variable can only be assigned to a value once (B) PROLOG… Read More

The clausal form of the disjunctive normal form ¬A ∨ ¬B ∨ ¬C ∨ D is: (A) A ∧ B ∧ C ⇒ D (B)… Read More

The transition function for the language L = {w|na (w) and nb(w) are both odd} is given by: δ (q0, a) = q1 ; δ… Read More

My Personal Notes arrow_drop_up Save