{"id":1561,"date":"2017-08-21T07:30:40","date_gmt":"2017-08-21T12:30:40","guid":{"rendered":"https:\/\/www.jsums.edu\/nmeghanathan\/?page_id=1561"},"modified":"2017-12-05T00:03:55","modified_gmt":"2017-12-05T05:03:55","slug":"csc228-fall2017","status":"publish","type":"page","link":"https:\/\/www.jsums.edu\/nmeghanathan\/csc228-fall2017\/","title":{"rendered":"CSC 228 Data Structures and Algorithms, Fall 2017"},"content":{"rendered":"

Exam 3 (on Dec. 6th: 1 PM to 2.50 PM): Module 9 (Slides 1-47): Open Notes<\/b><\/p>\n

—————————————————-<\/span><\/p>\n

Syllabus<\/a>
\nLecture Slides<\/a>
\nLecture Code (C++)<\/a>
\nLecture Code (Java)<\/a>
\nProject Descriptions<\/a>
\nQuizzes and Exams<\/a>
\nQuiz, Exam and Project Schedules<\/a><\/p>\n

\n <\/p>\n

Information about Teaching Assistants<\/a><\/span><\/p>\n

<\/p>\n

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

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

CSC228 Syllabus, Fall2017<\/a><\/span><\/p>\n

<\/p>\n

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

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

Module 2 – List ADT<\/a><\/p>\n

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

<\/p>\n

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

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

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

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

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

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

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

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

Code 2: <\/strong>Dynamic List Implementation using Arrays<\/a><\/span>
\n
\nCode 3: <\/strong>Singly Linked List<\/a><\/span><\/p>\n

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

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

<\/p>\n

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

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

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

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

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

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

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

<\/p>\n

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

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

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

<\/p>\n

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

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

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

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

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

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

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

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

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

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

<\/p>\n

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

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

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

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

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

<\/p>\n

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

Bonus Project 1 (Due: Aug 30, 1 PM)<\/a><\/span><\/p>\n

<\/p>\n

Project 1: List ADT – Dynamic Arrays (Due: Sept. 13, 1 PM)<\/a><\/span><\/p>\n

Project 2: Implementation of Recursive Print and Merge List Functions for
\nSingly Linked List (Due: Sept. 27, 1 PM)<\/a><\/span>
\nCheck Canvas for the startup code <\/p>\n

Project 3: Finding the Next Greater Element of an Element in an Array in \u0398(n) Time (Due: Oct. 4, 1 PM)<\/a><\/span>
\nProject Idea<\/a><\/span>
\nCheck Canvas for the startup code <\/p>\n

Project 4: Stack-based Implementation of Queue (Due: Oct. 11, 1 PM)<\/a><\/span>
\nCheck Canvas for the startup code <\/p>\n

Project 5: Using Hashtables to Print the Duplicate Elements in an Array exactly once (Due: Oct. 18, 1 PM)<\/a><\/span>
\nCheck Canvas for the startup code <\/p>\n

Project 6: Checking whether a binary tree is height-balanced or not. (Due: Oct. 27, 1 PM)<\/a><\/span>
\nCheck Canvas for the startup code <\/p>\n

Project 7: Binary Trees: Checking for Complete Binary Tree and Binary Search Tree (Due: Nov. 3, 1 PM)<\/a><\/span>
\nCheck Canvas for the startup code <\/p>\n

Project 8: Binary Search Tree: Average Number of Comparisons for a Successful Search (Due: Nov. 10, 1 PM)<\/a><\/span>
\nCheck Canvas for the startup code <\/p>\n

Project 9: Binary Search Tree: Lowest Common Ancestor Node for Two Keys (Due: Nov. 17, 1 PM)<\/a><\/span>
\nCheck Canvas for the startup code <\/p>\n

Project 10: Binary Tree: Checking for a Max Heap (Due: Nov. 29, 1 PM)<\/a><\/span>
\nCheck Canvas for the startup code <\/p>\n

 <\/p>\n

 <\/p>\n

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

Quiz 2 (Take Home); Due on Sept. 18 by 1 PM (Check Canvas for the Code and other instructions)<\/a><\/p>\n

Exam 1 (Take Home); Due on Oct. 2 by 1 PM (Check Canvas for the Code and other instructions)<\/a><\/p>\n

Exam 2 (Take Home); Due on Nov. 13 1 PM (Check Canvas for other instructions)<\/a><\/p>\n

Quiz 3 (Take Home); Due on Oct. 9 by 1 PM (Check Canvas for the Code and other instructions)<\/a><\/p>\n

Quiz 4 Solutions<\/a><\/p>\n

Quiz 5 Solutions<\/a><\/p>\n

Quiz 6 Solutions<\/a><\/p>\n

Quiz 7 (Take Home); Due on Nov. 6 by 1 PM (Check Canvas for the Code and other instructions)<\/a><\/p>\n

 <\/p>\n

 <\/p>\n

 <\/p>\n

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

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

Exam 3 (on Dec. 6th: 1 PM to 2.50 PM): Module 9 (Slides 1-47): Open Notes —————————————————- Syllabus Lecture Slides Lecture Code (C++) Lecture Code (Java) Project Descriptions Quizzes and Exams Quiz, Exam and Project Schedules   Information about Teaching Assistants —————————————————– Syllabus CSC228 Syllabus, Fall2017 Lecture Slides Module 1:Asymptotic Time Complexity and Intro to […]<\/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\/1561"}],"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=1561"}],"version-history":[{"count":123,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/1561\/revisions"}],"predecessor-version":[{"id":1975,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/1561\/revisions\/1975"}],"wp:attachment":[{"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/media?parent=1561"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}