NOORUL ISLAM COLLEGE OF ENGINEERING, KUMARACOIL
Computer Science and Engineering
CS1211 - DATA STRUCTURES AND ALGORITHMS
UNIT-I - INTRODUCTION TO DATASTRUCTURES
1.Write down the definition of data structures?
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. Give few examples for data structures?
Stacks, Queue, Linked list, Trees, graphs
3. 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.
4. What are the features of an efficient algorithm?
Free of ambiguity
Efficient in execution time
Concise and compact
5. List down any four applications of data structures?
Database Management system
6. What is meant by an abstract data type(ADT)?
An ADT is a set of operation.A useful tool for specifying the logical properties of a
datatype is the abstract data type.ADT refers to the basic mathematical concept that defines the
datatype. Eg.Objects such as list, set and graph along their operations can be viewed as ADT's.
7.What are the operations of ADT?
Union, Intersection, size, complement and find are the various operations of ADT.
8.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.
9. What are the various operations done under list ADT?