Programming Competitions as a Basis for an Algorithms and Data Structures Course John Paxton Montana State University CCSC - NW Friday, October 12, 2007.

Slides:

Advertisements

Similar presentations

J Paul Gibson, NUI Maynooth 2004/2005: CS211Intro. 1 CS211 Algorithms & Data Structures, with GUI Programming

Advertisements

Web Design! John Paxton Montana State University - Bozeman CCSC Northwestern Region Saturday, October 8 th, 2004.

Welcome to Introduction to Java Programming At J.D.O’Bryant Science & Mathematics Chonho Lee Department of Computer Science University of Massachusetts.

DATA STRUCTURES INTRODUCTION CSC 172 SPRING 2004.

W4140 Network Laboratory Lecture 13 Dec 11 - Fall 2006 Shlomo Hershkop Columbia University.

Undergraduate Consultation: Opportunities and Challenges John Paxton Montana State University – Bozeman October 15, 2005 Seventh Annual CCSC-NW Conference.

1 Foundations of Software Design Lecture 1: Course Overview Intro to Binary and Boolean Marti Hearst SIMS, University of California at Berkeley.

The Preference Matrix As A Course Design Tool John Paxton Montana State University Universität Leipzig Koli Calling Saturday, November 11, 2006.

CSC 171 – FALL 2004 COMPUTER PROGRAMMING LECTURE 0 ADMINISTRATION.

Administrivia Interviews this week: ex-TA Paul Hale Nate's office hours, as usual: Wed 2-4 The final survey will be up by Thursday: –you NEED to do this,

School of Computing Science – CMT1000 Slide 1 Ed Currie Introduction to Programming CMT1000 Lecture 1A.

Data Structures & Agorithms Lecture-1: Introduction.

Developing an Undergraduate Distributed Development Course Gregory Conti John M. D. Hill Curtis A. Carver, Jr. United States Military Academy Department.

1 Object Oriented Programming Computer Systems Engineering (D2) and Programming (P)

CS223 Algorithms D-Term 2013 Instructor: Mohamed Eltabakh WPI, CS Introduction Slide 1.

CS 150 PERSONAL PRODUCTIVITY USING TECHNOLOGY Instructor: Xenia Mountrouidou.

MATH 310, FALL 2003 (Combinatorial Problem Solving) MoWeFr 1:20 McGregory 214.

CS426 Game Programming II Dan Fleck. Why games?  While the ideas in this course are demonstrated programming games, they are useful in all parts of computer.

Data Structures and Programming.  Today:  Administrivia  Introduction to 225, Stacks  Course website: 

How to Learn in This Course CS 5010 Program Design Paradigms “Bootcamp” Lesson 0.1 © Mitchell Wand, This work is licensed under a Creative Commons.

Java Teaching Workshop Y. Daniel Liang May 20, 2002 At NCC.

Network Simulation and Testing Polly Huang EE NTU

AP/Honors Night WELCOME! WELCOME!. What is the Honors and Advanced Placement Program? We offer nine Honors classes across the English, Social Studies,

Polly Huang, NTU EEAdmin1 Network Simulation and Testing Polly Huang EE NTU

8/19/2003CS 303 – Administrivia Lecture 0 1 Administrivia Labs Homework Grades Exams Quiz.

CS 140 Computer Programming (I) Second semester (3 credits) Imam Mohammad bin Saud Islamic University College of Computer Science and Information.

CSC 171 – FALL 2001 COMPUTER PROGRAMMING LECTURE 0 ADMINISTRATION.

Network Simulation and Testing Polly Huang EE NTU

CS Summit John Paxton Montana State University June 10, 2010.

How to Learn in This Course CS 5010 Program Design Paradigms “Bootcamp” Lesson 0.1 © Mitchell Wand, This work is licensed under a Creative Commons.

CHEM 146C, SPRING 2010 Advanced Physical Chemistry Laboratory Instructor: Yat Li, PSB 160, , Group website:

Course Assessment Presentation Jan- May, 2013 Aim of Course: The aim of the course is to make students learn algorithm design skills and apply these skills.

Interactivity and Intervention An Overview of Calculus Redesign at Missouri S&T.

Art Middle School Revisited Tim Lowke Visual Art Curriculum Specialist.

Chris Schroeder Morehead State University Morehead, Kentucky The National Center for Academic Transformation Redesign Alliance Fourth Annual Conference.

Basic Computer (CS-101A) Accelerated Program City Junior College Tim Jaines Instructor.

