Data Structures and Algorithms (AT70.02) Comp. Sc. and Inf. Mgmt. Asian Institute of Technology.

Slides:

Advertisements

Similar presentations

Hon Wai Leong, NUS (CS6234, Spring 2009) Page 1 Copyright © 2009 by Leong Hon Wai CS6234: Spring 2009 (Overview) CS6234: Advanced Algorithms  Instructors:

Advertisements

Computer Graphics and Animation (AT70.09) Comp. Sc. and Inf. Mgmt. Asian Institute of Technology.

Design and Analysis of Algorithms Maria-Florina (Nina) Balcan Lecture 1, Jan. 14 th 2011.

Data Structures and Algorithms (AT70.02) Comp. Sc. and Inf. Mgmt. Asian Institute of Technology Instructor: Dr. Sumanta Guha Slide Sources: CLRS “Intro.

Computer Organization and Architecture (AT70.01) Comp. Sc. and Inf. Mgmt. Asian Institute of Technology.

Jan Welcome to the Course of Advanced Algorithm Design (ACS-7101/3)

CS 46101–600/CS Design and Analysis of Algorithms Dr. Angela Guercio Spring 2010.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2009 Lecture 1 Introduction/Overview Text: Chapters 1, 2 Th. 9/3/2009.

COMP 122 – Design and Analysis of Algorithms Spring 2004 MW 11:00-12:15, SN 014 Instructor:Jack Snoeyink TA: Nathan Fisher SN.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2001 Lecture 1 Introduction/Overview Wed. 9/5/01.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2005 Lecture 1 Introduction/Overview Text: Chapters 1, 2 Wed. 9/7/05.

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.

Data Structures & Agorithms Lecture-1: Introduction.

METU Computer Engineering Department

Computer Science 102 Data Structures and Algorithms V Fall 2009 Lecture 1: administrative details Professor: Evan Korth New York University 1.

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.

Piyush Kumar (Lecture 1: Introduction)

© 2004 Goodrich, Tamassia CS2210 Data Structures and Algorithms Lecture 1: Course Overview Instructor: Olga Veksler.

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

Introduction to Programming Summer 2010 Akil M. Merchant.

LeongHW, SoC, NUS (CS Combinatorial and Graph Algorithms) Page 1 About CS5234: Course Overview CS5234: Combinatorial and Graph Algorithms  Level.

CSC 212 – Data Structures Prof. Matthew Hertz WTC 207D /

COMPE 226 Data Structures 2015 Fall Murat KARAKAYA Department of Computer Engineering.

Overview Algorithms Baojian Hua

CS 615: Design & Analysis of Algorithms Chapter 1: Introduction, Algorithmic Notation and Flowcharts.

ECE 250 Algorithms and Data Structures Douglas Wilhelm Harder, M.Math. LEL Department of Electrical and Computer Engineering University of Waterloo Waterloo,

Information Retrieval and Data Mining (AT71.07) Comp. Sc. and Inf. Mgmt. Asian Institute of Technology.

Data Structures and Algorithms (AT70.02) Comp. Sc. and Inf. Mgmt. Asian Institute of Technology Instructor: Prof. Sumanta Guha Slide Sources: CLRS “Intro.

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.

Design and Analysis of Algorithms Introduction Instructors:1. B V Kiran Mayee, 2. A Madhavi

Data Structures and Algorithms (AT70.02) Comp. Sc. and Inf. Mgmt. Asian Institute of Technology Instructor: Prof. Sumanta Guha Slide Sources: CLRS “Intro.

Design and Analysis of Algorithms CS st Term Course Syllabus Cairo University Faculty of Computers and Information.

1 CENG 707 Data Structures and Algorithms Nihan Kesim Çiçekli Department of Computer Engineering Middle East Technical University Fall 2013.

CENG 213 Data Structures1 Nihan Kesim Çiçekli Department of Computer Engineering Middle East Technical University.

CS16: Introduction to Algorithms and Data Structures

CENG 213 Data Structures Nihan Kesim Çiçekli

CENG 707 Data Structures and Algorithms

Welcome to the Course of Advanced Algorithm Design

Introduction to Algorithms Second Edition by

CENG 213 Data Structures Nihan Kesim Çiçekli

Lecture 1 Introduction/Overview Text: Chapters 1, 2 Wed. 1/28/04

