1.)What are the different characteristics of an
Algorithm?
ANS:-- a)Input: The algorithm receives input.
Zero or more quantities are externally
supplied. b)Output: The algorithm produces
output. At least one quantity is produced.
c)Precision: The steps are precisely stated.
Each instruction is clear and unambiguous.
d)Feasibility: It must be feasible to execute
each instruction. e)Flexibility: It should also
be possible to make changes in the algorithm
without putting so much effort on it.
f)Generality: The algorithm applies to a set of
inputs. h)Finiteness: Algorithm must
complete after a finite number of instruction
have been executed.
2.) Explain Sparse Matrices with its ex?
ANS:--In computer programming , a matrix
can be defined with a 2-dimensional array.
Any array with ‘m’ columns & ‘n’ rows
represent a mxn matrix. There may be a
situation in which a matrix contains more no of
zero values than non-zero values such matrix
is known as sparse matrix. Sparse matrix is a
matrix which contain very few non-zero
elements. When a sparse matrix is
represented with a 2-dimensional array , we
waste a lot of space to represent that matrix.
Example:-consider a matrix of size 100x100
containing only 10 non-zero elements. In this
matrix, only 10 spaces are filled with non-zero
values and remaining spaces of the matrix are
filled with zero. That means, totally we
allocate 100x100 x2=20000 bytes of space
to store this integer matrix and to access
these 10 non-zero elements we have to make
scanning for 10000.
3.) Define Data structure with example?
ANS:- Data Structure can be defined as the
group of data elements which provides an
efficient way of storing and organising data in
the computer so that it can be used
efficiently. Data Structures are the main part
of many computer science algorithms as they
enable the programmers to handle the data in
an efficient way. It plays a vital role in
enhancing the performance of a software or a
program as the main function of the software
is to store and retrieve the user's data as fast
as possible.
EX:- arrays, Linked List, Stack, Queue.
4.)Define algorithm with its function ?
ANS:- An algorithm is a set of instructions for
solving a problem or accomplishing a task. Every
computerized device uses algorithms to perform its
functions in the form of hardware- or software-
based routines.
Function:-Algorithms are essential to the way
computers process data, many computer program
contain algorithm. That detail the specific
instructions a computer should perform. In a
specific order to carry out a specified task , such
as calculating employees paychecks or printing
students report card.
5.)Explain Linear and Non-Linear Data
Structure?
ANS:-LINEAR:- a)Those data structures where
the data elements are organised in some
sequence is called linear data structure. b)Here
the various operations on a data structure are
possible only in a sequence i.e. we cannot insert
the element into any location of our choice. c)
They can be implemented in memory using two
ways. d)The first method is by having a linear
relationship between elements by means of
sequential memory locations. e)The second
method is by having a linear relationship by using
links.
Examples:-array, stacks, queue, and linked list.
NON-Linear:-a) When the data elements are
organised in some arbitrary function without any
sequence, such data structures are called non-
linear data structures. b) The relationship of
adjacency is not maintained between elements of
a non-linear data structure.
E.X:- trees, graphs.
6.) What is Hash Table and Hash Functions?
ANS:-Hash table is a type of data structure
which is used for storing and accessing data
very quickly. Inseation of data type in a table
is based on a key value, hence every entry in
the hash table is defined with some key.
7.) Explain stack implementation and reprtion
with its example?
ANS:-Stacks can be implemented in two ways,
a)Stack implementation:-uses arrange to create
stack. Stack implementation thought a very simple
technique but its not a flexible way of creation, as
the size of stack has to be declare during program
design, after that size cannot be varied.
b)Dynamite implementation:-also called linked list
representation and uses pointers to implement
the stack types of data structure.
8.)Explain Queue implementation and
representation and its type with example?
ANS:-Queue is an abstract data structure
sometimes similar to stacks, unlike stacks a
queue is open at both the ends. One end is
always used to insert data (queue) and the
other is used to remove data deaveue.
Its Type’s:-a)Simple Queue:-ex. “we wait in a
line for movie”.
b)Circular Queue:-ex. “Traffic light”.
c)Double ended Queue.
d)Priority Queue.