AMA University Answers
Login
Register
AMA OED
Courses
ITE
ITE-6201
In a graph, if E=(u,v), it mea...
In a graph, if E=(u,v), it means _____________.
u is adjacent to v but v is not adjacent to u
e begins at processor u and ends at successor v
Correct
e begins at processor v and ends at successor u
v is adjacent to u but u is not adjacent to v
Similar ITE-6201 questions
in the parent should always be greater or equal than the child nodes.
In a linked list, the contains the address of next element in the list.
In linked representation of stack, fields hold the elements of the stack.
In the linked representation of the stack, pointer behaves as the top pointer variable of stack.
In a graph, if e=[u,v], then u and v are called
In a 2-tree, nodes with 0 children are called .