{"id":221,"date":"2020-04-05T08:46:53","date_gmt":"2020-04-05T08:46:53","guid":{"rendered":"https:\/\/temp.ashkerala.com\/?p=221"},"modified":"2020-04-05T08:46:53","modified_gmt":"2020-04-05T08:46:53","slug":"computer-graph-mcq-01","status":"publish","type":"post","link":"https:\/\/temp.ashkerala.com\/?p=221","title":{"rendered":"Computer Graph MCQ 01"},"content":{"rendered":"

1) A graph is a collection of…. ?<\/strong>
a.\u00a0\u00a0 \u00a0Row and columns
b.\u00a0\u00a0 \u00a0Vertices and edges
c.\u00a0\u00a0 \u00a0Equations
d.\u00a0\u00a0 \u00a0None of these
Answer = B<\/strong>
\u00a0
2)\u00a0 The degree of any vertex of graph is …. ?<\/strong>
a.\u00a0\u00a0 \u00a0The number of edges incident with vertex
b.\u00a0\u00a0 \u00a0Number of vertex in a graph
c.\u00a0\u00a0 \u00a0Number of vertices adjacent to that vertex
d.\u00a0\u00a0 \u00a0Number of edges in a graph
\u00a0
Answer = A<\/strong>
Explanation: The number of edges connected on a vertex v with the self loop counted twice is called the degree of vertex.<\/p>\n

3) If for some positive integer k, degree of vertex d(v)=k for every vertex v of the graph G, then G is called… ?<\/strong>
a.\u00a0\u00a0 \u00a0K graph
b.\u00a0\u00a0 \u00a0K-regular graph
c.\u00a0\u00a0 \u00a0Empty graph
d.\u00a0\u00a0 \u00a0All of above
Answer = B<\/strong>
Explanation:\u00a0 A graph in which all vertices are of equal degree is called regular graph.<\/p>\n

4) A graph with no edges is known as empty graph. Empty graph is also known as… ?<\/strong>
a.\u00a0\u00a0 \u00a0Trivial graph
b.\u00a0\u00a0 \u00a0Regular graph
c.\u00a0\u00a0 \u00a0Bipartite graph
d.\u00a0\u00a0 \u00a0None of these
\u00a0
Answer = A<\/strong>
Explanation: Trivial graph is the second name for empty graph.<\/p>\n

5) Length of the walk of a graph is …. ?<\/strong>
a.\u00a0\u00a0 \u00a0The number of vertices in walk W
b.\u00a0\u00a0 \u00a0The number of edges in walk W
c.\u00a0\u00a0 \u00a0Total number of edges in a graph
d.\u00a0\u00a0 \u00a0Total number of vertices in a graph
\u00a0
Answer = B<\/strong>
Explanation:\u00a0 A walk is defined as finite altering sequence of vertices and edges. No Edges appear more than once but vertex may appear more than once.<\/p>\n

6) If the origin and terminus of a walk are same, the walk is known as… ?<\/strong>
a.\u00a0\u00a0 \u00a0Open
b.\u00a0\u00a0 \u00a0Closed
c.\u00a0\u00a0 \u00a0Path
d.\u00a0\u00a0 \u00a0None of these
\u00a0
Answer = B<\/strong>
Explanation:\u00a0 A walk which\u00a0 begins and ends with same vertex is called closed walk otherwise it is open.<\/p>\n

7) A graph G is called a ….. if it is a connected acyclic graph ?<\/strong>
a.\u00a0\u00a0 \u00a0Cyclic graph
b.\u00a0\u00a0 \u00a0Regular graph
c.\u00a0\u00a0 \u00a0Tree
d.\u00a0\u00a0 \u00a0Not a graph
\u00a0
Answer = C<\/strong>
Explanation: No explanation for this question.<\/p>\n

8) Eccentricity of a vertex denoted by e(v) is defined by…. ?<\/strong>
a.\u00a0\u00a0 \u00a0max { d(u,v): u belongs to v, u does not equal to v : where d(u,v) is the distance between u&v}
b.\u00a0\u00a0 \u00a0min { d(u,v): u belongs to v, u does not equal to v }
c.\u00a0\u00a0 \u00a0Both A and B
d.\u00a0\u00a0 \u00a0None of these
\u00a0
Answer = A<\/strong>
Explanation:\u00a0 The eccentricity E(v) of a vertex V in the graph is the distance from v to the vertex farthest from v in G.<\/p>\n

9) Radius of a graph, denoted by rad(G) is defined by…. ?<\/strong>
a.\u00a0\u00a0 \u00a0max {e(v): v belongs to V }
b.\u00a0\u00a0 \u00a0min { e(v):\u00a0 v belongs to V}
c.\u00a0\u00a0 \u00a0max { d(u,v): u belongs to v, u does not equal to v }
d.\u00a0\u00a0 \u00a0min { d(u,v): u belongs to v, u does not equal to v }
\u00a0
Answer = A<\/strong>
Explanation:\u00a0 The diameter or radius of a graph G is largest distance between two vertices in the graph G.<\/p>\n

10) The complete graph K, has… different spanning trees?<\/strong>
a.\u00a0\u00a0 \u00a0n^n-2
b.\u00a0\u00a0 \u00a0n*n
c.\u00a0\u00a0 \u00a0n^n
d.\u00a0\u00a0 \u00a0n^2
\u00a0 ^ = raised to for exponent<\/em>
Answer = A<\/p>\n

11) A tour of G is a closed walk of graph G which includes every edge G at least once. A ….. tour of G is a tour which includes every edge of G exactly once ?<\/strong>
a.\u00a0\u00a0 \u00a0Hamiltonian
b.\u00a0\u00a0 \u00a0Planar
c.\u00a0\u00a0 \u00a0Isomorphic
d.\u00a0\u00a0 \u00a0Euler
\u00a0
Answer = D<\/strong>
Explanation: If some closed walk in a graph contains all the edges then the walk is called Euler.<\/p>\n

12) Which of the following is not a type of graph ?<\/strong>
a.\u00a0\u00a0 \u00a0Euler
b.\u00a0\u00a0 \u00a0Hamiltonian
c.\u00a0\u00a0 \u00a0Tree
d.\u00a0\u00a0 \u00a0Path
\u00a0
Answer = D<\/strong>
Explanation:Path is a way from one node no another but not a graph.<\/p>\n

13) Choose the most appropriate definition of plane graph ?<\/strong>
a.\u00a0\u00a0 \u00a0A graph drawn in a plane in such a way that any pair of edges meet only at their end vertices
b.\u00a0\u00a0 \u00a0A graph drawn in a plane in such a way that if the vertex set of graph can be partitioned into two non – empty disjoint subset X and Y in such a way that each edge of G has one end in X and one end in Y.
c.\u00a0\u00a0 \u00a0A simple graph which is Isomorphic to Hamiltonian graph
d.\u00a0\u00a0 \u00a0None of these
\u00a0
Answer = A<\/strong>
Explanation: No explanation for this question.<\/p>\n

14) A continuous non – intersecting curve in the plane whose origin and terminus coincide ?<\/strong>
a.\u00a0\u00a0 \u00a0Planer
b.\u00a0\u00a0 \u00a0Jordan
c.\u00a0\u00a0 \u00a0Hamiltonian
d.\u00a0\u00a0 \u00a0All of these
\u00a0
Answer = B<\/strong>
Explanation: The jordan graph is the set of all vertices of minimum eccentricity that is the set of all vertices A where the greatest distance to other vertex B is minimal.<\/p>\n

15) Polyhedral is…. ?<\/strong>
a.\u00a0\u00a0 \u00a0A simple connected graph
b.\u00a0\u00a0 \u00a0A plane graph
c.\u00a0\u00a0 \u00a0A graph in which the degree of every vertex and every face is atleast 3
d.\u00a0\u00a0 \u00a0All of above
\u00a0
Answer = D<\/strong>
Explanation: A polyhedral graph is the undirected graph formed from the vertices and edges of a convex polyhedron<\/p>\n

16) A path in graph G, which contains every vertex of G once and only once ?<\/strong>
a.\u00a0\u00a0 \u00a0Eulartour
b.\u00a0\u00a0 \u00a0Hamiltonian Path
c.\u00a0\u00a0 \u00a0Eular trail
d.\u00a0\u00a0 \u00a0Hamiltonian tour
\u00a0
Answer = B<\/strong>
Explanation:A Hamiltonian circuit in a connected graph is defined as a closed walk that traverse every vertex of G exactly once except the starting vertex.<\/p>\n

17) A minimal spanning tree of a graph G is…. ?<\/strong>
a.\u00a0\u00a0 \u00a0A spanning sub graph
b.\u00a0\u00a0 \u00a0A tree
c.\u00a0\u00a0 \u00a0Minimum weights
d.\u00a0\u00a0 \u00a0All of above
\u00a0
Answer = D<\/strong>
Explanation: A tree is said to be spanning tree of connected graph G if it is subgraph of G and contains all the vertices of G.<\/p>\n

18) A tree having a main node, which has no predecessor is…. ?<\/strong>
a.\u00a0\u00a0 \u00a0Spanning tree
b.\u00a0\u00a0 \u00a0Rooted tree
c.\u00a0\u00a0 \u00a0Weighted tree
d.\u00a0\u00a0 \u00a0None of these
\u00a0
Answer = B<\/strong>
Explanation:A tree in which one vertex distinguish from all other is called rooted tree.<\/p>\n

