Scribd Logo
Upload

Welcome to Scribd!

  • 37 views

    Course Outline Data Structure

    Uploaded by

    Jermyn G Evangelista
    This document outlines a course on data structures and algorithms. The course description indicates it will cover core data abstractions, structures, and algorithms to write efficient programs. It is a 2-unit course that meets for 6 hours per week, with object oriented programming listed as a prerequisite. The course outline covers topics like pointers, dynamic memory allocation, linked lists, stacks, queues, trees, heaps, and classic and application-specific algorithms. Laboratory experiments are to accompany each major topic, with 15 exercises planned per semester. Laboratory equipment includes computers and programming software.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Course Outline Data Structure

    Uploaded by

    Jermyn G Evangelista
    37 views2 pages
    This document outlines a course on data structures and algorithms. The course description indicates it will cover core data abstractions, structures, and algorithms to write efficient programs. It is a 2-unit course that meets for 6 hours per week, with object oriented programming listed as a prerequisite. The course outline covers topics like pointers, dynamic memory allocation, linked lists, stacks, queues, trees, heaps, and classic and application-specific algorithms. Laboratory experiments are to accompany each major topic, with 15 exercises planned per semester. Laboratory equipment includes computers and programming software.

    Original Title

    COURSE OUTLINE DATA STRUCTURE

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document outlines a course on data structures and algorithms. The course description indicates it will cover core data abstractions, structures, and algorithms to write efficient programs. It is a 2-unit course that meets for 6 hours per week, with object oriented programming listed as a prerequisite. The course outline covers topics like pointers, dynamic memory allocation, linked lists, stacks, queues, trees, heaps, and classic and application-specific algorithms. Laboratory experiments are to accompany each major topic, with 15 exercises planned per semester. Laboratory equipment includes computers and programming software.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    37 views2 pages

    Course Outline Data Structure

    Uploaded by

    Jermyn G Evangelista
    This document outlines a course on data structures and algorithms. The course description indicates it will cover core data abstractions, structures, and algorithms to write efficient programs. It is a 2-unit course that meets for 6 hours per week, with object oriented programming listed as a prerequisite. The course outline covers topics like pointers, dynamic memory allocation, linked lists, stacks, queues, trees, heaps, and classic and application-specific algorithms. Laboratory experiments are to accompany each major topic, with 15 exercises planned per semester. Laboratory equipment includes computers and programming software.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 2

    Republic of the Philippines

    BULACAN AGRICULTURAL STATE COLLEGE


    Institute of Engineering and Applied Technology
    Pinaod, San Ildefonso, Bulacan, Philippines 3010

    COURSE NAME DATA STRUCTURES AND ALGORITHM


    Course Solving computational problems that involve manipulating collections of
    Description data, study a core set of data abstractions, data structures, and
    algorithm that provide a foundation for writing efficient programs.
    Number of Units 2 units
    for Laboratory
    Number of 6 hours per week
    Contact Hours
    per Week
    Prerequisite Object Oriented Programming
    Program To be identified by the program
    Outcomes
    Course Outline 1. Pointers, Dynamic Memory Allocation Pointers, Arrays,
    Structures
    2. Abstract Data Types (ADT) and Fundamentals of Linked Lists
    3. Linked Lists Operations
    4. Stack Abstract Data Types Doubly Linked Lists
    5. Queue Abstract Data Type and its Linked Lists Operations
    6. Algorithm Analysis and Linked List Types Doubly Linked Lists
    7. Tree ADT and Binary Search Tree
    8. AVL Tree
    9. Heaps
    10.Basic Algorithmic Analysis
    11.Algorithmic Strategies
    12.Classic Algorithms For Common Tasks
    13.Analysis and Design of Application Specific Algorithms
    14.Parallel Algorithms and Multithreading
    15.Algorithmic Complexity
    16.Scheduling Algorithms
    17.Basic Computability Theory
    Laboratory Laboratory exercise to be identified by the program
    Experiments Each major topic should have corresponding laboratory exercise
    For semestral program 15 exercises per semester

    Laboratory Computer and any programming software tool


    Equipment Depending on the class size
    Republic of the Philippines
    BULACAN AGRICULTURAL STATE COLLEGE
    Institute of Engineering and Applied Technology
    Pinaod, San Ildefonso, Bulacan, Philippines 3010

    You might also like