CSI 2110 Lecture Notes - Lecture 2: History Of The Web Browser, Big O Notation, Text Editor

73 views2 pages

Document Summary

We must find a constant c and a constant n0 such that: 1<=n2 for all n>=1 f(n)<=60n2 + 5n2+n2 for all n>=1 f(n)<=66n2 for all n>=1 c=66, n0 =1 ---> f(n)=o(n2) Theorem: if g(n) is o(f(n)), then for any constant c>0, g(n) is also o(c f(n)) Re(cid:373)e(cid:373)ber: (cid:1005) + (cid:1006) + + (cid:374) = (cid:374)(cid:894)(cid:374)+(cid:1005)(cid:895)/(cid:1006) Must specify what can be stored in the adt. Must specify what operations can be done on/by the adt. Information is hidden and can easily be changed. Adt stack - implemented with arrays or singly linked lists. Adt queue - implemented with arrays or singly linked lists. Adt double ended queues - implemented with doubly linked lists. Push(o) - pushes object o onto top of stack. Pop() - removes the top object of stack and returns it. Size() - returns number of objects in stack isempty() - returns boolean indicating if stack is empty. Top() - returns the top object of stack without removing it.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

Related Questions