Part 3 ITE6201 Data Structures and Algorithm Analysis

 Part 3 ITE6201 Data Structures and Algorithm Analysis

Graph G is _____________ if for any pair u, v of nodes in G, there is a path from u to v or path from v to u.

Select one:
If a graph has a directional flow, the graph is defined to be ______________
Select one:

Every node N in a binary tree T except the root has a unique parent called the ________ of N.

Select one:

In binary trees, nodes with no successor are called _______________.

Select one:

Another name for directed graph.

Select one:

A connected graph T without any cycles is called a ____________.

Select one:

A connected graph T without any cycles is called ________________.

Select one:
The data structure that stores data in the form of key and value pairs where every key is unique.
Select one:
The data structure that consists of finite set of _____________which are also called nodes.
Select one:

Trees are ________ if they are similar and have the same contents at corresponding nodes.

Select one:

Feedback

Linked representation of binary tree needs ______ parallel arrays.

Select one:

In a graph, if e=[u,v], then u and v are called _______________

Select one:

TREE[1]=NULL indicates tree is _________

Select one:

What does the sequential representation of binary trees use?

Select one:

This is a terminal node in a binary tree.

Select one:

The depth of complete binary tree is given by ________________.

Select one:

Which indicates pre-order traversal?

Select one:

This is a binary tree whose every node has either zero or two children.

Select one:

In a 2-tree, nodes with 0 children are called ___________.

Select one:
the upward movement of the newly inserted entry by means of swaps is conventionally called __________________
Select one:

In an extended binary tree, nodes with 2 children are called _________________.

Select one:

In a graph, if E=(u,v), it means _____________.

Select one:
in _____________ the parent should always be greater or equal than the child nodes.
Select one:
after creating a Max Heap we then swap the first node to the last node and delete ________________.
Select one:
Algorithm that finds the location of the smallest element in the unsorted portion of the list and moves it to the top of the unsorted portion of the list
Select one:
The terms depth-first and breadth-first are two most common graph ______________ algorithm
Select one:
The operation commonly performed in graphs that store the graph in computer memory using a particular graph representation is called ________________
Select one:
Marked the birth of graph theory
Select one:
Graphs consists of the following :
Select one:
To represent a graph (in computer memory), we can use _______________________.
Select one: