{"id":2816,"date":"2019-08-18T16:31:18","date_gmt":"2019-08-18T21:31:18","guid":{"rendered":"https:\/\/www.jsums.edu\/nmeghanathan\/?page_id=2816"},"modified":"2019-11-21T18:37:07","modified_gmt":"2019-11-21T23:37:07","slug":"csc228-fall2019","status":"publish","type":"page","link":"https:\/\/www.jsums.edu\/nmeghanathan\/csc228-fall2019\/","title":{"rendered":"CSC 228 Data Structures and Algorithms, Fall 2019"},"content":{"rendered":"

\n\tEXAM 3 will be on Tuesday, December 3rd, from 9 AM to 10.50 AM at ENB 162 (regular classroom). It will be in-class, OPEN notes. <\/strong><\/span>Reading List for EXAM 3<\/a><\/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, Fall 2019<\/a><\/strong>\n<\/p>\n

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

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

\n\tMahzabin Akhter <akhterm86@gmail.com><\/span>\n<\/p>\n

\n\tRoom: ENB 163<\/span>\n<\/p>\n

\n\tTuesday: 9 am – 11 am, 1 pm – 2 pm, 4 pm – 5pm<\/span>
\n\tThursday: 9 am – 11 am, 1 pm – 2 pm, 4 pm – 5pm<\/span>
\n\tFriday: 9 am – 1 pm<\/span>\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 (updated)<\/u><\/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<\/font><\/a><\/b>\n<\/p>\n

\n\tModule 7 – Binary Search Trees (Last updated: Oct. 24th)<\/a><\/strong>\n<\/p>\n

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

\n\tProject 1 (Due: Sept. 19th, 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\n<\/p>\n

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

\n\tProject 2 (Due: Sept. 26th, 11.59 PM): <\/strong><\/span><\/b> Project 2: 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\n<\/p>\n

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

\n\tProject 3 (Due: Oct. 10th, 11.59 PM): <\/strong><\/span><\/b> Project 3: Implementation of the Stack ADT using a Singly Linked List and Comparing its Performance with a Doubly Linked List-based Implementation<\/a><\/strong>\n<\/p>\n

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

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

\n\tProject 4 (Due: Oct. 17th, 11.59 PM): <\/strong><\/span><\/b>Project 4: Implementation of the Queue ADT using a Stack Object and Performance Comparison of the EnqueueCostly and the DequeueCostly Approaches<\/a><\/strong>\n<\/p>\n

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

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

\n\tProject 5 (Due: Oct. 24th, 11.59 PM): <\/strong><\/span><\/b>Project 5: Using a Hashtable to Determine the Common Elements in all the Lists<\/a><\/strong>\n<\/p>\n

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

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

\n\tProject 6 (Due: Nov. 7th, 11.59 PM): <\/strong><\/span><\/b>Project 6: 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><\/strong>\n<\/p>\n

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

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

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

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

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

\n\tProject 8 (Due: Nov. 21st, 11.59 PM): <\/strong><\/span><\/b>Project 8: Checking whether a Binary Tree is a Min Heap<\/a><\/strong>\n<\/p>\n

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

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

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

\n\tQuiz 1 (Due: Sept. 24th, 11.59 PM): <\/strong><\/span><\/b> Design and Implementation of an Algorithm to Determine whether a Linked List has Unique Elements<\/a><\/span><\/strong>\n<\/p>\n

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

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

\n\tExam 1 (Due: Oct. 1st, 11.59 PM)<\/a><\/strong><\/span>\n<\/p>\n

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

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

\n\tQuiz 2 (Due: Oct. 15th, 11.59 PM): <\/strong><\/span><\/b> Quiz 2: Determination of Maximum Depth of Nested Parentheses in an Expression<\/a><\/strong>\n<\/p>\n

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

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

\n\tQuiz 3 (Due: Oct. 22nd, 11.59 PM): <\/strong><\/span><\/b>Quiz 3: Insertion and Deletion of Data at an Arbitrary Index in a Queue<\/a><\/strong>\n<\/p>\n

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

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

\n\tExam 2 (Due: Oct. 29th, 11.59 PM)<\/strong><\/span><\/b>\n<\/p>\n

\n\tExam 2 (Take Home)<\/a><\/strong><\/span>\n<\/p>\n

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

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

\n\tQuiz 4 (Due: Nov. 5th, 11.59 PM): <\/strong><\/span><\/b>Quiz 4: 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><\/strong>\n<\/p>\n

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

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

\n\tQuiz 5 and Quiz 6 (Due on Nov. 19th, @ 11.30 AM; submit the quizzes together as a single submission): <\/span><\/strong><\/span><\/b>CSC228-Fall2019-Quiz-5-6-TakeHome<\/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 on Tuesday, December 3rd, from 9 AM to 10.50 AM at ENB 162 (regular classroom). It will be in-class, OPEN notes. Reading List for EXAM 3 —————————————————– Syllabus Lecture Slides Lecture Code (C++) Project Descriptions Quizzes and Exams Quiz, Exam and Project Schedules   Syllabus CSC228 Syllabus, Fall 2019   Teaching […]<\/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\/2816"}],"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=2816"}],"version-history":[{"count":48,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/2816\/revisions"}],"predecessor-version":[{"id":3031,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/2816\/revisions\/3031"}],"wp:attachment":[{"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/media?parent=2816"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}