Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
46 views

Introduction To Algorithm and Complexity Module 1

This document contains a module for an Algorithm and Complexity course. It includes instructions for an activity where students watch a 15 minute video on data structures and algorithms and provide insights on topics covered. It also includes an assessment question asking students to discuss the differences between easy and hard problems, providing their own views and examples of each.

Uploaded by

boa ka123
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
46 views

Introduction To Algorithm and Complexity Module 1

This document contains a module for an Algorithm and Complexity course. It includes instructions for an activity where students watch a 15 minute video on data structures and algorithms and provide insights on topics covered. It also includes an assessment question asking students to discuss the differences between easy and hard problems, providing their own views and examples of each.

Uploaded by

boa ka123
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Republic of the Philippines

PARTIDO STATE UNIVERSITY


Goa, Camarines Sur

Module 1
Introduction to Algorithm and Complexity

Course Code and Title: AL1 Algorithm and Complexity Week number(s): 1 (January 24-31, 2022)
Name of Faculty: Michael H. Indico

III. ACTIVITY (20 pts.)

1. Kindly click this tutorial https://www.youtube.com/watch?v=oz9cEqFynHU&t=0s and watch the


video until the last topic of discussion. This will give you a recall on the topic of data structures
and algorithms. The video takes only 15 minutes to finish. After watching the video, give your
insights about the particular topics.

The entire video contains different topic or part of DSA where the efficiency of searching an element
increases the efficiency of any algorithm. One of the topics I’ve been stock on is the stack which is an
abstract data type with predefined capacity. A stack structure restricts dramatically how elements are
inserted, retrieved, and removed. It can easily be implemented using array or linked list. Another one is
the Tree concept and I think the good examples of it are the use of integer values and characters as
elements of a tree. While in the Queue it is used to process elements in First in First out order. In
summary, the 15 minutes contain the topics about “Big O, arrays, linked lists, BFS, DFS, stack, queue,
binary tree, binary search tree, binary search, graphs, topological sort, heaps, hash maps, collision,
merge sort, divide and conquer, selection sort, logarithms”.

IV. ASSESSMENT (30 pts.)

1. Discuss the difference between the easy and hard problems? Explain your own views about
the two topics. (Do not define or copy the definition from the internet. You can give examples
to elaborate your discussion.)

For me, the definitions of easy problems are those that make me feel chill while I am on the scenery of
solving a problem while in the hard problems that’s the time when I feel uneasy like I have to make a lot
of efforts to do it. So, that’s the definition of easy and hard problems for me. To elaborate the
differences between the two, I would give an example for the easy one first, like on the algorithm it
might be found in the process of doing laundry as well as the operation of a search engine. The example
that I could include in the hard problems are solving such issues when they arise and using a search
engine to swiftly locate sites containing specific information.
Republic of the Philippines
PARTIDO STATE UNIVERSITY
Goa, Camarines Sur

2. Give at least 3 examples of easy and hard problem. Discuss each of them and why they are
classified easy or hard problem?

For the hard problems:

 Tally to collect data (research paper) – it is obvious that expecting to make a result while the
respondent totally inadequate could make the tally didn’t match especially if you’re conducting
research unless you would deceive the results.
 Aiming to have an excellent grades but not even bother to pass any outputs – seems like you
wanted to have a wealthy living but you just only want to have sleep all day long and have some
sort of relaxation so what do you expect.
 A computational problem is difficult to solve if it can be proven that there is no fast algorithm
for it – it is like you are solving an equations without answers actually. So, how do you prove if
the given for the solving equations is not actually answerable. That’s how I highlighted the third
problem because I’ve encountered a lot of problem solving that was given incorrectly.

For the easy problems:

 Finding specific words in the dictionary – as what in the 15 minutes video discussed people
don’t get to find their searches starting from letter “a” if they were looking for “indulge” word
right, of course they will look for letter “i” and make some divided until the words on their
sorting come out.
 Records of one’s identity – example of this are the PSA, finger prints, ID’s and etcetera. Every
one of us has an identity like when you are going to change something about in your PSA it is
possible but you have to follow everything from the very beginning. For our finger prints it’s like
when there’s a crime involved the records of your prints could be the best evidence. While on
our ID’s everything right now are all high-tech like for example when you are aiming to get
verified on g-cash first you have to present a valid ID. Once it trace done, surely your account
could be verified so that’s how an algorithm works by sorting.
 Positive thinkers – they are the person who makes everything easy even it would be the hardest
to because they are positive as always. I come up to this because when you’re in a difficult
situation probably you collapse but positive thinkers could never. So for me, if I have a problem I
would go to that person because I knew he/she would lift me up.

You might also like