This is the course homepage for CSE 208. In this webpage assignments, notifications and marks will be uploaded from time to time.
October 2009
Course Teachers:
Your marks are here
Quiz marks are here
Week  Topic  Assignment 

1, 2  Introduction to Algorithms. Order and Complexity. Graph input, Graph searching using BFS, DFS 

3, 4 
Binary Search Tutorial on Binary Search 

58  Single Source Shortest Path, Minimum Cost Spanning Tree 
Offline : A1, A2, B1, B2: Implement Kruskal's algorithm, Prim's algorithm, Dijkstra's Algorithm in 3 separate files.
Input format for all three: First line contains two integers n and m. n denotes number of vertices and m denotes number of edges. Next m lines each contain three integers u,v,w where u,v denote there is an edge from vertex u to vertex v in the graph and w denotes the weight of that edge. 1<=u,v<=1000. Ouput : [Prim] [Kruskal] Print the cost of the minimum cost spanning tree and also print the edges present in that tree. [Dijkstra] Print the cost of the shortest path from node 1 to every other node. Also print the shortest paths.
A1 and B1 will submit all these on 7th week. There will be an online test also on these topics. You should keep the offline codes during the online test. They will come handy at that time. Online Test 1:
A1, B1 :
A2, B2 : 
Bonus Assignment :
 
Caution : Runtime Errors In a contest/ judge systems main runtime error scenarios are :
 
912  Dynamic Programming 
Extra Lecture
Offline Assignment :
Online Test 2: A1, B1 : 11th Week A2, B2 : 12th Week 
13 
CSE 208 Quiz

Course webpage maintained by Md. Tanvir Al Amin
Department of Computer Science and Engineering, EME building, Palashi, Dhaka, Bangladesh.
The Department is part of the Faculty of Electrical and Electronic Engineering at the
Bangladesh University of Engineering & Technology.
No part or content of this website may be copied or reproduced without
permission of the department authority.