https://github.com/mosespace/sd2x-data-structures-and-software-design
This repository consists of my homework(s) done while pursuing the above course at edX (under PennX University)
https://github.com/mosespace/sd2x-data-structures-and-software-design
Last synced: 9 months ago
JSON representation
This repository consists of my homework(s) done while pursuing the above course at edX (under PennX University)
- Host: GitHub
- URL: https://github.com/mosespace/sd2x-data-structures-and-software-design
- Owner: mosespace
- License: gpl-3.0
- Created: 2022-11-02T06:52:08.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2022-11-02T07:40:40.000Z (over 3 years ago)
- Last Synced: 2025-01-18T06:29:29.959Z (over 1 year ago)
- Language: Java
- Size: 1.13 MB
- Stars: 2
- Watchers: 0
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# SD2x-Data-Structures-and-Software-Design
This repository consists of my homework(s) done while learning the above course at edX (under PennX University)
### Don't forget to give me a Follow Please!!
# [PennX: SD2x Data Structures and Software Design]
- `Home Work 1` - Linked Lists
Implement three methods that perform functions on a linked list, using the java.util.LinkedList class from the Java Collections API.
- `Home Work 2` - Queues and Stacks
Use the stack and queue implementations from the Java Collections API in order to build a program that determines whether an HTML page is well formatted.
- `Home Work 3` - Collections
Write a program that will analyze the sentiment (positive or negative) of a sentence based on the words it contains by implementing methods that use the List, Set, and Map interfaces from the Java Collections API.
- `Home Work 4` - Binary Search Trees
Use and modify a binary search tree (BST) implementation in order to determine whether a tree is balanced.
- `Home Work 5` - TreeMaps and PriorityQueues
Implement methods that process movie ratings, using the java.util.TreeMap and java.util.PriorityQueue classes from the Java Collections API.
- `Home Work 6` - Graphs
Implement methods used for exploring graphs.
- `Home Work 7` - UML
Implement a design that is specified using a UML class diagram.
- `Home Work 8` - Software Design
Implement a program using the three-tier architecture that allows a user to search through a collection of books and find books written by a specific author or the number of books written in a specified year.
- `Home Work 9` - Refactoring
Refactor a piece of code in order to reduce its size and make it more generalizable.
- `Home Work 10` - Reliability
Modify code that relates to a simple social networking concept: suggesting friends to a student based on who is taking the same classes.
- `Home Work 11` - Efficiency
Improve the execution time of a Java program that attempts to detect plagiarism in a corpus of documents.
