**we will update the important questions and topics soon ..here we have listed the repeated questions asked in AU question Papers**

EE2204 DATA
STRUCTURES AND ALGORITHMS 3
0 0 3

An
ADT is a set of operation. Abstract data types are mathematical
abstractions.Eg.Objects such as list, set and graph along their operations can
be
viewed as ADT’s.2. What are the operations of ADT?

Union, Intersection, size, complement and find are the
various operations of
ADT.3. What is meant by list ADT?

List
ADT is a sequential storage structure. General list of the form a1, a2,
a3.…., an and the size of the list is ‘n’. Any element in the list at the
position I is
defined to be ai, ai+1 the successor of ai and ai-1 is the predecessor of ai.4. What are the various operations done
under list ADT? a. Print list
b.Insert
c.Make empty
d.Remove
e.Next
f.Previous
g.Find kth5. What are the different ways to
implement list?
a. Simple array implementation of list
b.Linked list implementation of
list6. What are the advantages in the array
implementation of list?
a. Print list operation can be carried out at
the linear time
b. Find Kth operation takes a
constant time7. What is a linked list?

Linked
list is a kind of series of data structures, which are not necessarily
adjacent in memory. Each structure contains the element and a pointer to a
record
containing its successor.

8. What is
a pointer?

Pointer is a variable,
which stores the address of the next element in the list.
Pointer is basically a number.9. What is a doubly linked list?

In a simple linked list,
there will be one pointer named as ‘NEXT
POINTER’ to point the next element, where as in a doubly linked list, there
will be
two pointers one to point the next element and the other to point the previous
element location.10. Define double circularly linked
list?

In a doubly linked list,
if the last node or pointer of the list, point to the first
element of the list, then it is a circularly linked list.11. 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 data element of the
list.12. List three examples that uses linked
list?
a. Polynomial ADT
b.Radix sort
c.Multi lists13. Give some examples for linear data
structures? a. Stack
b.Queue14. What is a stack?

Stack is a data structure
in which both insertion and deletion occur at one
end only. Stack is maintained with a single pointer to the top of the list of
elements. The other name of stack is Last-in -First-out list.15. Write postfix from of the expression
–A+B-C+D?

A-B+C-D+16. 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 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.

In recursive algorithms,
stack data structures is used to store the return
address when a recursive call is encountered and also to store the values of
all the parameters essential to the current state of the procedure.19. Write down the operations that can
be done with queue data structure?

Queue is a first – in -first
out list. The operations that can be done with
queue are addition and deletion.20. What is a circular queue?

The queue, which wraps
around upon reaching the end of the array is called
as circular queue.

Traversing a tree means
processing it in such a way, that each node is
visited only once.8. What are the different types of
traversing?

The different types of
traversing are
a. Pre-order traversal-yields prefix from of expression.
b. In-order traversal-yields infix form of expression.
c. Post-order traversal-yields postfix from of expression.9. What are the two methods of binary
tree implementation?

Pre-order traversal
entails the following steps;
a. Process the root node
b. Process the left subtree
c. Process the right subtree11.Define post-order traversal?

Post order traversal
entails the following steps;
a. Process the left subtree
b. Process the right subtree
c. Process the root node12. Define in -order traversal?

In-order traversal
entails the following steps;
a. Process the left subtree
b. Process the root node
c. Process the right subtree13. What is a balance factor in AVL
trees?

Balance factor of a node
is defined to be the difference between the height
of the node's left subtree and the height of the node's right subtree.14. What is meant by pivot node?

The node to be inserted
travel down the appropriate branch track along the
way of the deepest level node on the branch that has a balance factor of +1 or
-1 is
called pivot node.15. What is the length of the path in a
tree?

The length of the path is
the number of edges on the path. In a tree there is
exactly one path form the root to each node.16. Define expression trees?

The leaves of an
expression tree are operands such as constants or variable
names and the other nodes contain operators.17. What is the need for hashing?

Hashing is used to
perform insertions, deletions and find in constant
average time.18. Define hash function?

Hash function takes an
identifier and computes the address of that identifier
in the hash table using some function.19. List out the different types of
hashing functions?

The different types of
hashing functions are,
a. The division method
b. The mind square method
c. The folding method
d. Multiplicative hashing
e. Digit analysis20. What are the problems in hashing?a. Collision
b. Overflow21. What are the problems in hashing?

When two keys compute in
to the same location or address in the hash table
through any of the hashing function then it is termed collision.

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, 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. Define adjacent nodes?

Any two nodes which are
connected by an edge in a graph are 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.Î3. What is a directed graph?

A graph in which every
edge is directed is called a directed graph.4. What is a undirected graph?

A graph in which every
edge is undirected is called a directed graph.5. What is a loop?

An edge of a graph which
connects to itself is called a loop or sling.6. What is a simple graph?

A simple graph is a
graph, which has not more than one edge between a
pair of nodes than such a graph is called a simple graph.7. What is a weighted graph?

A graph in which weights
are assigned to every edge is called a weighted
graph.8. Define out degree of a graph?

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.9. Define indegree of a graph?

In a directed graph, for
any node v, the number of edges which have v as
their terminal node is called the indegree of the node v.10. Define path in a graph?

The path in a graph is
the route taken to reach terminal node from a starting
node.

11. What is
a simple path?

