{"id":2326,"date":"2018-08-20T19:06:39","date_gmt":"2018-08-21T00:06:39","guid":{"rendered":"https:\/\/www.jsums.edu\/nmeghanathan\/?page_id=2326"},"modified":"2018-11-06T13:29:43","modified_gmt":"2018-11-06T18:29:43","slug":"csc228-fall2018","status":"publish","type":"page","link":"https:\/\/www.jsums.edu\/nmeghanathan\/csc228-fall2018\/","title":{"rendered":"CSC 228 Data Structures and Algorithms, Fall 2018"},"content":{"rendered":"

\n\tExam 3 (IN-CLASS; on Nov. 29th @ 2.30 PM): OPEN NOTES. <\/span>Reading List<\/a><\/strong>\n<\/p>\n

\n\tExam 2 (Take Home: Due on Nov. 8th) posted.<\/span><\/strong>\n<\/p>\n

\n\tProjects 9-10 posted<\/strong><\/span>\n<\/p>\n

\n\tQuiz 7 (Take Home) posted (Due on Nov. 15th, 11.59 PM)<\/strong><\/span>\n<\/p>\n

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

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

\n\tTeaching Assistant<\/a><\/b>\n<\/p>\n

\n\tLecture Slides<\/a>
\n\tLecture Code (C++)<\/a>
\n\tProject Descriptions<\/a>
\n\tQuizzes and Exams<\/a>
\n\tQuiz, Exam and Project Schedules<\/a><\/b>\n<\/p>\n

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

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

\n\tCSC228 Syllabus, Fall 2018<\/a><\/span><\/b>\n<\/p>\n

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

\n\t<\/a>Teaching Assistant<\/b>\n<\/p>\n

\n\tFall2018-TA-information<\/a><\/strong>\n<\/p>\n

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

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

\n\tModule 1:Asymptotic Time Complexity and Intro to Abstract Data Types<\/a><\/b>\n<\/p>\n

\n\tModule 2 – List ADT (Last updated: Sept. 4th)<\/a><\/b>\n<\/p>\n

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

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

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

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

\n\tModule 7 – Binary Search Trees<\/a><\/b>\n<\/p>\n

\n\tModule 8 – Heap<\/a><\/b>\n<\/p>\n

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

\n\t<\/a>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<\/a><\/span><\/b>\n<\/p>\n

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

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

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

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

\n\tCode 6: <\/strong>Run Time Complexity Analysis<\/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<\/a><\/span><\/b>\n<\/p>\n

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

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

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

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

\n\tCode 6: <\/strong>Evaluation of an Expression in PostFix Format using Stack<\/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<\/a><\/span><\/b>\n<\/p>\n

\n\tCode 2:<\/strong> Doubly Linked List based Queue<\/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<\/a><\/span><\/b>\n<\/p>\n

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

\n\tCode 3: <\/strong>Use of Hashtable to Print the Unique Elements in an Array<\/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)<\/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<\/a><\/span><\/b>\n<\/p>\n

\n\tCode 2: <\/strong>Implementation of Binary Trees<\/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<\/a><\/span><\/b>\n<\/p>\n

\n\tCode 4: <\/strong>Preorder Traversal of a Binary Tree<\/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)<\/a><\/span><\/b>\n<\/p>\n

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

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

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

\n\t<\/a>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<\/a><\/span><\/b>\n<\/p>\n

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

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

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

\n\tCode 5: <\/strong>Reversing a Singly Linked List<\/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<\/a><\/span><\/b>\n<\/p>\n

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

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

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

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

\n\tCode 6: <\/strong>Evaluation of an Expression in PostFix Format using Stack<\/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<\/a><\/span><\/b>\n<\/p>\n

\n\tCode 2:<\/strong> Doubly Linked List based Queue<\/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<\/a><\/span><\/b>\n<\/p>\n

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

\n\tCode 3: <\/strong>Use of Hashtable to Print the Unique Elements in an Array<\/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)<\/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<\/a><\/span><\/b>\n<\/p>\n

\n\tCode 2: <\/strong>Implementation of Binary Trees<\/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<\/a><\/span><\/b>\n<\/p>\n

\n\tCode 4: <\/strong>Preorder Traversal of a Binary Tree<\/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)<\/a><\/span><\/b>\n<\/p>\n

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

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

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

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

\n\t<\/a>Project Descriptions<\/b>
\n<\/h3>\n

\n\tProject 1 (Due on Sep. 11th, 11.59 PM): <\/strong>Algorithm Design and Time Complexity Analysis for Operations on the Dynamic Array Implementation of the List ADT<\/a><\/span><\/b>\n<\/p>\n

\n\tSee Canvas for the code<\/strong>\n<\/p>\n

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

\n\tProject 2 (Due on Sep. 18th, 11.59 PM): <\/strong><\/span><\/b>Implementation of the Merge List Function (for Merger of Unique Elements) for Singly Linked List and the Time Complexity Analysis<\/a><\/strong><\/span>\n<\/p>\n

\n\tSee Canvas for the code<\/strong>\n<\/p>\n

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

\n\tProject 3 (Due on Sep. 25th, 11.59 PM): <\/strong><\/span><\/b>Implementation of the Stack ADT using Singly Linked List and the Time Complexity Analysis of the Push and Pop Operations<\/a><\/span><\/strong>\n<\/p>\n

\n\tSee Canvas for the code<\/strong>\n<\/p>\n

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

\n\tProject 4 (Due on Oct. 8th, 11.59 PM): <\/strong><\/span><\/b>Design and Implementation of an Algorithm to Find the Next Greater Element of the Elements in an Array in Θ(n) Time<\/a><\/strong>\n<\/p>\n

\n\tSee Canvas for the code and a help video<\/strong>\n<\/p>\n

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

\n\tProject 5 (Due on Oct. 9th, 11.59 PM): <\/strong><\/span><\/b>Stack-based Implementation of Queue<\/a><\/strong>\n<\/p>\n

\n\tSee Canvas for the code<\/strong>\n<\/p>\n

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

\n\tProject 6 (Due on Oct. 16th, 11.59 PM): <\/strong><\/span><\/b>Hash table Tradeoff Analysis: Average Insertion Time vs. Load Imbalance Index<\/a><\/strong>\n<\/p>\n

\n\tSee Canvas for the code<\/strong>\n<\/p>\n

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

\n\tProject 7 (Due on Oct. 23rd, 11.59 PM): <\/strong><\/span><\/b>Binary Tree: Checking for Complete Binary Tree and Binary Search Tree<\/a><\/strong>\n<\/p>\n

\n\tSee Canvas for the code<\/strong>\n<\/p>\n

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

\n\tProject 8 (Due on Oct. 30th, 11.59 PM): <\/strong><\/span><\/b>Project 8: Binary Search Tree: Lowest Common Ancestor Node<\/a><\/strong>\n<\/p>\n

\n\tSee Canvas for the code<\/strong>\n<\/p>\n

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

\n\tProject 9 (Due on Nov. 6th, 11.59 PM): <\/strong><\/span><\/b>Project 9: Binary Tree: Design and Implementation of an Iterative Algorithm (using the Stack ADT) to do a Preorder Traversal of the Vertices<\/a><\/strong>\n<\/p>\n

\n\tSee Canvas for the code<\/strong>\n<\/p>\n

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

\n\tProject 10 (Due on Nov. 13th, 11.59 PM): <\/strong><\/span><\/b>Project 10: Degree Distribution of the Vertices in a Graph<\/a><\/strong>\n<\/p>\n

\n\tStartup Code (PDF)<\/a>\n<\/p>\n

\n\tSee Canvas for the code<\/strong>\n<\/p>\n

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

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

\n\tQuiz 2 (Due on Sep. 27th, 11.59 PM): <\/strong><\/span><\/b>Dynamic Array Implementation of the List ADT: Doubling the List Size vs. Incrementing the List Size by One: Memory and Run Time Analysis<\/a><\/span><\/strong>\n<\/p>\n

\n\tSee Canvas for the code<\/strong>\n<\/p>\n

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

\n\tExam-1<\/a><\/strong><\/span> (Due on Oct. 4th, 11.59 PM)<\/strong><\/span><\/b>\n<\/p>\n

\n\tSee Canvas for the code<\/strong>\n<\/p>\n

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

\n\tQuiz 3 (Due on Oct. 11th, 11.59 PM): <\/strong><\/span><\/b>Determination of Maximum Depth of Nested Parentheses in an Expression and Evaluation of an Expression in Pre-fix Format<\/a><\/strong>\n<\/p>\n

\n\tSee Canvas for the code<\/strong>\n<\/p>\n

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

\n\tQuiz 4 (Due on Oct. 18th, 11.59 PM): <\/strong><\/span><\/b>Height-Balanced Binary Trees<\/a><\/strong>\n<\/p>\n

\n\tSee Canvas for the code<\/strong>\n<\/p>\n

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

\n\tQuiz 5 (Due on Oct. 25th, 11.59 PM): <\/strong><\/span><\/b>Binary Search Tree: Average Number of Comparisons for a Successful Search<\/a><\/strong>\n<\/p>\n

\n\tSee Canvas for the code<\/strong>\n<\/p>\n

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

\n\tExam-2<\/a><\/strong> (Due on Nov. 8th, 2.30 PM hardcopy to be submitted in-class)<\/strong><\/span><\/b>\n<\/p>\n

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

\n\tQuiz 7 (Due on Nov. 15th, 11.59 PM): <\/strong><\/span><\/b>Quiz 7: Breadth First Search on a Graph: Test for Bipartivity<\/a><\/strong>\n<\/p>\n

\n\tStartup Code (PDF)<\/a>\n<\/p>\n

\n\tSee Canvas for the code<\/strong>\n<\/p>\n

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

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

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

\n\t<\/a>Quiz, Exam and Project Schedules<\/b>
\n<\/h3>\n

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

Exam 3 (IN-CLASS; on Nov. 29th @ 2.30 PM): OPEN NOTES. Reading List Exam 2 (Take Home: Due on Nov. 8th) posted. Projects 9-10 posted Quiz 7 (Take Home) posted (Due on Nov. 15th, 11.59 PM) —————————————————– Syllabus Teaching Assistant Lecture Slides Lecture Code (C++) Project Descriptions Quizzes and Exams Quiz, Exam and Project Schedules […]<\/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\/2326"}],"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=2326"}],"version-history":[{"count":52,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/2326\/revisions"}],"predecessor-version":[{"id":2542,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/2326\/revisions\/2542"}],"wp:attachment":[{"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/media?parent=2326"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}