Lecture01

Lecture01 - Goals of Course Concept of Data Abstraction...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
CS2134 Goals of Course Concept of Data Abstraction Toolbox of useful abstract data types and their implementations (data structures) Toolbox of useful algorithms Basics of analyzing efficiency of algorithms Some more C++
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CS2134 Concept of Data Abstraction Classes in Object Oriented languages group data (member variables) with operations to manipulate the data (member functions) Abstract Data Types Abstract description of the operations provided and the relationships among them Different implementations are possible for the same ADT Separation of concerns between data type implementation and use OO languages developed to support ADTs
Background image of page 2
CS2134 Toolbox of fundamental data structures vectors lists stacks queues sets and maps binary trees priority queues graphs
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CS2134 Toolbox of fundamental algorithms sorting and searching parsing and evaluation of expressions graph algorithms
Background image of page 4
CS2134 Understanding of how to analyze efficiency of programs More advanced programming techniques more on recursion, dynamic data structures, STL, . ..
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CS2134 Factors affecting Running Time of a Program size of input particular input of a given size worst input “average” input best input (not usually interesting) details of environment: processor speed, number of registers, access time for memory, … We usually ignore these when analyzing the algorithm
Background image of page 6
Size of Input for (i=0;i<n;i++)     sum += a[i] for (i=0;i<n;i++)    for(j=0; j<n; j++)        sum += a[i]*a[j] n steps 10 10 100 100
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 22

Lecture01 - Goals of Course Concept of Data Abstraction...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online