www.AUNewsBlog.

net

EC8393 – FUNDAMENTALS OF DATA STRUCTURES IN C

Linear DataStructures

PART-A

1.What is called as a Data Structure?

A Data Structure defines a way of representing or organizing all data that contains
both the data items and their relationship with each other.
2.Differentiate between data type and data structures.
Data Type: Data Type of a variable is a set of values the variable may assume.
Eg. int, char & real
Data Structures: Data structure mean the way of organizing data values with the help of
existing data types.
Eg. Array, stack queue, & tree.

3.What are Primary Data Structures?

 Integers
 Floating-point numbers.
 Character Constants

4.What are the types of Secondary Data Structures?

 Static Data structures
 Dynamic Data structures.

5.What are the static data structures?

 Arrays
 Structures

6.What are the types of dynamic data structures?

 Linear Data Structures
 Non-Linear Data Structures.

7.Give examples of Linear and Non-Linear Data Structures.

 Linear Data Structures
i) Linked Lists(Singly & Doubly Linked Lists)
ii) Circular Linked Lists(Circular-singly&Circular-doubly
Linked Lists).
 Non-Linear Data Structures

www.AUNewsBlog.net
 www.AUNewsBlog.net

i) Trees
ii) Graphs.
8.What do you mean by Abstract Data Types?
Classes encapsulate all the essential properties of the objects that are to be
created. Since the classes use the concept of data abstraction, they are known as
Abstract Data Types (ADT).

9.List the operation of set ADT?

Union and Find are the two operations on set ADT

10. Define Stack.

Stack is a list, in which insertion and deletion of elements are made at one end
called top. Push and Pop are two important operations performed on stacks.
Push: The incoming element is placed on top of the stack.
Pop: Removes the topmost element from the stack.

11. Define Queue.

Queue is a list in which insertion takes place at one end, called the rear and the
deletion at the other end, called the front.
In queue, the item inserted first is removed first. Therefore it is called a First In First
Out (FIFO) structure.

12. Define Circular Queue.

In array based implementation of queue, inefficiency arises only when the value of the
rear pointer exceeds maximum size during insertion. This can be rectified if we logically
consider the queue to be circular.
In circular queue, once the rear pointer reaches the maximum size, the next location I
the first one (index 0), provided the first location is vacant. The specific location is
calculated by mod (%) operator.

13. Give some applications of stack.

 Evaluation of Expressions.
 Expression conversion.
 Balancing of symbols.
Function Calls.

14. Define Dequeue.

A dequeue is an ordered list in which additions and deletions may be carried out at
either end.

15. Distinguish between stack and queue.

STACK QUEUE
Insertion and deletion are made at one end. Insertion at one end rear and deletion at
other end front.
The element inserted last would be The element inserted first would be

www.AUNewsBlog.net
 www.AUNewsBlog.net

removed first. So LIFO structure. removed first. So FIFO structure.

Full stack condition: Full stack condition:
If(top==Maxsize) If(rear = = Maxsize)
Physically and Logically full stack Logically full. Physically may or may not
be full.

16.State the difference between cursor and pointers.

Pointer: Pointer is a variable, which stores the address of another variable.
Using pointers, memory can be allocated dynamically.
Cursor: Cursor is a temporary memory space. Memory allocated is static.
17.What is an ordered list
An ordered list is a linear list which is been ordered by some key.
Eg. An alphabetized list of students in a class, a list of exam scores in decreasing order.
18.State the difference between array and linked list.

Array Linked List

Contiguous memory location Memory location need not be necessarily

contiguous

Operations such as insertion and deletion Insertion and deletions are easier and
are ineffective since the memory needs only one pointer assignment.
locations need to be moved up and down
respectively.

Inefficient use of memory space. A small amount of memory is been

wasted for storing a pointer, which is
been associated with each node.

19. Give the applications of linked list.

Applications of linked list are:
Bin Sort, radix sort, convex Hull, Offline Equivalence classes, Polynomial Manipulation.

20.What are the advantages and disadvantages of linked list?

Advantages:
a. Memory location for a linked list is dynamic, that is memory allocation is done
during run time. So memory will not be wasted.
b. Data movements during insertion and deletion will be eliminated. So time will not be
wasted.
c. Memory allocation for each node of a linked list need not be continuous.

www.AUNewsBlog.net
 www.AUNewsBlog.net

Disadvantages:
d. Nodes of a linked list cannot be accessed directly. To access a particular node
accessing should start only from the beginning.
e. To store a single data, along with data, memory must be allocated for a pointer also,
which wastes memory.

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

