0% found this document useful (0 votes)
80 views

Csi 227 Algorithms: Fariha Tabassum Islam

This document outlines the policies for the CSI 227 ALGORITHMS course. It details that attendance is worth 5% of the grade and absence deductions will start after 21 days. Class tests will be worth 40% with 3 out of 5 counting, assignments will be 10% with 2 given, the midterm is 20% and the final exam is 25%. It also lists topics covered, exam dates and formats, late policies, and contact information for the professor.

Uploaded by

assd
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
80 views

Csi 227 Algorithms: Fariha Tabassum Islam

This document outlines the policies for the CSI 227 ALGORITHMS course. It details that attendance is worth 5% of the grade and absence deductions will start after 21 days. Class tests will be worth 40% with 3 out of 5 counting, assignments will be 10% with 2 given, the midterm is 20% and the final exam is 25%. It also lists topics covered, exam dates and formats, late policies, and contact information for the professor.

Uploaded by

assd
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 7

CSI 227 ALGORITHMS

FARIHA TABASSUM ISLAM


COURSE POLICIES

 Attendance
 Full marks for a minimum of 21 days’ attendance
Criteria Marks
 0.25 marks will be deducted for every days of absence afterwards
Attendance 5%
 Class Tests
Class Tests 40%
 Offline exams taken in class time, 3 out of 5 will be considered
Assignments 10%
 tentative times: 6 , 11 , 16 , 20 and 23 classes
th th th th nd
Midterm 20%
 Assignments
Final 25%
 2 assignments will be given, the best one will be count
 one before the midterm and the other after the midterm
COURSE POLICIES

 Midterm
 Offline exam during mid week according to the schedule given by Exam
Controller Office
Criteria Marks
 duration = one hour (writing) + 15 minutes (for downloading question,
Attendance 5%
capturing picture and uploading answer)
Class Tests 40%
 Final
Assignments 10%
 Offline exam, during final week according to the schedule given by Exam
Controller Office Midterm 20%
 duration = one hour 15 minutes (writing) + 15 minutes (for downloading Final 25%
question, capturing picture and uploading answer)
COURSE POLICIES

Missed Exams
 Class test: One make-up before mid-term, one make-up before final
 Only for those who have missed the any CT
 You have to notify me before class test with proof/valid reasons
 Syllabus: last two class tests syllabus

 Mid-term exam: You must notify me as soon as possible with proof


 Final exam: You must notify me as soon as possible with proof
COURSE POLICIES

 Course materials, notices and exam will be posted in eLMS


 Marks of attendance, class tests, assignments and mid-term will be provided via a Google sheet (link in eLMS).
 Contact me via email: [email protected]
 Mobile no. 01759 463059
 Call me in case of emergency
 Please do not call me after 8 PM
TENTATIVE COUNSELING HOUR

Day Time
Saturday 2:00 PM to 05:00 PM
Sunday 11:30 AM to 2:00 PM
Tuesday 9:00 AM to 11:00 AM

• Will be given in ELMS


• No counseling on Friday
TOPICS COVERED IN THIS COURSE

 Worst-Case and Best-Case Analysis, Asymptotic Notation


 Divide-and-Conquer Approach; Analyzing Divide-and-Conquer Algorithms
 Greedy Algorithm
 Dynamic Programming

 Graph Representation, Graph Searching


 Disjoint Set
 Minimum Spanning Tree
 Shortest Path Algorithms
 Hashtable
 String Matching Algorithms
 Computational complexity

You might also like