Data Structures and Analysis Multiple Choice review

Distant learning course. This is a self-taught open-book test. I
have read the book over & over, I even found a PDF version and
searched it. I've combed the net and found some good resources like
NIST.gov. After my other tests I have asked the on-line instructor
for references, or even the correct anwser to what I missed. She has
proved useless.I have a few here I would like some opinions on, i have
tried on my own, but would like some tutoring .

1. A cyclic graph has:

a. a shape like a unicycle
b. a graph that cycles from vertices to edges
c. a cycle of two or more nodes
d. a cycle of three or more nodes
e. None of the above

I'd say d, because a cycle graph consists of a single cycle (some
number of vertices connected in a closed chain)


2. A(n) _______________________ graph is a graph in which each vertex
has a connection to every other vertex.

a. directed
b. cyclic
c. acyclic
d. fully connected
e. None of the above

I'd say e, because I belive it should be either a connected graph or a
strongly connected graph, depending on where you read about it. Fully
connected sounds close, but I can't find a single reference to that.


3. A(n) ____________________ is a graph in which each connection has
two directions.

a. undirected graph
b. bigraph
c. bidirectional graph
d. TS graph
e. None of the above

I'd say e, I've found no graph that has an edge going both ways

yogi_bear_79 wrote:And what, precisely, was your C++ language question/

On May 19, 9:01*pm, red floyd <no.s...@here.dudewrote:
The Class is Data Structures and Algorithm Analysis in C++, are you
saying this isn't the best group for such discussion? And I didn't
ask for anyone to do my home work, I explained each of my anwsers and
asked for some guidence.

On May 20, 9:16 am, yogi_bear_79 <yogi_bear...@yahoo.comwrote:Actually, these questions have nothing to do with C++.
They are all language independent data structures questions.

Here is not a good place to ask these questions,
and I don't know a good group to discuss algorithm and DS.

Anyway, let me try to answer them:
1. c. For a graph with two vertices u, v,
if there are two edges connect u-v and v-u, the graph is cyclic.

2. e. strongly connected graph

3. a. If a edge is from u->v, and at the same time v->u,
there is no direction.

On 2008-05-20 05:35, Lambda wrote:When it comes to graph theory a math-group would be a good place, or you
could try in comp.programming.

--
Erik Wikström