Postfix :ab+cd+*f/
Prefix :/*+ab+cdf

22.Write the steps required to evaluate the postfix expression.

 Repeatedly read characters from postfix expression
 If the character read is an operand, push the value associated with it into the stack
 If it is an operator, pop the top two values from stack, apply the operator to them
and push the result back onto the stack.

23.Define Singly Linked List.

A singly linked list is a list structure in which each node contains a single pointer
field that points to the next node in the list, along with a data field.

24.Define Doubly Linked List.

A doubly linked list is a list structure in which each node contains two pointer
fields along with a data field namely,
BLINK – Points to the previous node in the list
FLINK – Points to the successive node in the list

Tree Structures

PART-A

1. Define Tree.

A Tree is a collection of one or more nodes with a distinct node called the root , while
remaining nodes are partitioned as T1 ,T2, ..,Tk , K≥ 0 each of which are sub trees, the
edges of T1,T2,…,Tk are connected the root.

www.AUNewsBlog.net
 www.AUNewsBlog.net

2. Give some applications of Trees.

 Implementing the file system of several operating systems.

 Evaluation of arithmetic expression.
 Set representation.
 Gaming/Decision making problems.

3. Define node, degree, siblings, depth/height, level.

Node: A node is an item of information with branches to other items.

Degree: The number of subtrees of a node is called is degree.
Siblings: The children of the same parent is said to be siblings.
Level: The level of a node is defined recursively by assuming the level of the root to
be one and if a node is at level l, then its children at level l+1.
Depth/Height: The depth/height of a tree is defined to be the level of a node which is
maximum.

4.Define a path in a tree.

A path in a tree is a sequence of distinct nodes in which successive nodes are
connected by edges in the tree.
5.Define terminal nodes in a tree.
A node which has no children is called a terminal node.It is also referred as a leaf
node.these nodes have a degree as zero.
6. Define nonterminal nodes in a tree
All intermediate nodes that traverse the given tree from its root node to the
terminal nodes are referred as terminal nodes.
7.Define a Binary Tree.
A Binary Tree is a tree,which has nodes either empty or not more than two child
nodes,each of which may be a leaf node.
8.Define a full binary tree.
A full binary tree,is a tree in which all the leaves are on the same level and every
non-leaf node has exactly two children.
9.Define a complete binary tree.

www.AUNewsBlog.net
 www.AUNewsBlog.net

A complete binary tree is a tree in which every non-leaf node has exactly two
children not necessarily to be on the same level.
10.Define a right-skewed binary tree.
A right-skewed binary tree is a tree,which has only right child nodes.

11.State the properties of a Binary Tree.

 Maximum No. of nodes on level n of a binary tree is 2^(n-1),where n>=1.
 Maximum No. of nodes in a Binary tree of height is 2^(n-1),where n>=1.
 For any non-empty tree,nl=nd+1 where nl is the number of leaf nodes and nd is
the no. of nodes of degree 2.
12.What are the different ways of representing a Binary Tree?
 Linear Representation using Arrays.
 Linked Representation using Pointers.

13.State the merits of linear representation of binary trees.

 Store methods is easy and can be easily implemented in arrays.
 When the location of the parent/child node is known,other one can be determined
easily.
 It requires static memory allocation so it is easily implemented in all
programming languages.

14.State the DISADVANTAGES of linear representation of binary trees.

 Insertions and deletions are tougher.
 Processing consumes excess of time.
 Slow data movements up and down the array.

15. Define Traversal.

Traversal is an operation which can be performed on a binary tree is visiting all the
nodes exactly once.
Inorder: traversing the LST, visiting the root and finally traversing the RST.
Preorder: visiting root, traversing LST and finally traversing RST.
Post- order: traversing LST, then RST and finally visiting root.

16.What are the tasks performed while traversing a binary tree?

 Visiting a node
 Traverse the left structure
 Traverse the right structure.

17.What are the tasks performed during preorder traversal?

 Process the root node
 Traverse the left subtree
 Traverse the right subtree.
Ex : +AB
18.What are the tasks performed during inorder traversal?
 Traverse the left subtree
 Process the root node

www.AUNewsBlog.net
 www.AUNewsBlog.net

 Traverse the right subtree.

Ex : A+B

19.What are the tasks performed during postorder traversal?

 Traverse the left subtree
 Traverse the right subtree.
 Process the root node.
Ex : AB+

20. Give the pre & postfix form of the expression (a + ((b*(c-e))/f).

21.Define a Binary Search Tree.

A Binary Search Tree is a special binary tree,which is either empty or if it is
empty it should satisfy the conditions given below:
 Every node has a value and no two nodes should have the same value(Values
should be distinct).
 The value in any left subtree is less than the value of its parent node.
 The value in any right subtree is greater than the value of its parent node.

22.What do u mean by General trees?

General Tree is a tree with nodes having any number of children.

23. Define Forest.

A forest is a collection on N(N>0) disjoint tree or group of trees are called forest.
If the root is removed from the tree that tree becomes a forest.

24.State the demerits of linked representation of binary trees.

• Given a node structure, it is difficult to determine its parent node

• Memory spaces are wasted for storing null pointers for the nodes, which have
one or no sub-trees
• It requires dynamic memory allocation, which is not possible in some
programming language

www.AUNewsBlog.net
 www.AUNewsBlog.net

UNIT-IV Graphs

1. Define Graph.
A Graph G, consists of a set of vertices V, and a set of edges E.V is a finite non-empty
set consisting of vertices of vertices of the graph. The set of edges E consists of a pair of
vertices from the vertex set.
2.What is undirected graph.
If an edge between any two nodes in a graph is not directionally oriented, a graph
is called as undirected graph. It is also called as unqualified graph.

a b

3.What is directed graph.

If an edge between any two nodes in a graph is directionally oriented, a graph is
called as directed graph.It is also called as digraph.

a b

4.Define a cycle in a graph.

A cycle is a path containing atleast thee vertices such that the starting and the
ending vertices are the same.

5.Define a weakly connected graph.

A directed graph is said to be a weakly connected graph if any vertex doesn’t
have a directed path to any other vertices.

6.Define a weighted graph.

A graph is said to be weighted graph if every edge in the graph is assigned some
weight or value.The weight of an edge is a positive value that may be representing the
distance between the vertices or the weights of the edges along the path.
2
a b

5 11
c

7. Define parallel edges

In some directed as well as undirected graph certain pair of nodes are joined by
more than one edge, such edges are called parallel edges.

www.AUNewsBlog.net
 www.AUNewsBlog.net

a b

c d

8.List some representation of Graphs?

Physically a graph can be represented as,
-adjacency matrix
-Incident matrix
-Adjacency list
-Adjacency multilist
-Circular adjacency list
8.Define Adjacency Matrix.
Adjacency Matrix is a representation used to represent a graph with zeros and
ones.A graph containing n vertices can be represented using n rows and n columns.
9.What is meant by Traversing a Graph?
It means visiting all the nodes in the graph

10. Define undirected graph / directed graph.

If G=(V, E) is a graph. The edge between v1 and v2 is represented as (v1, v2). If the
edges of the form (v1, v2) and (v2, v1) are treated as the same edge, then G is said to be an
undirected graph.
In case of a directed graph, the edge <v1, v2> and <v2, v1> are different.
11. Define out degree of a graph.
In a directed graph, for any node ‘v’, the number of outgoing edges from ‘v’ are
called out degree of a node ‘v’. Ex : out degree of c =2

a b

www.AUNewsBlog.net
 www.AUNewsBlog.net

12. Define In degree of a graph.

In a directed graph, for any node ‘v’, the number of incoming edges to ‘v’ are
called In degree of a node ‘v’. Ex : In degree of c =1

a b

13. Define total degree of a graph.

The sum of the In degree and out degree of a node is called the total degree of the
node. Ex : total degree of a node c = 1 +2 =3

a b

14. Define a path in a graph.

A path in a graph is defined as a sequence of distinct vertices each adjacent to the
next,except possibly the first vertex and last vertex is different.
The path in a graph is the route taken to reach the terminal node from a starting
node.
a b

c d

The path from ‘a’ to ‘e’ are

P1 = ((a,b),(b,e))
P2 = ((a,c),(c,d),(d,e))

15. What is a complete Graph.

A complete graph is a graph in which there is an edge between every pair of
vertices.

a b

c dwww.AUNewsBlog.net
 www.AUNewsBlog.net

16. Give the adjacency list representation for the following

A B

C D

A B C D

0 1 1 1
0 0 0 1
0 0 0 1
1 1 1 0

17. List out the graph traversals of graph search?

The two methods of traversal is,
-Depth First Search (DFS)
-Breadth First Search (BFS)
18. 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 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.
19. Define connected and strongly connected graph.
Two Vertices u and v are said to be connected if there exists a path from u to v in the
graph. A directed graph is said to be connected if every pair of vertices in the graph is
connected.
A directed graph is said to be strongly connected if for every pair of distinct vertices vi
and vj, there exists two disjoint paths, one from vi to vj and the other from vj to vi.

www.AUNewsBlog.net