In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks. For example, B-trees are particularly well-suited for implementation of databases, while compiler implementations usually use hash tables to look up identifiers. Data structures are used in almost every program or software system. Specific data structures are essential ingredients of many efficient algorithms, and make possible the management of huge amounts of data, such as large databases and internet indexing services. Some formal design methods and programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design.
TWO MARKS Q-BANK -DIFFERENT ONE CLICK TO DOWNLOAD
ANNA UNIVERSITY QUESTION PAPER -NOVEMBER-DECEMBER-2006CLICK TO DOWNLOADANNA UNIVERSITY QUESTION PAPER -MAY-JUNE-2007 CLICK TO DOWNLOAD ANNA UNIVERSITY QUESTION PAPER -NOVEMBER-DECEMBER-2007 CLICK TO DOWNLOAD ANNA UNIVERSITY QUESTION PAPER -APRIL-MAY-2008 CLICK TO DOWNLOAD Your's friendly,[MOHANRAM.G],
ADMIN...
