Course Blooms

S.
Question Outcom Taxanom
No.
e y Level
1 What is a data structure?
● A data structure is a method for organizing and storing
data which would allow efficient
data retrieval and usage.
● A data structure is a way of organizing data that considers C204.1
BTL1
not only the items stored, but
also their relationships to each other.

2 Why do we need data structures?

● Data structures allow us to achieve an important goal:
component reuse.
● Once data structure has been implemented, it can be used C204.1 BTL 1
again and again in
various applications.

3 List some common data structures.

● Stacks
● Queues
● Lists
C204.1 BTL 1
● Trees
● Graphs
● Tables

4 How data structures are classified?

Data structures are classified into two categories based on
how the data items are
C204.1 BTL 1
operated:
i. Primitive data structure
ii. Non-Primitive data structure

a. Linear data structure

b. Non-linear data structure
5 Differentiate linear and non-linear data structure. C204.1

BTL 2

6 Define ADT (Abstract Data Type)

An abstract data type (ADT) is a set of operations and
mathematical abstractions , which
can be viewed as how the set of operations is implemented.
C204.1 BTL 1
Objects like lists, sets and graphs, along with their operation, can
be viewed as abstract data types, just as integers, real numbers
and Booleans.

7 Mention the features of ADT.

a. Modularity
i. Divide program into small functions
ii. Easy to debug and maintain
iii. Easy to modify C204.1 BTL 2
b. Reuse
i. Define some operations only once and reuse them in future
c. Easy to change the implementation

8 Define List ADT

A list is a sequence of zero or more elements of a given BTL 1
type. The list is represented as
C204.1
sequence of elements separated by comma.
A1, A2, A3…..AN
Where N>0 and A is of type element
9 What are the ways of implementing linked list?
The list can be implemented in the following ways:
C204.1 BTL 1
i. Array implementation
ii. Linked-list implementation
Linear data structure Non-linear data structure
Data are arranged in linear or Data are not arranged in linear
sequential manner manner

Every items is related to its Every item is attached with

previous many other
and next item items

Data items can be traversed in Data items cannot be traversed

a in a
single run. single run.

Implementation is easy Implementation is difficult.

Example: array, stack, queue, Example: tree, graph
linked
list
iii. Cursor implementation
10 What are the types of linked lists?
There are three types
i. Singly linked list
ii. Doubly linked list
iii. Circularly linked list C204.1 BTL 1

11 How the singly linked lists can be represented?

C203.1 BTL 1

Each node has two elements

i. Data
ii. Next
12 How the doubly linked list can be represented?

C203.1 BTL 1
Doubly linked list is a collection of nodes where nodes are
connected by forwarded and
backward link.
Each node has three fields:
1. Address of previous node
2. Data
3. Address of next node.

13 What are benefits of ADT?

a. Code is easier to understand
b. Implementation of ADT can be changed without requiring
C203.1 BTL 1
changes to the program
that uses the ADT

14 When singly linked list can be represented as circular linked

list?
In a singly linked list, all the nodes are connected with
C203.1 BTL 1
forward links to the next nodes in
the list. The last node has a next field, NULL. In order to
implement the circularly linked

lists from singly linked lists, the last node’s next field is connected
to the first node.
15 When doubly linked list can be represented as circular linked
list?
In a doubly linked list, all nodes are connected with
forward and backward links to the
next and previous nodes respectively. In order to implement
circular linked lists from
doubly linked lists, the first node’s previous field is connected to
the last node and the
last node’s next field is connected to the first node. C203.1 BTL 1

16 Where cursor implementation can be used?

The cursor implementation of lists is used by many
languages such as BASIC and
FORTRAN that do not support pointers. The two important
features of the cursor
implementation of linked are as follows:
● The data are stored in a collection of structures. Each C203.1 BTL 1
structure contains data and a
index to the next structure.
● A new structure can be obtained from the system’s global
memory by a call to
cursorSpace array.

17 List down the applications of List.

a. Representation of polynomial ADT
b. Used in radix and bubble sorting
c. In a FAT file system, the metadata of a large file is
organized as a linked list of FAT entries. C203.1 BTL 1
d. Simple memory allocators use a free list of unused
memory regions, basically a
linked list with the list pointer inside the free memory itself.

