## Discussion Forum

Interative Forum for discussing any query literally to UGC-NET Computer Science, GATE Computer Science and Computer Sciene and Technology in general.

## UGC-NET Computer Science

Correspondence Courses and Test Series to prepare for UGC-NET computer science and applications

## GATE

MCQs, Lecture Notes, Ebooks for GATE preparation

## Jobs Newsfeed

Timely information of various Recruitments.

NextPrev

## Answer Key and Solved Questions Paper-3 UGC-NET Computer Science November 2017

 31. Consider a full binary tree with n internal nodes, internal path length i, and external path length e. The internal path length of a full binary tree is the sum, taken over all nodes of the tree, of the depth of each node. Similarly, the external path length is the sum, taken over all leaves of the tree, of the depth of each leaf. Which of the following is correct for the full binary tree? A. e = i + n B. e = i + 2n C. e = 2i + n D. e = 2n + i View/Hide Ans Explanation 32. You are given a sequence of n elements to sort. The input sequence consists of n/k subsequences, each containing k elements. The elements in a given subsequence are all smaller than the elements in the succeeding subsequence and larger than the elements in the preceding subsequence. Thus, all that is needed to sort the whole sequence of length n is to sort the k elements in each of the n/k subsequences. The lower bound on the number of comparisons needed to solve this variant of the sorting problem is: A. Ω(n) B. Ω(n/k) C. Ω(n lg k) D. Ω(n/k lg n/k) View/Hide Ans Explanation 33. Consider the recurrence relation: T (n) = 8T(n/2) + Cn, if n > 1 = b, if n =1 Where b and c are constants. The order of the algorithm corresponding to above recurrence relation is: A. n B. n2 C. n lg n D. n3 View/Hide Ans Explanation 34. Consider the following two sequences : X = ❰B, C, D, C, A, B, C❱ and Y = ❰C, A, D, B, C, B❱ The length of longest common subsequence of X and Y is: A. 5 B. 3 C. 4 D. 2 View/Hide Ans Explanation 35. A text is made up of the characters a, b, c, d, e each occurring with the probability 0.11, 0.40, 0.16, 0.09 and 0.24 respectively. The optimal Huffman coding technique will have the average length of: A. 2.40 B. 2.16 C. 2.26 D. 2.15 View/Hide Ans Explanation 36. An undirected graph G (V, E) contains n (n > 2) nodes named v1, v2,...,vn. Two nodes vi and vj are connected if and only if 0 < | i – j | ≤ 2. Each edge (vi, vj) is assigned a weight i+j. The cost of the minimum spanning tree of such a graph with 10 nodes is : A. 88 B. 91 C. 49 D. 21 View/Hide Ans Explanation 37. An XML document that adheres to syntax rules specified by XML 1.0 specification in that it must satisfy both physical and logical structured, is called : A. Well - formed B. Reasonable C. Valid D. Sophisticated View/Hide Ans Explanation 38. Which of the following statement(s) is/are TRUE regarding Java Servelets? (a) A Java Servelet is a server-side component that runs on the web server and extends the capabilities of a server. (b) A Servelet can use the user interface classes like AWT or Swing. Code : A. Only (a) is TRUE. B. Only (b) is TRUE. C. Both (a) and (b) are TRUE. D. Neither (a) nor (b) is TRUE. View/Hide Ans Explanation 39. Consider the following HTML table definition :
Text A
Text B Text C
Text D Text E <
Text F
The above HTML code would render on screen as : A. B. C. D. View/Hide Ans Explanation 40. Which of the following statements is/are TRUE? (a) In HTML, character entities are used to incorporate external content into a web page, such as images. (b) Once a web server returns a cookie to a browser, the cookie will be included in all future requests from the browser to the same server. Code : A. Only (a) is TRUE. B. Only (b) is TRUE. C. Both (a) and (b) are TRUE. D. Neither (a) nor (b) is TRUE. View/Hide Ans Explanation

Author Does Not claim of any answer these answers are as per expert opinion

Pages: 1 2 3 4 5 6