Assignment
- 1. ASSIGNMENTPRESENTED BY:SHANNITISHBHIMDEVINAARSHAD (didn’t gave notes + not presenting)
- 2. PRESENTING ON:ALGORITHMS TO INSERT AND DELETE DATA INTO/FROM:-STACKS-QUEUESLINKED LISTS:-INITIALISATION-INSERTION OF DATA-DELETION-SEARCHING OF DATA ELEMENTS
- 3. STACKSA 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.
- 4. EXAMPLE OF PUSH AND POP:
- 5. QUEUESAQueue differ from a stack. A queue is a particular kind of collection in which the entities are kept in order and principle of FIRST IN FIRST OUT (FIFO) data structure.
- 6. FIFO: In FIFO the first element added to a queue will be the first one to be removed. ENQUEUE: It is element that are inserted at the rear.DEQUEUE: It is element that are removed at the front.
- 7. EXAMPLE OF ENQUEUE AND DEQUEUE:
- 8. LINKED LISTS In computer science, a linked list is a data structure that consists of a sequence of data records such that in each record there is a field that contains a reference (i.e., a link) to the next record in the sequence.
- 9. Linked lists and arrays are similar since they both store collections of data. The terminology is that arrays and linked lists store "elements" on behalf of "client" code. The specific type of element is not important since essentially the same structure works to store elements of any type. One way to think about linked lists is to look at how arrays work and think about alternate approaches.INITIALISATION(To assign a value to a variable or storage location in a computer program)Initialization in computing is the setting (or “formatting”) of a variable to some initial value, either by statically embedding the value at compile time, or else by assignment at run time. A section of code that performs such initialization is generally known as “initialization code” and may include other, one-time-only, functions such as opening files. Setting a memory location to hexadecimal zeroes is also sometimes known as “clearing” and is often performed by an exclusive or instruction (both operands specifying the same variable), at machine code level, since it requires no additional memory access.
- 10. INITIALISATION (CONTD.)Certain linked list operations (init, insert, etc.) may change element at start of list (what ListStart points at)to change what ListStart points to could pass a pointer to ListStart (pointer to pointer)
- 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();
- 12. FIRST EXAMPLES OF INITIALISATION:
- 13. SECOND EXAMPLE OF INITIALISATION
- 14. INSERTION OF DATA:Add new element to list:Make new element’s next pointer point to start of listMake pointer to new element start of listEPtr insertF(EPtr start, DataType dnew) { return newElement(dnew,start);} To use, get new value to add (ask user, read from file, whatever), then call insertF:ListStart = insertF(ListStart,NewDataValue);
- 15. EXAMPLES OF INSERTION OF DATA:
- 16. DELETIONDeletion is act of deleting or removing by striking out material such as a word or passage that has been removed from a written body.
- 17. TYPES OF DELETION: SPEEDY DELETIONPROPOSED DELETION
- 18. SPEEDY DELETIONThis 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 DELETIONThis 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 ELEMENTSIn 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.
- 22. THANK YOU FOR YOUR ATTENTION