CS 3343 (Fall 2013) Assignment 6 (80 points)
Due: Nov 12 before class starts
1. (15 point) Shortest paths
Use dynamic programming to find the shortest path from node S to node G on the following graph
EE3301 , Spring 2014
Department of Electrical Engineering,
University of Texas -Dallas
Name:
Last 4 digits of SID:
Instructions:
Please write your name and last 4 digits of your student ID.
This exam
ECE 210 ELECTRICAL CIRCUIT ANALYSIS
University of Illinois at Chicago
Hour Exam #2
Spring 2009
Problem 3 (15 points)
Find voltage V0. Show all necessary steps in your calculations.
6k!)
Va:
Proble
EE3301 , Fall 2016
Department of Electrical Engineering,
University of Texas -Dallas
Name:
Last 4 digits of SID:
Instructions:
Please write your name and last 4 digits of your student ID.
This exam is
Practice Midterm Exam Fall 2017
I.
Name: _
Answer each of the following. No explanation is required
a. What is the worst-case asymptotic running-time for the best algorithm for finding
something in a
' @DALLAS
EE3301 Fall 2014
Department of Electrical Engineering,
University of Texas -Dallas
Problem 1 125 points:
Q1. The measured electric current in a cable is given by: i(t) = (105in(120m) +5)[A
EE3301 , Spring 2015
Department of Electrical Engineering,
University of Texas -Dallas
Name:
Last 4 digits of SID:
Instructions:
Please write your name and last 4 digits of your student ID.
This exam
CS 3343.001 (Fall 2015) Exam 1 Solution
1. (16 points) For each pair of functions in the table below, determine whether f (n) O(g(n),
f (n) (g(n), f (n) (g(n), or all of them. It is NOT necessary to j
CS 3343: Analysis of
Algorithms
Lecture 14: Order Statistics
Order statistics
The ith order statistic in a set of n elements
is the ith smallest element
The minimum is thus the 1st order statistic
CS 3343: Analysis of
Algorithms
Lecture 13: Linear time sorting
More about sorting
How many sorting algorithms do you
know?
What are their time complexity?
Whats common about them?
Can we do bette
CS 3343: Analysis of
Algorithms
Lecture 17: Intro to Dynamic
Programming
In the next few lectures
Two important algorithm design techniques
Dynamic programming
Greedy algorithm
Meta algorithms, no
CS 3343: Analysis of
Algorithms
Lecture 5: Solving recurrence by
recursion-tree method
Problem of the day
How many multiplications do you need to
compute 316?
316 =3 x 3 x 3 . x 3
Answer: 15
316 =38
Analysis of Algorithms
CS 477/677
Randomizing Quicksort
Instructor: George Bebis
(Appendix C.2 , Appendix C.3)
(Chapter 5, Chapter 7)
Randomizing Quicksort
Randomly permute the elements of the input
CS 3343: Analysis of
Algorithms
Lecture 10: Heap sort
Heap sort
Another (n log n) sorting algorithm
In practice quick sort wins
The heap data structure and its variants
are very useful for many alg
EE3301 , Fall 2014
Department of Electrical Engineering,
University of Texas -Dallas
Name:
Last 4 digits of SID:
Instructions:
Please write your name and last 4 digits of your student ID.
This exam is
Disjoint sets
The union-find ADT
10/17/17
10/17/17
10/17/17
10/17/17
10/17/17
10/17/17
10/17/17
10/17/17
10/17/17
10/17/17
10/17/17
Review: Union Find Operations
Given an unchanging set S, create an
CS 3343 (Fall 2013) Assignment 7
Due: Dec 5 (Thur) before class starts
Part II - Questions 6-9, 45 points.
Your name:
Discussed with:
6. (10 points) Print out the confirmation email that you have done
CS 3343 (Spring 2013) Assignment 4
Solution
1. (25 points) Quick sort.
a. (10 points) Study the pseudocode of the Partition algorithm in lecture9.ppt. Use Slide #37 as a
model, illustrate the operatio
CS 3343 (Fall 2013) Assignment 2 (80 points)
Due: Sept 17 before class starts
1. (20 points) Find the order of growth of the following sums (i.e., is it in (n2 ), (nlgn), or . . . ?) If the
analysis i
Homework 4 Answers
CS 3343 Spring 2016
Tom Bylander, Instructor
assigned March 7, 2016
due March 25, 2016
Your solutions must be submitted to Blackboard as a PDF document.
1. (10 pts.) Use a recursion
Homework 3 Answers
CS 3343 Spring 2016
Tom Bylander, Instructor
assigned February 22, 2016
due March 4, 2016
Your solutions must be submitted to Blackboard as a PDF document.
1. (10 pts.) Use a recurs
Homework 5 Answers
CS 3343 Spring 2016
Tom Bylander, Instructor
assigned April 6, 2016
due April 15, 2016
Your solutions must be submitted to Blackboard as a PDF document.
1. (10 pts.) Show a recursio
CS 3343 (Fall 2013) Assignment 7
Solution
1. Fractional knapsack problem.
Weight (LB)
10
50
40
20
40
10
x
Item ID
A
B
C
D
E
F
Total
Value ($)
40
30
80
60
10
60
x
Value / Weight ($/LB)
4.0
0.6
2.0
3.0
CS 3343 (Fall 2013) Assignment 1
Due: Tuesday, Sept 10 before class starts
1. (25 points) Order the following functions according to their order of growth from the lowest to the
highest. If you think
Homework 1 Answers
CS 3343 Spring 2016
Tom Bylander, Instructor
assigned January 11, 2016
due January 27, 2016
Your solutions must be submitted to Blackboard as a PDF document.
1. (20 pts.) Using the
Advanced Engineering Mathematics: class 24
Applications of residues
William Vandenberghe
UT Dallas
April 17, 2017
William Vandenberghe (UT Dallas)
Advanced Engineering Mathematics: class 24
April 17,