Algorithms: CSE 101 Homework I
Problem 1: (Function Order)
2
Is the function 2lg n polynomially bounded? Is the function log log n ! polynomially bounded? Justify
your answers
Solution.
bounded.
The function 2lg
2
n
is not polynomially bounded. The functi
Algorithms Homework IV
Solve the following problems. Consult the style guide for writing solutions. Each problem is worth 10
points.
Problem 1: Covering a spectrum:
You want to create a scientic laboratory capable of monitoring any frequency in the electr
KEY
ECE 118 Quiz 2!
2pts
Name:_
1 a) Below is the timing diagram for two-wire handshake Pull signals. To the right of
each signal, write source or receiver to indicate which device drives the lines.
Source
Receiver
Source
2pts
b) Redraw the diagram above
Midterm Solutions
CSE 101 Winter 2012
Problem 1.
2/9/12
Graph exploration (15 points)
Version B (yellow papers):
Version A (white papers):
A
B
C
D
A
B
C
D
E
F
G
H
E
F
G
H
I
J
K
L
I
J
K
L
a. (4 points) Given the above graph G, draw the reverse graph GR . E
Algorithms: CSE 101 Sample Mid-term Questions 1
1. Write a recursive algorithm that sorts a list of n items by dividing them into three sublists of n/3
items, sorting each sublist recursively and merging the three sorted sublists. Analyze your algorithm,
Algorithms: CSE 101 Homework II
Solve the following problems. Consult the style guide for writing solutions. Each problem is worth 10
points.
Problem 1: Finding the k th Smallest Element
You are given two sorted lists of size m and n. Give an O(log m + lo
Clark Guest 2005
ECE 118 Computer Interfacing
Topics
Digital I/O gates
Address decoding
Parallel Digital I/O
Handshaking
8255 chip
ECE 118 Chapter 3
PC printer port
IEEE-488
Digital signal conditioning
2
Clark Guest 2005
ECE 118 Computer Interfacing
Digit
Clark Guest 2005
ECE 118 Computer Interfacing
Topics
Digital to Analog Conversion
Signal Filtering
D/A & A/D
Analog to Digital Conversion
Signal Conditioning
ECE 118 Ch. 5
Noise and Interference
2
Clark Guest 2005
ECE 118 Computer Interfacing
Clark Guest
Clark Guest 2005
ECE 118 Computer Interfacing
Topics
Examples of Close-Loop Control
Approaches to Control
On-Off Control
Closed-Loop Control
Proportional Control
Determining Loop Response
ECE 118 Chapter 8
Proportional-Integral Control
Proportional-Integr
Clark Guest 2005
ECE 118 Computer Interfacing
Topics
What is computer interfacing?
Embedded vs general-purpose computers
Introduction
Microprocessors vs microcontrollers
Some approaches to computer interfacing
ECE 118 Chapter 1
Types of memory
The compute
Algorithms: CSE 101 Sample Final Exam 1
Time: 2 hours and 30 minutes
Maximum Points: 40
NAME:
Student ID:
Answer all the following questions:
1. 8 points Formulate the following problem as a directed or undirected graph problem. Clearly indicate
the set o
Algorithms: CSE 101 Sample Final Exam 2
August 3, 2007
Time: 2 hours and 45 minutes
Maximum Points: 40
NAME:
Student ID:
Answer the following questions:
1. 8 points Describe an efcient algorithm to nd a directed path that has the maximum number of
edges a
ECE 118 Quiz 1!
2pts
KEY
Name:_
1. What is the single most distinguishing feature between microcontrollers and
microprocessors?
Microcontrollers have peripheral devices built onto the same chip as the CPU,
microprocessors do not.
3pts
2. The class notes l
Clark Guest 2005
ECE 118 Computer Interfacing
Topics
Video Cameras and Monitors
CCD Camera
Video Interfacing
Video Signal
Video Sampling Circuit
ECE 118 Ch. 7
Video Capture and Display
Color Video
Digital Video
Video Connectors
2
Clark Guest 2005
ECE 118
KEY
ECE 118 Quiz 4!
2pts
Name:_
1. a) For I2C, write out what the following two signal names mean:
SCL: Serial Clock
SDA: Serial Data
6pts
b) The diagram below represents an I2C message, with each capital letter representing
one or more bits serving some
Clark Guest 2005
ECE 118 Computer Interfacing
Topics
Digital to Analog Conversion
Signal Filtering
D/A & A/D
Analog to Digital Conversion
Signal Conditioning
ECE 118 Ch. 5
Noise and Interference
2
Clark Guest 2005
ECE 118 Computer Interfacing
Clark Guest
Clark Guest 2005
ECE 118 Computer Interfacing
Topics
Digital I/O gates
Address decoding
Parallel Digital I/O
Handshaking
8255 chip
ECE 118 Chapter 3
IEEE-488
Digital signal conditioning
2
Clark Guest 2005
ECE 118 Computer Interfacing
Digital I/O Gates
D F
Clark Guest 2005
ECE 118 Computer Interfacing
Topics
Direct input and output
S oft ware-Hardware
I nterface
Interrupts
Operating system mediated I/O
Direct Memory Access
ECE 118 Chapter 2
2
Clark Guest 2005
ECE 118 Computer Interfacing
Clark Guest 2005
EC
Clark Guest 2005
ECE 118 Computer Interfacing
Topics
What is computer interfacing?
Embedded vs general-purpose computers
I ntroduction
M icroprocessors vs microcontrollers
S ome approaches to computer interfacing
ECE 118 Chapter 1
Types of memory
The comp
Clark Guest 2005
ECE 118 Computer Interfacing
ECE 118 Information
Professor: Clark Guest
Office: EBU1-3407
email: c [email protected]
C ourse Description
Put ECE118 in the subject
Voice: 858-534-6549
Office Hours: Tues, Thur. 2:00pm-3:00pm
Website: h ttp:/
/
ECE 118 Quiz 5!
4pts
KEY
Name:_
1. Both Thunderbolt and PCI-E use the concept of a lane. What is a lane, how many
wires are used for a lane, how are they used, and how does this relate to the ideal of
duplex?
A lane is one serial data connection
Two wires
Algorithms: CSE 101 Homework III
Solve the following problems. Consult the style guide for writing solutions. Each problem is worth 10
points.
Problem 1: Find a source (DPV)
Give an efcient algorithm which takes as input a directed graph G = (V, E ), and
Disjkstras Shotest-Path Algorithm
Notations and denitions
The input of Dijkstras algorithm is a graph G = (V, E ) and a starting vertex s V .
The output is for each v V , the length to the shortest path d(v ).
At every moment, the set of the vertices t
Clark Guest 2005
ECE 118 Computer Interfacing
Topics
Video Cameras and Monitors
CCD Camera
Video Interfacing
Video Signal
Video Sampling Circuit
ECE 118 Ch. 7
Video Capture and Display
Color Video
Digital Video
Video Connectors
2
Clark Guest 2005
ECE 118