18 What are the advantages of linked list?

a. Save memory space and easy to maintain
C203.1 BTL 1
b. It is possible to retrieve the element at a particular index
c. It is possible to traverse the list in the order of increasing index.

d. It is possible to change the element at a particular index to a

different value,without affecting any other elements.
19 Mention the demerits of linked list
a. It is not possible to go backwards through the list
C203.1 BTL 2
b. Unable to jump to the beginning of list from the end.

20 The polynomial equation can be represented with linked list C203.1 BTL 2
as follows:

struct polynomial
{
int coefficient;int exponent;struct polynomial *next;
};
21 What are the operations performed in list?
The following operations can be performed on a list
i. Insertion
a. Insert at beginning
b. Insert at end
c. Insert after specific node
d. Insert before specific node
ii. Deletion C203.1 BTL 1
a. Delete at beginning
b. Delete at end
c. Delete after specific node
d. Delete before specific node
iii. Merging
iv. Traversal

22 What are the merits and demerits of array implementation of

lists?
Merits
● Fast, random access of elements
● Memory efficient – very less amount of memory is
required
Demerits C203.1 BTL 1
● Insertion and deletion operations are very slow since the
elements should be
moved.
● Redundant memory space – difficult to estimate the size of
array.

23 What is a circular linked list?

A circular linked list is a special type of linked list that
supports traversing from the end C203.1 BTL 1
of the list to the beginning by making the last node point back to
the head of the list.
Coefficient Exponent Next node link

24 What are the advantages in the array implementation of list?

a. Print list operation can be carried out at the linear time
C203.1 BTL 1
b. Find Kth operation takes a constant time

25 What is the need for the header?

Header of the linked list is the first element in the list and
it stores the number of elements in the list. It points to the first C203.1 BTL 1
data element of the list.

26 List three examples that uses linked list?

a. Polynomial ADT
b.Radix sort C203.1 BTL 1
c.Multi lists

27 List out the different ways to implement the list?

1. Array Based Implementation
2. Linked list Implementation
i. Singly linked list C203.1 BTL 1
ii. Doubly linked list
iii. Cursor based linked list

28 Write the routine for insertion operation of singly linked list.

Void Insert (ElementType X, List L, Position P)
{Position TmpCell;
TmpCell=malloc(sizeof(struct Node));
if(TmpCell==NULL) BTL 5
C203.1
FatalError(“Out of space!!!”);
TmpCell->Element =X; TmpCell->Next=P->Next;
P->Next=TmpCell;
}

29 Advantages of Array over Linked List.

1. Array has a specific address for each element stored in it
and thus we can access any memory directly. C203.1
BTL 5
2. As we know the position of the middle element and other
elements are easily accessible too, we can easily perform
BINARY SEARCH in array.
30 Disadvantages of Array over Linked List.
1. Total number of elements need to be mentioned or the
memory allocation needs to be done at the time of array
creation C203.1 BTL 5
2. The size of array, once mentioned, cannot be increased in
the program. If number of elements entered exceeds the
size of the array ARRAY OVERFLOW EXCEPTION
occurs.

31 Advantages of Linked List over Array.

1. Size of the list doesn't need to be mentioned at the
beginning of the program.
C203.1 BTL 5
2. As the linked list doesn't have a size limit, we can go on
adding new nodes (elements) and increasing the size of
the list to any extent.

32 Disadvantages of Linked List over Array.

1. Nodes do not have their own address. Only the address of
the first node is stored and in order to reach any node, we
need to traverse the whole list from beginning to the
desired node.
C203.1 BTL 5
2. As all Nodes don't have their particular address, BINARY
SEARCH cannot be performed
S. Question Course Blooms
No. Outcome Taxanomy
Level
1 Define Stack.
A stack is an ordered list in which all insertions and
deletions are made at one end, called C203.2 BTL 1
the top. It is an abstract data type and based on the principle of
LIFO (Last In First Out).
2 What are the operations of the stack?
a. CreateStack/ InitStack(Stack) – creates an empty stack
b. Push(Item) – pushes an item on the top of the stack
C203.2
c. Pop(Item) – removes the top most element from the stack BTL 1
d. Top(Stack) – returns the first element from the stack
e. IsEmpty(Stack) – returns true if the stack is empty

