Ideas to be Adopted from IUCEE Workshop on Teaching Algorithms

Slides:



Advertisements
Similar presentations
Temi Avanzati di Intelligenza Artificiale - Intro1 Temi Avanzati di Intelligenza Artificiale Prof. Vincenzo Cutello Department of Mathematics and Computer.
Advertisements

Digital Systems Emphasis for Electrical Engineering Students Digital Systems skills are very valuable for electrical engineers Digital systems are the.
MS Computer Science: Dr. William J. Wolfe Professor and Chair Computer Science CSUCI MS Mathematics: Dr. Ivona Grzegorczyk Professor and Chair Mathematics.
CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT Lecture 1 Introduction Jan Maluszynski, IDA, 2007
1. 2 Understanding Atmospheric & Oceanic Flows: Laboratory Application of Cross-Correlation David M. Holland Courant Institute of Mathematical Sciences.
IUCEE – Algorithms Group Sub-Group 1:Dr.RBV Subramanyam – NIT, Warangal Dr.M.Kannan – KSR CT, Tiruchengodu Ms.S.Sapna – KSR CE, Tiruchengodu Mr.Ch.Anil.
Discrete Structures for Computer Science Ruoming Jin MW 5:30 – 6:45pm Fall 2009 rm MSB115.
A Brief Introduction To The Theory of Computer Science and The PCP Theorem By Dana Moshkovitz Faculty of Mathematics and Computer Science The Weizmann.
Welcome and Overview Richard Anderson University of Washington June 30, 20081IUCEE: Welcome and Overview.
Brief overview of ideas In this introductory lecture I will show short explanations of basic image processing methods In next lectures we will go into.
ALICE 3D PROGRAM WORKSHOP. ALICE & MATHEMATICS Using Alice in Mathematics Using 3D Graphics to add in the understanding of math concepts.
Cody Clifton KU GSO/AWM joint meeting April 29, 2014.
Mathematics throughout the CS Curriculum Support by NSF #
Issues in Teaching Software Engineering Virendra C. Bhavsar Professor and Director, Advanced Computational Research Laboratory Faculty of Computer Science.
Teaching Teaching Discrete Mathematics and Algorithms & Data Structures Online G.MirkowskaPJIIT.
Unité Mixte de Recherche - Sciences Techniques Education Training Informatics in the French High School Curricula: Recent Moves and Perspectives Françoise.
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.
CS 103 Discrete Structures Lecture 01 Introduction to the Course
Lecture 1: Introduction CS 6903: Modern Cryptography Spring 2009 Nitesh Saxena Polytechnic Institute of NYU.
AP CS: Principles Dr. Kelly Schultz Academically Talented Youth Program Western Michigan University.
Korea Advanced Institute of Science and Technology, Dept. of EECS, Div. of CS, Information Systems Lab. 1/10 CS204 Course Overview Prof.
Relationships Between Structures “→” ≝ “Can be defined in terms of” Programs Groups Proofs Trees Complex numbers Operators Propositions Graphs Real.
Lecturer: Do Kieu Anh University of Social Science and Humanities Faculty of English Linguistics and Literature Teaching Pronuciation Course code: NVA.
Major Disciplines in Computer Science Ken Nguyen Department of Information Technology Clayton State University.
Standard Template Library Bryce Boe 2013/08/20 CS24, Summer 2013 C.
Discrete Mathematics ( 離散數學 ) Ming-Jer Tsai. Outline What is Discrete Mathematics? Why learn Discrete Mathematics? What will be taught in the class? How.
Key points from IUCEE Algorithms workshop Group-5 S.Padmavathi C.Sujatha Narayanan.
1 Data Structures CSCI 132, Spring 2014 Lecture 1 Big Ideas in Data Structures Course website:
1 CPSC 320: Intermediate Algorithm Design and Analysis July 30, 2014.
1 An Execution-Driven Simulation Tool for Teaching Cache Memories in Introductory Computer Organization Courses Salvador Petit, Noel Tomás Computer Engineering.
Instructor Satisfaction with E-Learning David Dietrich, Ph.D. The University of Tennessee at Martin.
Coding Connections at the Interface of Algebra I and Physical World Concepts Improving Teacher Quality Grant Program Summer 2016.
1 COMP9007 – Algorithms Course page: + Blackboard link Lecturer: M.Reza Hoseiny M.Reza Hoseiny Level.
Computer Vision COURSE OBJECTIVES: To introduce the student to computer vision algorithms, methods and concepts. EXPECTED OUTCOME: Get introduced to computer.
CSC 172 DATA STRUCTURES. MIDTERM REVIEW MIDTERM EXAM 75 min 6 – 10 questions a lot like the quiz questions.
Module 3 Engagement techniques 3b Running a SP Workshop.
American Mathematical Society Workshop for Department Chairs and Department Leaders Atlanta, GA January 3, 2017.
Specialties Description
Theory of Computer Science
Computing and Informatics Courses
Analysis of Computing Options at ISU
Bruno Buchberger Kyoto University, October 2004
Computing and Informatics Courses
Active learning Flipped Classrooms
Lecture 1 Introduction/Overview Text: Chapters 1, 2 Wed. 1/28/04
Computer Science Courses
7 Big Ideas of Computing:
Jeremy Bolton, PhD Assistant Teaching Professor
Using mobile technology for teaching and learning in mathematics
Principles of Computing – UFCFA Lecture-1
CS223 Advanced Data Structures and Algorithms
Great Ideas in Computing Complexity Theory
Optimization Techniques for Natural Resources SEFS 540 / ESRM 490 B
Strategic Planning Update Group 5
Great Ideas in Computing Problem mapping
IUCEE Workshop Summary
Professional Elective-I Advanced Data Structure
Karthick S.B. (VIT, Pune) Kulkarni V.Y. (MIT Pune)
MSc in Statistical Science Graduate Open Day – 31 October 2018
Overview Analysis Notation Specific ADTs
CS223 Advanced Data Structures and Algorithms
Databases for Bioinformatics
Division for Social Impact
Introducing Digital Technologies
Principles of Computing – UFCFA Week 1
Computing and Informatics Courses
Computer Science Courses in the Major
Understanding Atmospheric & Oceanic Flows: Laboratory Application of Cross-Correlation
Computer Science Department
Interesting Algorithms for Real World Problems
Presentation transcript:

