Algorithms-and-Complexity-LEARNING PLAN

2nd Semester, School Year 2020-2021
Course Code & Title: Algorithms and Complexity Schedule:

Name of Faculty: Room: Google Classroom
Program Upon graduation, successful BSCS graduates will attain the following program outcomes:
Outcomes
1. Apply knowledge of computing fundamentals, knowledge of a computing specialization, and mathematics,
science and domain knowledge appropriate for the computing specialization to the abstraction and
conceptualization of computing models from defined problems and requirements
2. Identify, analyze, formulate, research literature, define, and solve complex computing problems and
requirements reaching substantiated conclusions and needed to design an appropriate solution using
fundamental principles of mathematics, computing sciences, and relevant domain disciplines.
3. Apply mathematical foundations, algorithmic principles and computer science theory in the modeling and
design of computer-based systems in a way that demonstrates comprehension of the tradeoffs involved in
design choices.
4. Knowledge and understanding of information security issues in relation to the design, development and use
of information systems.
5. Design, develop, and evaluate solutions for complex computing problems, and design and evaluate
systems, components, or processes that meet specified needs with appropriate consideration for public
health and safety, cultural, societal, and environmental considerations.
6. Create, select, adapt and apply appropriate techniques, resources and modern computing tools to complex
computing activities, with an understanding of the limitations to accomplish a common goal.
7. Function effectively as individual and member or leader in diverse teams and in multidisciplinary and
multi-cultural settings.
8. Communicate effectively using both English and Filipino with the computing community and with society
at large about complex computing activities by being able to comprehend and write effective reports,
design documentation and make effective presentations, and give and understand clear instructions.
9. An ability to recognize the legal, social, ethical and professional responsibilities involved in the utilization
of computer technology and be guided by the adoption of appropriate professional, ethical and legal
practices.
10. Recognize the need, and have the ability, to engage in independent learning and for continual
development as a computing professional.
11. Participate in the generation of new knowledge or in research and development projects aligned to local
and national development agenda or goals.
Course Credit 3 units

Course Description This course aims to acquaint students with the notion of algorithms and complexity, to
present generalized techniques for the design and analysis of algorithms for problems
that are useful in practice, to argue about the correctness of algorithms, and to become
acquainted with the notion of computational classes.
Contact Hours/Week Lecture – 2 hours/week

Laboratory – 3 hours/week
Course Prerequisite/s CSCC 104 Data Structures and Algorithms
Course Requirements ● Lecture Activities, Assignments

● Quizzes
● Laboratory Work
● Midterm and final examinations
Grading System Class Standing = 60%
Midterm/Final Exam = 40%
Classroom Policies  Class attendance and punctuality must be observed in accordance to the Revised
Student Code of Discipline, Article 10 – Class Attendance.
 Wear proper uniform and school ID card in accordance to the Revised Student Code
of Discipline, Article 2, and Sections 1-3.
 Kindness, courtesy, and respect are expected and appreciated by your fellow
classmates and the instructor.
 Complete all activities with your own work and only your own work. Do not engage
in any activity that would dishonestly improve your results, or improve or hurt the
results of others. You must not involve yourself to any form of cheating, otherwise,
disciplinary action shall be imposed.
 There must be no food or drink, other than water, allowed in the computer lab.
 Cell phone use during class is prohibited. You will receive one warning before any
disciplinary action is taken.
 The computers and internet are to be used responsibly and for the sole purpose of
work related to the class. Inappropriate use of the computer will result in
disciplinary action.
 Your workstation must be kept and left for the next class in a clean and orderly
manner.
Consultation Hours MWF 3:00 – 5:00 PM
Learning Outcome/s Learning Content Time Methodology/ies Resources Assessment

Allotment
Use big O notation  The Role of 15 hours  Professional  Module  Activities
formally to give algorithms in Lectures  Lecture Notes  Quiz
asymptotic upper bonds computing  Peer teaching  Reference materials  Examinations
on time and space  Introduction to  Collaborative (ebooks, online
complexity of algorithms Algorithmic Learning resources/tutorials/
Allotment
complexity video)
 Asymptotic  PowerPoint
analysis of Presentation
upper and  Google Classroom
expected  Laptop
complexity  Internet connection
bounds
 Big-O notation:
formal
definition and
use
 Algorithms with
various time
and space
complexity such
as constant,
logarithmic,
linear,
quadratic, and
exponential
 Analysis of
iterative and
recursive
algorithms
 Recurrence
relations
Choose and apply the  Brute-force 12 hours  Professional  Module  Activities

most appropriate algorithms lectures  Lecture Notes  Quiz
algorithm design  Greedy  Peer teaching  Reference materials  Examinations
Allotment
technique (divide and Algorithms  Simulations (ebooks, online
conquer, backtracking,  Divide and  Dimensional resources/tutorials/
greedy, dynamic Conquer question video)
programming) for solving  Recursive approach  PowerPoint
problems. Backtracking  Brainstorming Presentation
 Dynamic  Google Classroom
Programming  Laptop
Algorithms  Internet connection
Describe the behavior  Searching 27 hours  Professional  Module  Activities

and running times of Algorithms lectures  Module  Quiz
various searching, sorting  Linear Search  Peer teaching  Lecture Notes  Examinations
and graph algorithms  Binary Search  Simulations  Reference materials
 Dimensional (ebooks, online
 Sorting question resources/tutorials/
Algorithms approach video)
 Insertion Sort  Brainstorming  PowerPoint
 Selection Presentation
Sort  Google Classroom
 Bubble Sort  Laptop
 Quick Sort  Internet connection
 Heap Sort
 Merge Sort
 String
Processing
 Graph
Algorithms

Algorithms-and-Complexity-LEARNING PLAN

Uploaded by

Copyright:

Available Formats

Algorithms-and-Complexity-LEARNING PLAN

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Algorithms-and-Complexity-LEARNING PLAN

Uploaded by

Copyright:

Available Formats

2nd Semester, School Year 2020-2021

Course Code & Title: Algorithms and Complexity Schedule:

Course Credit 3 units

Contact Hours/Week Lecture – 2 hours/week

Course Requirements ● Lecture Activities, Assignments

Learning Outcome/s Learning Content Time Methodology/ies Resources Assessment

Choose and apply the  Brute-force 12 hours  Professional  Module  Activities

Describe the behavior  Searching 27 hours  Professional  Module  Activities

You might also like