DATA STRUCTURE

In computer science, a data structure is a particular way of organizing data in a computer so that it can be used efficiently.Data structures can implement one or more particular abstract data types(ADT), which are the means of specifying the contract of operations and their complexity. In comparison, a data structure is a concrete implementation of the contract provided by an ADT.

Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks. For example, databases use B-tree indexes for small percentages of data retrieval and compilers and databases use dynamic hash tables as look-up tables.

Data structures are generally based on the ability of a computer to fetch and store data at any place in its memory, specified by a pointer – a bit string, representing a memory address, that can be itself stored in memory and manipulated by the program. Thus, the array and record data structures are based on computing the addresses of data items with arithmetic operations; while the linked data structures are based on storing addresses of data items within the structure itself. Many data structures use both principles.


The implementation of a data structure usually requires writing a set of procedures that create and manipulate instances of that structure. The efficiency of a data structure cannot be analyzed separately from those operations. This observation motivates the theoretical concept of an abstract data type, a data structure that is defined indirectly by the operations that may be performed on it, and the mathematical properties of those operations.

Data structures provide a means to manage large amounts of data efficiently for uses such as large databases and internet indexing services. Usually, efficient data structures are key to designing efficient algorithms. Some formal design methods and programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design. Storing and retrieving can be carried out on data stored in both main memory and in secondary memory.

DATA STRUCTURE TUTORIALS PPT
SUNDAY,21 JUNE 2015

CHAPTER 1: 

INTRODUCTION TO DATA STRUCTURE

THURSDAY,04 JULY 2015

CHAPTER 2: 

SEARCHING AND SORTING

MONDAY,27 JULY 2015

CHAPTER 3: 

STACKS

WEDNESDAY,05 AUGUST 2015

CHAPTER 4: 

QUEUES

SUNDAY,23 AUGUST 2015

CHAPTER 5: 

LINKED LIST

TUESDAY,15 SEPTEMBER 2015

CHAPTER 6: 

TREE

SUNDAY,20 SEPTEMBER 2015

CHAPTER 7: 

GRAPH AND HASHING

Data Structure DSU 17330 SUMMER 2015 
QUESTION PAPER

Data Structure DSU 17330 SUMMER 2015 MODEL ANSWER





Data Structure DSU 17330 WINTER 2014 QUESTION PAPER 





Data Structure DSU 17330 SUMMER 2014 MODEL ANSWER 

Data Structure Practice Test

DSU Practice test First Question Paper

DSU Practice test First Model Answer





DSU Practice test Second Question Paper

DSU Practice test Second Model Answer



DSU PST Question BANK