Is an undirected graph consisting only two connected vertices cyclic?
(1.) No, undirected cycles are also natural.

(2.) No, what you describe is a path on two vertices. It does not form a cycle, since by definition, you cannot find a subset of the edges that form a path where the first node of the path corresponds to the last.

To be sure about these type of things, you must always look at the definitions.