Upgrade to remove ads
Only $35.99/year

CSCI DATA STRUCT University of Georgia MID TERM

Terms in this set (27)

explicit
Makes typecasting impossible
.h and .cpp
For information hiding
destructor
Preforms termination housekeeping
ADT operations
Constructor, transformer, observer, iterator
Transformer examples
Anything that changes of value(pop, push)
Observer examples
Any get functions
How to find address
Address= base address + index * size of element
Big O slowest to fastest
O(1) O(logn) O(n) O(n log n) O(n^2) O(2^n) O(N!)
Intractable
Problems of higher complexity
trackable
A problem that can be solved with the worst case
monotonoc increasing function
It either keeps rising, or falling.
Big O notation provides
The upper bound
Big omega provides
The lower bound
Teta
The intersection of the upper and lower bound
Generic data type
a function that doesn't manipulate items
Binary Search
min=0 max=SIZE-1 mid=(min+max)/2
Can you dereference a null pointer
NO
When do you need a destructor?
When you are dynamically allocating memory
When do we use a try catch
To see if we're out of memory when dynamically allocating shit
When is a case special
When we have to update head/listData
T OR F-List data pointer is always at the end
TRUE
In a linked list, inserting is only special when:
You insert at the end
In a linked list, deleting is only special when:
You delete the last node
Why are recursive functions less efficient
You're doing some stuff twice
Array based queue, rear=
(rear+1)%max. This is used with enqueue
A queue is full/empty
-Using a length variable
-You can NOT use just pointers (front and rear) to tell
Algorithm for full queue
If((rear+1)%max==front)
Other sets by this creator