Discrete Structures (NTANET (Based on NTAUGC) Computer Science (PaperII)): Questions 1  3 of 56
Access detailed explanations (illustrated with images and videos) to 2012 questions. Access all new questions we will add tracking exampattern and syllabus changes. Subscription can be renewed yearly absolutely FREE! View Sample Explanation or View Features.
Rs. 550.00 or
How to register?
Question number: 1
» Discrete Structures » Graph » Hamiltonian and Eulerian Graphs, Planar Graphs
Appeared in Year: 2013
Question
Which of the following statement (s) is/are false?
 A connected multigraph has an Euler Circuit if and only if each of its vertices has even degree.
 A connected multigraph has an Euler Path but not an Euler Circuit if and only if it has exactly two vertices of odd degree.
 A complete graph (K_{N}) has a Hamilton Circuit whenever n≥3
 A cycle over six vertices (C_{6}) is not a bipartite graph but a complete graph over 3 vertices is bipartite. (Dec)
Choices
Choice (4)  Response  

a.  (1) only 

b.  (2) and (3) 

c.  (3) only 

d.  (4) only 

Question number: 2
» Discrete Structures » Graph » Spanning Trees
Appeared in Year: 2015
Question
A tree with n vertices is called graceful, if its vertices can be labelled with integers 1,2, …, n such that the absolute value of the difference of the labels of adjacent vertices are all different. Which of the following trees are graceful?
Choices
Choice (4)  Response  

a.  (a) and (c) 

b.  (b) and (c) 

c.  (a), (b) and (c) 

d.  (a) and (b) 

Question number: 3
» Discrete Structures » Groups » Finite Fields and Error Correcting Codes
Appeared in Year: 2015
Question
Which of the following properties a Group G must hold, in order to be an Abelian group?
(1) The distributive property
(2) The commutative property
(3) The symmetric property (December)
Choices
Choice (4)  Response  

a.  (2) only 

b.  (2) and (3) 

c.  (1) and (2) 

d.  (1) only 
