ITEC33(finals)

Question 1

It is a pictorial representation of a set of objects where some of objects are connected by links.

Answer 1

Graph

Question 2

The interconnected objects are represented by points.

Answer 2

Vertices

Question 3

Links that connect the vertices.

Answer 3

Edges

Question 4

Two nodes or vertices are adjacent of they are connected to each other through an edge.

Answer 4

Adjacency

Question 5

It represents a sequence of edges between the two vertices.

Answer 5

Path

Question 6

Adds a vertex to the graph

Answer 6

Add Vertex

Question 7

Adds an edge between the two vertices of the graph.

Answer 7

Add Edge

Question 8

Displays a vertex of the graph.

Answer 8

Display Vertex

Question 9

Algorithm traverse a graph in a depthward motion and uses a stack to remember to get the next vertex to start a search.

Answer 9

Depth First Search (DFS)

Question 10

Algorithm traverse a graph in a breadthward motion and uses a queue to remember to get the next vertex to start a search.

Answer 10

Bread First Search(BFS)

Question 11

Represents the nodes connected by edges.

Answer 11

Tree

Question 12

Refers to the sequence of nodes along the edges of a tree.

Answer 12

Path

Question 13

The node at the top of the tree.

Answer 13

Root

Question 14

Any node except the root node has one edge upward to a node.

Answer 14

Parent

Question 15

The node below a given node connected by each edge downward.

Answer 15

Child

Question 16

The node which does not have any child node.

Answer 16

Leaf

Question 17

Represents the descendants of a node.

Answer 17

Subtree

Question 18

Refers to the checking the value of a node when control is on a node.

Answer 18

Visiting

Question 19

It means passing through nodes in a specific order.

Answer 19

Traversing

Question 20

It represents the generation of a node.

Answer 20

Levels

Question 21

It represents a value of a node based on which operation is to be carried out for a node.

Answer 21

Keys

Question 22

Inserts an element in a tree/ create a tree.

Answer 22

Insert

Question 23

Searches an element in a tree.

Answer 23

Search

Question 24

Traverses a tree in a pre-order manner.

Answer 24

Preorder Traversal

Question 25

Traverses a tree in a in-order manner.

Answer 25

Inorder Traversal

Question 26

Traverses a tree in a post-order manner.

Answer 26

Postorder Traversal

Question 27

Is a process to visit all the nodes of a tree and may print their values too.

Answer 27

Tree Traversal

Question 28

In this traversal method, the first subtree is visited first, then the root and later the right subtree.

Answer 28

In-Order Tree Traversal

Question 29

In this traversal method, the root node is visited first, then the left subtree and finally the right subtree.

Answer 29

Pre-Order Traversal

Question 30

In this traversal method, the root node is visited last, hence the name. First we traverse the left subtree, then the right subtree and finally the root node.

Answer 30

Post-Order Traversal

Question 31

It is a hierarchical data structure in which node has at most two children generally referred as left child and right child.

Answer 31

Binary Tree

Question 32

It has a root node and every node has at most 2 children.

Answer 32

Rooted Binary Tree

Question 33

It is a tree in which every node in the tree has either 0 or 2 children.

Answer 33

Full Binary Tree

Question 34

It is a binary tree in which all interior nodes have two children and all levels have the same depth or same level.

Answer 34

Perfect Binary Tree

Question 35

It is a binary tree in which every level, except possible the last, is completely filled, and all nodes are as far left as possible.

Answer 35

Complete Binary Tree

Question 36

A binary tree is height balanced if it satisfies the following concept.

Answer 36

Balance Binary Tree

Question 37

It is a tree where each parent node has only 1 child node. It behaves like a linked list.

Answer 37

Degenerate Tree

Question 38

A tree whose elements have at most 2 children is called a binary tree. Since each element in a binary tree can have only 2 children, we typically named them the left and right child.

Answer 38

Binary Tree Data Structure

Question 39

Always initiate analyzing tree at the root node and then move further to either the right or left subtree of the root node depending upon the elements to be located is either less or greater than the root.

Answer 39

Search Operation

Question 40

First, the root node is inserted, then the next value is compared with the root node. If the value is greater than root, it is added to the right subtree, and if it is lesser than the root, it is added to the left subtree.

Answer 40

Insert Operation

Question 41

It is the most advanced and complex among all other operation.

Answer 41

Delete Operation