[3] C.A. Giumale, “Introducere in Analiza Algoritmilor. Teorie si aplicatie” ( Introduction. to the Analysis of Algorithms. Theory and Application), Polirom, Bucharest. Dorel Lucanu – Bazele proiectării programelor şi algoritmilor II: Tehnici de Cristian A. Giumale –Introducere în analiza algoritmilor – Editura. Creţu V., Structuri de date şi algoritmi, Ed. Orizonturi Universitare, Timişoara, 6. Cristea V. Giumale C.A., Introducere în analiza algoritmilor. Teorie şi.
| Author: | Gasida Akizshura |
| Country: | Turkey |
| Language: | English (Spanish) |
| Genre: | Travel |
| Published (Last): | 5 November 2012 |
| Pages: | 37 |
| PDF File Size: | 18.29 Mb |
| ePub File Size: | 10.7 Mb |
| ISBN: | 811-2-56780-850-5 |
| Downloads: | 45267 |
| Price: | Free* [*Free Regsitration Required] |
| Uploader: | Dumuro |
This course is an i ntroduction algogitmilor the design, behavior, and analysis of computer algorithms. Searching, sorting, and combinatorial algorithms are emphasized.
In the first part, a number of standard algorithm design paradigms are presented and example applications of these examined. In the second part of the course, some theoretical issues in algorithm design are examined. The concepts of computability and computational tractability are introduced.
Algorithm Design and Complexity
Knuth, The Art of Computer Programmingv. How to characterize an algorithm’s behavior and how to compare two algorithms? Quantification of resources used giukale algorithms. Asymptotic upper, lower, and tight bounds on time and space complexity of algorithms.
Case Studies in Algorithm Analysis. Abstract Data Type Definition. Complexity analysis of some well-known implementation solutions for basic ADTs stack, queue, vector, list, sequence, set, tree, priority queue, heap, dictionary, hash table. Analysis of Searching Algorithms. Analysis of Sorting and Selection Algorithms.
Comparison of Sorting Algorithms. The Graph Abstract Data Type. Data Structures for Graphs. Models of algorithmic process and their universality: Polynomial versus Non-Polynomial analuza complexity.
Introducere in analiza algoritmilor by Cristian A. Giumale –
Laboratory consists of discussion, problem solving, and presentation of homework solutions. Pre-reading of the lecture notes and class attendance is essential and students are expected to be prepared and to actively participate in class activities.
There are about 7 assignments, due two weeks after the student get them. Assignments should be prepared for the next class period. Some may be collected for grading; others will be reviewed in class.
Introducere in analiza algoritmilor
The topic of algorithmic analysis is central to computer science. Its goal is to explore and examine a range of algorithms that can be used to solve practical problems.
As we know, each algorithm possesses strengths and weaknesses. Moreover, the performance or any particular algorithm typically varies according to the size and nature of the input data.
Students need a thorough understanding of the tools of analysis in order to select the right algorithm for the job. This is exactly what this course intends to offer. Goodrich, Roberto Tamassia, Algorithm Design: Backtracking and Branch-and-Bound 3h. Grading will be as follows: