Courses | Date |
CA | 02-04-2018 |
CA | 16-04-2018 |
CS | 05-04-2018 |
SSC/ Banking | 16-04-2018 |
Web Development | 05-04-2018 |
C | 10-04-2018 |
CS | 01-05-2018 |
CS Executive Module 1 | 01-05-2018 |
CS Foundation | 01-05-2018 |
A data structure is an arrangement of data in a computer's memory or even disk storage. Data structure as an organization of information, usually in memory, for better algorithm efficiency, such as queue, stack, linked list, heap, dictionary, and tree, or conceptual unity, such as the name and address of a person. Nimact provides data structure through c and c++ training according to the current requirement of IT industry. It may include redundant information, such as length of the list or number of nodes in a sub tree. datastructure is a set of types, a designated type from that type set, a set of functions, and a set of axioms. That definition implies that a datastructure is a type with implementation. In our object-oriented programming era, type with implementation means class. A data structure is a way of storing and retrieving data efficiently. There are two main objectives to study data structures. First one is to identify and develop useful entities and operations and decide what type of problems can be solved with these entities and operations. The second one is to decide how to represent those entities and implement operations on those representations. There are two types of data structures are available to C/C++ programmers. One type of data structures are already built into C/C++ programming languages. These can be Arrays, Structures and classes. Other one is complex data structures that can be implemented using built in data types and structures in C/C++ programming languages.. Some of the examples of these data structures are Stack, Queue, Linked List, Tree and Graph. Sometimes built in data structures do not full fill the requirements and we have to implement our own data structures. All of these complex data structures have their own strengths and weaknesses. Also they have their own usage in real life computer applications. Efficiency of these data structures can be measured by two factors (Time, Space). First one is the time taken to complete the instruction and give the output and Second If an application uses large amount of the structures, thus it will take more space to store and represent these structures.