Vous êtes sur la page 1sur 3

Revised : June 8, 2010

Effectivity : 1st Semester, SY 2010-2011

Republic of the Philippines


UNIVERSITY OF ANTIQUE
Sibalom, Antique

SUBJECT CODE : COSCI 402*


DESCRIPTIVE TITLE : DESIGN AND ANALYSIS OF ALGOERITHM
NUMBER OF HOURS : 5 Hours / Week
NUMBER OF UNITS : 3 Units

Course Description
This course provides the students with the fundamental understanding of object-oriented programming
using C#. It allows them to learn and apply the basic language syntax and principles of oop to solve
computational problems.

General Objectives
To learn the fundamentals of object-oriented programming and design programs using RAD object-
oriented programming languages.

Specific Objectives
1. To introduce the concepts of object-oriented programming and apply its basic language syntax.
2. To introduce C# as a RAD object-oriented programming language
3. Write programming project(s) in C#, integrating the concepts and principles learned in this
course.
4. Determine the debugging techniques for solving errors and inhibiting program acceptance.
5. Adhere to standards and guidelines of documentations.
6. Justify the correctness of the program as well as its documentation as needed.

Content Outline & Time Frame

Page 1
Revised : June 8, 2010
Effectivity : 1st Semester, SY 2010-2011

Time
Topics and Readings Allotted
(hour/s)
I. ORIENTATION 1
1. Mission, Goals & Objectives of the College and the Department
2. Rules and Regulation of the Computer Center
3. Grading System
4. Requirements of the Course
II. BASIC CONCEPTS OF ALGORITHMS 10
5. Notion of Algorithm
6. Fundamentals of Algorithmic Solving
7. Important Problem types
8. Fundamentals of the Analysis Framework
9. Asymptotic Notations and Basic Efficiency Classes

20

III. MATHEMATICAL ASPECTS AND ANALYSIS OF ALGORITHM


10. Mathematical Analysis of Non-recursive Algorithm
11. Mathematical Analysis of Recursive Algorithm
12. Fibonacci Numbers
13. Empirical Analysis of Algorithms
14. Algorithm Visualization

IV. ANALYSIS OF SORTING AND SEARCHING ALGORITHMS 20


15. Brute Force
16. Selection Sort and Bubble Sort
17. Sequential Search and Brute-force string matching
18. Divide and conquer
19. Merge sort
20. Quick Sort
21. Binary Search
22. Binary tree
23. Traversal and Related Properties
24. Decrease and Conquer
25. Insertion Sort
26. Depth first Search and Breadth First Search
V. ALGORITHMIC TECHNIQUES 27
27. Transform and conquer
28. Presorting
29. Balanced Search trees
30. AVL Trees
31. Heaps and Heap sort
32. Dynamic Programming
33. Warshall’s and Floyd’s Algorithm
34. Optimal Binary Search trees
35. Greedy Techniques
36. Prim’s Algorithm
37. Kruskal’s Algorithm
38. Dijkstra’s Algorithm
39. Huffman trees
VI. ALGORITHM DESIGN METHODS 10
40. Backtracking
41. n-Queen’s Problem
42. Hamiltonian Circuit problem
43. Subset-Sum problem
44. Branch and bound
45. Assignment problem
46. Knapsack problem
47. Traveling salesman problem
Prelim Examination 1
Final Examination 1
Total 90

Page 2
Revised : June 8, 2010
Effectivity : 1st Semester, SY 2010-2011

Methodology
Discussion, Lectures & Presentations, Group Activity, Laboratory Hands-on using Microsoft Visual
Studio 2005 C#.

Evaluative Techniques
Attendance, Assignments, Quizzes, Individual Participation, Prelim & Final Examination, Practical
Examination,

Grading System

Part 1 50%
Class Standing........30%
Project.....................60%
Character................10%

Part 2 50%
Quizzes...................50%
Prelim/Final.............50%

Prelim or Tentative Final Grade = Part 1 + Part 2

Final Grade =

Prepared by:

SALVADOR G. DELA RIVA


Instructor

Approved by:

PROF. NELLY E. MISTIO


Dean, College of Computer Studies

Page 3