|
1 | | -<div> |
2 | | -<img src="https://user-images.githubusercontent.com/12025538/85956751-f0b56580-b955-11ea-86d6-c9eb9da5311c.png" width="500"/> |
3 | | -</div> |
4 | | -<h2>Master of Science, Computer Science</h2> |
5 | | -<div> |
6 | | - <ol> |
7 | | - <li>Advanced Programming</li> |
8 | | - <li>Analysis of Algorithms</li> |
9 | | - <li>Artificial Intelligence</li> |
10 | | - <li>Computer Language Theory</li> |
11 | | - <li>Computer Networks</li> |
12 | | - <li>Data Structures</li> |
13 | | - <li>Discrete Mathematics</li> |
14 | | - <li>Financial Informatics</li> |
15 | | - <li>Operating Systems</li> |
16 | | - <li>Server-Side Development</li> |
17 | | - <li>Software Design and Patterns</li> |
18 | | - <li>Software Engineering</li> |
19 | | - </ol> |
20 | | -</div> |
| 1 | + |
| 2 | +<h1>Master of Science, Computer Science</h1> |
| 3 | + |
| 4 | +<h2>Course</h2> |
| 5 | +<h4>Data Structures with Java</h4> |
| 6 | + |
| 7 | +<h2>Description</h2> |
| 8 | +<p> |
| 9 | +This course is designed to familiarize and instruct students in the concepts of data structures, data abstraction, |
| 10 | +information hiding, and software interaction, as utilized in software engineering. The course will describe the |
| 11 | +concepts listed above and will demonstrate their usage in modern software engineering, with Java. An emphasis is placed |
| 12 | +on the implementation of these techniques and the management of their usage. |
| 13 | +</p> |
| 14 | + |
| 15 | +<h2>Data Structures and Featured Topics</h2> |
| 16 | + |
| 17 | +<p><strong>Intro</strong></p> |
| 18 | +<ol> |
| 19 | + <li>Software Design</li> |
| 20 | + <li>Big O Notation</li> |
| 21 | + <li>Testing</li> |
| 22 | + <li>Debugging</li> |
| 23 | +</ol> |
| 24 | + |
| 25 | +<p><strong>Collection Classes</strong></p> |
| 26 | +<ol> |
| 27 | + <li>Methods</li> |
| 28 | + <li>Static vs. Dynamic Objects</li> |
| 29 | +</ol> |
| 30 | + |
| 31 | +<p><strong>Linked Lists</strong></p> |
| 32 | +<ol> |
| 33 | + <li>Arrays</li> |
| 34 | + <li>Node Tools</li> |
| 35 | + <li>Linked List Tools</li> |
| 36 | +</ol> |
| 37 | + |
| 38 | +<p><strong>Generics</strong></p> |
| 39 | +<ol> |
| 40 | + <li>Wrappers</li> |
| 41 | + <li>Autoboxing</li> |
| 42 | + <li>Generic Classes and Generic Nodes</li> |
| 43 | + <li>Interfaces</li> |
| 44 | + <li>Iterators</li> |
| 45 | +</ol> |
| 46 | + |
| 47 | +<p><strong>Stacks</strong></p> |
| 48 | +<ol> |
| 49 | + <li>Applications</li> |
| 50 | + <li>Abstract Data Types</li> |
| 51 | + <li>Array Based Stacks</li> |
| 52 | + <li>Linked-List Based Stacks</li> |
| 53 | +</ol> |
| 54 | + |
| 55 | +<p><strong>Queues</strong></p> |
| 56 | +<ol> |
| 57 | + <li>Applications</li> |
| 58 | + <li>Abstract Data Types</li> |
| 59 | + <li>Array Based Queues</li> |
| 60 | + <li>Linked-List Based Queues</li> |
| 61 | +</ol> |
| 62 | + |
| 63 | +<p><strong>Recursion</strong></p> |
| 64 | +<ol> |
| 65 | + <li>Theory</li> |
| 66 | + <li>Implementations</li> |
| 67 | +</ol> |
| 68 | + |
| 69 | +<p><strong>Trees</strong></p> |
| 70 | +<ol> |
| 71 | + <li>Binary Trees</li> |
| 72 | + <li>Linked and Array Based Representations</li> |
| 73 | + <li>Traversals (In-Order, Pre-Order, Post-Order)</li> |
| 74 | +</ol> |
| 75 | + |
| 76 | +<p><strong>Searching</strong></p> |
| 77 | +<ol> |
| 78 | + <li>Serial Searching</li> |
| 79 | + <li>Binary Searching</li> |
| 80 | + <li>Open Address Hashing</li> |
| 81 | + <li>Chained Hashing</li> |
| 82 | +</ol> |
| 83 | + |
| 84 | +<p><strong>Sorting</strong></p> |
| 85 | +<ol> |
| 86 | + <li>Quadratic Sorting Algorithms</li> |
| 87 | + <li>Recursive Sorting Algorithms</li> |
| 88 | + <li>Heaps</li> |
| 89 | +</ol> |
| 90 | + |
| 91 | +<p><strong>Graphs</strong></p> |
| 92 | +<ol> |
| 93 | + <li>Directed and Undirected Graphs</li> |
| 94 | + <li>Dijkstra's Shortest Path Algorithm</li> |
| 95 | +</ol> |
| 96 | + |
0 commit comments