Coding Skills - Graph 1

The process of adding an element into stack is called: ________

• Create

• Evaluation

• Pop

• Push

What is the result of this operation in stack S?

S.top(S.push(x))

• Null

• x

• S

• None

Two variables used in queue are ____

• top and down

• rear and front

• left and right

• rear and top

Consider these operations in a stack:

push(1) -> pop() -> push(2) -> push(3) -> pop() -> push(4) ->push(5);

How many elements remain in stack?

• 2

• 4

• 1

• 3

The operation of adding and removing an element from a queue are:

• enque and deque

• push and pop

• enqueue and pop

• enqueue and dequeue

Basic operations on a queue including:

• dequeue()

• All is correct

• isFull()

• enqueue()

• peek()

In the given graph identify the cut vertices.

• A and D

• E and D

• B and C

• C and E

Euler paths must touch

• all edges

• all vertices

• some edges

• some vertices

A graph is connected if

• Each vertex can reach any other vertex

• each vertex is adjacent to every other vertex

• All the vertices are odd

• the length of all the edges are equal

The degree of a vertex in undirected graph is

• The number of vetices directly connected to that vertex

• is the number of edges that connect to that vertex

• the number of loops

• how many times it can be part of a path