eBoard

برد الكترونیكی دروس

طراحی الگوريتم :

برای دريافت فايل ها، پس از كليك روی دانلود و وارد شدن به سايت پرشين گيگ، روی دكمه دانلود راست كليك كرده و سپس Save As را انتخاب كنيد

سری	موضوع	صفحه	اندازه	دريافت
00	پيشگفتار	-	57 KB	دانلود
01	طراحی الگوريتمها ؛ مقدمه	1	113 KB	دانلود
02	آناليز الگوريتمها ؛ تعيين مرتبه پيچيدگی	5	225 KB	دانلود
03	تقسيم و حل	9	201 KB	دانلود
04	تقسيم و حل؛ ادامه	13	131 KB	دانلود
05	برنامه نويسی پويا	17	184 KB	دانلود
06	برنامه نويسی پويا؛ ادامه	21	225 KB	دانلود
07	رويكرد حريصانه	25	487 KB	دانلود
08	رويكرد پسگرد	31	206 KB	دانلود
09	رويكرد شاخه و كران	35	172 KB	دانلود
10	مباحث پيشرفته و تكميلی	37	204 KB	دانلود

پيوستهای جزوه طراحی الگوريتمها :

روابط رياضی در آناليز الگوريتم ها
نمادهای مجانبی و الگوريتم های مرتب سازی
نمادهای مجانبی و آناليز لگوريتم ها بازگشتی

كتاب طراحی الگوريتم ، نئوپوليتان ، ويرايش سوم

تمرينهای طراحی الگوريتمها

+ نوشته شده در ساعت توسط ك. م.

	طراحي الگوريتم ها
Algorithms Design Fall-1388 Prerequisites: Data Structures Text Books: [1] R. Neapolitan , and K. Naimipour, "Foundation of Algorithms Using C++ Pseudocode" , Third Edition, 2004 [2] T. Cormen, C. Leiserson, R. Rivest and C. Stein , (CLRS) "Introduction to Algorithms" , Second Edition, 2001 Reference Books: [3] Kleinberg and Eva Tardos, "Algorithm Design" , 2006 [4] G. Brassard and P. Bratley, "Fundamental of Algorithms" , First Edition, 1996 [5] H. S. Wilf, "Algorithms and Complexity", Internet Edition, Summer, 1994 [6] Peter Gacs and L. Lovasz, "Complexity of Algorithms", Lecture Notes, Spring 1999 [7] Lothaire, "Applied Combinatorics on Words" , 2004 Description: The study of algorithms is one of the central areas of Computer Science. Algorithmic ideas arise frequently in the several sub-areas within computer science as well as beyond; a small sample of these areas include computer systems and networks, data mining, computer vision, social networks, economics and biology. This course encompasses most aspects of the study of algorithms, though some areas are covered in more detail than others. Algorithm types we will consider include: Brute Force Algorithms Simple Recursive Algorithms Divide and Conquer Algorithms Dynamic Programming Algorithms Greedy Algorithms Backtracking Algorithms Branch and Bound Algorithms Advanced Topics in Algorithms Design Grade Distribution: Your performance will be assessed by assignments, quizzes, class participation and final exam. Their weights are: Final Exam: 90% Mid-Term(take-home): 5% Quizzes and Class Participation:5% Assignments have to be typed, if you want them corrected. All of students must work on assignments individually. The assignments play a crucial part in understanding the course material and must be turned in by class time on the due date for full credit. Participation means coming to class, asking questions, taking part in discussions and so on. Useful Links: Dictionaries: Dictionary of Algorithms and Data Structures Computer Programming Algorithms Directory eBooks: Algorithms Analysis of Algorithms Data Structures and Algorithms Scientific Computation (By Gaston Gonnet) Cellular Automata and Complexity: Collected Papers Courses: Algorithms in the "Real World" Fundamental Algorithms (Problems and Solutions) Sorts, Searchs: Sorting and Searching Sorting Demonstrations The Heroic Tales of Sorting Algorithms Peoples: R. Neapolitan Clifford Stein Ronald L. Rivest Thomas H. Cormen Charles E. Leiserson If you have any comments and suggestions about the class and my teaching course, you can send me a mail.
+ نوشته شده در ساعت توسط ك. م.

	درباره
استفاده و نقل قول از مطالب موجود در وبلاگ, با ذکر نام نویسنده و آدرس وبلاگ مجاز است


RSS POWERED BY BLOGFA.COM

طراحی الگوريتم :

Algorithms Design

Prerequisites:

Text Books:

Reference Books:

Description:

Grade Distribution:

Useful Links:

Dictionaries:

eBooks:

Courses:

Sorts, Searchs:

Peoples: