Awesome-Mirrors/awesome-courses
1
0
Fork 0
mirror of https://github.com/prakhar1989/awesome-courses.git synced 2025-04-18 06:15:53 -04:00
Code Issues Packages Projects Releases Wiki Activity

Merge dfad97fdd9045a884fc13d6ac90a88a83a2a608f into e0b02ce4084c3b426304ae03ffcb072f7c8057f3

Browse Source
This commit is contained in:
Alaharon123 2023-02-16 13:13:23 +05:00 committed by GitHub
commit 79ac22f535
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
README.md
View File

@ -344,6 +344,9 @@ Courses
- Algorithms class covering recursion, randomization, amortization, graph algorithms, network flows and hardness. The lecture notes by Prof. Erikson are comprehensive enough to be a book by themselves. Highly recommended!
- [Lecture Notes](http://web.engr.illinois.edu/~jeffe/teaching/algorithms/all-algorithms.pdf)
- [Labs and Exams](http://web.engr.illinois.edu/~jeffe/teaching/algorithms/all-hwex.pdf)
- [CS 2102](http://web.cs.wpi.edu/~cs2102/b16/index.html) **Object-Oriented Design Concepts** *Worcester Polytechnic Institute* <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f4bb.png" width="20" height="20" alt="Assignments" title="Assignments" /> <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f4dd.png" width="20" height="20" alt="Lecture Notes" title="Lecture Notes" /> <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f4da.png" width="20" height="20" alt="Readings" title="Readings" />
- CS 2102 is an intermediate-level course on program design. CS1101/1102 (How to Design Programs) focused on designing single-task programs for correct behavior. In CS2102, we begin to consider multi-task programs, more complex data, and other design goals—such as maintainability and scalability—without sacrificing correct program behavior. The course examines interactions between data structures, algorithms, invariants, and object-oriented code structure in the pursuit of good program design. All programming in the course is in Java, but the course does not assume prior Java experience. While the course covers certain issues specific to Java and object-oriented programming, the general principles apply broadly to most programming languages.
- [Syllabus, Readings, Assignments, etc](http://web.cs.wpi.edu/~cs2102/b16/syllabus.html)
- [CS 2150](https://github.com/aaronbloomfield/pdr) **Program & Data Representation** *University of Virginia* <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f4bb.png" width="20" height="20" alt="Assignments" title="Assignments" /> <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f4dd.png" width="20" height="20" alt="Lecture Notes" title="Lecture Notes" />
- This data structures course introduces C++, linked-lists, stacks, queues, trees, numerical representation, hash tables, priority queues, heaps, huffman coding, graphs, and x86 assembly.
- [Lectures](http://aaronbloomfield.github.io/pdr/slides/)