Computer Graphics and Animation (AT70. 09) Comp. Sc. and Inf. Mgmt

CENG 213 Data Structures Dr. Cevat Şener

Jeremy Bolton, PhD Assistant Teaching Professor

Piyush Kumar (Lecture 1: Introduction)

Piyush Kumar (Lecture 1: Introduction)

Introduction of ECE665 Computer Algorithms

Data Structures Algorithms: (Slides to be Adopted from Goodrich and aligned with Weiss' book) Instructor: Ganesh Ramakrishnan

Computer Science 102 Data Structures CSCI-UA

Data Structures and Algorithms (AT70. 02) Comp. Sc. and Inf. Mgmt

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.

Introduction to Algorithms Second Edition by

Data Structures and Algorithms (AT70. 02) Comp. Sc. and Inf. Mgmt

CENG 213 Data Structures Nihan Kesim Çiçekli

CMPT 438 Algorithms Instructor: Tina Tian.

Data Structures and Algorithms (AT70. 02) Comp. Sc. and Inf. Mgmt

Introduction to Algorithms Second Edition by

Introduction to Algorithms Second Edition by

Introduction to Algorithms Second Edition by

Introduction to Algorithms Second Edition by

Introduction to Algorithms Second Edition by

Introduction to Algorithms Second Edition by

Piyush Kumar (Lecture 1: Introduction)

Piyush Kumar (Lecture 1: Introduction)

Introduction CSE 2320 – Algorithms and Data Structures

COMP 122 – Design and Analysis of Algorithms

Information Retrieval and Data Mining (AT71. 07) Comp. Sc. and Inf

Introduction to Algorithms Second Edition by

Presentation transcript:

Data Structures and Algorithms (AT70.02) Comp. Sc. and Inf. Mgmt. Asian Institute of Technology

Course Overview Page 1 Instructor: Prof. Sumanta Guha Office: 104 CSIM Building Telephone: 5714 Prerequisite: Officially none, but we’ll assume you have had an undergrad DSA course and have decent programming skills. Course Website: All lecture slides – and these slides – are on-line !

Course Overview Page 2 Class times: Mon. & Th. 16:00-17:30 Discussion Group: Yahoo group – ait_csim_dsa WWW: You must join the group! Membership is currently open so anyone can join – just go to the link above and click the join button. If you have a problem send me mail and I will invite you. Important: It’s good for everyone to post questions and comments to the discussion group!! Then, everybody benefits from the interaction. Announcements by the instructor will always be posted to the group. However, if you wish to see me in my office you are always welcome (provided I am not busy). It’s best to make an appointment. Note that I am not a morning person. Please check the group frequently and please participate in discussions

Course Overview Page 3 Required Textbook: Cormen, Leiserson, Rivest, Stein – Introduction to Algorithms (2 nd Edition), McGraw Hill, 2001 Reference Books : Goodrich, Tamassia – Data Structures and Algorithms in Java (4 th Edition), John Wiley & Sons, 2005 Weiss – Data Structures and Problem Solving Using C++ (2 nd Edition), Addison Wesley, 2000 Sedgewick – Algorithms in C++ (3 rd Edition), Addison Wesley, 1998

Course Overview Page 4 Tentative Course Outline (from course textbook CLRS “Introduction To Algorithms”): Chap. 2: Getting Started Chap. 3: Growth of Functions Chap. 4: Recurrences Chap. 5: Prob. Analysis and Randomized Algorithms Chap. 6: Heapsort Chap. 7: Quicksort Chap. 8: Sorting in Linear Time Chap. 9: Medians and Order Statistics Chap. 11: Hash Tables Chap. 13: Red-Black Trees Chap. 15: Dynamic Programming Chap. 16: Greedy Algorithms Chap. 18: B-Trees Chap. 24: Single-Source Shortest Paths Chap. 26: Maximum Flows Chap. 30: Polynomials and the FFT Chap. 32: String Matching Chap. 33: Computational Geometry Undergrad material: will be covered quickly!

Course Overview Page 5 Grading System: Mid-sem – 40% Final – 60% Enjoy the Course! Be enthusiastic about the material because it is interesting, useful and an important part of your training as a computer scientist. Our job is to help you learn and enjoy the experience. We will do our best but we need your help. So let’s all have fun together with data structures and algorithms!!!