1. DATA STRUCTURES AND ALGORITHM

2. DATA STRUCTURES In programming , the term data structure refers to a scheme for organizing related pieces of information. The basic types of data structures include: FILES, LISTS, ARRAYS, RECORDS, TREES AND TABLES

3. FILES A collection of data or information that has a name , called the filename . Almost all information stored in a computer must be in a file. There are many different types of files: data files, text files , program files, directory files, and so on. Different types of files store different types of information. For example, program files store programs, whereas text files store text .

4. ARRAYS In programming, a series of objects all of which are the same size and type. Each object in an array is called an array element. For example, you could have an array of integers or an array of characters or an array of anything that has a defined data type . The important characteristics of an array are:Each element has the same data type (although they may have different values).The entire array is stored contiguously in memory (that is, there are no gaps between elements). Arrays can have more than one dimension. A one-dimensional array is called a vector ; a two-dimensional array is called a matrix .

5. RECORDS

6. TREE STRUCTURES

7. TABLES Refers to data arranged in rows and columns . A spreadsheet , for example, is a table. In relational database management systems , all information is stored in the form of tables.

8. LISTS In computer science , a list or sequence is an abstract data structure that implements an ordered collection of values , where the same value may occur more than once. An instance of a list is a computer representation of the mathematical concept of a finite sequence , that is, a tuple . Each instance of a value in the list is usually called an item , entry , or element of the list; if the same value occurs multiple times, each occurrence is considered a distinct item. A singly-linked list structure, implementing a list with 3 integer elements. The name list is also used for several concrete data structures that can be used to implement abstract lists, especially linked lists

9. ALGORITHM In mathematics , computing , and related subjects, an algorithm is an effective method for solving a problem using a finite sequence of instructions. Algorithms are used for calculation , data processing , and many other fields. Each algorithm is a list of well-defined instructions for completing a task. Starting from an initial state, the instructions describe a computation that proceeds through a well-defined series of successive states, eventually terminating in a final ending state. The transition from one state to the next is not necessarily deterministic ; some algorithms, known as randomized algorithms , incorporate randomness. A partial formalization of the concept began with attempts to solve the Entscheidungsproblem (the "decision problem") posed by David Hilbert in 1928. Subsequent formalizations were framed as attempts to define " effective calculability “ or "effective method" [2] ; those formalizations included the Gödel - Herbrand - Kleene recursive functions of 1930, 1934 and 1935, Alonzo Church 's lambda calculus of 1936, Emil Post 's " Formulation 1 " of 1936, and Alan Turing 's Turing machines of 1936–7 and 1939.