![]() No late assignments will be accepted under any circumstances. Discussion amongst students is encouraged, but when in doubt, direct your questions to the professor, tutor, or lab assistant. Offering and accepting solutions from others are an act of plagiarism, which is a serious offense and all involved parties will be penalized according to the Academic Honesty Policy. Students are expected to work independently.Students are responsible for tracking their progress by referring to the online gradebook. Grades in the C range represent performance that meets expectations Grades in the B range represent performance that is substantially better than the expectations Grades in the A range represent work that is excellent.No makeup quizzes or exams will be given.Quizzes and exams are closed book, closed notes.You must have your computer with you in all sessions.Apply efficient algorithms in common engineering design situations.Apply important algorithmic design paradigms and methods of analysis.Demonstrate a familiarity with major algorithms and data structures.Analyze asymptotic performance of algorithms.Supplementary Textbook(s): Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching, 3 rd Edition, Robert Sedgewick ISBN-13: 978-0201350883Īt the completion of this course, students will be able to: Textbook: Introduction to Algorithms, 3 rd Edition, Thomas H. Note(s): You should have a Linux (preferably Ubuntu) running laptop with you. Prerequisite(s): A passing grade at BIL111-Programming, BIL122-Data Structures is highly recommended. Course Schedule: Turkish: Monday(2 PM) B312 English: Thursday(3 PM) B314Ĭourse Description: This course teaches general understanding about algorithms, techniques to measure and compare algorithm performances, well-known data structures and their algorithms, and algorithm design principles. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |