Podcast
Questions and Answers
Which of the following actions is LEAST likely to cause disquiet?
Which of the following actions is LEAST likely to cause disquiet?
- Breaking plans at the last minute
- Interrupting someone who is speaking
- Sharing a thoughtful compliment (correct)
- Spreading false rumors about a friend
A task is defined as an assignment of work done as part of ones duties?
A task is defined as an assignment of work done as part of ones duties?
True (A)
Give an example of a physical sensation that could be described as 'prickly'.
Give an example of a physical sensation that could be described as 'prickly'.
tingling
To become aware of something directly through any of the senses is to ______ it.
To become aware of something directly through any of the senses is to ______ it.
Which of the following is the BEST example of something 'adaptable'?
Which of the following is the BEST example of something 'adaptable'?
Focus is to deviate from a specific point or purpose.
Focus is to deviate from a specific point or purpose.
Provide an adjective that describes something 'not typical, usual, or regular'.
Provide an adjective that describes something 'not typical, usual, or regular'.
Match the word with its definition:
Match the word with its definition:
Which word best describes something that makes you unable to move or act?
Which word best describes something that makes you unable to move or act?
A prominent or distinctive part, quality, or characteristic is known as a ______.
A prominent or distinctive part, quality, or characteristic is known as a ______.
Flashcards
Grimace
Grimace
Shap testing of the face, indicating disgust or distorter.
Mesmerize
Mesmerize
To mesmerize someone it's to spill bind them.
Prickly
Prickly
A prickly feeling is a tingling sensation.
Perceive
Perceive
Signup and view all the flashcards
Task
Task
Signup and view all the flashcards
Abnormal
Abnormal
Signup and view all the flashcards
Adaptable
Adaptable
Signup and view all the flashcards
Disquiet
Disquiet
Signup and view all the flashcards
Feature
Feature
Signup and view all the flashcards
Focus
Focus
Signup and view all the flashcards
Study Notes
- Algorithmic trading (AT) has changed finance through technology improvements, increased data, and demand for fast execution
- Algorithmic trading uses computer programs with defined instructions to place trades
Algorithmic Trading System
- Algorithm development involves creating strategies based on math models and data
- Backtesting uses data to simulate the algorithm's performance
- Risk parameters are set to control losses and ensure compliance
- Order generation makes buy/sell orders based on conditions
- Execution routes orders to venues for trade
- Monitoring tracks market conditions and makes needed adjustments
Algorithmic Trading Strategies
- Trend Following capitalizes on market trends
- Mean Reversion bets on prices reverting to their average
- Arbitrage exploits price differences in markets
- Market Making uses buy/sell orders, profiting from the bid-ask spread
- Execution Algorithms optimize order execution to minimize transaction costs
- Statistical Arbitrage identifies pricing anomalies, profiting from short-term mispricings
High-Frequency Trading (HFT)
- HFT is a type of AT using extremely high speeds, turnover rates, and short-term positions
- HFT firms use co-location for minimizing latency
- HFT strategies might include market making, quote stuffing, and latency arbitrage
Order Book Dynamics
- An order book contains outstanding buy and sell orders organized by price
- It provides data about liquidity, price levels, and market depth
- The order book is a key input for AT strategies
Order Book Example
- Here is a basic Level II Order Book example:
Bid Price | Bid Size | Ask Price | Ask Size |
---|---|---|---|
100.00 | 100 | 100.05 | 100 |
99.99 | 200 | 100.06 | 200 |
99.98 | 300 | 100.07 | 300 |
99.97 | 400 | 100.08 | 400 |
99.96 | 500 | 100.09 | 500 |
Order Types
- Market Order is used to buy/sell fast at the best price
- Limit Order buys/sells at a specified price
- Stop Order becomes a market order when the stop hits the price
- Stop-Limit Order becomes a limit order when the stop hits the price
- Hidden (Iceberg) Order only shows a partial quantity in the order book
Market Impact
- AT can have market dynamics effects
- Large orders by algorithms can move prices quickly
- Execution algorithms aim to minimize effects by having smaller pieces over time
Regulation and Ethics
- AT has regulatory oversight to prevent manipulation
- Ethical considerations include transparency, fairness, and avoiding market destabilization
Conclusion
- Understanding algorithmic trading and its effects on order books is essential
Algorithmic Complexity
What is it?
- It is a measure of the resources (time, storage) needed for an algorithm
- It is shown as a function of the size of a problem
- It compares algorithms independently of implementation and hardware
Why is it Important?
- It helps to pick the correct algorithm
- Knowing an algorithms scales lets you predict performance on inputs
- It avoids nasty surprises!
How is it Measured?
- Time complexity is the number of operations an algorithm performs
- Space Complexity is the amount of memory an algorithm uses
- Time complexity is focussed on, but space can also be crucial
- Worst case scenario is usually the thing to focus on
Big O Notation
- Describes the upper bound of an algorithms complexity
- Focuses on ignoring constant factors and lower order terms
- Describes how resources grow as inputs increase
- Examples:
- $O(1)$ - Constant
- $O(\log n)$ - Logarithmic
- $O(n)$ - Linear
- $O(n \log n)$ - "Linearithmic"
- $O(n^2)$ - Quadratic
- $O(2^n)$ - Exponential
- $O(n!)$ - Factorial
Common Complexities
Complexity | Name | Example |
---|---|---|
$O(1)$ | Constant | Array lookup |
$O(\log n)$ | Logarithmic | Binary search |
$O(n)$ | Linear | Linear Search |
$O(n \log n)$ | "Linearithmic" | Merge sort |
$O(n^2)$ | Quadratic | Bubble sort |
$O(2^n)$ | Exponential | Tower of Hanoi |
$O(n!)$ | Factorial | Generate all permutations |
Practical Implications
- $O(n)$ scales better than $O(n^2)$
- Algorithm choice is more important as n grows
- An $O(n^2)$ algorithm might be faster for small n but slower for large n
Tips
- Know the complexities of common algorithms
- Be aware of hidden complexity
- Test with large datasets to confirm expected performance
Studying That Suits You
Use AI to generate personalized quizzes and flashcards to suit your learning preferences.