Toggle navigation
Home
Article Category
Question Papers
General Knowlege
Popular Pages
Multiple Choice Question in
Multiple Choice Question in 049
Multiple Choice Question in 2016
Multiple Choice Question in -current-affairs-2016
Multiple Choice Question in TRADES-INSTRUCTOR---GR-II---SMITHY---TECHNICAL-EDUCATION
Question Answer in ASSISTANT-PROFESSOR---COMPUTER-SCIENCE-AND-ENGINEERING---TECHNICAL-EDUCATION
Multiple Choice Question in ASSISTANT-PROFESSOR---COMPUTER-SCIENCE-AND-ENGINEERING---TECHNICAL-EDUCATION
Multiple Choice Question in english
Multiple Choice Question in abbreviations-abbreviations-m
Multiple Choice Question in SSC CHSL 7 March 2018 Morning Shift
Multiple Choice Question in 072/2016
Question Answer Bank
Multiple Choice Question Bank
Question Answer Category
Multiple Choice Question Category
Home
->
Multiple Choice Questions
1. The maximum number of edges in an acyclic undirected graph with n vertices is:
(A): n - 1
(B): n +1
(C): n
(D): 2n - 1
Previous Question
Show Answer
Next Question
Add Tags
Report Error
Show Marks
Write Comment
Type in
(Press Ctrl+g to toggle between English and the chosen language)
Post reply
Comments
Tags
kerala-psc
ASSISTANT-PROFESSOR---INFORMATION-TECHNOLO0GY--TECHNICAL-EDUCATION--ENGINEERING-DCOLLEGES
140/2016
Show Similar Question And Answers
QA->The minimum number of edges in a connected cyclic graph on N vertices is :....
QA->Consider a Program Graph (PG) with statements as nodes and control as edges. Which of the following is not true for any PG?....
QA->In a Program Graph, ‘X’ is an if-then-else node. If the number of paths from start node to X is ‘p’ number of paths from if part to end node is ‘q’ and from else part to end node is ’r’, the total number of possible paths through X is :....
QA->A program Graph has ‘start’ and ‘end’ nodes. The total number of paths from start to end is equivalent to the -----------set of test data required to test the software.....
QA->A wound with uneven edges is known as?....
MCQ->A graph may be defined as a set of points connected by lines called edges. Every edge connects a pair of points. Thus, a triangle is a graph with 3 edges and 3 points. The degree of a point is the number of edges connected to it. For example, a triangle is a graph with three points of degree 2 each. Consider a graph with 12 points. It is possible to reach any point from any point through a sequence of edges. The number of edges, e, in the graph must satisfy the condition....
MCQ->The maximum number of edges in an acyclic undirected graph with n vertices is:....
MCQ-> In each of the following questions two rows of number are given. The resultant number in each row is to be worked out separately based on the following rules and the question below the row is to be answered. The operations of number progress from the left to right. Rules: (i) If an even number is followed by another even number they are to be added. (ii) If an even number is followed by a prime number, they are to be multiplied. (iii) If an odd number is followed by an even number, even number is to be subtracted from the odd number. (iv) If an odd number is followed by another odd number the first number is to be added to the square of the second number. (v) If an even number is followed by a composite odd number, the even number is to be divided by odd number.I. 84 21 13 II. 15 11 44 What is half of the sum of the resultants of the two rows ?....
MCQ-> Study the graph below and answer the questions that follow: This graph depicts the last eight years’ annual salaries (in Rs. lacs.) offered to student during campus placement. Every year 100 students go through placement process. However, at least one of them fails to get placed. The salaries of all unplaced students are marked zero and represented in the graph.
The bold line in the graph presents Mean salaries at various years.In which year were a maximum number of students offered salaries between Rs. 20 to Rs.30 lacs(both inclusive)?
....
MCQ->Let G be a weighted undirected graph and e be an edge with maximum weight in G. suppose there is a minimum weight spanning tree in G containing the edge e. which of the following statements is always true?....
×
×
Type The Issue
×
Your Marks
Terms And Service:We do not guarantee the accuracy of available data ..We Provide Information On Public Data.. Please consult an expert before using this data for commercial or personal use
Powered By:Omega Web Solutions
© 2002-2017 Omega Education PVT LTD...
Privacy
|
Terms And Conditions