Computer notes - data structures

1.
Class No 1Data Structures http://ecomputernotes.com

2.
Data Structures Preparesthe students for (and is a prerequisite for) the more advanced material students will encounter in later courses. Cover well-known data structures such as dynamic arrays, linked lists, stacks, queues, tree and graphs. Implement data structures in C++ http://ecomputernotes.com

3.

4.

5.
Need for DataStructures Data structures organize data  more efficient programs. More powerful computers  more complex applications. More complex applications demand more calculations. http://ecomputernotes.com

6.

7.

8.
Organizing Data Anyorganization for a collection of records that can be searched, processed in any order, or modified. The choice of data structure and algorithm can make the difference between a program running in a few seconds or many days. http://ecomputernotes.com

9.
Organizing Data Anyorganization for a collection of records that can be searched, processed in any order, or modified. The choice of data structure and algorithm can make the difference between a program running in a few seconds or many days. http://ecomputernotes.com

10.
Efficiency A solutionis said to be efficient if it solves the problem within its resource constraints . Space Time The cost of a solution is the amount of resources that the solution consumes. http://ecomputernotes.com

11.
Efficiency A solutionis said to be efficient if it solves the problem within its resource constraints. Space Time The cost of a solution is the amount of resources that the solution consumes. http://ecomputernotes.com

12.
Selecting a DataStructure Select a data structure as follows: Analyze the problem to determine the resource constraints a solution must meet. Determine the basic operations that must be supported. Quantify the resource constraints for each operation. Select the data structure that best meets these requirements. http://ecomputernotes.com

13.

14.

15.
Some Questions toAsk Are all data inserted into the data structure at the beginning, or are insertions interspersed with other operations? Can data be deleted? Are all data processed in some well-defined order, or is random access allowed? http://ecomputernotes.com

16.

17.

18.
Data Structure PhilosophyEach data structure has costs and benefits. Rarely is one data structure better than another in all situations. A data structure requires: space for each data item it stores, time to perform each basic operation, programming effort. http://ecomputernotes.com

19.

20.

21.
Goals of thisCourse Reinforce the concept that costs and benefits exist for every data structure. Learn the commonly used data structures. These form a programmer's basic data structure “toolkit.” Understand how to measure the cost of a data structure or program. These techniques also allow you to judge the merits of new data structures that you or others might invent. http://ecomputernotes.com

22.
Goals of thisCourse Reinforce the concept that costs and benefits exist for every data structure. Learn the commonly used data structures. These form a programmer's basic data structure “toolkit”. Understand how to measure the cost of a data structure or program. These techniques also allow you to judge the merits of new data structures that you or others might invent. http://ecomputernotes.com

23.
Goals of thisCourse Reinforce the concept that costs and benefits exist for every data structure. Learn the commonly used data structures. These form a programmer's basic data structure “toolkit”. Understand how to measure the cost of a data structure or program. These techniques also allow you to judge the merits of new data structures that you or others might invent. http://ecomputernotes.com

24.
Arrays Elementary datastructure that exists as built-in in most programming languages. main( int argc , char** argv ) { int x[6]; int j; for(j =0; j < 6; j++) x[j ] = 2*j; } http://ecomputernotes.com

25.
Arrays Array declaration: int x[6]; An array is collection of cells of the same type. The collection has the name ‘x’. The cells are numbered with consecutive integers. To access a cell, use the array name and an index: x[0], x[1], x[2], x[3], x[4], x[5] http://ecomputernotes.com

26.
Array Layout x[1]x[2] x[3] x[4] x[5] x[0] Array cells are contiguous in computer memory The memory can be thought of as an array http://ecomputernotes.com

27.
What is ArrayName? ‘x’ is an array name but there is no variable x. ‘x’ is not an lvalue . For example, if we have the code int a, b;then we can write b = 2; a = b; a = 5;But we cannot write 2 = a; http://ecomputernotes.com

28.
What is ArrayName? ‘ x’ is an array name but there is no variable x. ‘x’ is not an lvalue . For example, if we have the code int a, b;then we can write b = 2; a = b; a = 5; But we cannot write 2 = a; http://ecomputernotes.com

29.
What is ArrayName? ‘x’ is an array name but there is no variable x. ‘x’ is not an lvalue . For example, if we have the code int a, b;then we can write b = 2; a = b; a = 5; But we cannot write 2 = a; http://ecomputernotes.com