A path in a diagram in
which the edges are distinct is called a simple path.
It is also called as edge simple.12. What is a cycle or a circuit?

A path which originates
and ends in the same node is called a cycle or
circuit.13. What is an acyclic graph?

A simple diagram which
does not have any cycles is called an acyclic
graph.14. What is meant by strongly connected
in a graph?

An undirected graph is
connected, if there is a path from every vertex to
every other vertex. A directed graph with this property is called strongly
connected.15. When is a graph said to be weakly
connected?

When a directed graph is
not strongly connected but the underlying graph is
connected, then the graph is said to be weakly connected.16. Name the different ways of
representing a graph? a. Adjacency matrix
b. Adjacency list17. What is an undirected acyclic graph?

When every edge in an
acyclic graph is undirected, it is called an undirected
acyclic graph. It is also called as undirected forest.18. What are the two traversal
strategies used in traversing a graph?a. Breadth first search
b. Depth first search19. What is a minimum spanning tree?

A minimum spanning tree
of an undirected graph G is a tree formed from
graph edges that connects all the vertices of G at the lowest total cost.20. What is NP?

NP is the class of
decision problems for which a given proposed solution
for a given input can be checked quickly to see if it is really a solution.

A data structure is a
mathematical or logical way of organizing data in the
memory that consider not only the items stored but also the relationship to
each
other and also it is characterized by accessing functions.2. What is meant by problem solving?

Problem solving is a
creative process, which needs systemization and
mechanization.3. Give few examples for data
structures?

The first step in solving
a problem is to understand problem clearly. Hence,
the first phase is the problem definition phase. That is, to extract the task
from the
problem statement. If the problem is not understood, then the solution will not
be
correct and it may result in wastage of time and effort.5. Define Algorithm?

Algorithm is a solution
to a problem independent of programming
language. It consist of set of finite steps which, when carried out for a given
set of
inputs, produce the corresponding output and terminate in a finite time.6. Define Program?

Set of instructions to
find the solution to a problem. It is expressed in a
programming language in an explicit and unambiguous manner.7. Mention how similarities among the
problems are used in problem solving?

This method is used to
find out if a problem of this sort has been already
solved and to adopt a similar method in solving the problem. The contribution
of
experience in the previous problem with help and enhance the method of problem
for the current problem.8. What is working backward from the
solution?

When we have a solution
to the problem then we have to work backward to
find the starting condition. Even a guess can take us to the starting of the
problem.
This is very important to systematize the investigation to avoid duplication of
our
effort.9. Mention some of the problem solving
strategies?

The most widely strategies
are listed below
Divide and conquer
Binary doubling strategy
Dynamic programming10. What is divide and conquer method?

The basic idea is to
divide the problem into several sub problems beyond
which cannot be further subdivided. Then solve the sub problems efficiently and
join then together to get the solution for the main problem.11. What are the features of an
efficient algorithm? a. Free of ambiguity
b.Efficient in execution time
c.Concise and compact
d.Completeness
e.Definiteness
f.Finiteness12. List down any four applications of
data structures?a. Compiler design
b.Operating System
c.Database Management system
d.Network analysis13. What is binary doubling strategy?

The reverse of binary
doubling strategy, i.e. combining small problems in to
one is known as binary doubling strategy. This strategy is used to avoid the
generation of intermediate results.14. Where is dynamic programming used?

Dynamic programming is
used when the problem is to be solved in a
sequence of intermediate steps. It is particularly relevant for many
optimization
problems, i.e. frequently encountered in Operations research.15. Define top-down design?

Top-down design is a
strategy that can be applied to find a solution to a
problem from a vague outline to precisely define the algorithm and program
implementation by stepwise refinement.16. Mention the types of bugs that may
arise in a program?

The different types of
bugs that can arise in a program are
Syntactic error
Semantic error
Logical error17. What is program testing?

Program testing is
process to ensure that a program solves the smallest
possible problem, when all the variables have the same value, the biggest
possible
problem, unusual cases etc.18. What is program verification?

Program verification
refers to the application of mathematical proof
techniques, to verify that the results obtained by the execution of the program
with
arbitrary inputs are in accord with formally defined output Specifications.19. How will you verify branches with
segments?

To handle the branches
that appear in the program segments, it is necessary
to set-up and proves verification conditions individually.20. What is proof of termination?

To prove that a program
accomplishes its stated objective in a finite number
of steps is called program termini nation. The prooft of termination is
obtained
directly from the properties of the interactive constructs.

Unit V part B

1. Explain
top-down design in detail?a. Definition
b.Breaking a problem in to sub problems
c.Choice of a suitable data structure
d.Constructions ofloops
e.Establishing initial conditions for loops
f.Finding the iterative construct
g.Terminations of loops2. What are the steps taken to improve
the efficiency of an algorithm?a. Definition
b.Redundant computations
c.Referencing array elements
d.Inefficiency due to late termination
e.Early detection of desired output conditions
f.Trading storage for efficiency gains3. Design an algorithm fro sine function
computation. Explain it with an example?
a. Algorithm development
b.Algorithm description
c.Pascalimplementation
d.Application4. Design an algorithm for reversing the
digit of an integer. Explain it with an
example?a. Algorithm development
b.Algorithm description
c.Pascalimplementation
d.Application 5. Design an algorithm for base
conversion. Explain it with an example?Algorithm development
Algorithm description
Pascal implementation
Application