Design and Analysis of Algorithms (09 Credits / 5 hours per week) Sixth Semester: Computer Science & Engineering M.B.Chandak

CS 161 Computer Science I Andrew Scholer

1 CS 381 Introduction to Discrete Structures Lecture #1 Syllabus Week 1.

CS321 Spring 2016 Lecture 3 Jan Admin A1 Due this Friday – 11:00PM Thursday = Recurrence Equations – Important. Everyone Should be added to class.

Designing Lego Labs Using Lejos and Mindstorms Adapted from Lynn Stein “Radically ReThinking CS1” NSF Workshop.

ME Curriculum Workshop Systems Engineering Discussion Rich Granger August 3, 2012.

BMTS Computer and Systems Pre-requisites :CT140 –Computer Skills Nature Of the Course: This course deals about the fundamentals of Computer such.

1 ECEN209-Computer Architecture (Course Overview & Introduction)

Integrating Web-Based Literacy Instruction: A Pilot Report The Reading Plus Faculty Inquiry Group 14 May 2015.

1 COMP9007 – Algorithms Course page: + Blackboard link Lecturer: M.Reza Hoseiny M.Reza Hoseiny Level.

COMP9024: Data Structures and Algorithms Course Outline Hui Wu Session 1, 2016

CS140 – Computer Programming 1 Course Overview First Semester – Fall /1438 – 2016/2017 CS140 - Computer Programming 11.

Design and Analysis of Algorithms (09 Credits / 5 hours per week)

Computer Engineering Department Islamic University of Gaza

CS101 Computer Programming I

COMP9024: Data Structures and Algorithms

CSc 020: Programming Concepts and Methodology II

PRE-AP computer science 1

Artificial Intelligence (CS 461D)

ENGINEERING A BRIDGE TO INFORMATION LITERACY

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.

GTECH 709 Criteria for evaluation

CSCE Problem Solving Programming Strategies

CSCE 315 Programming Studio

CSCE 489 Problem Solving Programming Strategies

Information Systems in Organizations Introduction Carey O’Donnell

Assessment Design For Learning

Solving Equations 3x+7 –7 13 –7 =.

Java Course Adaptation from Humboldt University

Homework Reading Machine Projects Labs

Design and Analysis of Algorithms

Programming Fundamentals Lecture #1 Overview of Computer Programming

CS533 Concepts of Operating Systems Class 1

Design and Analysis of Algorithms (04 Credits / 4 hours per week)

Presentation transcript:

Programming Competitions as a Basis for an Algorithms and Data Structures Course John Paxton Montana State University CCSC - NW Friday, October 12, 2007

Outline I.Course Overview II.Assessment III.Curriculum Ideas IV.Discussion

I. Course Overview leipzig.de/~paxton/algorithmics

Background Practical Applications of Data Structures and Algorithms The University of Leipzig Winter Semester 2006 / upper division students 4 credit, elective course

Funding Fulbright Award Montana State sabbatical

Course Goals Improve problem solving abilities Improve (Java) programming skills Improve technical English abilities

Course Format 90 minute lecture 90 minute lab Weekly exercise (30%) Local programming contest (10%) Final exam (60%)

Local Programming Contest

Course Topics Simple Input / Output Base Conversions Large Numbers Combinatorics Strings Sorting

Course Topics Grids Trees Graphs Dynamic Programming Artificial Intelligence

II. Assessment Student Instructor

Student Assessment 1.The course took a practical approach to problem solving. How did you like this approach? 0 – strongly dislike 1 – dislike 0 – neutral 12 – like 8 – strongly like

Student Assessment 2.The majority of the lecture time was spent coding solutions to problems. How valuable was this technique? 2 – not valuable 5 – somewhat valuable 10 – valuable 4 – very valuable

Student Assessment 3.How much did your problem solving skills improve during the course? 0 – none 5 – a little 9 – some 7 – a lot

Student Assessment 4.How much did your programming abilities improve during the course? 0 – none 7 – a little 11 – some 3 – a lot

Instructor Assessment Emphasize testing more Post alternate solutions Use a grading script Have students take final individually (pairs underperformed by 12.5%) Have students code in class Improve the assessment process

III. Curriculum Ideas Problem solving course Programming contest course Study abroad course Integrate into existing courses (CS I, CS II, artificial intelligence, networks, etc.)

IV. Discussion How to avoid a “hack-fest” Managing 75 students with no TA A peek at the website

IV. Discussion Thank you! Any questions?