{"id":2547,"date":"2019-01-11T05:57:19","date_gmt":"2019-01-11T10:57:19","guid":{"rendered":"https:\/\/www.jsums.edu\/nmeghanathan\/?page_id=2547"},"modified":"2019-04-11T14:09:13","modified_gmt":"2019-04-11T19:09:13","slug":"csc228-sp2019","status":"publish","type":"page","link":"https:\/\/www.jsums.edu\/nmeghanathan\/csc228-sp2019\/","title":{"rendered":"CSC 228 Data Structures and Algorithms, Spring 2019"},"content":{"rendered":"

\n\tExam 3 will be conducted in two parts: Both parts are in-class, OPEN notes. Part I will be tested on Wednesday, April 24th (1 PM to 1.50 PM) and Part II will be tested on Friday, April 26th (1 PM to 1.50 PM). <\/span>Reading List for both parts<\/span><\/a><\/strong>\n<\/p>\n

\n\tProjects 4-8 assigned.<\/span><\/strong>\n<\/p>\n

\n\tExam 2 and Quiz 5 assigned (both are Take Home Programming-based; Upload using Canvas)<\/span><\/strong>\n<\/p>\n

\n\tQuiz 6 & Quiz 7 (Take Home; assigned together; Submit hardcopy of both the quizzes together in class on April 12th, 1 PM)<\/span><\/strong>\n<\/p>\n

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

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

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

\n\tLecture Code (C++)<\/a>
\n\tProject Descriptions<\/a>
\n\tQuizzes and Exams<\/a>
\n\tQuiz, Exam and Project 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 2019<\/font><\/a><\/span><\/b>\n<\/p>\n

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

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

\n\tTA Schedule<\/a>\n<\/p>\n

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

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

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

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

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

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

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

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

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

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

\n\tModule 9 – Graphs<\/font><\/a><\/b>\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>Project Descriptions<\/b>
\n<\/h3>\n

\n\tProject 1 (Due on Feb. 20th, 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 Feb. 27th, 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>\n<\/p>\n

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

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

\n\tProject 3 (Due on March 6th, 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><\/span>\n<\/p>\n

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

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

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

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

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

\n\tProject 5 (Due on March 27th, 11.59 PM): <\/strong><\/span><\/b>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 6 (Due on April 3rd, 11.59 PM): <\/strong><\/span><\/b>Binary Search Tree: Average Number of Comparisons for a Successful Search<\/a><\/span><\/strong>\n<\/p>\n

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

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

\n\tProject 7 (Due on April 10th, 11.59 PM): <\/strong><\/span><\/b>Binary Search Tree: Lowest Common Ancestor Node<\/a><\/strong><\/span>\n<\/p>\n

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

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

\n\tProject 8 (Due on April 17th, 11.59 PM): <\/strong><\/span><\/b>Checking whether a Binary Tree is a Max Heap<\/a><\/strong><\/span>\n<\/p>\n

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

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

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

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

\n\tQuiz 2 (Due on Feb. 15th, 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><\/strong>\n<\/p>\n

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

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

\n\tQuiz 3 (Due on Feb. 22nd, 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><\/strong><\/span>\n<\/p>\n

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

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

\n\tEXAM 1 (Due on March 4th, 11.59 PM): <\/strong><\/span><\/b>CSC228-Sp2019-Exam-1<\/a><\/span><\/strong>\n<\/p>\n

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

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

\n\tQuiz 4 (Due on March 8th, 11.59 PM): <\/strong><\/span><\/b>Stack-based Implementation of Queue<\/a><\/strong><\/span>\n<\/p>\n

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

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

\n\tQuiz 5 (Due on March 22nd, 11.59 PM): <\/strong><\/span><\/b>Intersection of Two Linked Lists using a Hashtable<\/a><\/strong><\/span>\n<\/p>\n

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

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

\n\tEXAM 2 (Due on March 29th, 11.59 PM): <\/strong><\/span><\/b>CSC228-Sp2019-Exam-2<\/a><\/strong>\n<\/p>\n

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

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

\n\tQuiz 6 and Quiz 7 (Due on April 12th, 1 PM; submit the quizzes together as a single submission): <\/strong><\/span><\/b>CSC228-Sp2019-Quiz-6-7-TakeHome<\/a><\/strong>\n<\/p>\n

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

\n\tExam 3 <\/span><\/span>will be conducted in two parts: Both parts are in-class, OPEN notes. Part I will be tested on Wednesday, April 24th (1 PM to 1.50 PM) and Part II will be tested on Friday, April 26th (1 PM to 1.50 PM). <\/span>Reading List for both parts<\/span><\/a><\/strong>\n<\/p>\n

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

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

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

Exam 3 will be conducted in two parts: Both parts are in-class, OPEN notes. Part I will be tested on Wednesday, April 24th (1 PM to 1.50 PM) and Part II will be tested on Friday, April 26th (1 PM to 1.50 PM). Reading List for both parts Projects 4-8 assigned. Exam 2 and Quiz […]<\/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\/2547"}],"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=2547"}],"version-history":[{"count":40,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/2547\/revisions"}],"predecessor-version":[{"id":2793,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/2547\/revisions\/2793"}],"wp:attachment":[{"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/media?parent=2547"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}