CS213 - Data Structures and Algorithms - College of Information Technology Education
CS213 - Data Structures and Algorithms - College of Information Technology Education
SDSSU believes that higher education is an instrument for the improvement of life through democratized access to quality education in the development of a well-rounded person.
VISION
MISSION
SDSSU shall provide competency-based higher education through transformative instruction, relevant research, sustainable extension and production responsive to local, regional
and global trends.
CORE VALUES
Competence
A combination of observable and measurable knowledge, skills, abilities, and personal attributes that contribute to enhance SDSSU employee and student performance
and ultimately result in organizational success.
Accountability
Responsibility for own actions, decisions and commitment to accomplish work in an ethical, efficient, cost-effective and transparent manner manifesting the value of sound
stewardship in the wise use of resources for common good.
Responsiveness
A prompt action, consistent communication, quality information, and a focus on providing a superior experience to stakeholders.
Excellence
The quality spectrum at exceptional levels demonstrated by learning outcomes and the development of shared culture of quality consistent with the vision, mission and
goals of University.
Service
Dedication for a continuous improvement of services, stakeholder’s relationships and partnership which stresses interdependence and collaboration for a sustainable
success of clients and their communities in helping build a just, peaceful, stable and progressive Filipino nation.
SDSSU CARES…
These core values are not descriptions of the work we do, nor the strategies we employ to accomplish our University vision. They are the core values that underlie
our works and interactions as we internalize responsibilities to fulfil our mission. They are the basic elements of how we go about our work and how we deal with stakeholders,
molds students to become competent, innovative, globally competitive and service-oriented.
PROGRAM GOALS
The BSCS graduates are expected to become globally competent, innovative and socially and ethically responsible computing professionals engaged in life-long learning
endeavors. They are capable of contributing to the country’s national development goals.
Deliver relevant, interactive and experiment IT education with academic standards by academically qualified faculty.
Continually involve research activities which enhance the quality of instruction and contribute to the literature of Information Technology.
Provide linkages and opportunities for the involvement of the faculty and students with IT community.
Develop a sense of social citizenship, ethical behavior and respect for diversity.
Develop among students a pioneering spirit to establish trends in their respective fields and to contribute right solutions and activities which enhance the economic vitality of
the region and country.
PROBLEM ANALYSIS CS02 Identify, analyze, formulate, research literature, and solve complex computing
problems and requirements reaching substantiated conclusions using fundamental Enabling
principles of mathematics, computing sciences, and relevant domain disciplines.
CS03 An ability to apply mathematical foundations, algorithmic principles and computer
science theory in the modeling and design of computer-based systems in a way Enabling
that demonstrates comprehensions of the tradeoffs involved in design choices.
PROBLEM ANALYSIS CS05 Design and evaluate solutions for complex computing problems, and design and
evaluate systems, components, or processes that meet specified needs with
Introductory
appropriate consideration for public health and safety, cultural, societal, and
environmental considerations.
COURSE INFORMATION
Co-requisite : None
Course Description:
The course covers the standard data representation and algorithms to solve computing problems efficiently (with respect to space requirements and time complexity of algorithm).
This covers the following: Stacks, Queues, Trees, Graphs, Maps and Sets. Thorough discussion of sorting and searching algorithms and hashing is covered.
COURSE LEARNING OUTCOMES
At the end of the course, the students should be able to:
Knowledge/Competencies
LO2 Argue strengths and weaknesses among multiple implementations for a problem (i.e. on the aspects of abstraction, encapsulation, and information hiding.
Skills
LO1 Design, implement, test and debug a program, based on a given specification, that uses and implements abstract data
types (stacks queues, priority queues, sets, maps)
MAJOR OUTPUTS:
As evidence of attaining the above learning outcomes, students are required to do and submit the following during the indicated dates of the term. The rubrics for these outputs are
provided.
Buzz
Session
o Video
Lectures
3-4 LO1/LO2 Mathematical Virtual Individual Classroom.google. Delfinado, & Cecil, J. A. Online Assessment thru o Bring home test/
Preliminaries Interactive Student com/h (2016). Data Structures and classroom.google. com/h examination
o Sets and Teaching Activities Algorithms. Philippines: C & E o Modular means
relations Strategies like: such as: Publishing, Inc. o Forum Post of assessment
o Logarithms o Discussion o Case o Drag and Drop
o Recursion o Brainstorm Exercises Upadhyaya, B. P. (2019). Data o Open-ended/ Essay
o Mathematical ing o Workshee Structures and Algorithms with Questions
proof o (Think, ts/ Scala. Sunnyvale, CA, USA o Worksheet
techniques Pair and Exercises
Share)
o Collaborati
ve
learning/
Buzz
Session
o Problem-
Solving
o Group
activity
o Video
Lectures
5-6 LO1/LO2 ALGORITHM Virtual Individual Classroom.google. Delfinado, & Cecil, J. A. Online Assessment thru o Bring home test/
ANALYSIS Interactive Student com/h (2016). Data Structures and classroom.google. com/h examination
o Introduction Teaching Activities Algorithms. Philippines: C & E o Modular means
o Best, Worst, Strategies like: such as: Publishing, Inc. o Forum Post of assessment
and Average o Discussion o Case o Drag and Drop
Cases o Brainstorm Exercises o Open-ended/ Essay
o Asymptotic ing o Workshee Questions
Analysis o (Think, ts/ o Worksheet
o Calculating Pair and Exercises
7-8 LO1/LO2 Linear Data Virtual Individual Classroom.google. Delfinado, & Cecil, J. A. Online Assessment thru o Bring home test/
Structures Interactive Student com/h (2016). Data Structures and classroom.google. com/h examination
o Linked Teaching Activities Algorithms. Philippines: C & E o Modular means
List Strategies like: such as: Publishing, Inc. o Forum Post of assessment
o Stacks o Discussion o Case o Drag and Drop
o Queues o Brainstorm Exercises o Open-ended/ Essay
ing o Workshee Questions
o (Think, ts/ o Worksheet
Pair and Exercises
Share)
o Collaborati
ve
learning/
Buzz
Session
o Problem-
Solving
o Group
activity
o Video
Lectures
MIDTERM
10-13 LO1/LO2 Sorting Virtual Individual Classroom.google. References: Online Assessment thru Bring home test/
Algorithms Interactive Student com/h Neimann, T. (2018). Sorting classroom.google. com/h examination
o Insertion Teaching Activities and Searching. Retrieved from
Sort Strategies like: such as: http://epaperpress.com/sortsearch/i o Forum Post o Bring home test/
o Discussion o Case ndex.html o Drag and Drop examination
o Selection
o Brainstorm Exercises o Open-ended/ Essay o Modular means
Sort ing o Workshee Delfinado, & Cecil, J. A. (2016). of assessment
Questions
o Shell Sort o (Think, ts/ Data Structures and Algorithms. o Worksheet
o Heap Sort Pair and Exercises Philippines: C & E Publishing, Inc.
o Merge Sort Share)
o Collaborati
ve
learning/
Buzz
Session
o Problem-
Solving
o Group
activity
o Video
Lectures
14-17 LO1/LO2 Trees Algorithms Virtual Individual Classroom.google. References: Online Assessment thru o Bring home test/
o Basic Interactive Student com/h Delfinado, & Cecil, J. A. (2016). classroom.google. com/h examination
Tree Teaching Activities Data Structures and Algorithms. o Modular means
Strategies like: such as: Philippines: C & E Publishing, Inc. o Forum Post of assessment
Concept
o Discussion o Case o Drag and Drop
s o Brainstorm Exercises o Open-ended/ Essay
o Binary ing o Workshee Klausen, P. (2018). Java 18: Questions
Tree o (Think, ts/ Algorithm and Data Structure. o Worksheet
Traversa Pair and Exercises Bookboon
l Share)
o Expressi o Collaborati
on Tree ve
learning/
Traversa Buzz
l Session
o Problem-
Solving
o Group
activity
o Video
Lectures
FINAL
TOTAL 100%
REFERENCES
Textbook/ Ebooks:
Online:
https://drive.google.com/drive/u/0/folders/1BIhCBlDXAVf60CabbyaQcQSj2qpAskyU
https://drive.google.com/drive/u/0/folders/1BIhCBlDXAVf60CabbyaQcQSj2qpAskyU
https://drive.google.com/drive/u/0/folders/1BIhCBlDXAVf60CabbyaQcQSj2qpAskyU
https://drive.google.com/drive/u/0/folders/1BIhCBlDXAVf60CabbyaQcQSj2qpAskyU
https://drive.google.com/drive/u/0/folders/1BIhCBlDXAVf60CabbyaQcQSj2qpAskyU
Content Noted: