Team assignments in CS 322 “Data Structures & Algorithms II” Jey Veerasamy CIS Adjunct Faculty Baker College Online.

Slides:



Advertisements
Similar presentations
Review. What to know You are responsible for all material covered in lecture, the readings, or the programming assignments There will also be some questions.
Advertisements

CMPT 225 Data Structures and Programming. Course information Lecturer: Jan Manuch (Jano), TASC TAs: Osama Saleh,
1 CENG 707 Data Structures and Algorithms Nihan Kesim Çiçekli Department of Computer Engineering Middle East Technical University Fall 2010.
June 13, Introduction to CS II Data Structures Hongwei Xi Comp. Sci. Dept. Boston University.
1 Advanced Data Structures. 2 Topics Data structures (old) stack, list, array, BST (new) Trees, heaps, union-find, hash tables, spatial, string Algorithm.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2002 Lecture 2 Tuesday, 9/10/02 Design Patterns for Optimization.
CSCE156: Introduction to Computer Science II Instructor Stephen Scott Website
CS 410 Applied Algorithms Applied Algorithms Lecture #1 Introduction, class information, first problems.
Chapter 10: Algorithm Design Techniques
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2001 Lecture 1 Introduction/Overview Wed. 9/5/01.
CS 206 Introduction to Computer Science II 04 / 29 / 2009 Instructor: Michael Eckmann.
CS503: Tenth Lecture, Fall 2008 Review Michael Barnathan.
CS 206 Introduction to Computer Science II 12 / 10 / 2008 Instructor: Michael Eckmann.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Spring, 2001 Lecture 1 Introduction/Overview Wed. 1/31/01.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2000 Lecture 1 Introduction/Overview Wed. 9/6/00.
1 ES 314 Advanced Programming Lec 2 Sept 3 Goals: Complete the discussion of problem Review of C++ Object-oriented design Arrays and pointers.
DAST, Spring © L. Joskowicz 1 Data Structures – LECTURE 1 Introduction Motivation: algorithms and abstract data types Easy problems, hard problems.
July 16, Introduction to CS II Data Structures Hongwei Xi Comp. Sci. Dept. Boston University.
Data Structures and Programming.  John Edgar2.
 Solving inequalities follows the same procedures as solving equations.  There are a few special things to consider with inequalities: ◦ We need to.
Instructor: Dr. Sahar Shabanah Fall Lectures ST, 9:30 pm-11:00 pm Text book: M. T. Goodrich and R. Tamassia, “Data Structures and Algorithms in.
DESIGNING EFFECTIVE DQS/TESTS Dr. Jey Veerasamy 1.
1 What NOT to do I get sooooo Frustrated! Marking the SAME wrong answer hundreds of times! I will give a list of mistakes which I particularly hate marking.
Teaching Teaching Discrete Mathematics and Algorithms & Data Structures Online G.MirkowskaPJIIT.
CS223 Algorithms D-Term 2013 Instructor: Mohamed Eltabakh WPI, CS Introduction Slide 1.
Data Structures Lecture 1: Introduction Azhar Maqsood NUST Institute of Information Technology (NIIT)
1 CS 233 Data Structures and Algorithms 황승원 Fall 2010 CSE, POSTECH.
CRACKING THE CODING INTERVIEW Nitish Upreti. Nitish
Course Program, Evaluation, Exams, Resources Telerik Software Academy Data structures and algorithms.
COMPE 574 Fundamentals of Algorithms Spring Murat KARAKAYA Department of Computer Engineering.
Java Collections An Introduction to Abstract Data Types, Data Structures, and Algorithms David A Watt and Deryck F Brown © 2001, D.A. Watt and D.F. Brown.
Course Web Page Most information about the course (including the syllabus) will be posted on the course wiki:
Instructor Information: Dr. Radwa El Shawi Room: Week # 1: Overview & Review.
1 Summary: Design Methods for Algorithms Andreas Klappenecker.
1 CSC 222: Computer Programming II Spring 2004 See online syllabus at: Course goals:
Computer Science 102 Data Structures and Algorithms CSCI-UA.0102 Fall 2012 Lecture 1: administrative details Professor: Evan Korth New York University.
Overview of Course Java Review 1. This Course Covers, using Java Abstract data types Design, what you want them to do (OOD) Techniques, used in implementation.
1 Week 9 A little more GUI, and threads. Objectives: Discuss the Swing set of classes. Incorporate animation into applets. Define the term thread. Explain.
 Analysis Wrap-up. What is analysis?  Look at an algorithm and determine:  How much time it takes  How much space it takes  How much programming.
