A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. Maximum degree of any vertex in a simple graph of vertices n is
a. 2n - 1
b. n
c. n + 1
d. n - 1
Answer:n - 1
nivetha s :(August 13, 2018) If n=3,the statement a [++n]=n++;will;
Click to Add Comment
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions:

An algorithm is made up of 2 modules M1&M2.; If order of M1 is f(n) & M2 is g(n) then the order of algorithm is?
Which of the following is the correct syntax to declare an ArrayList in Java?
In linked list implementation of a queue, from where is the item deleted?
Which one of the below is not divide and conquer approach?
Trees are often used in implementing _________ and hence it is considered as prime application of trees.
Which of the following is false ?
The given array is arr = {2,3,4,1,6}. What are the pivots that are returned as a result of subsequent partitioning?
Bundling data and function together is termed as
Each array declaration need not give, implicitly or explicitly, the information about
What is the maximum number of ways in which a boolean expression with n + 1 terms can be parenthesized, such that the output is true?
Get it on Google Play

GATE CSE Resources

Questions from Previous year GATE question papers

UGC NET Computer science Resources

UGC NET Previous year questions and practice sets

NET General Paper 1

UGC NET Previous year questions and practice sets

GATE CSE Online Test

Attempt a small test to analyze your preparation level. This GATE exam includes questions from previous year GATE papers.

UGC NET practice Test

Practice test for UGC NET Computer Science Paper. The questions asked in this NET practice paper are from various previous year papers.