Skip to Main Content
|
Brooklyn College Library & Academic IT
|
CISC Department
Brooklyn College Library
Brooklyn College Library LibGuides Home
CISC 3130
CISC 3130 Data Structures
Arithmetic Notations
Search this Guide
Search
CISC 3130 Data Structures: Arithmetic Notations
Professor Chuang Spring 2020 OER
Home
Lecture Notes
Data Structures
Toggle Dropdown
Primitive Data Types
Arrays
Linked Lists
Stack & Queue with LL
Binary Trees
Graphs
Associative Arrays
Algorithms
Toggle Dropdown
Searching Algorithms (linear structures)
Sorting Algorithms
Tree Traversals
Notations
Toggle Dropdown
Upper Bound (Big O) Notation
Arithmetic Notations
Programming Skills
Toggle Dropdown
Getting Started Guides
This link opens in a new window
Java SDK 8
Java Collections Framework
Regular Expressions
Build Tools (Apache Maven)
Version Control (Git)
GitHub Pages
Introduction
There are three notations:
Infix Notation (1 + 1)
Prefix Notation (+ 1 1)
Postfix Notation (1 1 +)
<<
Previous:
Upper Bound (Big O) Notation
Next:
Programming Skills >>