December 4, Algorithms and Data Structures Lecture XV Simonas Šaltenis Aalborg University
CS Data Structures II Review & Final Exam. 2 Topics Review Final Exam.
Course Review Fundamental Structures of Computer Science Margaret Reid-Miller 29 April 2004.
CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2002 Sections Ms. Susan Mitchell.
1 Data Structures COP 4530 Spring 2010 MW 4:35 PM – 5:50 PM CHE 101 Instructor:Dr. Rollins Turner Dept. of Computer Science and Engineering ENB
1 Today’s Material Dynamic Programming – Chapter 15 –Introduction to Dynamic Programming –0-1 Knapsack Problem –Longest Common Subsequence –Chain Matrix.
Data Structures and Algorithms in Java AlaaEddin 2012.
Course Introductions.  Introduction to java  Basics of Java  Classes & Objects  Java Collections and APIs  Algorithms and their analysis  Recursion.
1Computer Sciences Department. 2 Advanced Design and Analysis Techniques TUTORIAL 7.
DATA STRUCTURES (CS212D) Overview & Review Instructor Information 2  Instructor Information:  Dr. Radwa El Shawi  Room: 
 Saturday, April 20, 8:30-11:00am in B9201  Similar in style to written midterm exam  May include (a little) coding on paper  About 1.5 times as long.
Principles of Imperative Computation Lecture 1 January 15 th, 2012.
Introduction to Algorithm Complexity Bit Sum Problem.
Advanced Higher Computing Science The Project. Introduction Worth 60% of the total marks for the course Must include: An appropriate interface using input.
IT 210 Week 2 Individual Application-Level Requirements To purchase this material link
IT 210 Week 3 CheckPoint Sequential and Selection Processing Control Structure Appendix G To purchase this material link
IT 210 Week 7 Chapter 5 Programming Problems To purchase this material link Programming-Problems.
Algorithm homework help For More Detail help.aspx - Phone:-
Advanced Higher Computing Science
CS16: Introduction to Algorithms and Data Structures
CSC 427: Data Structures and Algorithm Analysis
CSC 222: Computer Programming II
COMP9024: Data Structures and Algorithms
Midterm Review.
Computer Science 102 Data Structures CSCI-UA
Definition In simple terms, an algorithm is a series of instructions to solve a problem (complete a task) We focus on Deterministic Algorithms Under the.
HITS Hypertext Induced Topic Selection
Lecture 9 Greedy Strategy
HITS Hypertext Induced Topic Selection
COP3530- Data Structures Introduction
CSCE156: Introduction to Computer Science II
Presentation transcript:

Team assignments in CS 322 “Data Structures & Algorithms II” Jey Veerasamy CIS Adjunct Faculty Baker College Online

CS 321 & CS 322 contents CS 321 focuses on data structures: arrays, linked lists, vectors, stacks and queues, then a little about recursion algorithms. CS 322 covers advanced data structures like hash tables, binary trees, AVL trees, and graphs, but the focus is more on algorithms: divide-and-conquer, greedy & dynamic programming approaches to solve various problems.

CS 322 Team Assignments Goals: –Make students analyze the problems (a.k.a. critical thinking) –Bring ideas to solve them based on those three approaches to the table –Validate each other’s ideas –Settle on the “right” data structures & arrive at the detailed pseudocode

What problems? I use classic problems like Knapsack problem, company party problem, activity scheduling problem, Huffman coding algorithm. Typically these algorithms are taught in graduate courses. So, I try my best to provide “just enough” help to start meaningfully and progress meaningfully. P S1 S2 S3

When & How? Spans 2 weeks: High level approach in Week 4 and low level pseudocode in Week 5. I assign 2 to 3 designers & 2 to 3 reviewers for each problem. All discussions done in Weekly discussion forums, NOT in group forums.

Student’s roles Each student is a designer for one problem (40 points) and also a reviewer for another problem (20 points). I reverse the roles in Week 5 for each problem. P1 P2 S P1 P2 S Design ReviewDesign Review Week 4Week 5

Week 4 Process Start of Week 4: designers find the optimal solution for sample input manually and reviewers test it out. Week 4: designers come up with a few workable ideas, reviewers comment on them. End of Week 4: Try to zero in on one approach & verify it for a few sample inputs manually.

Week 5 process Start Week 5 with solid understanding of high level approach. Bring in the right data structures & details Verify its validity again by testing with a sample inputs.

What is good Students enjoy the experience. When one student hits the wall, another student brings up an idea, that keeps the team moving. Students learn to work with other’s “incomplete” ideas, practice their skills to give “constructive criticisms”.

Need to work on Sometimes students become impatient and find the solution using “web search”  even though I stress on the “thinking process”, NOT the “end- result”. I try to ensure there is at least one “leader” in each team. But, there are times I end up with no leaders in the team  No one starts the discussion! Some students refuse to post their ideas since they are not sure those ideas will work 