This action might not be possible to undo. Are you sure you want to continue?
DEPARTMENT OF COMPUTER SCIENCE
(MORNING PROGRAMME) MASTERS IN COMPUTER SCIENCE FIRST SEMESTER 2013 COURSE-OUTLINE AND POLICIES FOR THE COURSE CS-623 DATA STRUCTURE AND ALGORITHM ANALYSIS
Introduction to algorithms. Analysis of algorithms. Notations used in analysis of algorithms. Asymptotic notation. Complexity and costs of algorithms in terms of time and space. Best, worst and average case. Various aspects of analysis of algorithms. Algorithms for various data structures. Arrays. Linked lists. Stacks. Queues. Trees. Binary trees. Binary search trees. Operations on various types of trees. Red-Black trees. Splay and AVL trees. Binary heaps. B-trees. Hash tables. Hash functions. Graphs and networks. Graph and network algorithms. Minimal spanning tree. Iteration and recursion. Recursive algorithms. Analyses of recursive algorithms. Various sorting algorithms. Asymptotically slow and fast sort algorithms. Divide-and-conquer method for designing and analysis of algorithms. Traversal and searching algorithms. Probabilistic analysis. Randomised algorithms. Sets, functions and relations. Generating functions. Algorithms for algebraic problems. Algorithms for strings and tries. Backtracking. Polynomials and Fast Fourier Transformation. Intractable problems. Lower bounds theory. Number-theoretic algorithms. Matrix as a two -dimensional array. Matrix operations. Matrix chain multiplication. Using greedy method approach for designing of algorithm. Huffman coding tree. Introduction to dynamic programming algorithms. Introduction to approximation algorithms, pattern matching algorithms. PRAM algorithms. Mesh algorithms. Hypercube algorithms. NP-hard and NP-complete problems and related issues. Advance issues. Empirical exercises regarding designing of algorithms and their analyses.
Overview of the course: Critical study of the methods of designing of algorithms and the techniques used in the analysis of traditional and some of the advanced algorithms. Topics include designing algorithms for various types of data structures and their analyses, and cover recursive algorithms, randomised algorithms, divide -and-conquer algorithm, dynamic algorithm etc. Substantial projects including algorithm designing, programming and analysis of the problem and the algorithm(s) are the vital part of the course. Type of the course: This is a core course for all the students of Computer Science. An adequate knowledge of computer programming or equivalent course, data structures or equivalent course and vital experience of programming and software solution designing constitute the pre -requisite for the course.
Page 1 of 4
critically evaluate. No work will be accepted unless it is submitted as per instructions accordingly. By: Thomas H. Examination policy: The examination policy is subject to the rules and regulations of the University. Pub: Addison-Wesley Publishing Company. By: Robert Sedgewick. and other criteria. Recommended reference books and materials: • • • Algorithms. Cormen et al. Quizzes.UNIVERSITY OF KARACHI DEPARTMENT OF COMPUTER SCIENCE (MORNING PROGRAMME) MASTERS IN COMPUTER SCIENCE FIRST SEMESTER 2013 COURSE-OUTLINE AND POLICIES FOR THE COURSE CS-623 DATA STRUCTURE AND ALGORITHM ANALYSIS Objectives of the course: This course enables the students to design. submission of assignments will remain due in such cases. Any text book available in the University library preferably or available in the local market for the topics mentioned above. which either motivate traditional algorithmic topics from a new internet viewpoint or highlight new algorithms that are derived from internet applications. midterm and assignments will be conducted during the course accordingly. advanced software design methods and implementation issues along with the experimental analysis of algorithms. and hence can be reviewed at any time as per policy of the University. analyse and compare various algorithms used for various data structures. Recommended text books: • Introduction to Algorithms. All submitted works in the form of class assignments and home -work assignments must be on A4-size page(s). At the time of discussion of a topic. This course also some of the topics relevant to internet algorithms. Pub: McGrawHill Book Company. complexity (both in terms of space and time). relevant books/materials may be referred from time to time. This enables students to learn the behaviour of the software solutions to various problems in terms of expressiveness. It will be mandatory for the students (on individual basis) to work on the project and to prepare the project report. It will be responsibility of the students to keep themselves up-to-date regarding the assignments. It will be necessary for the students to qualify in both theory examination and Page 2 of 4 . No excuses will be accepted regarding non-submission of any assignment due to absence. which will be examined during or before the final examination week.
and are strictly prohibited in the university. Scholastic ethics: Copying of somebody else’s work and/or claiming somebody else’s work to be your own work and/or any other similar types of activities during quizzes. examinations and while preparing the assignments and/or project reports are considered to be one or the other forms of cheating. Higher-level detail design. Potential in the desired work. Detailed relevant analysis of the problem. as the case may be (as and where applicable). Please be very much careful. Any activity which is against the scholastic ethics might disqualify you from the course and sometimes from the whole academic programme. These types of activities are strictly against the scholastic ethics. Bibliographic references. Exact problem definition. Software system along with the input data and the output result/Pseudocode algorithm along with the dry execution and the trace table. Suggested solution / method etc. the formal proposals should be prepared and submitted within one week fro m this notification. Students are recommended to go through various resources for this task. should consist of: Main objective. Selection of the topic for the project is also a part of the project. Attendance policy: Attendance in the course is mandatory (please refer to the university rules and regulations for further information regarding attendance policy). individually worked out and submitted. Suggested solution/ methods/algorithms/methodologies etc. The proposals should consist of: Preliminary objective (task). Future work r ecommendations. The project reports completed in Page 3 of 4 . Suggested plan for study. Implementation/testing strategy (as and where applicable). Scheduled class timings and Counselling hours for the course: • As per departmental schedule (and/or as announced) Final project reports for the course: It is mandatory for the students to work on a relevant project and to prepare the academic report of the work done during the project on individual basis. In this regard. The final project reports.UNIVERSITY OF KARACHI DEPARTMENT OF COMPUTER SCIENCE (MORNING PROGRAMME) MASTERS IN COMPUTER SCIENCE FIRST SEMESTER 2013 COURSE-OUTLINE AND POLICIES FOR THE COURSE CS-623 DATA STRUCTURE AND ALGORITHM ANALYSIS project/practical examination in order to qualify for the course. Topics for the final projects must be finalised not later than one week from this notification. Results/findings/outcomes (as and where applicable) along with the conclusions. Idea and theory behind the problem and its solution. Detailed background theory. Problem definition and description.
UNIVERSITY OF KARACHI DEPARTMENT OF COMPUTER SCIENCE (MORNING PROGRAMME) MASTERS IN COMPUTER SCIENCE FIRST SEMESTER 2013 COURSE-OUTLINE AND POLICIES FOR THE COURSE CS-623 DATA STRUCTURE AND ALGORITHM ANALYSIS all aspects must be submitted during the last week of the course. stated above.) Website: To be announced later. are subject to change. Heuristic Solution to solve Travelling Salesman Problem. and no claims will be entertained regarding that in any circumstances. The contents of the course. at the discretion of the course incharge. Dr. Optimised BSTrees and the implementation of the Huffman Coding Algorithm. addition and/or modification from time to time. however. prior to the commencement of the final examination. Design. # 1 2 3 4 5 6 7 8 9 10 SUGGESTED TOPICS Theory and solutions of Pyramidal Number Problem. examination policy and the counselling hours. Syed Jamal Hussain Page 4 of 4 . Important note: It will be responsibility of the students to keep themselves up-to-date for the course in all circumstances. Various aspects of Travelling Salesman Problems. and improvements in Quicksort Algorithm. for the betterment of the students and the institution. whatsoever. Implementation of Binary Heap and managing Heapsort Algorithm. analysis. Following are some of the suggested topics that may be selected as the final project for the course. On getting registered for the course. Analysis and comparison of the various Routing Algorithms. However the students may decide to work on the project of their own choice as already mentioned above (subject to the approval of the course incharge). Intelligent solution for the Eight Queen’s Problem. and to know the maximum number of absences they are allowed as per university rules.com (All the students are required to subscribe to the usergroup by sending a blank email to the given address mentioning their student-id and names in the subject. Intelligent solution for the Knapsack Problem. Individual defence of the report and oral examinations will be conducted at the time of submitting the reports. Intelligent solution for the Knight’s Problem. the topics might be selected adaptively based on the background interest of the individuals and the rate of progress. Electronic links for the course: • • Usergroup: KUDCS-MP-2013-MCS-DSAA@yahoogroups. you accept to follow all the regulations stated herein for the course. The list of topics given above might be covered completely.
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue reading from where you left off, or restart the preview.