 |
| Data Structure |
| Data Structure is a way of storing data in a computer so that it can be used efficiently. A logical or mathematical model of a particular...more » |
|
 |
| |
|
|
| Abstract Data Types |
| A set of data values and associated operations that are precisely specified independent of any particular implementation.
...more » |
|
|
| |
|
|
| Stacks |
| A stack is a list of elements in which an element may be inserted or deleted only at one end called the top of the stack. This means, in particular that elemen...more » |
|
|
| |
|
|
| Queues |
| A queue is a linear list of elements in which deletions can take place only at one end, called the front of the stack, and insertion can take place on...more » |
|
|
| |
|
|
| Linked Lists |
| A linked list is a complex data structure, especially useful in systems or applications programming. A linked list is comprised of a series of nodes, each node...more » |
|
|
| |
|
|
| Linear Search |
| Search each record of the file one at a time until finding the given name and hence the corresponding record.
...more » |
|
|
| |
|
|
| Sorting |
| Let A be the list of n elements A1, A2, … An in memory. Sorting A refer to the operating of rearranging the contents of A so that there are increasing in order that is so that
A1...more » |
|
|
| |
|
|
| Hashing |
| The search time of each algorithm depend on the number n of elements of the collection S of the data. A searching technique called Hashing or Hash addressing w...more » |
|
|
| |
|
|
| Trees |
| Trees are the type of nonlinear data structure. A data structure accessed beginning at the root node. Each node is either a ...more » |
|
|
| |
|
|
| Graphs |
| A graph is a set of vertices and edges which connect them. A graph G consists of two things.
...more » |
|
|
| |
|
