{"id":125,"date":"2019-09-20T13:54:50","date_gmt":"2019-09-20T13:54:50","guid":{"rendered":"http:\/\/www2.kios.ucy.ac.cy\/christos\/?page_id=125"},"modified":"2023-09-06T08:28:04","modified_gmt":"2023-09-06T08:28:04","slug":"course-details","status":"publish","type":"page","link":"https:\/\/www.kios.ucy.ac.cy\/christos\/course-details\/","title":{"rendered":"Course Details: ECE 325"},"content":{"rendered":"\t\t<div data-elementor-type=\"wp-page\" data-elementor-id=\"125\" class=\"elementor elementor-125\">\n\t\t\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-eafcbe7 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"eafcbe7\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-0cf3856\" data-id=\"0cf3856\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-d9c0944 elementor-widget elementor-widget-heading\" data-id=\"d9c0944\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<h2 class=\"elementor-heading-title elementor-size-default\"><br>ECE 325- Iterative Methods<br><br>Course Details<\/h2>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-4d71af5 elementor-widget elementor-widget-text-editor\" data-id=\"4d71af5\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<p><strong>Objectives of the course:<\/strong><\/p><p>This course covers a broad spectrum of techniques for solving problems using iterative methods. During the course we will study various problems (search, decision, optimization) and we will investigate various algorithmic approaches for solving them. Emphasis will be given to the problem formulation, the precise description of the algorithm that solves the problem, as well as to the analysis of the correctness and efficiency of the algorithms. The objective of the course is to introduce problem solving strategies, mainly through the design of iterative algorithms. The course will introduce specific algorithm design techniques and will provide the tools for analyzing the efficiency of each algorithm.<\/p><p><b>Prerequisite:<\/b><\/p><p>Students must have completed at least a programming course and a course in data structures (CS 034 and CS 035 or equivalent).<\/p><p><strong>Course Syllabus:\u00a0<\/strong><\/p><ol><li>Introduction<\/li><li>Analysis of Algorithms (sets O, \u03a9, \u0398)<\/li><li>Brute Force and Exhaustive Search<\/li><li>Divide-and-Conquer<\/li><li>Fast Fourier Transform<\/li><li>Decrease-and-Conquer<\/li><li>Transformations<\/li><li>Greedy Algorithms<\/li><li>Dynamic Programming<\/li><li>Iterative Improvement (Linear Programming)<\/li><li>Decision Trees<\/li><li><em>P<\/em>,\u00a0<em>NP<\/em>, and\u00a0<em>NP<\/em>-Complete Problems\u00a0\u2013 If time permits<\/li><\/ol><p><strong>Grading:<\/strong><\/p><div><ul><li><strong>Method 1:<\/strong><ul><li>Laboratory Assignments: 15<strong>%<\/strong><\/li><\/ul><ul><li>Mid term exam: 35<strong>%\u00a0<\/strong>(Tentative date\u00a0<strong>October 6, 2023<\/strong>)<\/li><li>Final exam:\u00a0<strong>50%<\/strong>.<\/li><li><strong>Important Note:<\/strong>\u00a0To pass the class, students should get at least\u00a0<strong>50%<\/strong>\u00a0in the exams and\u00a0<strong>50%<\/strong>\u00a0in the lab assignments.\u00a0<\/li><\/ul><\/li><\/ul><\/div><div><ul><li><strong>Method 2:<\/strong><ul><li>Mid term exam: 40<strong>%\u00a0<\/strong>(Tentative date\u00a0<strong>October 6, 2023<\/strong>)<\/li><li>Final exam: 6<strong>0%<\/strong><\/li><li><strong>Important Note:<\/strong>\u00a0A student should get at least 50% in all lab assignments in order to be eligible to take the final exam.<\/li><\/ul><\/li><\/ul><\/div><div>For the lab assignments, students can work in groups. Each group should send a report via email to the course Teaching Assistant (TA) before the given deadline. The group will be examined according to the schedule that will be posted on the course website. During the examination, all group members should be present. Each group can submit up to one (1) delayed assignment but should be examined at a later date which will not exceed two weeks from the assigned deadline. Any other assignment submitted late will have a 10% per (late) day penalty.<\/div><div>\u00a0<\/div><div><strong>Important Note<\/strong>: All students who wish to use Method 2 for their grading should send an email to the course instructor with the title \u201c<strong>[ECE 325] Method 2<\/strong>\u201d and should include the name and ID number of the student.<\/div><div><p><strong>Textbook<\/strong>: Anany Levitin, \u201cIntroduction to The Design and Analysis of Algorithms\u201d, 2nd Edition, Prentice Hall, 2007.<\/p><div>\u00a0<strong style=\"font-size: 16px;\">Bibliography<\/strong><\/div><ul><li><p>T. Cormen, C. Leiserson, R. Rivest, and C. Stein, &#8220;Introduction to Algorithms&#8221;, 2003.<\/p><\/li><li><p>S. Dasgupta, C. Papadimitriou, and U. Vazirani, &#8220;Algorithms&#8221;, 2008.<\/p><\/li><li><p>R. Johnsonbaugh, M. Schaefer, &#8220;Algorithms&#8221;, 2004<\/p><\/li><li><p>J. Kleinberg and E. Tardos, &#8220;Algorithm Design&#8221;, 2005<\/p><\/li><li><p>S. Baase, \u201cComputer Algorithms: Introduction and Design Analysis\u201d, 1988.<\/p><\/li><li><p>G. Brassard and P. Bratley, \u201cFundamentals of Algorithmics\u201d, 1996.<\/p><\/li><\/ul><p><strong>Academic Honesty: <\/strong>It is acceptable to work together in small groups for study, homework, and laboratory assignments. However, the work that you turn in under your name <strong>must be your own<\/strong>. Cheating will not be tolerated; neither during homework nor during exams.<\/p><\/div>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-618b406 elementor-icon-list--layout-traditional elementor-list-item-link-full_width elementor-widget elementor-widget-icon-list\" data-id=\"618b406\" data-element_type=\"widget\" data-widget_type=\"icon-list.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<ul class=\"elementor-icon-list-items\">\n\t\t\t\t\t\t\t<li class=\"elementor-icon-list-item\">\n\t\t\t\t\t\t\t\t\t\t\t<a href=\"https:\/\/www.kios.ucy.ac.cy\/christos\/wp-content\/uploads\/2023\/09\/ECE325_SyllabusGreek2023.pdf\">\n\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-icon-list-icon\">\n\t\t\t\t\t\t\t<i aria-hidden=\"true\" class=\"far fa-file-pdf\"><\/i>\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-icon-list-text\">Download Syllabus (in Greek)<\/span>\n\t\t\t\t\t\t\t\t\t\t\t<\/a>\n\t\t\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t<li class=\"elementor-icon-list-item\">\n\t\t\t\t\t\t\t\t\t\t\t<a href=\"https:\/\/www.kios.ucy.ac.cy\/christos\/wp-content\/uploads\/2023\/09\/ECE325_Syllabus2023.pdf\">\n\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-icon-list-icon\">\n\t\t\t\t\t\t\t<i aria-hidden=\"true\" class=\"far fa-file-pdf\"><\/i>\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-icon-list-text\">Download Syllabus (in English)<\/span>\n\t\t\t\t\t\t\t\t\t\t\t<\/a>\n\t\t\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t<\/ul>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"<p>ECE 325- Iterative Methods Course Details Objectives of the course: This course covers a broad spectrum of techniques for solving problems using iterative methods. During the course we will study various problems (search, decision, optimization) and we will investigate various algorithmic approaches for solving them. Emphasis will be given to the problem formulation, the precise [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-125","page","type-page","status-publish","hentry","post"],"_links":{"self":[{"href":"https:\/\/www.kios.ucy.ac.cy\/christos\/wp-json\/wp\/v2\/pages\/125","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.kios.ucy.ac.cy\/christos\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.kios.ucy.ac.cy\/christos\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.kios.ucy.ac.cy\/christos\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.kios.ucy.ac.cy\/christos\/wp-json\/wp\/v2\/comments?post=125"}],"version-history":[{"count":28,"href":"https:\/\/www.kios.ucy.ac.cy\/christos\/wp-json\/wp\/v2\/pages\/125\/revisions"}],"predecessor-version":[{"id":1362,"href":"https:\/\/www.kios.ucy.ac.cy\/christos\/wp-json\/wp\/v2\/pages\/125\/revisions\/1362"}],"wp:attachment":[{"href":"https:\/\/www.kios.ucy.ac.cy\/christos\/wp-json\/wp\/v2\/media?parent=125"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}