30.
Array Name ‘x’is not an lvalue int x[6]; int n; x[0] = 5; x[1] = 2; x = 3; // not allowed x = a + b; // not allowed x = &n; // not allowed http://ecomputernotes.com

31.
Array Name ‘x’is not an lvalue int x[6]; int n; x[0] = 5; x[1] = 2; x = 3; // not allowed x = a + b; // not allowed x = &n; // not allowed http://ecomputernotes.com

32.
Dynamic Arrays Youwould like to use an array data structure but you do not know the size of the array at compile time. You find out when the program executes that you need an integer array of size n=20. Allocate an array using the new operator: int * y = new int[20]; // or int * y = new int[n ]y[0] = 10;y[1] = 15; // use is the same http://ecomputernotes.com

33.
Dynamic Arrays Youwould like to use an array data structure but you do not know the size of the array at compile time. You find out when the program executes that you need an integer array of size n=20. Allocate an array using the new operator: int * y = new int[20]; // or int * y = new int[n ]y[0] = 10;y[1] = 15; // use is the same http://ecomputernotes.com

34.
Dynamic Arrays Youwould like to use an array data structure but you do not know the size of the array at compile time. You find out when the program executes that you need an integer array of size n=20. Allocate an array using the new operator: int* y = new int[20]; // or int* y = new int[n] y[0] = 10; y[1] = 15; // use is the same http://ecomputernotes.com

35.
Dynamic Arrays ‘y’ is a lvalue; it is a pointer that holds the address of 20 consecutive cells in memory. It can be assigned a value. The new operator returns as address that is stored in y. We can write: y = &x[0]; y = x; // x can appear on the right // y gets the address of the // first cell of the x array http://ecomputernotes.com

36.

37.

38.
Dynamic Arrays Wemust free the memory we got using the new operator once we are done with the y array. delete[ ] y; We would not do this to the x array because we did not use new to create it. http://ecomputernotes.com

39.
The LIST DataStructure The List is among the most generic of data structures. Real life: shopping list, groceries list, list of people to invite to dinner List of presents to get http://ecomputernotes.com

40.
Lists A listis collection of items that are all of the same type (grocery items, integers, names) The items, or elements of the list, are stored in some particular order It is possible to insert new elements into various positions in the list and remove any element of the list http://ecomputernotes.com

41.

42.

43.
Lists List isa set of elements in a linear order. For example, data values a 1 , a 2 , a 3 , a 4 can be arranged in a list: (a 3 , a 1 , a 2 , a 4 ) In this list, a 3 , is the first element, a 1 is the second element, and so on The order is important here; this is not just a random collection of elements, it is an ordered collection http://ecomputernotes.com

44.
Lists List isa set of elements in a linear order. For example, data values a 1 , a 2 , a 3 , a 4 can be arranged in a list: (a 3 , a 1 , a 2 , a 4 ) In this list, a 3 , is the first element, a 1 is the second element, and so on The order is important here; this is not just a random collection of elements, it is an ordered collection http://ecomputernotes.com

45.
List Operations Usefuloperations createList(): create a new list (presumably empty) copy(): set one list to be a copy of another clear(); clear a list (remove all elments) insert(X, ?): Insert element X at a particular position in the list remove(?): Remove element at some position in the list get(?): Get element at a given position update(X, ?): replace the element at a given position with X find(X): determine if the element X is in the list length(): return the length of the list. http://ecomputernotes.com

46.
List Operations Weneed to decide what is meant by “particular position”; we have used “?” for this. There are two possibilities: Use the actual index of element: insert after element 3, get element number 6. This approach is taken by arrays Use a “current” marker or pointer to refer to a particular position in the list. http://ecomputernotes.com

47.
List Operations Weneed to decide what is meant by “particular position”; we have used “?” for this. There are two possibilities: Use the actual index of element: insert after element 3, get element number 6. This approach is taken by arrays Use a “current” marker or pointer to refer to a particular position in the list. http://ecomputernotes.com

48.
List Operations Ifwe use the “current” marker, the following four methods would be useful: start() : moves to “current” pointer to the very first element. tail() : moves to “current” pointer to the very last element. next (): move the current position forward one element back (): move the current position backward one element http://ecomputernotes.com

Computer notes - data structures

More Related Content

What's hot

Similar to Computer notes - data structures

More from ecomputernotes

Recently uploaded

Computer notes - data structures