{"id":3051,"date":"2020-01-10T21:57:07","date_gmt":"2020-01-11T02:57:07","guid":{"rendered":"https:\/\/www.jsums.edu\/nmeghanathan\/?page_id=3051"},"modified":"2020-04-18T19:58:05","modified_gmt":"2020-04-19T00:58:05","slug":"csc228-sp2020","status":"publish","type":"page","link":"https:\/\/www.jsums.edu\/nmeghanathan\/csc228-sp2020\/","title":{"rendered":"CSC 228 Data Structures and Algorithms, Spring 2020"},"content":{"rendered":"

\n\tAssignments 12 (04\/21) and 13 (04\/23) <\/span>are posted. Check Canvas<\/strong>\n<\/p>\n

\n\tExam 4<\/a> (Due 04\/28, by 11.59 PM) <\/span>is posted. Check Canvas<\/strong>\n<\/p>\n

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

\n\tSyllabus<\/font><\/a><\/b>\n<\/p>\n

\n\tTA Information<\/font><\/a><\/b>\n<\/p>\n

\n\tLecture Slides<\/a><\/font><\/b>\n<\/p>\n

\n\tLecture Code (C++)<\/a><\/font><\/b>\n<\/p>\n

\n\tAssignments<\/a><\/font><\/b>\n<\/p>\n

\n\tExams<\/a><\/font><\/b>\n<\/p>\n

\n\tAssignment and Exam Schedules<\/a><\/font><\/b>\n<\/p>\n

\n\t <\/b>\n<\/p>\n

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

\n\tCSC228 Syllabus, Spring 2020<\/a><\/strong>\n<\/p>\n

\n\t \n<\/p>\n

\n\t<\/a>TA Information<\/b>
\n<\/h3>\n

\n\tAmanuel Gebre: Mondays, Fridays: 10 AM to 3 PM; Wednesdays: 11 AM to 3 PM<\/a><\/strong>\n<\/p>\n

\n\tOffice:<\/strong> John A. Peoples Building, Room 218\n<\/p>\n

\n\tE-mail:<\/strong> J00801049@students.jsums.edu<\/a> <\/b>\n<\/p>\n

\n\t \n<\/p>\n

\n\t<\/a><\/font>Lecture Slides<\/b>
\n<\/h3>\n

\n\t \n<\/p>\n

\n\tModule 1:Asymptotic Time Complexity and Intro to Abstract Data Types, C++ Code Review<\/a><\/strong>\n<\/p>\n

\n\tModule 2 – List ADT<\/a><\/strong>\n<\/p>\n

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

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

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

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

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

\n\tModule 8 – Heap<\/a><\/strong><\/span>\n<\/p>\n

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

\n\t \n<\/p>\n

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

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

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

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

\n\tCode 3: <\/strong>Singly Linked List<\/font><\/a><\/span><\/b>\n<\/p>\n

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

\n\tCode 5: <\/strong>Reversing a Singly Linked List<\/font><\/a><\/span><\/b>\n<\/p>\n

\n\tCode 6: <\/strong>Run Time Complexity Analysis<\/font><\/a><\/span><\/b>\n<\/p>\n

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

\n\tCode 1: <\/strong>Dynamic Array based Stack<\/font><\/a><\/span><\/b>\n<\/p>\n

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

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

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

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

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

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

\n\tCode 1: <\/strong>Dynamic Array based Queue<\/font><\/a><\/span><\/b>\n<\/p>\n

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

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

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

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

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

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

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

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

\n\tCode 2: <\/strong>Implementation of Binary Trees<\/font><\/a><\/span><\/b>\n<\/p>\n

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

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

\n\t \n<\/p>\n

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

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

\n\tCode 2: <\/strong>Selection Sort<\/font><\/a><\/span><\/b>\n<\/p>\n

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

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

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

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

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

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

\n\tCode 3: <\/strong>Singly Linked List<\/font><\/a><\/span><\/b>\n<\/p>\n

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

\n\tCode 5: <\/strong>Reversing a Singly Linked List<\/font><\/a><\/span><\/b>\n<\/p>\n

\n\t \n<\/p>\n

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

\n\tCode 1: <\/strong>Dynamic Array based Stack<\/font><\/a><\/span><\/b>\n<\/p>\n

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

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

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

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

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

\n\t \n<\/p>\n

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

\n\tCode 1: <\/strong>Dynamic Array based Queue<\/font><\/a><\/span><\/b>\n<\/p>\n

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

\n\t \n<\/p>\n

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

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

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

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

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

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

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

\n\tCode 2: <\/strong>Implementation of Binary Trees<\/font><\/a><\/span><\/b>\n<\/p>\n

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

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

\n\t \n<\/p>\n

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

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

\n\tCode 2: <\/strong>Selection Sort<\/font><\/a><\/span><\/b>\n<\/p>\n

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

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

\n\t \n<\/p>\n

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

\n\tAssignment 1 (Programming): Dynamic Array Implementation of the List ADT: Doubling the List Size vs. Incrementing the List Size by One: Memory and Run Time Analysis<\/a>. Due on Feb. 6th, 11.59 PM<\/strong>\n<\/p>\n

\n\tCheck Canvas for the code\n<\/p>\n

\n\t \n<\/p>\n

\n\tAssignment 2 (Programming): Design and Implementation of a Sorted List ADT<\/a>. Due on Feb. 11th, 11.59 PM<\/strong>\n<\/p>\n

\n\tCheck Canvas for the code\n<\/p>\n

\n\t \n<\/p>\n

\n\tAssignment 3 (Programming): Design and Implementation of a Θ(n) Algorithm to Delete all the Occurrences of an Element in a List ADT<\/a>. Due on Feb. 13th, 11.59 PM<\/strong>\n<\/p>\n

\n\tCheck Canvas for the code\n<\/p>\n

\n\t \n<\/p>\n

\n\tAssignment 4 (Programming): <\/a>Maximum Depth of Nested Parentheses in an Expression<\/a>. <\/strong>Due on Feb. 25th, 11.59 PM<\/strong>\n<\/p>\n

\n\tCheck Canvas for the code\n<\/p>\n

\n\t \n<\/p>\n

\n\tAssignment 5 (Programming): Evaluation of an Expression in Prefix Forma<\/strong>t<\/a>. <\/strong>Due on Feb. 27th, 11.59 PM<\/strong>\n<\/p>\n

\n\tCheck Canvas for the code\n<\/p>\n

\n\t \n<\/p>\n

\n\tAssignment 6 (Programming): Implementation of the Queue ADT using a Stack Object and Performance Comparison of the EnqueueCostly and the DequeueCostly Approaches<\/a>. <\/strong>Due on March 3rd, 11.59 PM<\/strong>\n<\/p>\n

\n\tCheck Canvas for the code\n<\/p>\n

\n\t \n<\/p>\n

\n\tAssignment 7 (Programming): Using a Hashtable to Determine the Common Elements in all the Lists<\/a>. <\/strong>Due on March 5th, 11.59 PM<\/strong>\n<\/p>\n

\n\tCheck Canvas for the code\n<\/p>\n

\n\t \n<\/p>\n

\n\tAssignment 8 (Programming): Height-Balanced Binary Trees<\/a>, Due on March 31st, 11.59 PM<\/strong>\n<\/p>\n

\n\tCheck Canvas for the code\n<\/p>\n

\n\t \n<\/p>\n

\n\tAssignment 9 (Programming):<\/a> Binary Tree: Design and Implementation of an Iterative Algorithm (using the Stack ADT) to do a Preorder Traversal of the Vertices<\/a>, Due on April 2nd, 11.59 PM<\/strong>\n<\/p>\n

\n\tCheck Canvas for the code\n<\/p>\n

\n\t \n<\/p>\n

\n\tAssignment 10 (Programming):<\/a> <\/a>Determining the Average Number of Comparisons for a Successful Search and an Unsuccessful Search in a Binary Search Tree based on its Structure Only<\/a>, Due on April 7th, 11.59 PM<\/strong>\n<\/p>\n

\n\tCheck Canvas for the code\n<\/p>\n

\n\t \n<\/p>\n

\n\tAssignment 11 (Programming):<\/a> <\/a><\/strong> Setting the Data for the Nodes in a Binary Tree to Satisfy the Property of a Binary Search Tree without Changing the Structure of the Binary Tree<\/a>, Due on April 9th, 11.59 PM<\/strong>\n<\/p>\n

\n\tCheck Canvas for the code\n<\/p>\n

\n\t \n<\/p>\n

\n\tAssignment 12 (Programming): Checking whether a Binary Tree is a Max Heap<\/a>, Due on April 21st, 11.59 PM<\/strong>\n<\/p>\n

\n\tCheck Canvas for the code\n<\/p>\n

\n\t \n<\/p>\n

\n\tAssignment 13 (Programming): Performance Comparison of the Max heap vs. Min heap-based Heap Sort Algorithm to Sort an Array of Integers in the Increasing Order of the Values<\/a>, Due on April 23rd, 11.59 PM<\/strong>\n<\/p>\n

\n\tCheck Canvas for the code\n<\/p>\n

\n\t \n<\/p>\n

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

\n\tExam 1 (Take Home)<\/a>. Due on Feb. 20th, 11.59 PM<\/strong>\n<\/p>\n

\n\tCheck Canvas for the code\n<\/p>\n

\n\t \n<\/p>\n

\n\tExam 2 (Take Home)<\/a>. Due on March 26th, 11.59 PM<\/strong>\n<\/p>\n

\n\tCheck Canvas for the code\n<\/p>\n

\n\t \n<\/p>\n

\n\tExam 3 (Take Home)<\/a>. Due on April 16th, 11.59 PM<\/strong>\n<\/p>\n

\n\tSubmit in Canvas\n<\/p>\n

\n\t \n<\/p>\n

\n\tExam 4 (Take Home). <\/u><\/a>Due on April 28th, 11.59 PM<\/strong>\n<\/p>\n

\n\tSubmit in Canvas\n<\/p>\n

\n\t \n<\/p>\n

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

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

Assignments 12 (04\/21) and 13 (04\/23) are posted. Check Canvas Exam 4 (Due 04\/28, by 11.59 PM) is posted. Check Canvas —————————————————– Syllabus TA Information Lecture Slides Lecture Code (C++) Assignments Exams Assignment and Exam Schedules   Syllabus CSC228 Syllabus, Spring 2020   TA Information Amanuel Gebre: Mondays, Fridays: 10 AM to 3 PM; Wednesdays: […]<\/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\/3051"}],"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=3051"}],"version-history":[{"count":46,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/3051\/revisions"}],"predecessor-version":[{"id":3333,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/3051\/revisions\/3333"}],"wp:attachment":[{"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/media?parent=3051"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}