Introduction To Data Structures
Introduction To Data Structures
TexT Books:
1. Seymour Lipschutz, “Data Structure”, Schaum’s Outlines, Tata McGraw Hill
2. Sartaj Sahni, “Data Structures, Algorithms”, Tata Mc Graw Hill, New York
3. Preiss, Bruno R., “Data Structures and Algorithms: With Object-Oriented Design Patterns
in C++ “, John Wiley & Sons, New York
4. R.S. Salaria, “Data structure and algorithms using C”
RefeRence Books:
1. Kruse, Tonso, Leung, “Data Structures and Program Design in C”
2. Langsam, Augestein, Tanenbaum, “Data Structures using C and C++”
3. Weiss, “Data Structures and Algorithm Analysis in C/C++”
4. Carrano and Prichard, “Data Abstraction and Problem solving with C++”
5. Corman at el, “Introduction to Algorithms”
3. Pointers
Data Structure ?
• In general, any representation of data which follow a structure is data structure.
• But by definition, data structure is a way of organizing the data in computer memory
which makes the basic operations on data more efficient.
Basic operation –
• Traversing – Accessing and processing record exactly once
• Insertion – Adding new record to data structure
• Deletion – Removing particular record from the data structure
• Searching – Finding the location of the record in data structure
Special operation –
• Sorting – Arranging the record in some specific order
• Merging – Combining the records from different data structures to single data structure
1. Array
2. Stack
3. Queue
4. Linked list
5. Tree
6. Graph
7. Heap etc.
So, selection of data structure plays important role to make algorithm efficient
But, it depends on the nature of problem and operations to be supported.
Floor Function –
d denotes the greatest integer which does not exceed value of d and it is called
as floor of d.
Example: 2.4 = 2, 3.5 = 3, 3.9 = 3, -8.2 = -9 and 5 = 5 etc.
Ceiling Function –
d denotes the least integer which is not less the value of d and it is called as
ceiling of d.
Example: 2.4 = 3, 3.5 = 4, -8.2 = -8, and 5 = 5 etc.
d = d ,
Otherwise d +1= d