3 Write the routine to push a element into a stack.

Push(Element X, Stack S)
{ if(IsFull(S)
C203.2
{ Error(“Full Stack”); } BTL 5
else
S→Array[++S→TopOfStack]=X;
}
4 How the operations performed on linked list implementation
of stack?
a. Push and pop operations at the head of the list. C203.2
BTL 1
b. New nodes should be inserted at the front of the list,
so that they become the top of the stack.
c. Nodes are removed from the front(top) of the stack.
5 What are the applications of stack?
The following are the applications of stacks
• Evaluating arithmetic expressions
C203.2
• Balancing the parenthesis BTL 1
• Towers of Hanoi
• Functio
n calls Tree
traversal
6 What are the methods to implement stack in C?
The methods to implement stacks are: C203.2
BTL 1
● Array based
● Linked list based
7 How the stack is implemented by linked list?
It involves dynamically allocating memory space at run
time while performing stack
operations.
C203.2
Since it consumes only that much amount of space is required BTL 1
for holding its data
elements , it prevents wastage of memory space.
struct stack
{

int element;
struct stack *next;
}*top;
8 Write the routine to pop a element from a stack.
int pop()
{ if(top==NULL)
C203.2
{ printf(“\n Stack is empty.\n”);getch();exit(1);} BTL 5
else
{int temp;
temp=top→element; top=top→next; return temp; }}
9 Define queue.
It is a linear data structure that maintains a list of
C203.2
elements such that insertion happens at BTL 1
rear end and deletion happens at front end.
FIFO – First In First Out principle
10 What are the operations of a queue?
The operations of a queue are
● isEmpty()
C203.2
● isFull() BTL 1
● insert()
● delete()
● display()
11 Write the routine to insert a element onto a queue.
void insert(int element)
{
if(front==-1 )
{
front = rear = front +1;
queue[front] = element;
return;
} C203.2
BTL 5
if(rear==99)
{
printf(“Queue is full”);
getch();
return;
}
rear = rear +1;
queue[rear]=element;
}
12 What are the types of queue?
The following are the types of queue:
C203.2
● Double ended queue BTL 1
● Circular queue
● Priority queue
13 Define double ended queue
C203.2
● It is a special type of queue that allows insertion and BTL 1
deletion of elements at both

Ends.
● It is also termed as DEQUE.

14 What are the methods to implement queue in C?

The methods to implement queues are: C203.2
BTL 1
● Array based
● Linked list based
15 How the queue is implemented by linked list?
• It is based on the dynamic memory management
techniques which allow allocation and
De-allocation of memory space at runtime.
Insert operation
It involves the following subtasks:
1. Reserving memory space of the size of a queue element
in memory
2. Storing the added value at the new location C203.2
BTL 1
3. Linking the new element with existing queue
4. Updating the rear pointer
Delete operation
It involves the following subtasks:
1. Checking whether queue is empty
2. Retrieving the front most element of the queue
3. Updating the front pointer
4. Returning the retrieved value

16 Write the routine to delete a element from a queue

int del()
{int i;
if(front == NULL) /*checking whether the queue is empty*/ C203.2
BTL 5
{return(-9999);}
else
{i = front→element;front = front→next;return i;}
}
17 What are the applications of queue?
The following are the areas in which queues are applicable
a. Simulation
b. Batch processing in an operating systems
C203.2
c. Multiprogramming platform systems BTL 1
d. Queuing theory
e. Printer server routines
f. Scheduling algorithms like disk scheduling , CPU scheduling
g. I/O buffer requests
18 Define circular queue
A Circular queue is a queue whose start and end locations are
logically connected with
each other. That means the start location comes after the end
location.

C203.2
BTL 1

19 What are push and pop operations?

C203.2
• Push – adding an element to the top of stack BTL 1
• Pop – removing or deleting an element from the top of stack
20 What are enqueue and dequeue operations?
• Enqueue - adding an element to the queue at the rear end
If the queue is not full, this function adds an element to
the back of the queue, else it prints “OverFlow”.
void enqueue(int queue[], int element, int& rear, int arraySize) {
if(rear == arraySize) // Queue is full
printf(“OverFlow\n”);
else{
queue[rear] = element; // Add the element to the back
rear++;
}
BTL 1
} C203.2
• Dequeue – removing or deleting an element from the
queue at the front end
If the queue is not empty, this function removes the
element from the front of the queue, else it prints “UnderFlow”.
void dequeue(int queue[], int& front, int rear) {
if(front == rear) // Queue is
empty printf(“UnderFlow\n”);
else {
queue[front] = 0; // Delete the front element
front++;
}
}
21 Distinguish between stack and queue. C203.2 BTL4

STACK QUEUE

Insertion and deletion are made Insertion at one end rear and
at one end. deletion at other end front.
 The element inserted last would The element inserted first
be removed first. So LIFO would be removed first. So
structure. FIFO structure.

Full stack condition: Full stack condition:

If(top==Maxsize) If(rear = = Maxsize)

Physically and Logically full Logically full. Physically

stack may or may not be full.

22 Convert the infix (a+b)*(c+d)/f into postfix & prefix

expression

Postfix :ab+cd+*f/ C203.2

BTL5
Prefix :/*+ab+cdf

23 Write postfix from of the expression –A+B-C+D?

C203.2
BTL5
A-B+C-D+

24 How do you test for an empty queue?

To test for an empty queue, we have to check whether
READ=HEAD where REAR is a pointer pointing to the last C203.2
BTL1
node in a queue and HEAD is a pointer that pointer to the
dummy header. In the case of array implementation of queue, the
condition to be checked for an empty queue is READ<FRONT.
25 What are the postfix and prefix forms of the expression?
A+B*(C-D)/(P-R) C203.2
BTL1
Postfix form: ABCD-*PR-/+
Prefix form: +A/*B-CD-PR
26 Explain the usage of stack in recursive algorithm
implementation?
In recursive algorithms, stack data structures is used to
C203.2
store the return address when a recursive call is encountered and BTL5
also to store the values of all the parameters essential to the
current state of the procedure.

27 Define priority queue with diagram and give the operations.

Priority queue is a data structure that allows at least the
following two operations. C203.2
BTL1
1. Insert-inserts an element at the end of the list called the rear.
2. DeleteMin-Finds, returns and removes the minimum
element in the priority Queue.
 Operations: Insert, DeleteMin
28 Give the applications of priority queues.
There are three applications of priority queues
1. External sorting. C203.2
BTL3
2. Greedy algorithm implementation.
3. Discrete even simulation.
4. Operating systems.
29 How do you test for an empty stack?
To check if the stack is empty, we only need to check
C203.2
whether top and bottom are the same number. BTL1
bool stack_empty(stack S) //@requires is_stack(S);
{ return S->top == S->bottom; }
30 What are the features of stacks?
● Dynamic data structures
● Do not have a fixed size
● Do not consume a fixed amount of memory C203.2
BTL1
● Size of stack changes with
each push() and pop() operation.
Each push() and pop() operation increases and decreases
the size of the stack by 1, respectively.
31 Write a routine for IsEmpty condition of queue.
If a queue is empty, this function returns 'true', else it returns
'false'.
bool isEmpty(int front, int rear) { C203.2
BTL5
return (front == rear);
}

Blooms
S. Course
Question Taxanomy
No. Outcome
Level
1 Define non-linear data structure
Data structure which is capable of expressing more
C203.3 BTL1
complex relationship than that of physical adjacency is called
non-linear data structure.
2 Define tree?
C203.3
A tree is a data structure, which represents hierarchical BTL1
relationship between individual data items.
3 Define leaf?
C203.3
In a directed tree any node which has out degree o is BTL1
called a terminal node or a leaf.
4 Explain the representations of priority queue. C203.3
BTL2
Using Heap structure, Using Linked List
5 List out the steps involved in deleting a node from a binary
search tree.
1. t has no right hand child node t->r == z
2. t has a right hand child but its right hand child node has C203.3
BTL1
no left sub tree
t->r->l == z
3. t has a right hand child node and the right hand child
node has a left hand child node t->r->l != z
6 Convert the infix expression (A-B/C)*(D/E-F) into a postfix. C203.3
BTL2
Postfix: ABC/-DE/F-*
7 What are the steps to convert a general tree into binary tree? C203.3
BTL1
* use the root of the general tree as the root of the binary tree

* determine the first child of the root. This is the leftmost

node in the general tree at the next
level
* insert this node. The child reference of the parent node
refers to this node
* continue finding the first child of each parent node and
insert it below the parent node with the
child reference of the parent to this node.
* when no more first children exist in the path just used,
move back to the parent of the last node
entered and repeat the above process. In other words,
determine the first sibling of the last
node entered.
* complete the tree for all nodes. In order to locate where
the node fits you must search for the
first child at that level and then follow the sibling references to
a nil where the next sibling can
be inserted. The children of any sibling node can be inserted
by locating the parent and then
inserting the first child. Then the above process is repeated.
What is meant by directed tree?
C203.3
8 ed tree is an acyclic diagraph which has one node called its root BTL1
with in degree o while all other nodes have in degree I.
9 What is a ordered tree?
C203.3
In a directed tree if the ordering of the nodes at each level is BTL1
prescribed then such a tree is called ordered tree.
10 What are the applications of binary tree?
1. Binary tree is used in data processing. C203.3
BTL1
2. File index schemes
3. Hierarchical database management system
11 What is meant by traversing?
C203.3
Traversing a tree means processing it in such a way, that each BTL1
node is visited only once.
12 What are the different types of traversing?
The different types of traversing are
C203.3
a. Pre-order traversal-yields prefix form of expression. BTL1
b. In-order traversal-yields infix form of expression.
c. Post-order traversal-yields postfix form of expression.
13 What are the two methods of binary tree implementation?

Two methods to implement a binary tree are C203.3

BTL1
a. Linear representation.
b. Linked representation
14 What is a balance factor in AVL trees?
Balance factor of a node is defined to be the difference C203.3
BTL1
between the height of the node's left subtree and the height of the
node's right subtree.

15 What is meant by pivot node?

The node to be inserted travel down the appropriate branch track C203.3
BTL1
along the way of the deepest level node on the branch that has a
balance factor of +1 or -1 is called pivot node.
16 What is the length of the path in a tree?
C203.3
The length of the path is the number of edges on the path. In a tree BTL1
there is exactly one path form the root to each node.
17 Define expression trees?
C203.3
aves of an expression tree are operands such as constants or BTL1
variable names and the other nodes contain operators.
18 What is a threaded binary tree?
A threaded binary tree may be defined as follows: "A binary
tree is threaded by making all right child pointers that would C203.3
BTL1
normally be null point to the inorder successor of the node, and
all left child pointers that would normally be null point to the
inorder predecessor of the node
19 What is meant by binary search tree?
Binary Search tree is a binary tree in which each internal
C203.3
node x stores an element such that the element stored in the left BTL2
sub tree of x are less than or equal to x and elements stored in the
right sub tree of x are greater than or equal to x.
20 Write the advantages of threaded binary tree.
The difference between a binary tree and the threaded binary tree
is that in the binary trees the nodes are null if there is no child
associated with it and so there is no way to traverse back.
But in a threaded binary tree we have threads associated with the
nodes i.e they either are linked to the predecessor or successor in
the in order traversal of the nodes. C203.3
BTL5
This helps us to traverse further or backward in the in order
traversal fashion.
There can be two types of threaded binary tree :-
1) Single Threaded: - i.e. nodes are threaded either towards
its in order predecessor or successor.
2) Double threaded: - i.e. nodes are threaded towards both the
in order predecessor and successor.
21 What is the various representation of a binary tree?
Tree Representation
C203.3
Array representation BTL1
Linked list representation

22 List the application of tree.

(i) Electrical Circuit
ii) Folder structure C203.3
BTL1
a. Binary tree is used in data processing.
b. File index schemes
c. Hierarchical database management system
23 Define binary tree and give the binary tree node structure. C203.3 BTL1

24 What are the different ways of representing a Binary Tree?

C203.3
● Linear Representation using Arrays. BTL1
● Linked Representation using Pointers.
25 Give the pre & postfix form of the expression (a +
((b*(c-e))/f).

C203.3
BTL2
26 Define a heap. How can it be used to represent a priority
queue?
A priority queue is a different kind of queue, in which the next
C203.3
element to be removed is defined by (possibly) some other BTL1
criterion. The most common way to implement a priority queue is
to use a different kind of binary tree, called a heap. A heap avoids
the long paths that can arise with binary search trees.
27 What is binary heap?
C203.3
It is a complete binary tree of height h has between 2h and 2h+1 -1 BTL1
node. The value of the root node is higher than their child nodes
28 Define Strictly binary tree?
If every nonleaf node in a binary tree has nonempty left and right C203.3
BTL1
subtrees ,the tree is termed
as a strictly binary tree.
29 Define complete binary tree?
C203.3
A complete binary tree of depth d is the strictly binary tree all of BTL1
whose are at level d.
30 What is an almost complete binary tree?
A binary tree of depth d is an almost complete binary tree if :
C203.3
_ Each leaf in the tree is either at level d or at level d-1 BTL1
_ For any node nd in the tree with a right descendant at level d,all
the left descendants of nd that are leaves are at level d.
31 Define AVL Tree.
A AVL tree is a binary search tree except that for every node in C203.3
BTL1
the tree,the height of the
left and right subtrees can differ by atmost 1.

S. Blooms
Course
N Question Taxanom
Outcome
o. y Level
1 Define Graph?
A graph G consist of a nonempty set V which is a set of
nodes of the graph, a set E which is the set of edges of the graph, C203.4 BTL1
and a mapping from the set for edge E to a set of pairs of elements
of V. It can also be represented as G= (V, E).
2 Explain the topological sort.
It is an Ordering of vertices in a directed acyclic graph such C203.4
BTL1
that if there is a path from vi to vj, then vj appears after vi in the
ordering.
3 Define NP
NP is the class of decision problems for which a given C203.4 BTL1
proposed solution for a given input can be checked quickly to see
if it is really a solution.
4 Define biconnected graph.
C203.4
A connected undirected graph is biconnected if there are no BTL1
vertices whose removal disconnects the rest of the graph.
5 Define shortest path problem?
C203.4
For a given graph G=(V, E), with weights assigned to the BTL1
edges of G, we have to find the shortest path (path length is

defined as sum of the weights of the edges) from any given source
vertex to all the remaining vertices of G.
6 Mention any two decision problems which are NP-Complete.
NP is the class of decision problems for which a given C203.4
BTL2
proposed solution for a given input can be checked quickly to see
if it is really a solution
7 Define adjacent nodes?
Any two nodes which are connected by an edge in a graph are
C203.4 BTL1
called adjacent nodes. For E is associated with a pair of
nodes∈example, if and edge x (u,v) where u, v V, then we say that
the edge x connects the nodes u and v. ∈
8 What is a directed graph? C203.4 BTL1
A graph in which every edge is directed is called a directed graph.
9 What is a undirected graph?
C203.4
A graph in which every edge is undirected is called a directed BTL1
graph.
10 What is a loop? BTL1
C203.4
An edge of a graph which connects to itself is called a loop
or sling.
11 What is a simple graph?
A simple graph is a graph, which has not more than one edge C203.4
BTL1
between a pair of nodes than such a graph is called a simple graph.

12 What is a weighted graph?

C203.4
A graph in which weights are assigned to every edge is called a BTL1
weighted graph.
13 Define out degree of a graph? BTL1
C203.4
In a directed graph, for any node v, the number of edges which have
v as their initial node is called the out degree of the node v.
14 Define indegree of a graph?
C203.4
In a directed graph, for any node v, the number of edges which BTL1
have v as their terminal node is called the indegree of the node v.
15 Define path in a graph?
C203.4
The path in a graph is the route taken to reach terminal BTL1
node from a starting node.
16 What is a simple path?
C203.4
A path in a diagram in which the edges are distinct is called a BTL1
simple path. It is also called as edge simple.
17 What is a cycle or a circuit?
C203.4
A path which originates and ends in the same node is BTL1
called a cycle or circuit.
18 What is an acyclic graph?
C203.4
A simple diagram which does not have any cycles is called BTL1
an acyclic graph.
19 What is meant by strongly connected in a graph?
An undirected graph is connected, if there is a path from C203.4
BTL1
every vertex to every other vertex. A directed graph with this
property is called strongly connected.

20 When is a graph said to be weakly connected?

When a directed graph is not strongly connected but the C203.4
BTL1
underlying graph is connected, then the graph is said to be weakly
connected.
21 Name the different ways of representing a graph?
C203.4
a. Adjacency matrix BTL1
b. Adjacency list
22 What is an undirected acyclic graph?
When every edge in an acyclic graph is undirected, it is C203.4
BTL1
called an undirected acyclic graph. It is also called as undirected
forest.
23 What are the two traversal strategies used in traversing a graph?
C203.4
a. Breadth first search BTL1
b. Depth first search
24 What is a minimum spanning tree?
A minimum spanning tree of an undirected graph G is a C203.4
BTL1
tree formed from graph edges that connects all the vertices of G at
the lowest total cost.
25 Prove that the maximum number of edges that a graph with n
Vertices is n*(n-1)/2.
Choose a vertex and draw edges from this vertex to the
remaining n-1 vertices. Then, from these n-1 vertices, choose a C203.4
BTL5
vertex and draw edges to the rest of the n-2 Vertices. Continue this
process till it ends with a single Vertex. Hence, the total number of
edges added in graph is
(n-1)+(n-2)+(n-3)+…+1 =n*(n-1)/2.

30 Define Adjacency in graph.

Two node or vertices are adjacent if they are connected to C203.4
BTL1
each other through an edge. In the following example, B is
adjacent to A, C is adjacent to B, and so on.
31 Define Basic Operations of Graph.
Following are basic primary operations of a Graph
● Add Vertex − Adds a vertex to the graph. C203.4
BTL1
● Add Edge − Adds an edge between the two vertices of the
graph.
● Display Vertex − Displays a vertex of the graph.
32 What is Levels in graph?
Level of a node represents the generation of a node. If the C203.4
BTL1
root node is at level 0, then its next child node is at level 1, its
grandchild is at level 2, and so on.
33 What is visiting and traversing in graph.
● Visiting refers to checking the value of a node when
C203.4
control is on the node. BTL1
● Traversing means passing through nodes in a specific
order.

5 Define hashing.
C203.5
Hash function takes an identifier and computes the address of BTL1
that identifier in the hash table using some function
6 What is the need for hashing?
Hashing is used to perform insertions, deletions and find in constant C203.5
BTL1
average time.

7 Define hash function? BTL1

C203.5
Hash function takes an identifier and computes the address of that
identifier in the hash table using some function.
8 List out the different types of hashing functions?
The different types of hashing functions are,
a. The division method
C203.5
b. The mind square method BTL1
c. The folding method
d. Multiplicative hashing
e. Digit analysis
9 What are the problems in hashing?
C203.5
a. Collision BTL1
b. Overflow
10 What are the problems in hashing? BTL1
When two keys compute in to the same location or address in C203.5
the hash table through any of the hashing function then it is termed
collision.

adjacent elements are compared . Hence it is referred as

diminishing increment sort.
14 write the function in c for shellsort?
Void Shellsort(Elementtype A[ ],int N)
{
int i , j , increment ;
elementtype tmp ;
for(elementtype=N / 2;increment > 0;increment / = 2)
For( i= increment ; i <N ; i ++)
{ C203.5
BTL5
tmp=A[ ];
for( j=I; j>=increment; j - =increment)
if(tmp< A[ ]=A[j – increment];
A[ j ]=A[ j – increment];
Else
Break;
A[ j ]=tmp;
}}
15 erentiate between merge sort and quick sort?
Mergesort quick sort C203.5
BTL4
1. Divide and conquer strategy Divide and conquer strategy
2. Partition by position Partition by value
16 Mention some methods for choosing the pivot element in quick
sort?
C203.5
1. Choosing first element BTL2
2. Generate random number
3. Median of three
17 What are the three cases that arise during the left to right scan
in quick sort?
C203.5
1. I and j cross each other BTL1
2. I and j do not cross each other
3. I and j points the same position
18 What is the need of external sorting?
External sorting is required where the input is too large to fit into C203.5
BTL1
memory. So external sorting Is necessary where the program is too
large
19 What is sorting?
Sorting is the process of arranging the given items in a logical C203.5
BTL1
order. Sorting is an example where the analysis can be precisely
performed.
20 What is mergesort?
C203.5
The mergesort algorithm is a classic divide conquer strategy. The BTL1
problem is divided into two arrays and merged into single array
21 Compare the various hashing techniques.
Technique Load Factor
C203.5
Separate chaining - close to 1 BTL2
Open Addressing - should not exceed 0.5
Rehashing - reasonable load factor
22 Define collision in hashing.
When two different keys or identifiers compute into the same C203.5
BTL1
location or address in the hash table through any of the hashing
functions, then it is termed Collision.
23 Define Double Hashing.
Double Hashing is a collision-resolution technique used in open
C203.5
addressing category. In double hashing, we apply a second hash BTL1
function to x and probe at a distance of hash2 (x),
2hash2 (x)… , and so on.
24 What are applications of hashing?
The applications of hashing are,
● Compliers use hash table to keep track of declared variables
on source code. C203.5
BTL1
● Hash table is useful for any graph theory problem, where
the nodes have real names instead of numbers.
● Hash tables are used in programs that play games.
● Online spelling checkers use hashing.
25 What does internal sorting mean?
C203.5
Internal sorting is a process of sorting the data in the BTL1
main memory
26 What are the various factors to be considered in deciding a
sorting algorithm?
Factors to be considered in deciding a sorting algorithm are,
C203.5
1. Programming time BTL1
2. Executing time for program
3. Memory or auxiliary space needed for the
programs environment.
27 How does the bubble sort get its name?
C203.5
The bubble sort derives its name from the fact that the BTL1
smallest data item bubbles up to the top of the sorted array.

data with integer keys by grouping keys by the individual digits

which share the same significant position
32 Define searching
Searching refers to determining whether an element is
present in a given list of elements
or not. If the element is present, the search is considered as
C203.5
successful, otherwise it is considered as an unsuccessful search. The BTL1
choice of a searching technique is based on the following factors
a. Order of elements in the list i.e., random or sorted
b. Size of the list

33 Mention the types of searching

The types are C203.5
BTL2
● Linear search
● Binary search
34 What is meant by linear search?
Linear search or sequential search is a method for finding a
particular value in a list C203.5
BTL1
that consists of checking every one of its elements, one at a time and
in sequence, until
the desired one is found.
35 What is binary search?
For binary search, the array should be arranged in ascending or
descending order.
In each step, the algorithm compares the search key value with the
middle element of the
C203.5
array. If the key match, then a matching element has been found BTL1
and its index, or Position, is returned.
Otherwise, if the search key is less than the middle element, then
the algorithm repeats its action on the sub-array to the left of the
middle element or, if the search key is greater, on the sub-array to
the right.
36 What are the collision resolution methods?
The following are the collision resolution methods
C203.5
● Separate chaining BTL1
● Open addressing
● Multiple hashing
37 Define separate chaining
It is an open hashing technique. A pointer field is added to
each record location, when an
C203.5
overflow occurs; this pointer is set to point to overflow blocks BTL1
making a linked list. In this method, the table can never overflow,
since the linked lists are only extended upon the arrival of new
keys.
38 What is open addressing?
C203.5
Open addressing is also called closed hashing, which is an BTL1
alternative to resolve the

Collisions with linked lists. In this hashing system, if a collision

occurs, alternative cells
are tired until an empty cell is found.
There are three strategies in open addressing:
● Linear probing
● Quadratic probing
● Double hashing
39 What is Rehashing?
If the table is close to full, the search time grows and may
become equal to the table size.
When the load factor exceeds a certain value (e.g. greater than 0.5)
we do C203.5
BTL1
Rehashing: Build a second table twice as large as the original
and rehash there all the keys of the original table.
Rehashing is expensive operation, with running time O(N)
However, once done, the new hash table will have good
performance.
40 What is Extendible Hashing?
Used when the amount of data is too large to fit in main memory and
external storage is used.
N records in total to store, M records in one disk block C203.5
BTL1
The problem: in ordinary hashing several disk blocks may be
examined to find an element -
a time consuming process.
Extendible hashing: no more than two blocks are examined.