Key points from IUCEE Algorithms workshop Group-5 S.Padmavathi C.Sujatha Narayanan.

Slides:



Advertisements
Similar presentations
Peer-Assessment. students comment on and judge their colleagues work.
Advertisements

Teaching Methods Related to Student Progress in Lower-level STEM Courses Steve Benton, Ph.D. Senior Research Officer IDEA Emeritus Professor, Kansas State.
Active and Cooperative Learning in an Introductory Computer Science Course Dr. Cheryl A. Dugas.
5/19/2015CS 2011 CS 201 – Data Structures and Discrete Mathematics I Syllabus Spring 2014.
A Workshop on Subject GRE / AGRE Maths in 9 Classes, II Hours each Day & Three mock tests for AGRE By: Satyadhar Joshi
June 13, Introduction to CS II Data Structures Hongwei Xi Comp. Sci. Dept. Boston University.
Review for Test 2 i206 Fall 2010 John Chuang. 2 Topics  Operating System and Memory Hierarchy  Algorithm analysis and Big-O Notation  Data structures.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2004 Project.
Preparing An Effective Large Group Teaching Session Harvey J. Hamrick, MD Edmund A. Liles MD The Teaching Center UNC Department of Pediatrics The Teaching.
Data Structures, Spring 2004 © L. Joskowicz 1 DAST – Final Lecture Summary and overview What we have learned. Why it is important. What next.
Observing Learning Helen Bacon and Jan Ridgway Inclusion Support Services.
Welcome and Overview Richard Anderson University of Washington June 30, 20081IUCEE: Welcome and Overview.
Analysis and Design of Algorithms An algorithm is a method of solving problem (on a computer) Problem example: –given a set of points on the plane –find.
Advanced Research Methodology
Teaching Teaching Discrete Mathematics and Algorithms & Data Structures Online G.MirkowskaPJIIT.
Classroom learning skills Professor Eiad Al-faris.
Qatar University Exemplary Online Course Award
08/09/2015UAS Advert1.1 Computing in the Classroom Introduction What is this all about? Fiona McNeill EM G52
August, 2014 Diane Salter, Vice Provost Teaching and Learning Basics and Beyond Day 1.
About the Course Lecture 0: Sep 10 AB C. Plan  Course Information and Arrangement  Course Requirement  Topics and objectives of this course.
Competence Analysis in the Two-subject Study Program Computer Science Jože Rugelj, Irena Nančovska Šerbec Faculty of Education Univesity of Ljubljana 1Beaver.
Applying creativity in CS high school education - criteria, teaching example and evaluation Romeike, R. (2007). Applying creativity in CS high school education.
Session 2 : Feedback on Observation and Teaching Approaches 12 th March 2009 Majda Al-liabi.
DISCUSS ACADEMIC achievement WITH YOUR PROFESSOR! Exercise your responsibility to discuss your academic performance with all your instructors Designed.
On-Line Course Development in Remote Sensing at Virginia Tech Preparing Students for Careers in Remote Sensing August 2002 J.B. Campbell, R.H. Wynne,
 Length – 5 weeks with 8 lessons being taught in this time frame.  Main Subject Matter – Reading comprehension and social studies.
 Participants will teach Mathematics II or are responsible for the delivery of Mathematics II instruction  Participants attended Days 1, 2, and 3 of.
