CSE 331: Introduction to Algorithm Analysis and Design
Fall 2011
Homework 9
Due Friday, November 18, 2011 by 1:15pm in class
Please submit each problem separately, i.e. each problem should begin on a new page and only the
pages for one problem should be s
CSE 331: Introduction to Algorithm Analysis and Design
Fall 2013
H OMEWORK 2
Due Friday, September 20, 2013 by 1:15pm in class
IMPORTANT: Please submit each problem separately, i.e. each problem should begin on a new page
and only the pages for one proble
CSE 331: Introduction to Algorithm Analysis and Design
Fall 2014
H OMEWORK 4
Due Friday, October 3, 2014 by 1:15pm in class
IMPORTANT: Please submit each problem separately, i.e. each problem should begin on a new
page and only the pages for one problem s
NAME:
CSE 331
Introduction to Algorithm Analysis and Design
Sample Final Exam Solutions
1. (5 2 = 10 points) Answer True or False to the following questions. No justication
is required. (Recall that a statement is true only if it is logically true in all
CSE 331: Introduction to Algorithm Analysis and Design
Fall 2011
Homework 1
Due Friday, September 16, 2009 by 1:15pm in class
IMPORTANT: Please submit each problem separately, i.e. each problem should begin
on a new page and only the pages for one problem
NAME:
CSE 331
Introduction to Algorithm Analysis and Design
Sample Final Exam: Fall 2015
Atri Rudra
November 27, 2015
DIRECTIONS:
Closed Book, Closed Notes except for two 8 12 11
review sheet.
Time Limit: 2 hours 30 minutes.
Answer the problems on the
NAME:
CSE 331
Introduction to Algorithm Analysis and Design
Sample Mid-term Exam-II: Fall 2015
Atri Rudra
DIRECTIONS:
Closed Book, Closed Notes except for one 8 12 11
review sheet.
Time Limit: 50 minutes.
Answer the problems on the exam paper.
Each pr
S OLUTIONS TO CSE 331 S AMPLE M ID - TERM -II
Please do not read anything into the kind of problems in the sample mid-term. Overall, the
mid-term will be harder than this sample mid-term (but still easier than the homeworks). The
main purpose of this samp
S OLUTIONS TO CSE 331 S AMPLE M ID - TERM -I
Please do not read anything into the kind of problems in the sample mid-term. Overall, the
mid-term will be harder than this sample mid-term (but still easier than the homeworks). The
main purpose of this sampl
NAME:
CSE 331
Introduction to Algorithm Analysis and Design
Sample Mid-term Exam-I: Fall 2015
Atri Rudra
DIRECTIONS:
Closed Book, Closed Notes except for one 8 21 11
review sheet.
Time Limit: 50 minutes.
Answer the problems on the exam paper.
Make sur
COMP 482: Design and Analysis
of Algorithms
Spring 2013
Lecture 4
Prof. Swarat Chaudhuri
Q3:Analyzinganalgorithm
YouhaveanarrayAwithintegerentriesA[1],A[n]
Outputa2DarrayBsuchthatB[i,j]containsthesumA[i]+A[i+1]+A[j]
Hereisanalgorithm:
Fori=1,2,n
Forj=i+1,
Lecture 6
CSE 331
Sep 9, 2013
Homeworks
HW 1 posted online: see piazza
Pickup graded HW 0 in TA OHs/recitations
Comments on feedback
70% on exams and 4% on group project seems uneven (unfair? )
Distribution proportional to time spent preparing for it.
Asi
Lecture 8
CSE 331
Sep 12, 2014
HW 1 due today
Place Q1, Q2 and Q3 in separate piles
I will not accept HWs after 1:15pm
Other HW related stuff
HW 2 has been posted online: see piazza
Solutions to HW 1 at the END of the lecture
Clarification on collaboratio
Lecture 9
CSE 331
Sep 15, 2014
Run time of an algorithm
(Worst-case) run time T(n) for input size n
Maximum number of steps taken by the algorithm for
any input of size n
g(n) is O(f(n)
c*f(n) for some c>0
g(n)
n
n0
g(n) is (f(n)
g(n)
*f(n) for some >0
n
Lets do some introductions
http:/www.zazzle.com/warning_teaching_assistant_bag-149882665435161818
TAs first
Md S Q Zulkar Nine
mdsqzulk at buffalo
Office hours: TBA
OHs start next week
Frank Schoeneman
fvschoen at buffalo
Office hours: TBA
About Me
Atri R
Lecture'9'
CSE'331'
Sep'15,'2014'
Run'6me'of'an'algorithm
'
(Worst-case) run time T(n) for input size n
Maximum number of steps taken by the algorithm for
any input of size n
g(n)'is'O(f(n)
'
c*f(n) for some c>0
g(n)
n
n0
g(n)'is'(f(n)
'
g(n)
*f(n) for so
Lecture'8'
CSE'331'
Sep'12,'2014'
HW'1'due'today'
Place'Q1,'Q2'and'Q3'in'separate'piles!
I'will'not'accept'HWs'aAer'1:15pm'
Other'HW'related'stu
'
HW 2 has been posted online: see piazza
Solutions to HW 1 at the END of the lecture
ClaricaIon'on'collaboraI
Lecture 5
CSE 331
Sep 5, 2014
Submit the form
Ill need confirmation in writing. No graded material will be handed back till
I get this signed form from you!
Schedules and Deadlines
Schedules and Deadlines
Sign-up for mini projects
Email me your group (=6)
Lecture 4
CSE 331
Sep 3, 2014
Submit the form
Ill need confirmation in writing. No graded material will be handed back till
I get this signed form from you!
More clarification on sources
Office Hours
Frank: Tue + Th 1:00-1:50pm
Zulkar: Wed 4:00-4:50pm
+ T
Lecture 3
CSE 331
Aug 29, 2014
HW 0 due today
Place Q1, Q2 and Q3 in separate piles
I will not accept HWs after 1:15pm
Feedback for TA Office hours
Participate on Piazza!
Submit the form
Ill need confirmation in writing. No graded material will be handed
NAME:
CSE 331
Introduction to Algorithm Analysis and Design
Sample Final Exam: Fall 2010
Atri Rudra
DIRECTIONS:
1
Closed Book, Closed Notes except for two 8 2 11
review sheet.
Time Limit: 2 hours 30 minutes.
Answer the problems on the exam paper.
Each
NAME:
CSE 331
Introduction to Algorithm Analysis and Design
Sample Mid-term Exam: Fall 2010
Atri Rudra
DIRECTIONS:
Closed Book, Closed Notes except for one 8 1 11
2
review sheet.
Time Limit: 50 minutes.
Answer the problems on the exam paper.
Each prob
Solutions to CSE 331 Sample Mid-term
Please do not read anything into the kind of problems in the sample mid-term. In particular, to save myself time I copied two problems from the homeworks. (Further, instead of
spelling out the solutions in this documen