An edge E is called _________ if it has identical endpoints.

Related MCQs

• A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
• A linear list in which each node has pointers to point to the predecessor and successors nodes is called as
• In a directed tree any node which has out degree 0 is called a terminal node or__________.
• A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
• Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.
• A ……….. is a graph that has weights of costs associated with its edges.
• A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
• Each node in a linked list has two pairs of ………….. and ……………….
• Consider a standard Circular Queue 'q' implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are q[0], q[1], q[2].....,q[10]. The front and rear pointers are initialized to point at q[2] . In which position will the ninth element be added?
• If binary trees are represented in arrays, what formula can be used to locate a left child, if the node has an index i?