PPT Slide

Course outline

Features of C++, object-oriented programming principles, and features of the Unix programming environment will be introduced concurrently with the study of these topics, as appropriate
Review of C++

Introduction to Unix
Review of program performance
• time and space complexity
• asymptotic notation
  -- searching (linear vs binary) & sorting (insertion sort vs mergesort)
Data representation and lists
Stacks and Queues
Hash tables
Binary trees
• representation
• traversal
Priority queues
• Linear lists
• Heaps
Search trees
• Binary search trees
• balanced binary search trees – AVL trees
Graphs
• representation
• traversal

• data representation:
  • formula-based
  • linked/ pointer-based
  • indirect
  • simulated pointer

• lists
  • ADT specification
  • representation using arrays
  • representation using linked lists
  • compare and contrast

adt linearList{
create()

destroy()
isEmpty()
isFull()
length()
Find(x,k)
Search(x)
delete(k,x)
insert(k,x)

}

class list{

public:
list();

~list();
bool isEmpty();
bool isFull();
int length();
bool Find(x,k);
int Search(x);
void delete(k,x);
void insert(k,x);

private:

};

Previous slide

Next slide

Back to first slide

View graphic version