{"id":3344,"date":"2020-08-18T05:03:27","date_gmt":"2020-08-18T10:03:27","guid":{"rendered":"https:\/\/www.jsums.edu\/nmeghanathan\/?page_id=3344"},"modified":"2020-09-08T05:50:44","modified_gmt":"2020-09-08T10:50:44","slug":"csc228-fall2020","status":"publish","type":"page","link":"https:\/\/www.jsums.edu\/nmeghanathan\/csc228-fall2020\/","title":{"rendered":"CSC 228 Data Structures and Algorithms, Fall 2020"},"content":{"rendered":"

—————————————————–<\/strong><\/p>\n

<\/a>Syllabus<\/b><\/h3>\n

CSC228-Syllabus-Fall2020<\/a><\/p>\n

<\/a>TAs Information<\/b><\/h3>\n

Landrie Tchakoua
<\/span><\/strong>Zoom (Meeting ID: 816 538 7125)<\/span>
Tuesday 10 AM to 12 PM<\/span>
Wednesday 12 PM to 4 PM<\/span>
Thursday 10 AM to 12 PM; 4 PM to 6 PM<\/span>

Oluwaseun Akintade<\/strong>
Google Meet Link:\u00a0<\/span>https:\/\/meet.google.com\/jqv-druy-njz\u00a0(Links to an external site.)<\/span><\/a>
Monday 12 PM to 6 PM<\/span>
Wednesday 11 AM to 3 PM<\/span>
Friday 1 PM to 5 PM<\/span><\/p>\n

 <\/p>\n

<\/a>Lecture Slides<\/b><\/h4>\n

Module 1: Time Complexity Analysis and C++ Code Review<\/a><\/h4>\n

Module 2: List ADT<\/a><\/strong><\/p>\n

Module 3 – Stack ADT<\/a><\/strong><\/p>\n

Module 4 – Queue ADT<\/a><\/strong><\/p>\n

Module 5 – Dictionary ADT: Hash tables <\/a><\/b><\/p>\n

Module 6 – Binary Trees<\/a><\/strong><\/p>\n

Module 7: Binary Search Trees<\/a><\/strong><\/p>\n

Module 8 – Heap<\/a><\/strong><\/p>\n

Module 9 – Graphs<\/a><\/strong><\/p>\n

 <\/p>\n

 <\/p>\n

<\/a>Lecture Code (C++)<\/b><\/h3>\n

Module 2: List ADT<\/strong><\/b><\/p>\n

Code 1: <\/strong>Static List Implementation using Arrays<\/a><\/b><\/p>\n

Code 2:<\/strong> Dynamic List Implementation using Arrays<\/a><\/b><\/p>\n

Code 3: <\/strong>Singly Linked List<\/a><\/b><\/p>\n

Code 4: <\/strong>Recursion and Random Number Generation<\/a><\/b><\/p>\n

Code 5: <\/strong>Reversing a Singly Linked List<\/a><\/b><\/p>\n

Code 6: <\/strong>Run Time Complexity Analysis<\/a><\/b><\/p>\n

Module 3: Stack ADT<\/strong><\/b><\/p>\n

Code 1: <\/strong>Dynamic Array based Stack<\/a><\/b><\/p>\n

Code 2:<\/strong> Doubly Linked List based Stack<\/a><\/b><\/p>\n

Code 3: <\/strong>Example to Illustrate String Processing in C++<\/a><\/b><\/p>\n

Code 4: <\/strong>Using Stack to Check for Parenthesis Balance<\/a><\/b><\/p>\n

Code 5: <\/strong>Example to Illustrate String Tokenizing in C++<\/a><\/b><\/p>\n

Code 6: <\/strong>Evaluation of an Expression in PostFix Format using Stack<\/a><\/b><\/p>\n

Module 4: Queue ADT<\/strong><\/b><\/p>\n

Code 1: <\/strong>Dynamic Array based Queue<\/a><\/b><\/p>\n

Code 2:<\/strong> Doubly Linked List based Queue<\/a><\/b><\/p>\n

Module 5: Dictionary ADT: Hashtable<\/strong><\/b><\/p>\n

Code 1: <\/strong>Singly Linked List-based Implementation of Hashtable<\/a><\/b><\/p>\n

Code 2: <\/strong>Use of Hashtable to Determine whether two Integer Sequences are Permutations of each other<\/a><\/b><\/p>\n

Code 3: <\/strong>Use of Hashtable to Print the Unique Elements in an Array<\/a><\/b><\/p>\n

Code 4: <\/strong>Use of Hashtable to Determine the Union (with unique elements) of Two Linked Lists (that may have duplicates)<\/a><\/b><\/p>\n

Module 6: Binary Trees<\/strong><\/b><\/p>\n

Code 1: <\/strong>To Read Text from a File<\/a><\/b><\/p>\n

Code 2: <\/strong>Implementation of Binary Trees<\/a><\/b><\/p>\n

Code 3: <\/strong>Use of Breadth First Search to Determine the Depth of the Nodes in a Binary Tree<\/a><\/b><\/p>\n

Code 4: <\/strong>Preorder Traversal of a Binary Tree<\/a><\/b><\/p>\n

 <\/p>\n

Module 7: Binary Search Trees<\/strong><\/b><\/p>\n

Code 1: <\/strong>Construction of a Binary Search Tree (Input: Sorted Array of Integers)<\/a><\/b><\/p>\n

Code 2: <\/strong>Selection Sort<\/a><\/b><\/p>\n

Code 3: <\/strong>Construction of a Binary Search Tree (Input: Randomly Generated Array of Integers)<\/a><\/b><\/p>\n

Code 4: <\/strong>Searching for a Key in a Binary Search Tree<\/a><\/b><\/p>\n

<\/a>Lecture Code (Java)<\/b><\/h3>\n

Module 2: List ADT<\/strong><\/b><\/p>\n

Code 1: <\/strong>Static List Implementation using Arrays<\/a><\/b><\/p>\n

Code 2: <\/strong>Dynamic List Implementation using Arrays<\/a><\/b><\/p>\n

Code 3: <\/strong>Singly Linked List<\/a><\/b><\/p>\n

Code 4: <\/strong>Recursion and Random Number Generation<\/a><\/b><\/p>\n

Code 5: <\/strong>Reversing a Singly Linked List<\/a><\/b><\/p>\n

 <\/p>\n

Module 3: Stack ADT<\/strong><\/b><\/p>\n

Code 1: <\/strong>Dynamic Array based Stack<\/a><\/b><\/p>\n

Code 2:<\/strong> Doubly Linked List based Stack<\/a><\/b><\/p>\n

Code 3: <\/strong>Example to Illustrate String Processing in Java<\/a><\/b><\/p>\n

Code 4: <\/strong>Using Stack to Check for Parenthesis Balance<\/a><\/b><\/p>\n

Code 5: <\/strong>Example to Illustrate String Tokenizing in Java<\/a><\/b><\/p>\n

Code 6: <\/strong>Evaluation of an Expression in PostFix Format using Stack<\/a><\/b><\/p>\n

 <\/p>\n

Module 4: Queue ADT<\/strong><\/b><\/p>\n

Code 1: <\/strong>Dynamic Array based Queue<\/a><\/b><\/p>\n

Code 2:<\/strong> Doubly Linked List based Queue<\/a><\/b><\/p>\n

 <\/p>\n

Module 5: Dictionary ADT: Hashtable<\/strong><\/b><\/p>\n

Code 1: <\/strong>Singly Linked List-based Implementation of Hashtable<\/a><\/b><\/p>\n

Code 2: <\/strong>Use of Hashtable to Determine whether two Integer Sequences are Permutations of each other<\/a><\/b><\/p>\n

Code 3: <\/strong>Use of Hashtable to Print the Unique Elements in an Array<\/a><\/b><\/p>\n

Code 4: <\/strong>Use of Hashtable to Determine the Union (with unique elements) of Two Linked Lists (that may have duplicates)<\/a><\/b><\/p>\n

Module 6: Binary Trees<\/strong><\/b><\/p>\n

Code 1: <\/strong>To Read Text from a File<\/a><\/b><\/p>\n

Code 2: <\/strong>Implementation of Binary Trees<\/a><\/b><\/p>\n

Code 3: <\/strong>Use of Breadth First Search to Determine the Depth of the Nodes in a Binary Tree<\/a><\/b><\/p>\n

Code 4: <\/strong>Preorder Traversal of a Binary Tree<\/a><\/b><\/p>\n

 <\/p>\n

Module 7: Binary Search Trees<\/strong><\/b><\/p>\n

Code 1: <\/strong>Construction of a Binary Search Tree (Input: Sorted Array of Integers)<\/a><\/b><\/p>\n

Code 2: <\/strong>Selection Sort<\/a><\/b><\/p>\n

Code 3: <\/strong>Construction of a Binary Search Tree (Input: Randomly Generated Array of Integers)<\/a><\/b><\/p>\n

Code 4: <\/strong>Searching for a Key in a Binary Search Tree<\/a><\/b><\/p>\n

 <\/p>\n

<\/a>Assignments<\/b><\/h3>\n

Assignment 1: Dynamic Array Implementation of the List ADT: Doubling the List Size vs. Incrementing the List Size by One: Memory and Run Time Analysis<\/a><\/strong><\/p>\n

Due: Sept. 8th, 11.59 PM in Canvas<\/p>\n

See Canvas for code<\/p>\n

 <\/p>\n

Assignment 2: Implementation of the Merge List Function (for Merger of Unique Elements) for Singly Linked List and the Time Complexity Analysis<\/a><\/strong><\/p>\n

Due: Sept. 15th, 11.59 PM in Canvas<\/p>\n

See Canvas for code<\/p>\n

 <\/p>\n

 <\/p>\n

 <\/p>\n

 <\/p>\n

 <\/p>\n

 <\/p>\n

 <\/p>\n

<\/a>Exams<\/b><\/h3>\n

 <\/p>\n

 <\/p>\n

 <\/p>\n

<\/a>Assignment and Exam Schedules<\/b><\/h3>\n

\"\"<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

—————————————————– Syllabus CSC228-Syllabus-Fall2020 TAs Information Landrie TchakouaZoom (Meeting ID: 816 538 7125)Tuesday 10 AM to 12 PMWednesday 12 PM to 4 PMThursday 10 AM to 12 PM; 4 PM to 6 PMOluwaseun AkintadeGoogle Meet Link:\u00a0https:\/\/meet.google.com\/jqv-druy-njz\u00a0(Links to an external site.)Monday 12 PM to 6 PMWednesday 11 AM to 3 PMFriday 1 PM to 5 PM   […]<\/p>\n","protected":false},"author":168,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0},"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/3344"}],"collection":[{"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/users\/168"}],"replies":[{"embeddable":true,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/comments?post=3344"}],"version-history":[{"count":28,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/3344\/revisions"}],"predecessor-version":[{"id":3346,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/3344\/revisions\/3346"}],"wp:attachment":[{"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/media?parent=3344"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}