2. PRESENTING ON:ALGORITHMS TO INSERT AND DELETE DATA INTO/FROM:-STACKS-QUEUESLINKED LISTS:-INITIALISATION-INSERTION OF DATA-DELETION-SEARCHING OF DATA ELEMENTS
3. STACKS A stack is a container of abstract data or structure data that are inserted and removed according to the principle of LAST IN FIRST OUT (LIFO). The object can be inserted at any time but only the last object can be removed. It is mainly based on the push and pop operation. PUSH OPERATION: It add data to the top of the list, hiding any item already on the stack. POP OPERATION: It removes an item from the top of the lists.
11. alternately, in each such routine, always return a pointer to ListStart and set ListStart to the result of function call (if ListStart doesn’t change it doesn’t hurt)EPtr initList() { return NULL; } ListStart = initList();
14. INSERTION OF DATA: It is a methods followed in arranging a set of data items into a sequence according to precise rules. A formula used to record data into anew sequence. Like all complicated problems, there are many solution that can achieve the same result, and one sort algorithm can re sequence data faster than another.
18. SPEEDY DELETION This is meant to be used in uncontroversial cases. The main reason articles are speedily delete are for being extremely short on material or context.
19. PROPOSED DELETION This type of deletion is used to delete an article in seven days if no one objects. Proposed deletion should only be used for uncontroversial deletion nomination, it should not be used as a way of getting an article deleted.
21. SEARCHING OF DATA ELEMENTS In computer, a search algorithm, broadly speaking, is an algorithm for finding an item with specified properties among a collection of item. The items may be stored individually as a record in a database or may be elements of a search space defined by a mathematical formula or procedure.
