## 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

## MCQs Data Structure|UGC-NET|GATE|Data Structures

 51. An undirected graph is Eulerian if and only if all vertices of G are of the sum of the degrees of all nodes is: A. Same degree B. ODD degree C. Need not be ODD D. is twice number of edges View/Hide Ans Explanation 52. An undirected graph G has n vertices and n-1 edges then G is: A. Cyclic B. Addition of edge will make it cyclic C. Eulerian D. Is a Tree View/Hide Ans Explanation 53. Graph having every pair of vertices connected is called: A. Cycle graph B. Complete graph C. Peterson graph D. Is a Tree View/Hide Ans Explanation 54. The Eigen vectors of a real symmetric matrix corresponding to different Eigen values are: A. Orthogonal matrix B. Singular matrix C. Non-singular matrix D. Inverse matrix View/Hide Ans Explanation 55. The complexity of linear search algorithm of an array of n elements is: A. O log(n) B. O (n) C. O nlog(n) D. O(nXn) View/Hide Ans Explanation 56. “n” elements of a queue are to be reversed using another queue. The number of “ADD” and “REMOVE” required to do so is, A. 2*n B. 4*n C. n D. the task cannot be done View/Hide Ans Explanation 57. Prim’s algorithm is a method available for finding out the minimum cost of a spanning tree. Its time complexity is given by: A. O(n*n) B. O(n logn) C. O(n) D. O(1) 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