EDU 385 EDUCATION ASSESSMENT IN THE CLASSROOM
Elements of successful lesson and some classroom management tips Lecturing.
Enhancing Teaching and Learning with Podcasts Mico e-Learning Workshop.
1 Algorithms and networks Period 2, 2014/ Today Graphs and networks and algorithms: what and why? This course: organization Case introduction:
1. Introduction Adaptive hypermedia & AHyCo Algorithms and Data Structures course materials in AHyCo Knowledge assessment with AHyCo Conclusion and further.
Major objective of this course is: Design and analysis of modern algorithms Different variants Accuracy Efficiency Comparing efficiencies Motivation thinking.
COT 5405 Spring 2009 Discussion Session 3. Introduction Our weekly discussion class are like organized TA office hours. Here we encourage students to.
Antonio Aragon Teacher at Orange Walk Institute for Technical and Vocational Education and Training.
Principals’ Conference Network 609 October 4, 2012 Mathematics.
Module 3.2.  Learn the differences between kinds of textbooks  Learn ways to help students focus their reading and manage multiple or very large reading.
WELCOME to CS244 Brent M. Dingle, Ph.D Game Design and Development Program Mathematics, Statistics and Computer Science University of Wisconsin -
Sorting and Searching by Dr P.Padmanabham Professor (CSE)&Director
Contextualized Learning Activities
Assessment Ice breaker. Ice breaker. My most favorite part of the course was …. My most favorite part of the course was …. Introduction Introduction How.
THE PILLARS OF GOOD TEACHING MOHAMMED EL-AFFENDI AUGUST 2014.
Design and Analysis of Algorithms (09 Credits / 5 hours per week) Sixth Semester: Computer Science & Engineering M.B.Chandak
1 Algorithms and networks Period 3, 2011/ Today Graphs and networks and algorithms: what and why? This course: organization Case introduction:
&d1 Algorithms and networks Period 3, 2010/2011. &d2 Today Graphs and networks and algorithms: what and why? This course: organization Case introduction:
SE- Looking Ahead Topics Taught CA: Excel (lookup table) CL: Webpage publishing CS: Pascal (looping) CS: Pascal (case statement) CA: MSWord (creating table)
Instructor Development
Terms.  the “hook” or attention grabber at the beginning of the lesson that immediately involves the learner.
Teacher Directed Instruction. Use for teaching basic facts, knowledge, and skills (examples): New tasks Alphabetizing Unfamiliar material Science equations.
Analysis of Algorithms: Math Review Richard Kelley, Lecture 2.
13 strategies to use Powerpoint to support active learning in classroom.
1 COMP9007 – Algorithms Course page: + Blackboard link Lecturer: M.Reza Hoseiny M.Reza Hoseiny Level.
CSC 172 DATA STRUCTURES. MIDTERM REVIEW MIDTERM EXAM 75 min 6 – 10 questions a lot like the quiz questions.
RAIK 283 Data Structures and Algorithms
Advanced Algorithms Analysis and Design
Design and Analysis of Algorithms (09 Credits / 5 hours per week)
Year 11 Information Evening
CHAN Ka Wing, LAM Chung Man and YEUNG Yau Yeun
Chapter 5 Teaching Methods.
Objective of This Course
COSC 320 Advanced Data Structures and Algorithm Analysis
CS 281: Discrete Mathematics for Computer Science
Karthick S.B. (VIT, Pune) Kulkarni V.Y. (MIT Pune)
Ideas to be Adopted from IUCEE Workshop on Teaching Algorithms
Design and Analysis of Algorithms
INTRODUCTION TO ALOGORITHM DESIGN STRATEGIES
CSCE156: Introduction to Computer Science II
Department of Computer Science & Engineering
Presentation transcript:

Key points from IUCEE Algorithms workshop Group-5 S.Padmavathi C.Sujatha Narayanan

Discrete Mathematics Correlate Computer science applications to the Maths topics Proof of Contradiction with Tiling Example Importance of sequencing the topics by their complexity level.( Understanding level, not algorithm complexity)

Data Structures Best and worst case analysis preferred over average case analysis Examples for the students to think more( memory hierarchy) Build a library for Hash tables for their future use Summary of sorting techniques for better comparison Union find, Fibonacci heaps and Binomial Queues are identified as light weight topics. Better understanding of theoretical run time and complex data structures.

Algorithms Begin the course with Stable Marriage problem Knowledge of Mapping between different NP problems Clear distinction between NP-Hard, NP, NPC, P with suitable examples. Introduction of other spaces. Mathematical proof not to be dealt in depth Stress Dynamic Programming technique

General Points Preparation for the Course: –Identify the goals and challenges in each unit( purpose is normally done in lecture plan.) –Identify the topics to be dealt in detail (those that are practically applicable) and those to be done on surface level Course Delivery: –Establish Correlation between staff Bring in a discussion between the CS and Maths staff, to relate the CS applications to the Maths topic Identify suitable Practical examples/ analogies to the topic being dealt –Motivate Students Educate the students about the applications where the topics can not/ difficult to be used apart from applications where it can be used.

General Points Quality Improvement: –Students Concentrate on formative assessments also rather than summative assessments alone. Design suitable classroom activity for the course (i.e) problems which can stimulate the thinking process. Design suitable strategy at frequent intervals to regain the students attention. –Instructor Get a short feedback at the end of each hour rather than getting it thrice during a course. Research: –Select a project that is applicable to the Society –Divide it in to subparts, and involve the students.

Actions Planned Presentation of the Algorithm course to colleagues Discuss classroom activities to the teachers of respective subjects Suggest classroom activities to be included in lesson plan Highlighting the projects of UW to our students