Programming Assignment Three: Electronic Trading
Out: November 10, 2015; Due: November 29, 2015.
I. Motivation
1. Get familiar with the various data structures provided by STL: priority
queues (std:priority_queue), hash tables (std:unordered_map,
std:unor
Programming Assignment Two: Priority Queue and its Application
Out: October 28, 2015; Due: November 11, 2015.
I.
Motivation
This project will give you experience in implementing priority queues using C+. You will also
empirically study the efficiency of d
Programming Assignment One: Sorting
Out: Sep. 26, 2015; Due: Oct. 10, 2015.
I. Motivation
1. To give you experience in implementing various sorting algorithms.
2. To empirically study the time efficiency of different sorting algorithms.
II. Programming As
Programming Assignment Four: Graph Algorithms
Out: Nov. 27, 2015; Due: Dec. 11, 2015.
I. Motivation
1. To give you experience in implementing a graph data structure using the adjacency list
representation.
2. To give you experience in implementing a few g
Ve281 Data Structures and Algorithms
Written Assignment Four
This assignment is announced on Nov. 26th, 2015. It is due by 3:40 pm on Dec.
4th, 2015. The assignment consists of six problems.
1. AVL tree
(a) Suppose that we insert a sequence of keys 2, 1,
Ve281 Data Structures and Algorithms
Written Assignment Five
This assignment is announced on Nov. 30th, 2015. It is due by 5:40 pm on
Dec. 9th, 2015. The assignment consists of four problems. For those problems
that ask you to design algorithms, you can e
Ve281 Data Structures and Algorithms
Written Assignment Two
This assignment is announced on Oct. 10th, 2015. It is due by 3:40 pm on
Oct. 23rd, 2015. The assignment consists of five problems.
1. Sort 3, 7, 4, 1, 8, 9, 2, 6, 5, 10 using merge sort. Show th
Ve281 Data Structures and Algorithms
Written Assignment Three
This assignment is announced on Oct. 24th, 2015. It is due by 3:40 pm on
Nov. 6th, 2015. The assignment consists of six problems.
1. A full node in a binary tree is a node with two children. Pr
Ve281 Data Structures and Algorithms
Written Assignment One
This assignment is announced on September 19th, 2015. It is due by 3:40 pm
on September 28th, 2015. The assignment consists of six problems.
1. Suppose that you and your friend are playing a game
VE281
Data Structures and Algorithms
Dynamic Programming
Final Exam
Time: Dec. 14th, 2:00 pm 3:40 pm.
Location: Dong Xia Yuan 104 & 106. More details on Sakai.
A written exam.
Like our written assignments.
Pseudo-code OK (but make sure we can underst
VE281
Data Structures and Algorithms
Dynamic Programming
Outline
Dynamic Programming
Motivation
Example: Matrix-Chain Multiplication
2
Algorithm Design Methods
We have already learned two ways to design algorithms:
Greedy method.
Divide and conquer.
VE281
Data Structures and Algorithms
AVL Trees; Red-black Trees
AVL Trees
Rotation to fix unbalanced trees.
Four cases to consider on unbalance:
Left-left/Right-right/Left-right/Right-left insertion.
To fix: single rotation
double rotation
When an AVL
VE281
Data Structures and Algorithms
Shortest Path
Review
Breadth-First Search
What? Visit all directly connected neighbors first, then nodes 2
hops away, 3 hops away, and so on.
How? Based on a queue.
Time complexity?
Topological Sorting
What?
Onl
VE281
Data Structures and Algorithms
Minimum Spanning Tree
Review
Shortest Path Problem for Unweighted Graph
Apply breadth-first search
Shortest Path Problem for Weighted Graph
Dijkstras algorithm
2
Outline
Minimum Spanning Tree
Problem
Prims Algor
VE281
Data Structures and Algorithms
Graph Search; Topological Sorting
Review
Graph size and complexity
In terms of | and |
Sparse graph versus dense graph
Graph representation
Adjacent matrix
Adjacent list
Graph search
What?
Why?
How?
2
DFS(v)
Review for final
The names of E, D, P,(B,H,M). What are their relations? What are the definition of P and M.
What is the polarization process and the magnetization process?
what is electric dipole? What is magnetic dipole?
D E P relation with Q
Capacitanc
Review for final
The names of E, D, P,(B,H,M). What are their relations? What are the definition of P and M.
What is the polarization process and the magnetization process?
what is electric dipole? What is magnetic dipole?
D E P relation with Q
Capacitanc
Problem 5.84 Consider an FIR system with the following system function:
H ( z ) (1 0.9e j 0.4 z 1 )(1 0.9e j 0.4 z 1 )(1 1.5e j 0.6 z 1 )(1 1.5e j 0.6 z 1 )
Determine the system function H c ( z ) of a causal and stable compensating system so that the
cas
Problem 5.78 Consider an FIR system with the following system function:
H ( z ) (1 0.8e j /2 z 1 )(1 0.8e j / 2 z 1 )(1 1.5e j /4 z 1 )(1 1.5e j /4 z 1 )
(a) Determine all systems that have the same magnitude response. Which is the minimum-phase
system.
S
VE270 Introduction to Logic Design
Recitation Class
Week 5
By Gao Yuan
1
Outlines
Latch, Flip Flop, Register
Finite State Machine
Sequential circuit
Latch
SR Latch
Internal Structure
Symbol
Latch
Another SR Latch
Internal Structure
Symbol
Latch
Gated SR L
Outline
Numerical system
Logic gates, truth table and logic circuits
Boolean algebra (if time permitted)
Numerical System
Conversion of Integral Part
By multiplication (lower degree to higher degree) and division (higher degree to lower degree).
Eg. 1 (10
VE270 Introduction to Logic Design
Recitation Class
Week 2
By Gao Yuan
1
Outlines
Number Systems
Logic Equation, Truth Table, & Logic Circuit
Logics in practical scenario
Number systems
Base ten (Decimal)
Base two (Binary)
Number systems
Base 16 (Hexadeci
VE270 Introduction to Logic Design
Recitation Class
Week 2
Summer 2015
By Ma Xinzhao
Outlines
Boolean Algebra & Optimization
DeMorgans Law
Minterms and Maxterms
Simplification and Optimization
Combination Circuit
Concepts
Combinational Building Blo
Outline
HWK
FSM
Experience sharing
Treat the first DFF as a synchronizer
Simple Question
FSM
E.g
FSM
FSM
FSM
FSM
FSM
FSM
FSM
FSM
FSM
Last step: implement the circuit.