Data structure and algorithm

Array

collection of item stored in contiguous memory location

Array index

location of an element in an array

void

none

w chart_t

used by Windows w/ 16

bit character

Traverse

print all the array elements one by one

Insertion

adds an element at the given index

Deletion

deletes an element in the given index

Search

searches an element using the given index or by the value

Update

updates an element in the given index .

manually search and update

Display

displays the context of the array

Data Structure

named location that can be use to store and organize data

Algorithm

collection of steps to solve a particular problem

Linked List

Linear data structure that’s made up of a number of interconnected nodes

Singly Linked List

entry is merely connected to its next element by a pointer, rather than being

stored in consecutive memory regions

Doubly Linked List

each node has a reference to both the node before it and the node after it in the

linked list

Circular Linked List

every node is connected to every other node in a circle

Queues

FIFO(First In First Out) Data Structure

-structure of SEQUENTIALLY ORDERED ELEMENTS

ENQUEUE

responsible for INSERTING or PUSHING an element to the queue

DEQUEUE

responsible for REMOVING an element from the queue

SIMPLE QUEUE

also known as "LINEAR QUEUE"

-most basic type of queue

CIRCULAR QUEUE

the ELEMENT of the circular queue ACT as a CIRCULAR RING

-similar to linear queue except the LAST ELEMENT CONNECTED to the FIRST

ELEMENT

PRIORITY QUEUE

SPECIAL type of QUEUE"

- ARRANGES ELEMENTS based on SOME PRIORITY

Multi - programming

when MULTIPLE PROGRAMS are RUNNING in the MAIN MEMORY of the pc

Network

queue is used in the DEVICES such as ROUTER or a SWITCH

Job Scheduling

computer has a task to EXECUTE PARTICULAR NUMBER OF JOBS that are

SCHEDULED TO BE EXECUTED one after another

Shared Resources

use as WEIGHING LIST for a SINGLE SHARED RESOURCE

SEQUENTIAL ALLOCATION

-queue IMPLEMENTED using an ARRAY

-organize LIMITED NUMBER of elements

LINKED LIST ALLOCATION

-queue IMPLEMENTED using a LINKED LIST

-organize an UNLIMITED NUMBER of elements

STACK

-piece that was inserted last is accessed first in this data structure

-structure of sequential and ordered elements and it based on the principle Last In

First Out(LIFO)

PUSH

responsible for inserting or pushing a new element to the stack

* push()

POP

responsible for removing the most recent element from the stack

*pop()