19) Diameter of a graph is denoted by diam(G) is defined by…. ?<\/strong>
a.\u00a0\u00a0 \u00a0max (e(v) : v belongs to V)
b.\u00a0\u00a0 \u00a0max( d(u,v) )
c.\u00a0\u00a0 \u00a0Both A and B
d.\u00a0\u00a0 \u00a0None of these
\u00a0
Answer = C<\/strong>
Explanation: The diameter of a graph G is largest distance between two vertices in a graph G.
\u00a0
20) A vertex of a graph is called even or odd depending upon ?<\/strong>
a.\u00a0\u00a0 \u00a0Total number of edges in a graph is even or odd
b.\u00a0\u00a0 \u00a0Total number of vertices in a graph is even or odd
c.\u00a0\u00a0 \u00a0Its degree is even or odd
d.\u00a0\u00a0 \u00a0None of these
\u00a0
Answer = C<\/strong>
Explanation: The vertex of a graph is called even or odd based on its degree.<\/p>\n

21) Let A and B be any two arbitrary events then which one of the following is true ?<\/strong>
a.\u00a0\u00a0 \u00a0P( A intersection B) = P(A). P(B)
b.\u00a0\u00a0 \u00a0P(A union B) = P(A) + P(B)
c.\u00a0\u00a0 \u00a0P(AB) = P(A intersection B). P(B)
d.\u00a0\u00a0 \u00a0P(A union B) >= P(A) + P(B)
\u00a0
Answer = D<\/strong><\/p>\n

22) If X and Y be the sets. Then the set ( X – Y) union (Y- X) union (X intersection Y ) is equal to?<\/strong>
a.\u00a0\u00a0 \u00a0X union Y
b.\u00a0\u00a0 \u00a0Xc union Yc
c.\u00a0\u00a0 \u00a0X intersection Y
d.\u00a0\u00a0 \u00a0Xc intersection Yc
\u00a0
Answer = A<\/strong><\/p>\n

23) If G is an undirected planer graph on n vertices with e edges then ?<\/strong>
a.\u00a0\u00a0 \u00a0e<=n
b.\u00a0\u00a0 \u00a0e<=2n
c.\u00a0\u00a0 \u00a0e<=3n
d.\u00a0\u00a0 \u00a0None of these
\u00a0
Answer = B<\/strong><\/p>\n

24) Which of the following statement is false ?<\/strong>
a.\u00a0\u00a0 \u00a0G is connected and is circuitless
b.\u00a0\u00a0 \u00a0G is connected and has n edges
c.\u00a0\u00a0 \u00a0G is minimally connected graph
d.\u00a0\u00a0 \u00a0G is circuitless and has n-1 edges
\u00a0
Answer = B<\/strong><\/p>\n

25) Probability that two randomly selected cards from a set of two red and two black cards are of same color is ?<\/strong>
a.\u00a0\u00a0 \u00a01 \/ 2
b.\u00a0\u00a0 \u00a01 \/ 3
c.\u00a0\u00a0 \u00a02 \/ 3
d.\u00a0\u00a0 \u00a0None of these
\u00a0
Answer = B<\/strong><\/p>\n

26) The number of circuits that can be created by adding an edge between any two vertices in a tree is ?<\/strong>
a.\u00a0\u00a0 \u00a0Two
b.\u00a0\u00a0 \u00a0Exactly one
c.\u00a0\u00a0 \u00a0At least two
d.\u00a0\u00a0 \u00a0None
\u00a0
Answer = B<\/strong><\/p>\n

27) In a tree between every pair of vertices there is ?<\/strong>
a.\u00a0\u00a0 \u00a0Exactly one path
b.\u00a0\u00a0 \u00a0A self loop
c.\u00a0\u00a0 \u00a0Two circuits
d.\u00a0\u00a0 \u00a0n number of paths
\u00a0
Answer = A<\/strong><\/p>\n","protected":false},"excerpt":{"rendered":"

1) A graph is a collection of…. ? a.\u00a0\u00a0 \u00a0Row and columns b.\u00a0\u00a0 \u00a0Vertices and edges c.\u00a0\u00a0 \u00a0Equations d.\u00a0\u00a0 \u00a0None of these Answer = B \u00a0 2)\u00a0 The degree of any vertex of graph is …. ? a.\u00a0\u00a0 \u00a0The number of edges incident with vertex b.\u00a0\u00a0 \u00a0Number of vertex in a graph c.\u00a0\u00a0 \u00a0Number of…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"footnotes":""},"categories":[22],"tags":[],"class_list":["post-221","post","type-post","status-publish","format-standard","hentry","category-computer-science-combined"],"_links":{"self":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts\/221","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=221"}],"version-history":[{"count":0,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts\/221\/revisions"}],"wp:attachment":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=221"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=221"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=221"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}