Loading repository data…
Loading repository data…
flexycode / repository
💫 This repository contains all of the java, javascript & python code implementations for each topic in the course outline for data structures and algorithms COM231 - Mrs. Jensen A. Santillan
A transparent discovery signal based on current public GitHub metadata.
This score does not audit code, security, maintainers, documentation quality, or suitability. Verify the repository and its current documentation before adoption.
Data structures and algorithms (DSA) are an important aspect of any programming language. Every language has its own data structures and its way of handling different types of algorithms.
This course focuses on the use of data structures and algorithms for solving computing and real-life problems efficiently. This course covers the following data structures: dynamic arrays, list, stacks, queues, trees, graphs and maps. Analysis of time and space complexity of algorithmic solutions will also be covered
Welcome to the "CCDATRCL - Data Structures and Algorithms" repository! This collection of code and resources is dedicated to the educational exploration of fundamental data structures and algorithms.
The "DATA STRUCTURES AND ALGORITHMS" course is designed to equip students with a deep understanding of the underlying principles and techniques that enable efficient and effective problem-solving in computer science.
Data structures and algorithms are the building blocks of software development, allowing programmers to organize, process, and analyze data in a way that is both efficient and scalable. By mastering these concepts, students will gain a solid foundation in computer science and be able to tackle complex problems with confidence.
This repository serves as a practical companion to the course, providing students with hands-on examples, exercises, and project templates to solidify their grasp of data structures and algorithms, including arrays, linked lists, stacks, queues, trees, graphs, and more. Through this repository, students will develop the skills to analyze problems, design efficient solutions, and implement them in a variety of programming languages.
The purpose of the "DATA STRUCTURE AND ALGORITHM" course is to empower students with the skills necessary to design and implement efficient algorithms and utilize appropriate data structures.
In the realm of software development, understanding data structures and algorithms is crucial for developing scalable and optimized solutions. By the end of this course, students are expected to comprehend various data structures, such as arrays, linked lists, stacks, queues, trees, and graphs, and be able to apply algorithms like sorting, searching, and graph traversal to solve real-world problems.
The hands-on experience gained from working with this repository's code samples and projects aims to reinforce theoretical knowledge and prepare students for practical challenges in the field of data structure and algorithm implementation.
| Week No. | Date Coverage | Topic | Reference |
|---|---|---|---|
| 1 | August 5 | Class Orientation | Course Syllabus |
| - Ø Concept of Abstraction | |||
| - Ø Review of types-definitions | |||
| - Ø Parameters and Parameter Pasing | |||
| - Ø Array Processing and Manipulation | |||
| August 8 | - Ø Abstract Data Types (ADTs) | Course Materials, PPT, Sample Programs | |
| - Ø Introduction to Data Structures | |||
| 2 | August 12 | 2.1 - Classes / Structure | Course Materials, PPT, Sample Programs🚀 |
| 2.2 - Class Definition | |||
| August 15 | Type Definition | ||
| Involving structures | |||
| 3 | August 19 | 3.1 - Linked-list | Course Materials, PPT, Sample Programs🚀 |
| 3.2 - Linked-list operations | |||
| August 22 | 3.3 - Linked-list traversal | ||
| 4 | August 26 | 4.1 - Stack Definition | Course Materials, PPT, Sample Programs🚀 |
| 4.2 - Stack Application | |||
| August 28 | 4.3 - Stack Implementation using an Array | ||
| 4.4 - Stack Implementation using a Linked-list | |||
| 5 | September 2 | 5.1 Queue Definition | Course Materials, PPT, Sample Programs🚀 |
| 5.2 Queue Application | |||
| September 12 | 5.3 Queue Implementation using an Array | ||
| 5.4 Queue Implementation using a Linked-list | |||
| 6 | September 16 | 6.1 Binary Tree | Course Materials, PPT, Sample Programs🚀 |
| 6.2 Binary Tree representation of expression | |||
| MIDTERM EXAM | |||
| September 26 | 6.3 Binary Traversal | ||
| 6.4 Binary Search Trees | |||
| 7 | September 30 | 6.5 Heap | |
| 7 | September 30 | 7.1 Hash Table | Course Materials, PPT, Sample Programs🚀 |
| 7.2 Hash Table Operations | |||
| 8 | October 10 | 7.3 Open Hashing | |
| 7.4 Closed Hashing | |||
| 11 | October 14 | 8.1 Graph Definition | Kindly give my repo_a star here💫 |
| 8.2 Graph Application | |||
| 12 | October 24 | 8.3 Graph Representation | |
| 8.4 Graph Traversal |