If every node u in G is adjacent to every other node v in G, A graph is said to be _______.

Related MCQs

• If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
• A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.
• If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
• A graph is a tree if and only if graph is
• Any node is the path from the root to the node is called
• node.next -> node.next.next; will make
• What is the functionality of the following code? Choose the most appropriate answer. public int function() { if(head == null) return Integer.MIN_VALUE; int var; Node temp = head; Node cur; while(temp.getNext() != head) { cur = temp; temp = temp.getNext(); } if(temp == head) { var = head.getItem(); head = null; return var; } var = temp.getItem(); cur.setNext(head); return var; }
• If in a linked list address of first node is 1020 then what will be the address of node at 5th position ?
• A linked list whose last node points back to the list node instead of containing the null pointer________.
• A _________is a linked list which always contains a special node called the header node, at the beginning of the list.