Data

Question 1

is a very simple search algorithm. In this type of search, a sequential search is made over all items one by one. Every item is checked and if a match is found then that particular item is returned, otherwise the search continues till the end of the data collection.

Answer 1

Linear search

Question 2

is an improved variant of binary search. This search algorithm works on the probing position of the required value.

Answer 2

Interpolation search

Question 3

is a fast search algorithm with run-time complexity of Ο (log n). This search algorithm works on the principle of divide and conquer.

Answer 3

Binary search

Question 4

refers to arranging data in a particular format. Sorting algorithm specifies the way to arrange data in a particular order. Most common orders are in numerical or lexicographical order.

Answer 4

Sorting

Question 5

directory stores the telephone numbers of people sorted by their names, so that the names can be searched easily.

Answer 5

Telephone Directory

Question 6

tores words in an alphabetical order so that searching of any word becomes easy.

Answer 6

Dictionary

Question 7

these algorithms do not require any extra space and sorting is said to happen in-place, or for example, within the array itself

Answer 7

In-Place Sorting

Question 8

the program requires space which is more than or equal to the elements being sorted. Sorting which uses equal or more space

Answer 8

Not In-Place Sorting

Question 9

does not change the sequence of similar
content in which they appear

Answer 9

Stable Sorting

Question 10

changes the sequence of similar content
in which they appear

Answer 10

Unstable Sorting

Question 11

is a simple sorting algorithm. This sorting algorithm is comparison-based algorithm in which each pair of adjacent elements is compared and the elements are swapped if they are not in order. This algorithm is not suitable for large data sets as its average and worst case complexity are of O(n2) where n is the number of items.

Answer 11

Bubble sort

Question 12

An element which is to be ‘inserted’ in this sorted sub-list, has to find its appropriate place and then it has to be inserted there.
The array is searched sequentially and unsorted items are moved and inserted into the sorted sub-list (in the same array). This algorithm is not suitable for large data sets as its average and worst case complexity are of Ο(n2), where n is the number of items.

Answer 12

Insertion Sort

Question 13

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

Answer 13

graph

Question 14

the interconnected objects are represented by points termed. Each node of the graph is represented as a vertex.

Answer 14

Vertices

Question 15

the links that connect the vertices. Edge represents a path between two vertices or a line between two vertices.

Answer 15

Edges

Question 16

Two node or vertices are adjacent if they are connected to each other through an edge.

Answer 16

Adjacency

Question 17

represents a sequence of edges between the two vertices.

Answer 17

Path

Question 18

What are the 3 basic operations

Answer 18

Add vertex
Add edges
Display Vertix

Question 19

Adds a vertex to the graph.

Answer 19

Add Vertex

Question 20

Adds an edge between the two vertices of the graph.

Answer 20

Add Edge .

Question 21

Displays a vertex of the graph.

Answer 21

Display Vertex

Question 22

algorithm traverses a graph in a depthward motion and uses a stack to remember to get the next vertex to start a search, when a dead end occurs in any iteration.

Answer 22

Depth First Search (DFS)

Question 23

algorithm traverses a graph in a breadthward motion and uses a queue to remember to get the next vertex to start a search, when a dead end occurs in any iteration.

Answer 23

Breadth First Search (BFS)

Question 24

represents the nodes connected by edges. We will discuss binary tree or binary search tree specifically.

Answer 24

Tree

Question 25

s a special data structure used for data storage purposes. A binary tree has a special condition that each node can have a maximum of two children. A binary tree has the benefits of both an ordered array and a linked list as search is as quick as in a sorted array and insertion or deletion operation are as fast as in linked list.

Answer 25

Binary Tree

Question 26

refers to the sequence of nodes along the edges of a tree

Answer 26

Path

Question 27

The node at the top of the tree is called root. There is only one root per tree and one path from the root node to any node.

Answer 27

Root

Question 28

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

Answer 28

Parent

Question 29

The node below a given node connected by its edge downward is called its child node.

Answer 29

Child

Question 30

The node which does not have any child node is called the leaf node.

Answer 30

Leaf

Question 31

represents the descendants of a node.

Answer 31

Subtree

Question 32

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

Answer 32

Visiting

Question 33

means passing through nodes in a specific order.

Answer 33

Traversing

Question 34

a node represents the generation of a node. If the root node is at level 0, then its next child node is at level 1, its grandchild is at level 2, and so on.

Answer 34

Levels

Question 35

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

Answer 35

Keys

Question 36

is a collection of nodes arranged in a way where they maintain BST properties. BST divides all its sub-trees into two segments; the left sub-tree and the right sub-tree.

Answer 36

BST

Question 37

BST Basic Operations

Answer 37

Insert
Search
Pre-order Traversal
In-order Traversal
Post-order Traversal

Question 38

an element in a tree/create a tree.

Answer 38

Insert

Question 39

an element in a tree.
.

Answer 39

Search

Question 40

Traverses a tree in a pre-order manner.

Answer 40

Pre-order Traversal

Question 41

Traverses a tree in an in-order manner.

Answer 41

.In-order Traversal

Question 42

Traverses a tree in a post-order manner.

Answer 42

Post-order Traversal

Question 43

is a process to visit all the nodes of a tree and may print their values too. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree:

Answer 43

Traversal

Question 44

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

Answer 44

In-order Traversal

Question 45

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

Answer 45

Pre-order Traversal

Question 46

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 46

Post-order Traversal