syllabus of final exam

6 views
Skip to first unread message

Fatema Zohora

unread,
Apr 13, 2013, 11:09:15 AM4/13/13
to dashboard...@googlegroups.com

Syllabus of Final Exam:


**Two topics form midterm are included:
1.
Introduction to algorithms
2.Divide and Conquer


Greedy Algorithms:

Slides+
Book Reference:  KT 4(4.1,4.2,4.4,4.5,4.6); CLRS 16.1,16.2; Sahani 4.2(knapsack);
see related exercises.

Dynamic programming

Slides+
Book Reference: KT 6.1,6.2,6.4; CLRS 15.3;
see related exercises.

Hashing:
slides+
Separate Chaining, Coalesced Chaining, Linear Probing, Double Hashing 
Book Reference: uploaded chapter from Reingold

Graph algorithms

Slides+
Book Reference: CLRS 22(BFS & DFS), 23, 24(introduction, 24.2, 24.3), 25(introduction,25.2); KT 3; Sahani 4.8(dijkstra), 4.5(Spanning Tree);
see related excercises

Complexity

Slides+
CLRS chapter 34 -- Introduction, 34.1(up to page 972), 34.2,34.3(up to page 986)


Israt Shanchary

unread,
Apr 16, 2013, 10:33:25 AM4/16/13
to dashboard...@googlegroups.com
miss,
algo order sort,
algo linear sort,
234 tree,
algo balance tree
heap sort...
 Dont we realy need to go through these topics???



--
You received this message because you are subscribed to the Google Groups "Dashboardalgorithm" group.
To unsubscribe from this group and stop receiving emails from it, send an email to dashboardalgori...@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.
 
 

Fatema Zohora

unread,
Apr 16, 2013, 10:52:06 AM4/16/13
to dashboard...@googlegroups.com
Complete set of questions from these topics were already given in midterm. So these are excluded from final. 
Reply all
Reply to author
Forward
0 new messages