Ideas to be Adopted from IUCEE Workshop on Teaching Algorithms Group 2 Manisha. Y. Joshi Vahida Attar Geetha S. Padmavati.S. Seema Shukla. July 4, 2008 IUCEE Workshop on Teaching Algorithms

IUCEE Workshop on Teaching Algorithms Outline Pedagogical Ideas Technical Ideas Discrete Mathematics Data Structures Algorithms Research Motivation July 4, 2008 IUCEE Workshop on Teaching Algorithms

IUCEE Workshop on Teaching Algorithms Pedagogical Ideas “Students learn by thinking not by listening” Create long term impact on students Active Learning through Informational Lecture Student Participation Student-Student Interaction through Class Room Activities Associating theory with real world examples Sufficient Delivery of Technical Concept What to stress & what not to stress Clearly Stated Objectives July 4, 2008 IUCEE Workshop on Teaching Algorithms

IUCEE Workshop on Teaching Algorithms Discrete Structures Apt faculty to take the course (Maths or CS) – resolved Correlating more with Computer Science Proof Techniques Tiling Problems Baye’s Theorem July 4, 2008 IUCEE Workshop on Teaching Algorithms

IUCEE Workshop on Teaching Algorithms Data Structures More Emphasis on Practically used data structures like Priority Queues & Hash Tables Identify relevant Data Structures Communicate implementation details. July 4, 2008 IUCEE Workshop on Teaching Algorithms

IUCEE Workshop on Teaching Algorithms “All of computer science is Study of Algorithms” Starting the course with Stable Marriage Problem. Key Ideas in Problem Mapping. TSP. Complexity Classes – P, NP, NPC, NPH, PSPACE & Co-NP. July 4, 2008 IUCEE Workshop on Teaching Algorithms

IUCEE Workshop on Teaching Algorithms Research Motivation Research Areas TSP Use of Network flow in Image Segmentation Error Detecting Codes, etc. Taking Technology to Society Research in Education Technology Exposing the Research Status July 4, 2008 IUCEE Workshop on Teaching Algorithms