Professional Documents
Culture Documents
F-ODI-2056
Cagayan State University
www.csu.edu.ph
APARRI | CARIG | GONZAGA | LALLO | LASAM | PIAT | SANCHEZ MIRA
COLLEGE of INFORMATION and COMPUTING SCIENCES
The Cagayan State University aims to produce graduates who will exhibit:
Competence - critical thinker, creative problem-solver, competitive performer regionally, nationally and gglobally
Social Responsibility - sensitive to ethical demands and compassionate particularly to the marginalized, steward of the
Intended Graduate Attributes environment for future generations while championing development and ssocially just and an advocate of
economic and social equity
Unifying Presence - uniting theory and practice, uniting strata of society, uniting tradition and innovation, uniting the
nation, the ASEAN region and the world and uniting the University and the community
Graduates of the college will be able to:
Knowledge - analyze, design and implement appropriate solutions to complex problems;
College Intended Learning
Skills - conduct advanced ICT-related and responsive research and extensions innovations; and
Outcomes
Attitude - manifest personal and interpersonal skills imbued with ICT professional ethics and values;
GAD integration performs tasks in a gender responsive manner.
At the end of the program, the graduates are expected to:
1. analyze complex problems, and identify and define the computing requirements needed to design an
Program Intended Learning appropriate solution;
Outcomes 2. apply computing and other knowledge domains to address real-world problems;
3. design and develop computing solutions using a system-level perspective; and
4. utilize modern computing tools.
2
Republic of the Philippines
F-ODI-2056
Cagayan State University
www.csu.edu.ph
APARRI | CARIG | GONZAGA | LALLO | LASAM | PIAT | SANCHEZ MIRA
COLLEGE of INFORMATION and COMPUTING SCIENCES
F-ODI-2056
Cagayan State University
www.csu.edu.ph
APARRI | CARIG | GONZAGA | LALLO | LASAM | PIAT | SANCHEZ MIRA
COLLEGE of INFORMATION and COMPUTING SCIENCES
Course Code IT 211 Course Title DATA STRUCTURES AND ALGORITHMS (Using JAVA)
Credit Units 3.0 Semester Second School Year 2019-2020 Number of Discussion Hours 36
Pre-Requisite/s IT 121, IT 123 Co-Requisite/s None Number of Laboratory Hours 54
This course covers the standard data representation and algorithms to solve computing problems efficiently (with
Course Description respect to space requirements and time complexity of algorithm). This covers the following: Stacks, queues, trees,
graphs, maps, and sets, sorting, searching, and hashing.
Class Standing 15%
a. Attendance - 5%
b. Recitation - 5%
c. Seatwork – 5%
Quizzes 20%
Grading System
Major Exams 35%
Laboratory Exercises 30%
a. Hands-on Examination - 15%
b. Presentation of output – 15%
Total 100%
4
Republic of the Philippines
F-ODI-2056
Cagayan State University
www.csu.edu.ph
APARRI | CARIG | GONZAGA | LALLO | LASAM | PIAT | SANCHEZ MIRA
COLLEGE of INFORMATION and COMPUTING SCIENCES
PRELIM COVERAGE
5
Republic of the Philippines
F-ODI-2056
Cagayan State University
www.csu.edu.ph
APARRI | CARIG | GONZAGA | LALLO | LASAM | PIAT | SANCHEZ MIRA
COLLEGE of INFORMATION and COMPUTING SCIENCES
➢ Explain the need for efficiency I.Introduction to Data 2 ➢ Lecture Data Structures and Algorithms in Java ➢ Oral
in data structures and Structures and Algorithms hrs. ➢ Seatwork Michael T. Goodrich Department of Recitation
algorithms 1.1. Overview of Data ➢ Assignment Computer Science University of Quiz 1
➢ Apply methods to analyze Structures and Algorithms ➢ Internet California, Irvine 1 Roberto Tamassia
running time of essential data 1.2. Characteristics of Data Research Department of Computer Science
structures and estimate Structures and Algorithms Brown University 0-471-73884-0 Fourth
efficiency of the algorithms Edition
and implementations.
➢ Understand and apply the
concept of abstract data type
to represent and implement
heterogeneous data structures
• Trace Java’s history II. INTRODUCTION TO 6 Lecture Azat, Mardan. Java Script and Node Recitation
• Distinguish the features of JAVA hrs. Homework Group Fundamentals: A Collection of Essential Written Quiz 1
Java 1.1. Java Background discussion and Basics. 2014 Poo, Danny, Java Hands-on
• Identify different types of 1.2. The Java Technology Demonstration programming. 2010 Regandwald, Activity 1
programs that could be 1.3. Features of Java Javascipt: A long pull of functions,
created in Java 1.4. Applications and combinators and decorators. 2014
• Explain the Java Virtual Applets Sedgewick, Robert, Introduction to
Machine (Java VM) 1.5. Phases of a Java programming in Java : an
• Identify some useful Program interdisciplinary approach. 2009. Java:
components of the Java A Beginner’s Guide, 6th edition. 2014
Application Programming Java Cookbook, 3rd edition. 2014 Java
Interface (Java API) Network Programming, 4th edition.
2014
6
Republic of the Philippines
F-ODI-2056
Cagayan State University
www.csu.edu.ph
APARRI | CARIG | GONZAGA | LALLO | LASAM | PIAT | SANCHEZ MIRA
COLLEGE of INFORMATION and COMPUTING SCIENCES
MIDTERM
• Debug and simulate java IV.. The Basics of Array 3 6 Lecture Hands-on Data Structures and Algorithms in Java Written Quiz
programs with the use of 1. Creating an hrs. hrs. Demonstration Michael T. Goodrich Department of 3
arrays Array Computer Science University of Hands-on
Workshop California, Irvine 1 Roberto Tamassia Activity 3
Department of Computer Science
7
Republic of the Philippines
F-ODI-2056
Cagayan State University
www.csu.edu.ph
APARRI | CARIG | GONZAGA | LALLO | LASAM | PIAT | SANCHEZ MIRA
COLLEGE of INFORMATION and COMPUTING SCIENCES
• Write programs using VII. Linked Lists 3 hr. 4 Lecture Hands-on Data Structures and Algorithms in Java Written Quiz
linked lists 1. Definition of linked list hrs. Demonstration Michael T. Goodrich Department of 6
• Define linked lists 2. How to work with linked Computer Science University of Hands-on
list in java programing Workshop California, Irvine 1 Roberto Tamassia Activity 6
8
Republic of the Philippines
F-ODI-2056
Cagayan State University
www.csu.edu.ph
APARRI | CARIG | GONZAGA | LALLO | LASAM | PIAT | SANCHEZ MIRA
COLLEGE of INFORMATION and COMPUTING SCIENCES
• Demonstrate skills in 3 6 Lecture Hands-on Data Structures and Algorithms in Java Written Quiz
tracing, analysing, and VII. RECURSION hrs. hrs. Demonstration Michael T. Goodrich Department of Hands-on
designing recursive 1. Triangular numbers Computer Science University of Activity 7
algorithms and recursive 2. Factorials Workshop California, Irvine 1 Roberto Tamassia Presentation
methods 3. Anagrams Department of Computer Science of Output 6
4. Recursive Binary Search Brown University 0-471-73884-0 Fourth Output
Edition Tracing 3
• Write programs using VIII. ADVANCED SORTING 3 6 Lecture Hands-on Data Structures and Algorithms in Java Written Quiz 8
advanced sorting 1. Shellsort hrs. hrs. Demonstration Michael T. Goodrich Department of Hands-on
• Differentiate shellsort, 2. Partitioning Computer Science University of Activity 8
partitioning and quicksort 3. Quicksort Workshop California, Irvine 1 Roberto Tamassia Presentation
Department of Computer Science of Output 6
Brown University 0-471-73884-0 Fourth Output
Edition Tracing 4
• Write Program using IX. BINARY TREES 3 4 Lecture Hands-on Data Structures and Algorithms in Java Written Quiz
binary trees and variation 1. Defining a tree hrs. hrs. Demonstration Michael T. Goodrich Department of 9
• Define a tree 2. Uses of tree Computer Science University of Hands-on
• Discuss the uses of tree 3. How binary trees works Workshop California, Irvine 1 Roberto Tamassia Activity 9
• Demonstrate how trees 4. Traversing a tree Department of Computer Science Presentation
works Brown University 0-471-73884-0 Fourth of Output 7
• Discuss how traversing a Edition
tree works
9
Republic of the Philippines
F-ODI-2056
Cagayan State University
www.csu.edu.ph
APARRI | CARIG | GONZAGA | LALLO | LASAM | PIAT | SANCHEZ MIRA
COLLEGE of INFORMATION and COMPUTING SCIENCES
Case Project
Presentation
2
F-ODI-2056
Cagayan State University
www.csu.edu.ph
APARRI | CARIG | GONZAGA | LALLO | LASAM | PIAT | SANCHEZ MIRA
COLLEGE of INFORMATION and COMPUTING SCIENCES
Course Policies:
• Attendance – Students incurring the accumulated 20 percent of the total required course contact hours shall be considered dropped (With Lab: 18 hours – 4 laboratory and 3
lecture meeting; Pure Lecture: 11 hours or 4 3-hour meetings). Students need to secure admission slip in case of absences/late. University admission policies should be explicitly
followed. (Lifted from Student Manual and Academic Manual).
• Class participation – Each student or team should comply with the requirements and required outputs corresponding each module/topic.
• Late work – Each student or team submitting/presenting their outputs outside the agreed schedule shall be deducted an agreeable point based on criteria for
checking/evaluation.
• Missed exams/quiz – Provided with justified and reasonable written consent, missed exams encountered by a student shall be given a chance. However, the teacher will have
to make modifications based on the topics to avoid leakage. Students involved in various student-related activities, convocations, competitions representing the
College/Campus/University as well as differently-abled, hospitalization and social responsibility shall be given considerations.
• Academic integrity – Based on the Student Manual, any student found guilty of academic dishonesty, plagiarism, and cheating shall be dealt accordingly with prescribed
penalties/sanctions. The student will be on probation when necessary.
• Requests for extensions and for rescheduling of exams – In any case that extension of class and rescheduling of exam is necessary, a written valid and reasonable request shall
be made by the requesting party, noted by the concerned faculty with the approval of the college dean.
• Expectations for student conduct in the classroom or laboratory – Students are expected to comply with all the school rules and regulations as well as policies and ethical conduct
on the classroom or laboratory. Students are also expected to practice the 10 commandments of computer ethics and/or netiquette. Using of mobile phones or smart devices
during classes or laboratory session is strictly prohibited. Violation of such will be subject to disciplinary actions. In emergency cases, the student can answer the call/text
unnoticeably outside the class with the permission of the faculty.
Other References:
1. Data Structures and Algorithms in Java Michael T. Goodrich Department of Computer Science University of California, Irvine 1 Roberto Tamassia
Department of Computer Science Brown University 0-471-73884-0 Fourth Edition
2. Azat, Mardan. Java Script and Node Fundamentals: A Collection of Essential Basics. 2014
3. Poo, Danny, Java programming. 2010
4. Regandwald, Javascipt: A long pull of functions, combinators and decorators. 2014
5. Sedgewick, Robert, Introduction to programming in Java : an interdisciplinary approach. 2009.
11
Republic of the Philippines
F-ODI-2056
Cagayan State University
www.csu.edu.ph
APARRI | CARIG | GONZAGA | LALLO | LASAM | PIAT | SANCHEZ MIRA
COLLEGE of INFORMATION and COMPUTING SCIENCES
6. Java: A Beginner’s Guide, 6th edition. 2014 Java Cookbook, 3rd edition. 2014
7. Java Network Programming, 4th edition. 2014
8. Karumanchi, Narasimha (2017) Data Structures and Algorithm Made Easy in Java Available at https://www.pdfdrive.com/data-structures-and-algorithms-made-
easy-in-java-e184690185.html
Prepared by: