Professional Documents
Culture Documents
Syllabus in ELEC 1
Observational Visits and Seminar
1st Semester | SY 2019-2020
EDISON R. RALAR FERNANDO E. QUIROZ, JR. CHERYL A. EBAJO, MIT LEOMERO H. GARCIA, Ph.D.
Instructor Faculty Representative, ITE Chairperson, BSIS Program VP for Academic and External Affairs
Date: _______ Date: _______ Date: _______ Date: _______
CYRIL R. DOMINGO PAUL MATTHEW S. BENTOR, CpE MATIAS A. BENTOR, JR., D.M.
Instructor DQMR, ITE Dean, CIICT
Date: _______ Date: _______ Date: _______
BIPSU VISION
A State University leading in research and innovation for human empowerment and societal development.
BIPSU MISSION
To advance the University with innovative human resources, responsive researches, sustainable production and
demand-driven extension services.
CIICT GOALS
1. To develop well-rounded students with ethical and moral standards imbibed with social consciousness, equipped with technical,
entrepreneurial
and managerial competence.
2. To prepare academically and technically trained workers for the industry in the competitive global market.
VII. OUTCOMES
VIII.
Covers the design, analysis, and implementation of data structures and algorithms to solve engineering problems using an object‐oriented
programming language. Topics include elementary data structures, (including arrays, stacks, queues, and lists), advanced data structures
(including trees and graphs), the algorithms used to manipulate these structures, and their application to solving practical engineering
problems.
An important part of computing is the ability to select algorithms appropriate to particular purposes and to apply them, recognizing the
possibility that no suitable algorithm may exist. This facility relies on understanding the range of algorithms that address an important set of
well-defined problems, recognizing their strengths and weaknesses, and their suitability in particular contexts. Efficiency is a pervasive
theme throughout this area.
At the end of this course, student is expected to apply different techniques in data structuring and algorithms including simple mathematical
algorithms, hash, binary, heap, and bubble sort and searching and compare which algorithm applied the most in circumstances given.
VIII. LEARNING PLAN
In order to achieve the outcomes of this course, learners will go through this learning plan:
2-5 CO1 Seminar 1: SEMINAR 3-day lecture, seminar and ( to be given by the
WORKSHOP ON DATA workshop on machine lecturer/ speaker)
ANALYTICS AND MACHINE learning and mobile
LEARNING WITH MOBILE
application.
APPLICATION
10-15 CO3 ACTUAL OBSERVATIONAL A 3-day educational tour to - Students will report on
VISIT TO DIFFERENT different agencies with the class about their
COMPUTING FIRM/ AGENCY/ seminar and actual field realization after the
UNIT visit.
educational tour.
IX. References
X. Suggested Readings
1. In consonance to par (2), Section 78, Rule 20 of the Students’ Handbook of NSU.
2. Academically low achievers will undergo remedial classes on weekend to cope up with the lessons.
Wednesday 8:AM-12:00 NN