2. DREAM VALLEY COLLEGE FOR GIRLS CENTRE FOR EDUCATIONAL EXECELLENCE ADD:-Near Railway spring factory, Sitholi, Gwalior (MP) AFFILATED TO:-JIWAJI UNIVERSITY (strictly according to jiwaji university)

3. PPT PRESENTATION On DATA STRUCTURE BCA 2nd semester PPT PRESENTATION On DATA STRUCTURE BCA 2nd semester

4. ARRAY STACK LINKEDLIST QUEUES TREES GRAPHS ARRAY STACK LINKEDLIST QUEUES TREES GRAPHS - -

5. Array is vital part of programming. It allows user to stored multiple value in single variable. Array stored in contiguous form in memory. Array is vital part of programming. It allows user to stored multiple value in single variable. Array stored in contiguous form in memory.

6. ABCFED OR INSERTION OF ELEMENT IN THE ARRAY

7. Traversal:- processing each element in the array. Search:- finding a location of an element in the given value. Insertion:- adding new element in array. deletion:- removing an element in array. Sorting:- arranging element in array. Merging:- combining two array in single array. Reversing:- reversing the element of array.

8. ABCDEF DELETION OF ELEMENT IN THE ARRAY Delete (F) from the array. Delete (E) from the array. Delete (D) from the array. Delete (C) from the array. Delete (B) from the array. Delete (A) from the array.

16. Binary tree->binary tree is defined as finite set of node in which number of the children of a node should not exceed more than two.it means the degree of binary tree not then greater then two.

17. BINARY TREE A B C D E F G

18. TYPES OF BINARY TREE

19. In every non terminal node in a binary tree consists of non empty left subtree and right subtree,then such a tree is called strictly binary tree.

20. STRICTLY BINARY TREE A B D E C F G

21. Complete binary tree The level of all nodes of complete binary tree is equal.

22. A B C D E F G 0 1 2

23. 20726818 6 28 20 20 is a root node of this tree > 7 7 is compared with 20 7 > 26 26 is compared with 20 26 > 8 > 8 8 > 6 > 6 6 < 18 < > 28 > 28

24. To traverse a non empty binary tree in in- order following three operations are performed  Traverse the left sub –tree in in-order  Visit the root node  Traverse the right sub-tree in in-order A B C D E F G TRVERSE STARTS FROM THE ROOT NODE Since D is the leaf node,it gets printed,which is the left child of D. D Now B gets printed as it is the parent of the node D B Since E is the leaf node,it gets printed,which is right child of B E Now A gets printed as it is the parent of the node B A Since F is the leaf node,it gets printed,which is the left child of c F Now C gets printed as it is the parent of the node F C Since G is leaf node,it gets printed,which the right child of C G In order traversal

25. Post -order traversal Printing the data in post-order traversal To traverse a non empty binary tree in in- order following three operations are performed TTraverse the left sub –tree in in-order VVisit the root node TTraverse the right sub-tree in in-order A B C D E F G Now A gets printed as it is the parent of the node B Now C gets printed as it is the parent of the node F Since D is the leaf node,it gets printed,which is the left child of D. TRVERSE STARTS FROM THE ROOT NODE Now B gets printed as it is the parent of the node D DEB Now F gets printed as it is the left child of C FGCA Since E is the leaf node,it gets printed,which is right child of B Now G gets printed,as it is the right child of C

26. a non empty binary tree in pre- order following three operations are performed To traverse  Visit the root node  Traverse the left sub –tree in pre-order  Traverse the right sub-tree in pre-order Pre-order traversal A B C D E F G Printing the data in pre-order traversal Traversal starts from the root node The data at the root node i.e. A gets printed A Since D is the leaf node,it gets printed,which is the left child of B. D Now B gets printed as it is the parent of the node D B Since E is the leaf node,it gets printed, which is right child of B E Now C gets printed as it is the parent of the node F C Since F is the leaf node,it gets printed, which is the left child of c F Since G is leaf node,it gets printed, which the right child of C G

27. Representation of a binary trees in memory ->there are two ways by which we can represent a binary tree

28. BINARY TREE CAN BE REPRESENTED BY LINKS WHERE EACH NODE CONTAINS THE ADDRESS OF THE LEFT CHILD AND THE RIGHT CHILD

29. LINKED LIST REPRESENTATION LEFTDATARIGHT

30. ABCDEHFG

32. AR ABCDEF LC 123456 RC 268497 ARRAY

33. PPT PRESENTATION ONSTACK DATA STRUCTURE BCA 2nd semester Dept. of computer science Presented by:- Guided by:- RICHA MITTAL HARISH SIR RANI KUSHWAH

35. Introduction. Working of stack Push operation performed on stack Pop operation performed on stack Infix to prefix Infix to postfix Prefix to postfix Postfix to infix

36. A Stack is a linear collection of data in which new item may be inserted and deleted at one end. It sometimes called LIFO and push down list. A stack is usually represented by computer by block of memory cells. Thus, stack data structure implemented (LIFO) property. The situation of LIFO may be compared as the plates of cafeteria where every new plate will added at the top. INTRODUCTION TO STACK

37. Working of stack Stacks associated with two basic operation i.e PUSH and POP. Push function means addition of element to the stack. Pop function means remove an element from the top op the stack.

38. 2341253612 Push Operation on stack ( PUSH ) INSERT 41 TO STACK ( PUSH ) INSERT 23 TO STACK ( PUSH ) INSERT 25 TO STACK ( PUSH ) INSERT 36 TO STACK ( PUSH ) INSERT 12 TO STACK

39. 23 41 25 36 12 POP OPERATION ON STACK ( POP ) DELETE 12 FROM THE STACK ( POP ) DELETE 36 FROM THE STACK ( POP ) DELETE 25 FROM THE STACK ( POP ) DELETE 23 FROM THE STACK ( POP ) DELETE 41 FROM THE STACK

40. EXPRESSION :- A + B * C C*B+A scan CONVERSION OF INFIX TO PREFIX NOTATION Character (C) scanned Operator(*) scanned Push (*) into the stack Character (B) scanned Priority of(*)is higher than (+),so(*) operator is poped from the stack Character(A) Scanned Pop(+) from the stack

41. CONVERSION OF INFIX TO POSTFIX NOTATION EXPRESSION :- A + B * C A+B*C SCAN Character(A) scanned Operator(+) scanned Character (B) scanned Operator (*) scanned Character (c) Scanned Priority of (*) is high, pop(*) from the stack pop (+) from the stack

42. CONVERSION OF PREFIX TO POSTFIX NOTATION EXPRESSION :- + A * B C CB* A+ scan OPERATOR (+)SCANNED CHARACTER (A) SCANNED OPERATOR (*)SCANNED CHARACTER(B) SCANNED CHARACTER (C)SCANNED Priority of (*) is higher than (+),pop (*) from the stack Pop (+) from the stack

43. CONVERSION OF POSTFIX TO INFIX NOTATION EXPRESSION :- A B + C * SCAN AB + C* Operator(*) scanned, push to the stack Character (C) scanned Operator(+) scanned Priority of (*) is higher than (+),so (*) is pop from the stack Push (+) to the stack Scanned character (B) Pop (+) from the stack Character (A) scanned

46. CONCEPT OPERATIONS ON QUEUE

47. CONCEPT LINEAR DATA STRUCTURE PRINCIPLE :- First in First out DEFINATION :- Ordered collection of items in a linear way.

48. QUEUE AS A SINGLE LINE

49. QUEUE ON GAME STATION

50. OPERATIONS OF QUEUE INSERT at Front or Rear end DELETE at Front or Rear end

51. FIRST OPERATIONS OF Q INSERT OPERATION:- first of all, we assume three elements A,B,C….. And added at Front and Rear end. B CA

52. Now, we inserting a new element in this function this is called a insert function at Front and Rear end. AB C D

53. SECOND OPERATION OF Q DELETE OPERATION:- In this function, we deleting a new element which was added in insert function at Front end. Now, see in figure – DABC

55. GRAPHS IE…..

56. I N COMPUTER SCIENCE,GRAPH IS USE TO CREATE

57. N ETWORKING! BE IT ANY WALK OF LIFE THAT’S THE KEY WORD TODAY BETTER YOUR NETWORK,FARTHER YOU WOULD REACH AND FUTHER YOU REPLACE YOUR TENTACLES BETTER WOULD YOU NETWORK, AND THE CRUX OF BUILDING AND MANAGING A NETWORK IS HIDDEN IN A SUBJECT AS INNOCUOUS AS DATA STRUCTURE IN A TOPIC CALLED GRAPHS

59. GRAPHS THIS CONCEPT INTRODUCE IMPORTANT MATHAMATICAL STRUCTURE CALLED GRAPHS APPLICATION IN SUBJECT AS DIVERSE AS SOCIOLOGY,CHEMISTRY GEOGRAPHY AND ELECTRICALLY ENGINEERING

