Download Question Paper previous year and more Papers Data Structures and Algorithms in PDF only on Docsity!
Questions Option1 Option2 Option3 Option4 Answer
________ is a sequence of instructions to
accomplish a particular task
Data
Structure
Algorithm Ordered
List
Queue Algorithm
_______ criteria of an algorithm ensures
that the algorithm terminate after a
particular number of steps.
effectivenes
s
finiteness definiteness particular finiteness
An algorithm must produce __________
output(s)
many only one atleast one zero or
more
atleast one
_______ criteria of an algorithm ensures
that the algorithm must be feasible.
effectivenes
s
finiteness definiteness infinite effectivenes
s
_______ criteria of an algorithm ensures
that each step of the algorithm must be
clear and unambiguous.
effectivenes
s
finiteness definiteness infinite definiteness
The logical or mathematical model of a
particular data organization is called
as_____________
Data
Structure
Software
Engineeri
ng
Data
Mining
Data
Ware
Housing
Data
Structure
An algorithms _____________ is
measured in terms of computing time ad
space consumed by it.
performance effectiven
ess
finiteness definiten
ess
performance
Which of the following is not structured
data type?
Arrays Union. Queue Linked
list.
Union.
What is the strategy of Stack? LILO FIFO FILO LIFO LIFO
What is the strategy of Queue? LILO FIFO FILO LIFO FIFO
Data structures are classified as
____________ data type.
User
Defined
Abstract Primitive &
Non
Primitive
predefine
d only
Primitive &
Non
Primitive _______ are the commonl used ordered
list.
Graphs Trees Stack and
Queues
List Stack and
Queues
Data structure can be classified as
________ data type based on relationship
with complex data element.
Linear &
Non Linear
Linear Non Linear None of
the above
Linear &
Non Linear
A data structure whose elements forms a
sequence of ordered list is called as
__________ data structure.
Non Linear Linear. Primitive Non
Primitive
Linear.
A data structure which represents
hierarchical relationship between the
elements are called as ___________ data
Linear Primitive. Non Linear Non
Primitive
Non Linear
A data structure, which is not composed
of other data structure, is called as
___________ data structure.
Linear Non
Primitive
Non Linear Primitive Primitive
Data structures, which are constructed
from one or more primitive data
structure, are called as ___________ data
Non
Primitive
Primitive. Non Linear Linear Non
Primitive
__________ is the term that refers ti the
kinds of data that variables may hold in a
programming language.
data type data
structure
data Object data data type
________ refers to the set of elements
that belong to a particular type.
data type data
structure
data Object data data Object
The triplet ( D,F,A) r efers to a ________
where D is a set of Domains, F is a set
of Functions and A is a set of Axioms
data type data
structure
data Object data data
structure
_________estimation is the method of
analysing an algorithm before it is
executed.
Preprocess Verificatio
n
Priori Posteriori Priori
In queue we can add elements at
________.
Top Bottom Front Rear Rear
In queue we can delete elements at
________.
Front Bottom Top Rear Front
In Stack we can add elements at
_______.
Bottom Top Front Rear Top
In Stack we can delete elements at
______
Front Rear Top Bottom Top
When Top = Bottom in stack, the total no
of element in the stack is
When FRONT = REAR in queue, the
total no of element in the queue is
In Stack the TOP is decremeted by one
after every ___ operation.
AddQ Pop Push DelQ Pop
In Stack the TOP is incremeted by one
before every ___ operation.
AddQ Pop Push DelQ Push
To add an item into the queue, FRONT is
incremented
by one
FRONT is
decrement
ed by one
REAR is
decremente
d by one
REAR is
incremete
d by one
REAR is
incremeted
by one In Queue FRONTis incremented then, the
operation performed on it is ________.
DelQ Pop Push AddQ DelQ
When the maximum entries of (m*n)
matrix are zeros then it is called as
_______.
Transpose
matrix
Sparse
Matrix
Inverse
Matrix
tridiagon
al matrix
Sparse
Matrix
A matrix of the form (row, col, n) is
otherwise known as _______.
Transpose
matrix
Inverse
Matrix
Sparse
Matrix
Diagonal
matrix
Sparse
Matrix
Which of the following is a valid linear
data structure.
Stacks Records Trees Graphs Stacks
Which of the following is a valid non -
linear data structure.
Stacks Trees Queues Linked
list.
Trees
A list of finite number of homogeneous
data elements are called as _________
Stacks Records Arrays Linked
list.
Arrays
No of elements in an array is called the
_________ of an array.
Structure Height Width Length Length
_________ is the art of creating sample
data upon which to run the program
Testing Designing Analysis Debuggin
g
Testing
If a program fail to respond corectly then
_________ is needed to determine what
is wrong and how to correct it.
Testing Designing Analysis Debuggin
g
Testing
Algorithms with time complexity O(n
2 )
are called ________
linear exponenti
al
quadratic cubic quadratic
For large data set algorithms with
complexity greater than ________ are
impractical
O(log n) O(n) O(n log n) O(1) O(n log n)
Sum of terms of the form ax
e is called
_______.
Array Matrix Expression Polynomi
al
Polynomial
______________ is efficient solution to
avoid data movement in array
representation of Queue.
Circular
Queue
Dequeue Enqueue queue Circular
Queue
Questions Option1 Option2 Option3 Option4 Answer
________is a collection of data and links. Links Node List Item Node
Each item in a node is called a_______. Field Data item Pointer Data Field
The elements in the list are stored in a one
dimensional array called a _______
Value List Data Link Data
Data movement and displacing the pointers of the
Queue are tedious proplems in _________
representation of a Queue.
Array Linked Circular linear list Array
________ list allows traversing in only one
direction.
Singly linked
list
Doubly
linked list
Circular
Doubly Linked
List
Ordered List Singly linked
list
In storage management every block is said to have
three fields namely ________
Llink, Data,
Rlink
Link, Data,
Size
Size, Link and
Unusable
Size, Llink
and Uplink
Size, Link and
Unusable
________ allows traversing in both direction. Singly linked
list
Doubly
linked list
Circular
Singly Linked
List
Circular
Queue
Doubly linked
list
_________ is the process of allocating and
deallocating memory to various programs in a
multiprocessing enviroment.
Job scheduling
in Time
sharing
Processor
Management
Dynamic
Storage
Management
Garbage
Collection
Dynamic
Storage
Management
The best application of Doubly Linked list in
computers is __________
Job scheduling
in Time
sharing
Processing
Procedure
calls
Dynamic
Storage
Management
Evaluating
postfix
expressions
Dynamic
Storage
Management
List containing link to all of the available nodes is
called __________ list.
Free Empty AV Ordered AV
The computing time for manipulating the list is
__________for sequential Representation
Less then Greater than Less then
equal
Greater than
equal
Less then
The back pointer for each node will be referred as
_________.
Blink Break Back Clear Blink
Forward pointer for each node will be referred as
_________.
Forward Flink Front Data Flink
A___________is a linked list in which last node
of the list points to the first node in the list.
Linked list Singly linked
circular list
Circular list Insertion node Singly linked
circular list
A________in which each node has two pointers, a
forward link and a Backward link.
Doubly linked
circular list
Circular list Singly linked
circular list
Linked list Doubly linked
circular list
In sparse matrices each nonzero term was
represented by a node with ______ fields.
Five Six Three Four Three
We want to represent n stacks with 1 ≤ i ≤ n then
T(i)_______
Top of the i
th
stack
Top of the (i
th stack
Top of the ( i –
th stack
Top of the (i -
th stack
Top of the i
th
stack
We want to represent m queues with 1 ≤ i ≤ m
then F(i)_______
Front of the (i
th Queue
Front of the
i
th Queue
Front of the ( i
th Queue
Front of the (i -
th Queue
Front of the i
th
Queue
We want to represent m queues with 1 ≤ i ≤ m
then R(i)_______
Rear of the (i +
th Queue
Rear of the i
th
Queue
Rear of the ( i
th Queue
Rear of the (i -
th Queue
Rear of the i
th
Queue
In Linked representation of Sparse Matrix, DOWN
field used to link to the next nonzero element in
the same _________
Row List^ Column Diagonal Column
In Linked representation of Sparse Matrix, RIGHT
field used to link to the next nonzero element in
the same _________
Row Matrix Column Diagonal Row
The time complexity of the MREAD algorithm
that reads a sparse matrix of n rows, n columns
and r nonzero terms is ____
O(max {n, m,
r})
O(m * n * r) O(m + n + r) O(max {n,
m})
O(m + n + r)
In Available Space list combining the adjacent free
blocks is called _________
Defragmenting Coalescing Joining Merging Coalescing
In Available Space list, the first and last word of
each block are reserved for ___________
Data Allocation
Information
Link Value Allocation
Information
In Storage management, in the Available Space
List, the first word of each free block has
________fields.
In Available Space list, the last word of each free
block has ________fields.
The first and last nodes of each block have tag
fields, this system of allocation and freeing is
called the _________.
Tag Method Boundary
Method
Free Method Boundary Tag
Method
Boundary Tag
Method
In Available Space list ,Tag field has the value one
when the block is _________
Allocated Coalesced Free Merge Allocated
Available Space list ,Tag field has the value Zero
when the block is _________
Allocated Coalesced Free Merged Free
The ______field of each storage block indicates if
the block is free are in-use.
rlink tag size uplink tag
In storage management the ________ field of the
free block points to the start of the block
rlink llink uplink top uplink
__________ is the process of collecting all unused
nodes and returning them to the available space.
Compaction Coalescing Garbage
collection
Deallocation Garbage
collection
Moving all free nodes aside to form a single
contiguous block of memeory is called
__________
Compaction Coalescing Garbage
collection
Deallocation Compaction
__________ of disk space reduces the average
retrieval time of allocation.
Compaction Coalescing Garbage
collection
Deallocation Compaction
___________ is done in two phases 1) marking
used nodes and 2) returning all unmarked nodes to
available space list.
Compaction Coalescing Garbage
collection
Deallocation Garbage
collection
Questions Option1 Option2 Option3 Option4 Answer
_______________ are genealogical charts which
are used to present the data
Graphs Pedigree and
lineal chart
Line , bar chart pie chart Pedigree and
lineal chart
A __ is a finite set of one or more nodes, with one
root node and remaining form the disjoint sets
tree graph list set tree
A _________ is a graph without any cycle. tree path set list tree
In binary trees there is no node with a degree
greater than _____
zero one two three two
Which of this is true for a binary tree. It may be empty The degree of
all nodes must
It contains a root
node
All the options All the options
The Number of subtrees of a node is called its
_______.
leaf terminal children degree degree
Nodes that have degree zero are called ________. end node leaf nodes subtree root node leaf nodes
A binary tree with all its left branches supressed is
called a _________
balanced tree left sub tree full binary tree right skewed
tree
right skewed tree
All node except the leaf nodes are called________. terminal node percent node non terminal children node non terminal
The roots of the subtrees of a node X, are the
_______ of X.
Parent Children Sibling sub tree Children
X is a root then X is the ______ of its children. sub tree Parent Sibilings subordinate Parent
The children of the same parent are called
__________________.
sibiling leaf child subtree sibiling
___________of a node are all the nodes along the
path form the root to that node.
Degree sub tree Ancestors parent Ancestors
The ______________of a tree is defined to be a
maximum level of any node in the tree.
weight length breath height height
A___________ is a set of n ≥ 0 disjoint trees Group forest Branch sub tree forest
A tree with any node having at most two branches
is called a _____________.
branched tree sub tree binary tree forest binary tree
A ___________of depth k is a binary tree of depth
k having 2
K -1 nodes.
full binary tree half binary tree sub tree n branch tree full binary tree
Data structure represents the hierarchical
relationships between individual data item is known
Root Node Tree Address Tree
Node at the highest level of the tree is known as
_______.
Child Root Sibiling Parent Root
The root of the tree is the _______of all nodes in
the tree.
Child Parent Ancestor Head Ancestor
_____is a subset of a tree that is itself a tree. Branch Root Leaf Subtree Subtree
A node with no children is called _________. Root Node Branch Leaf Node Null tree Leaf Node
In a tree structure a link between parent and child is
called _______
Branch Root Leaf Subtree Branch
Height – balanced trees are also referred as as
___________trees.
AVL trees Binary Trees Subtree Branch Tree AVL trees
Visiting each node in a tree exactly once is called
_________
searching travering walk through path travering
In________traversal ,the current node is visited
before the subtrees.
PreOrder PostOrder Inorder End Order PreOrder
In________traversal ,the node is visited between
the subtrees.
PreOrder PostOrder Inorder End Order Inorder
In________traversal ,the node is visited after the
subtrees.
PreOrder PostOrder Inorder End Order PostOrder
Inorder traversal is also sometimes called______ Symmetric Order End Order PreOrder PostOrder Symmetric Order
Postorder traversal is also sometimes called______ Symmetric Order End Order PreOrder PostOrder End Order
Nodes of any level are numbered from _________ Left to right Right to Left Top to Bottom Bottom to Top Left to right
________ search involves only addition and
subtraction.
binary fibonacci sequential non sequential fibonacci
A________ is defined to be a complete binary tree
with the property that the value of root node is at
quick radix merge heap heap
Binary trees are used in ______ sorting. quick sort merge sort heap sort lrsort heap sort
The ____ of the heap has the largest key in the tree. Node Root Leaf Branch Root
In Threaded Binary Tree ,LCHILD(P) is a normal
pointer When LBIT(P) = ____
In Threaded Binary Tree ,LCHILD(P) is a Thread
When LBIT(P) = ____
In Threaded Binary Tree ,RCHILD(P) is a normal
pointer When RBIT(P) = ____
In Threaded Binary Tree ,RCHILD(P) is a Thread
When LBIT(P) = ____
Which of these searching algorithm uses the Divide
and Conquere technique for sorting
Linear search Binary search fibonacci search m-way search Binary search
______ algorithm can be used only with sorted lists. Linear search Binary search insertion sort merge sort Binary search
________ search involves comparision of the
element to be found with every elements in a list.
Linear search Binary search fibonacci search m-way search Linear search
Binary search algorithm in a list of n elements takes
only _______ time.
O(log 2 n) O(n) O(n
3 ) O(n
2 )
O(log 2 n)
_____ is used for decision making in eight coin
problem.
trees graphs linked lists array trees
The Linear search algorithm in a list of n element
takes ________ time to compare in worst case.
constant linear quadratic exponential constant
Which of these is an application of trees. Finding
minimum cost
Decision tree Storage
management
Job
sequencing
Decision tree
________ is an operation performed on sets union sort rename traverse union
Questions Option1 Option2 Option3 Option
In a graph G(V,E), V is a finite non-empty set of Nodes Items Vertices Circles
Iff the degree of each vertex is even, a walk starting from one
vertex and going through all the other vertices
exactly once and returning to the starting vertex is
Kruskals
path
Hamiltonian
cycle
Eulerian
walk
Koenisberg
bridge
In a undirected graph G two vertices v1 and v2 are said
to be if there is a path in G from v1 to v2.
connected adjacent neighbours incident
In a Graph G if there are n vertices the adjacency list n/2 2n n-1 n
In a Graph G if there are n vertices the adjacency
Matrix of the graph consists of rows and
n/2 2n n-1 n
In graph the pair of vertices joined by any directed undirected sub multi
In graph each edge is represented by the undirected multi directed sub
The of a path is the number of edges on it. tree maximal length cycle
An n vertex undirected graph with exactly n(n-1)/
distinct edges is said to be
connected complete directed cyclic
A is a simple path in which the first & last
vertices are the same.
Cycle graph component matrix
A connected component of an undirected graph is a
connected subgraph.
tree strongly weekly maximal
A is a connected acyclic graph. graph component tree list
In a graph with n vertices the number of distinct unordered
pairs(vi,vj) with vi not equal to vj is
n(n-1)/2 n-1 n(n-1) n/
In a graph of a vertex is the number of edges
incident to it.
path degree depth height
The of a vertex is defined as the number of
edges for which v is the head.
out-degree pre-degree in-degree post-degree
The is defined to be the number of edges for
which v is the tail
in-degree out-degree pre-degree post-degree
Directed graph is also called. Line Graph sub graph connected
graph
di graph
In a directed graph G(V,E) a vertex vj is vi iff
there is an edge <vi,vj> in E
adjacent
from
adjacency
matrix
adjacent
from
adjacency
list
A vertex vi is adjacent to vj iff vi=vj <vi,vj> is an
edge in E
if it belongs
to a graph
vi is starting
vertex
An edge connected by any 2 vertices i & j can be
determined by
sparse matrix adjacency
matrix
linked lists tree graph
An edge <vi,vj> is said to on two vertices vi
and vj.
parallel incident degree loop
A from vertex vi to vj is a seqence of vertices
from vi to vj with an edge connecting them in pairs
path length cycle tree
The of a path is the number if edges on it. degree length degree height
The adjacency matrix of an undirect graph is always _____ Unit Matrix Diagonal
Matix
Identity
Matrix
SymetricMa
trix
A graph with weighted edge is called a. strong graph network component sub graph
Any tree consisting solely of edges in G and including
all vertices in G is called.
graph spanning tree tri graph bread the first
spanning
tree
The spanning tree resulting from a call to DFS is
known as a spanning tree.
Independent breadth first depth first dependent
When BFS is used the resulting spanning tree is called
a spanning tree.
breadth first depth first independent dependent
and are the searching techniques used
in graphs.
Inorder,
preorder
firstfit,
bestfit
depth first,
breadth first
prefix,
postfix
Starting from a vertex v and visiting all vertices adjacent to it
before moving to the next vertex is called
search
breadth first depth first pre order first fit
The all pairs shortest path problem calls for finding the
paths between all pairs of vertices.
longest shortest minimal maximal
A graph is a graph in which each vertex of G
is adjacent to every other vertex in G.
Complete Incomplete connected un
connected
All algorithms using adjacency matrix will require
atleast time.
O(n
2 ) O(n) O(n
3 ) O(2n)
The fields used to distinguish among the records are
known as.
records address pointers keys
In search method the search begins by
examining the record in the middle of the file.
sequential fibonacci binary non-
sequential
search involves only addition and
subtraction.
Binary fibonacci sequential non
sequential
Kruskal formulated a method to determine in
graphs.
Breadth first
search
connected
component
adjacency
matrix
minimum cost
spanning
tree
sort is done in graphs Merge sort^ Heap^ Topological
sort
Linear sort
An requires that the collection of data fit
entirely in the computer’s main memory.
Internal sort external sort sorting searching
An when the collection of data cannot fit in the
computer’s main memory all at once but must
reside in secondary storage such as on a disk.
Internal sort external sort sorting searching
are a specific type of Algorithms that specialize
in taking in multiple sorted lists and merging
them into a single sorted list.
Multiway Merges Multiway
Merges
Dynamic
Merges
A data structure, the size of the structure is
fixed.
static dynamic non terminal non
sequential
A sort is one in which successive elements
are selected.
insertion deletion Selection shell
The straight selection sort is also known as push-down
sort
selection shell sort shell
An is one that sorts a set of records by
inserting records into an existing sorted file.
down sort insertion sort selection shell
The sorts separate subfilesof the original file. down sort insertion sort shell sort shell
A table of records in which a key is used for retrieval is
called a.
insert table delete table records search table
adjacent
from
<vi,vj> is
an edge in E
adjacency
matrix
incident
path
length
SymetricMa
trix
network
spanning
tree
depth first
breadth first
depth first,
breadth first
breadth first
shortest
Complete
file
acyclic
graph
Topological
sort
successor
partial
ordering
O(e+n)
linear
activity on
vertex
network
trees
Adjacency
list
cycle
sum
weights
