KEY EXAM POINT'S DATA STRUCTURE STACK AND QUEUE COMPUTER SCIENCE CLASS 12TH

1.Data structure is different arrangement of data elements ,which accessing in different ways.
2.data structure that has sequential  relation ship between data elements is linear data structure .like array ,linked list3 data structure that not has linear relationship is non linear data structure like :tree,graph4.stack is data structure which is also known as LIFO or last in first out data structure.5. Queue known as FIFO ,first in first out arrangement of data elements6. stack can be implement by array or linked list.7.queue can be implement by array or linked list8. stack has one pointer which always point to top most element of stack .9. inserting a element in array in known as push operation in stack .10 deleting a element in array is knwn as pop operation .11 push operation   increase top value by one.12pop operation decrease value of top by one .13.in  array implemented stack,stack has overflow condition.14 overflow means no insertion  possible  now,because its capacity is fixed to store .array has limited capacity to store.so it has overflow condition.15 underflow means empty condition,no deletion possible .16.queue has two pointer front and rear.17 front point to first element of queue .18 rear point to last element of queue .19 when deletion perform in queue ,front increase by one .20. when insertion perform in queue, rear increase by one .21.rear=size-1 is over flow condition for queue22.top==size-1 is overflow condition for stack23 rear==front is condition when one element in queue24 top=-1 is stack underflow condition .25 rear=front =-1 is queue underflow condition .26. linked list is linked sequential arrangement of self referential structure instance called node.27 linked list consist of number of node .28 each node contain pointer  of same type .29one node keep address of other node ,known as linking of node.30linked list has special pointer start.31 start point to first node of linked list .32start help to process linked list.

33 array	Linked list
Consecutive memory allocation	Discrete memory allocation
both random and sequential access access	Sequential access
Relation between element	No relation
Pointer not must	Pointer essential

 34.stack and queue can also be implemented by linked list.35 top in stack linked list implementation point to last node of stack.36.no overflow condition in linked liststack .37.no overflow condition in linked queue.38 .singly linked list always move in one direction.39double linked list can move in two direction .40doubly lineked list contain two pointer to process .41 one pointer member point  to forward direction,other point to backward direction.42 deque ,a queue where addition n deletion can be from both end front and rear43.front==NULL is empty condition for linked queue.44 rear==NULL is empty condition for dynamic queue.45 front==rear is condition when there is one node in queue.46. linked list is just linking of node ,where one node keep address of other node .47 primitive data type are those which is not derived from other eX: int ,float,char ,double48 non primitive data type are those which group other data type : like Array,enumeration,union,structure.49 data structuretype 1.simple   2. compound49 simple data structure built from primitive data structure.  Array, Structure50  compound data structure combine simple data structure in complex way.

Data structure
Simple			Compound
Array			linear	Non linear
Structure			Stack	Tree
			Queue	graph
			Linked

51 prefix notation:operator is before operand .ex:+a b52 postfix notation :operator just after operand ex:a b+53 infix notation:operator in between operand a+b.54 infix to postfix coversion possible by stack.55 postfix expression evaluated by stack56 queue used in sequencing and  waiting line for resources of computer system .57.when f=0 and r=size-1 ,or f=r+1 or r=f-1 it’s a overflow condition for CQ.58CQ implemented by array only.   59.if  f==r than there is 1 element in CQ.   59:f=r=-1 is empty condition .