60. NOW A DAYS MANY APPLICATION RELATED WITH COMPUTATION RELATED WITH COMPUTATION CAN BE MANAGED EFFICIENTLY WITH GRAPH DATA STRUCTURE Vertices in the graph might represent computer instollation, edges represent connection between computers.where we want to allow message from any computer to get any other possibility with routing through intermidiate computer with minimum cost of connection vertices in a graph are cities and edges are root between cities we want to service a connected set of cities with minimum cost

61. TYPES OF GRAPHS DIRECTED GRAPH UNDIRECTED GRAPH IN THIS TYPE OF GRAPH PATH IS SPECIFIED THAT TYPE OF GRAPH IS CALLED DIRECTED GRAPH IN THIS TYPE OF GRAPH PATH IS NOT SPECIFIED IN THIS TYPE OF GRAPH THIS TYPE OF GRAPH IS CALLED UNDIRECTED GRAPH

63. CONNECTED PATH THERE ARE SEVERAL UNDIRECTED GRAPH.TWO VERTICES IN AN UNDIRECTED GRAPH IS CALLED ADJACENT IF THERE IS AN EDGE OFROM FRIST TO THE SECOND ADJACENT

65. CONNECTED DISCONNECTED PATH CYCLE TREE

66. THANK YOU

68. Link list as data structure

69. LINK LIST Definition: In computer science linked list is a data structure that consist of a sequence of data record such that in each record there is a field that contains a reference of next record in a sequence

70. Link list are special list of some data element link to one another. each element in link list called a node. Each node in a link list must contain at least two fields. An information field and next address field. The information field contain the actual element on the list which may be a integer, character, string or a large records.

71. A linked list consists of several nodes. Each node consists of a data part and a link part. Node DataLink

72. Use of Linked List Linked list as a data structure was used to solve many computer problem with a language called IPL. The major use of linked list to develop 1- Artificial intelligence 2- Chess Program 3- General Problem Solver

73. Advantage of link list Link list are dynamic data structure. Efficient memory utilization that is memory is not pre allocated memory allocated. When ever it is required and is de allocated when it is no longer required. Insertion and deletion are easier and efficient Many complex application can easily handle with link list.

74. Disadvantage of link list 1.many complex required because each node contain more fields. 2.access to a particular node is little bit cumber some and time consuming.

75. Building a linked list DataLink 70 NULL 100 80NULL 200 90NULL 300 200

76. 102030 100 200 300 NULL This is linked list of 3 nodes Allocate memory for a new node 700 Set 99 value in data part of new node 99 Set link part of a new node,with the address of first node Adding a new node at the beginning

77. DELETION OF A NODE IN A LINK LIST 45568075 200 300400500 Initially link contain four nodes. Set links to the node. Delete third node from the list null Set value to the nodes FREE THE MEMORY OCCUPIED BY THIRD NODE

78. Types of link list Basically four types of link list : 1 singly link list. 2 doubly link list. 3 circular link list. 4 doubly and circular link list.

79. Singly link list A singly link list is one in which all nodes are linked together in same sequential manner. It is also called linear link list. It has the beginning and the end. The main with this list is that we cant access the previous node from the current node. This problem can be over come with link list. In this list each node divided in to two parts that is INFO AND NEXT.

80. SINGLY LINK LIST STARTA..X INFO PART ADDRESS PART B C

81. Doubly link list A doubly link list is one in which all nodes are linked together by multiple link which is used in accessing next node and previous node from the curve node in the list.Each node in a doubly link list field to the left node and the right node.This help to traversed the list in the forward direction and the backward direction.So doubly link list provide bi directional traversing.each node in a doubly list is divided in three parts. INFO: To contain the information. NEXT: To contain the pointer to the next node. BACK :To contain the pointer to the previous node.

82. DOUBLY LINK LIST BACK INFO NEXT

83. START.A.. B..C X

84. Circular link list A circular link list is one which having no of beginning and no of end. A singly link list in which the link field of the last node contain the address of the first node of the list.That is the last field of the last node does not contain the null pointer rather it point back to the beginning of the link list.

85. CIRCULAR LINK LIST START ABC...

86. DOUBLY CIRCULAR LINK LIST A doubly circular link list is one which has both the successor pointer and procedure pointer in circular manner.A dell is a variation of doubly link list

87. DOUBLY CIRCULAR LINK LIST START.A.... C. B