Course Overview Analysis of Algorithms and Data Structures Course Overview CSE 680 Prof. Roger Crawfis.

Slides:



Advertisements
Similar presentations
Analysis of Algorithms
Advertisements

Introduction to Algorithms NP-Complete
Great Theoretical Ideas in Computer Science
1 P, NP, and NP-Complete Dr. Ying Lu RAIK 283 Data Structures & Algorithms.
Insertion Sort Introduction to Algorithms Insertion Sort CSE 680 Prof. Roger Crawfis.
Contest format 5 hours, around 8-12 problems One computer running (likely)Linux, plus printer 3 people on one machine No cell phones, calculators, USB.
Demonstrators: Mudasir Nazir(08-CS-41).  I am highly addicted to this field.  Working with W3C in research program(building CSS for creating web site.
 Live-in-the-application cases in Microsoft® Office 2007  Word  Excel  PowerPoint  Access  Content from select end-of-chapter material  Shelly/Cashman.
CSE373: Data Structures & Algorithms Lecture 24: The P vs. NP question, NP-Completeness Nicki Dell Spring 2014 CSE 373 Algorithms and Data Structures 1.
Fundamentals of Algorithms MCS - 2 Lecture # 4
CS 253: Algorithms Syllabus Chapter 1 Appendix A.
CSE332: Data Abstractions Lecture 27: A Few Words on NP Dan Grossman Spring 2010.
1 Module 2: Fundamental Concepts Problems Programs –Programming languages.
Lecture 2: Fundamental Concepts
CS421 - Course Information Website Syllabus Schedule The Book:
Text Chapters 1, 2. Sorting ä Sorting Problem: ä Input: A sequence of n numbers ä Output: A permutation (reordering) of the input sequence such that:
1 Module 2: Fundamental Concepts Problems Programs –Programming languages.
CSE 830: Design and Theory of Algorithms
Lecture 33 CSE 331 Nov 20, Homeworks Submit HW 9 by 1:10PM HW 8 solutions at the end of the lecture.
1. The Role of the Algorithms in Computer Hsu, Lih-Hsing
Need your MyMathLab card with your access code Need a Valid Address Need to know Purdue’s zip code is and your course ID for your Class You.
EE 220 (Data Structures and Analysis of Algorithms) Instructor: Saswati Sarkar T.A. Prasanna Chaporkar, Programming.
Lecture 37 CSE 331 Dec 1, A new grading proposal Towards your final score in the course MAX ( mid-term as 25%+ finals as 40%, finals as 65%) .
Unit 1. Sorting and Divide and Conquer. Lecture 1 Introduction to Algorithm and Sorting.
DATA STRUCTURE Subject Code -14B11CI211.
Section 2.4 solving equations with variables on both sides of the equal sign. Day 1.
Fundamentals of Algorithms MCS - 2 Lecture # 1
Course Web Page Most information about the course (including the syllabus) will be posted on the course wiki:
BY Lecturer: Aisha Dawood.  an algorithm is any well-defined computational procedure that takes some value, or set of values, as input and produces.
Introduction to Algorithms (2 nd edition) by Cormen, Leiserson, Rivest & Stein Chapter 1: The Role of Algorithms in Computing (slides by N. Adlai A. DePano)
1. The Role of the Algorithms in Computer Algorithms – 1/2 Algorithm: Any well-defined computation procedure that takes some value, or set of values,
Computer programming.
C++ Programming Language Lecture 2 Problem Analysis and Solution Representation By Ghada Al-Mashaqbeh The Hashemite University Computer Engineering Department.
1Computer Sciences Department. Book: Introduction to Algorithms, by: Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein Electronic:
CSE332: Data Abstractions Lecture 24.5: Interlude on Intractability Dan Grossman Spring 2012.
CMSC 691M Agent Architectures & Multi- Agent Systems UMBC Prof. Marie desJardins Spring 2002.
2 nd Quarter Reading Workshop Updates. Class Novels We will read 2 novels together as a class. We will read and analyze these novels together. We will.
CSE 421 Algorithms Richard Anderson Winter 2009 Lecture 1.
1 BIM304: Algorithm Design Time: Friday 9-12am Location: B4 Instructor: Cuneyt Akinlar Grading –2 Midterms – 20% and 30% respectively –Final – 30% –Projects.
Data Structures and Algorithms Dr. Tehseen Zia Assistant Professor Dept. Computer Science and IT University of Sargodha Lecture 1.
CS404 Design and Analysis of Algorithms BBy DDr. M V S Peri Sastry BB.E, PhD(BITS-Pilani)
Parallel and Distributed Computing Overview and Syllabus Professor Johnnie Baker Guest Lecturer: Robert Walker.
CSE 311 Foundations of Computing I Lecture 28 Computability: Other Undecidable Problems Autumn 2011 CSE 3111.
The Hashemite University Computer Engineering Department
Chapter 1. The Role of the Algorithms in Computer.
Copyright © 2014 Curt Hill Algorithms From the Mathematical Perspective.
CSC 241: Introduction to Computer Science I
Computer Network Fundamentals CNT4007C
Introduction to Algorithms
Topic: Introduction to Computing Science and Programming + Algorithm
Lecture 1 (Part 1) Introduction/Overview Tuesday, 9/9/08
Data Structures and Algorithms
CSE322 Recursive and Recursively enumerable sets
CMIS 102 Education for Service/tutorialrank.com
COMS W1004 Introduction to Computer Science and Programming in Java
Introduction to Algorithms
Which type of claim does this represent?
Which type of claim does this represent?
VISUAL BASIC – CHAPTER ONE NOTES An Introduction to Visual Basic
Introduction to Computer Programming
COSC 320 Advanced Data Structures and Algorithm Analysis
Algorithms.
Richard Anderson Autumn 2015 Lecture 1
Introduction to Algorithms
Copyright © 2004 The McGraw-Hill Companies, Inc. All rights reserved.
Click to add Text Computers & Instructions. Computers are given instructions in the form of computer programs that are created through the development.
Richard Anderson Winter 2019 Lecture 2
CSE 451: Operating Systems Winter 2007 Module 1 Course Introduction
CSC 241: Introduction to Computer Science I
Richard Anderson Autumn 2019 Lecture 2
Presentation transcript:

Course Overview Analysis of Algorithms and Data Structures Course Overview CSE 680 Prof. Roger Crawfis

Course Vitals Grading Policy, assignments, schedule, etc. are on the web page and will be updated throughout the quarter. Do not print them out and refer to them. Course Web site: Your Instructor Your Grader

Goals of the Course What is this course about? Algorithms Design - How do you create an algorithm? Analysis – How efficient is it? Correctness – How sure are you that it works for all input? Data Structures Role in efficient algorithms Data structures for common problems

Algorithm Algorithm: any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as output. A sequence of computational steps that transform the input into the output. Input Algorithm Output Typically, an algorithm must also halt.

Computational Problem We will look at several recurring problems in a vast set of application domains: networking, AI, data mining, graphics, manufacturing, etc. Sample problems: Sort a sequence of numbers. Given a set of points in the plane, find the closest two. Given a set of locations, find a route that visits each location once. Given a sorted set of numbers, determine whether a given number exists in the set. Given a pattern for a dress, determine the planar layout of the individual pieces on a fabric.

Some Definitions Problem Instance consists of the input (satisfying whatever constraints are imposed in the problem statement) needed to compute a solution to the problem. Correct Algorithm for every input instance it halts with the correct output. A correct algorithm solves the given computational problem. Definitions from the book and:

Group Activity Gather in groups of 4. Come up with two fundamentally different algorithms to sort a deck of cards (15 minutes). Do not try to be fancy or recall algorithms from earlier classes, just ask yourself, what would I do. Taking a card from the bottom versus the top is not fundamentally different. See which group can come up with the most unique algorithm to sort a deck of cards.

Group Activity Share each sorting algorithm Is it an algorithm? How many unique algorithms? How do you verify whether an algorithm is correct? How do we pick one and claim it is the best!