Let’s do some introductions

Slides:



Advertisements
Similar presentations
Lets do some introductions
Advertisements

Academic Integrity… CHEATING Warrior Wednesday. Is this okay? O I copied and pasted just a few sentences off the internet for my Literature paper.
John Hurley Cal State LA
Design and Analysis of Algorithms Maria-Florina (Nina) Balcan Lecture 1, Jan. 14 th 2011.
CS150 Introduction to Computer Science 1 Professor: Chadd Williams.
Lecture 21 CSE 331 Oct 20, Announcements Graded mid-term exams at the END of the lecture Sign up for blog posts/group scribe leader No more than.
CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University.
MIS 470: Information Systems Project Yong Choi School of Business Administration CSU, Bakersfield.
COMP171 Data Structures and Algorithm Qiang Yang Lecture 1 ( Fall 2006)
CS 166 DATABASE MANAGEMENT SYSTEMS Dr Eamonn Keogh uci
COMP 110 Introduction to Programming Mr. Joshua Stough August 22, 2007 Monday/Wednesday/Friday 3:00-4:15 Gardner Hall 307.
COMP 14 – 02: Introduction to Programming Andrew Leaver-Fay August 31, 2005 Monday/Wednesday 3-4:15 pm Peabody 217 Friday 3-3:50pm Peabody 217.
Welcome to CompSci 100! As You Arrive… Make sure you grab a syllabus packet. Read through it. I will be covering the most essential points in my talk,
EECS 110: Introduction to Programming for Non-Majors
CCT 355: E-Business Technologies Class 1: Introduction to Course.
Welcome to CS 115! Introduction to Programming Fall 2015.
Welcome to CS 115! Introduction to Programming. Class URL Please write this down!
Introduction to Programming Summer 2010 Akil M. Merchant.
COMP 111 Programming Languages 1 First Day. Course COMP111 Dr. Abdul-Hameed Assawadi Office: Room AS15 – No. 2 Tel: Ext. ??
COMP Introduction to Programming Yi Hong May 13, 2015.
Lecture 1 Page 1 CS 111 Summer 2015 Introduction CS 111 Operating System Principles.
MGS 351 Introduction to Management Information Systems
About Me Jesse Hartloff, PhD Office: 203 Davis (may change) Office hours: TBD.
How to be an online student. How does it work? An online course follows a schedule and syllabus with due dates for assignments (just like an on-campus.
Error Correcting Codes: Combinatorics, Algorithms and Applications CSE 545 January 14, 2013.
Hello World! CSE442. Course Summary A semester long group project – You will develop software from idea to implementation You have full freedom to choose.
Welcome to CS 115! Introduction to Programming. Class URL
Let’s do some introductions
Physics For Engineers and Scientists II Principles of Electricity and Magnetism Dr. Jeffrey B. Bindell Fall 2006.
ICS 6B Boolean Logic and Algebra Fall 2015
Welcome to CS 115! Introduction to Programming. Class URL Write this down!
Introduction to Data Structures
CS 415 Daily Announcements. Friday, 26 August 2005 Readings: –Read Chapter 1 for next Monday –Read Algol 60 report for next Wednesday –Read some of chapter.
ICS 6B Boolean Algebra and Logic Winter 2015
Lecture Section 001 Spring 2008 Mike O’Dell CSE 1301 Computer Literacy.
Lecture 1 Page 1 CS 111 Summer 2013 Introduction CS 111 Operating System Principles Peter Reiher.
Principles of Computer Science I Honors Section Note Set 1 CSE 1341 – H 1.
1 Daily Announcements CS 202, Spring 2007 Aaron Bloomfield.
Welcome to PHY2049 Physics for Engineers and Scientists II Dr. Bindell.
Welcome to CS 101! Introduction to Computers Fall 2015.
EECS 110: Introduction to Programming for Non-Majors Aleksandar Kuzmanovic Northwestern University
1 CS 381 Introduction to Discrete Structures Lecture #1 Syllabus Week 1.
Syllabus Highlights CSE 1310 – Introduction to Computers and Programming Vassilis Athitsos University of Texas at Arlington 1.
Data Structures and Algorithms in Java AlaaEddin 2012.
About Me Jesse Hartloff Office: 203 Davis Office hours: TBD.
Today’s Agenda Introduction Syllabus Review Minute Discussion Questions and Answers.
Lecture 18 CSE 331 Oct 12, HW 5 due today Q1, Q2 and Q3 in different piles I will not take any HW after 1:15pm.
Computer Networks CNT5106C
Welcome to CS 115! Introduction to Programming Spring 2016.
Syllabus Highlights CSE 1310 – Introduction to Computers and Programming Alexandra Stefan University of Texas at Arlington 1.
CSc 120 Introduction to Computer Programing II
Computer Network Fundamentals CNT4007C
CSE 489/589 Modern Networking Concepts
ICS 6D Discrete Mathematics for Computer Science Fall 2014
Computer Networks CNT5106C
Course Information Mark Stanovich Principles of Operating Systems
Lecture 6 CSE 331 Sep 9, 2013.
Welcome to CS 1010! Algorithmic Problem Solving.
Welcome to CS 1340! Computing for scientists.
Welcome to CS 1010! Algorithmic Problem Solving.
Lecture 3 CSE 331 Sep 3, 2010.
Welcome to CS 1301! Principles of Programming I.
Welcome to CS220/MATH 320 – Applied Discrete Mathematics Fall 2018
Lecture 4 CSE 331 Sep 3, 2014.
Lecture 4 CSE 331 Sep 4, 2013.
Lecture 3 CSE 331 Aug 31, 2012.
Syllabus Highlights CSE 1310 – Introduction to Computers and Programming Alexandra Stefan University of Texas at Arlington.
Course policy.
Presentation transcript:

Let’s do some introductions

331 Ninja Isaac Reath isaacrea “at” buffalo Office hours: TBA OHs start next week Not involved in grading AT ALL

TAs first Md S Q Zulkar Nine mdsqzulk “at” buffalo Office hours: TBA Mehdi Shamsi seyedmah “at” buffalo Office hours: TBA OHs start next week

About Me Atri Rudra atri “at” buffalo Office: 319 Davis Office hours: Mon, 2:00-2:50pm; Wed 3:00-3:50pm OH starts today Just for this Wed: My OH from 2:30-3:20

Introduction Format Name Anything else you might want to add

Handouts for today Syllabus (online) Feedback form (online soon) Homework 0 (online) Homework Policy document (online)

Read the syllabus CAREFULLY! I’ll need confirmation in writing. No graded material will be handed back till I get this signed form from you!

Pre-requisites Required (officially) CSE 250, CSE 191 and MTH 142 At least a C- Required (for practical purposes) Comfort with proofs Willingness to work hard!

Academic Dishonesty All your submissions must be your own work Penalty: Minimum: An F grade Possible: F “due to academic dishonesty” on your transcript YOUR responsibility to know what is cheating, plagarism etc. If not sure, come talk to me Excuses like “I have a job,” “This was OK earlier/in my country,” etc. WON’T WORK I DO NOT HAVE ANY PATIENCE WITH ANY CHEATING : YOU WILL GET AN F IN THE COURSE FOR YOUR FIRST MISTAKE

Disabilities Information included in the syllabus In short, let me know and consult with Office of Disability Services

TA Office hours YOU decide! Look for survey on piazza (should be up in a day or two)

Recitations Will start from Friday, Sep 4

Exams Mid term (two parts) Mon, Oct 19 and Wed, Oct 21, Usual place and time. Final exam Fri, Dec 18, NSC 215, noon-2:30pm

One stop shop for the course…

Syllabus and Resoures

Class Calendar

This course: how to solve problems!

Why should I care ?

Combining Shadows to Understanding the network

The key technical problem Given the three projections, what is the largest size of the original set of points ?

Detecting Communities

Conquering Shadows to Conquering the Internet Algorithmically compute the missing set

The proof is in the performance > 10x faster Better algorithm with little hacking will trump worse algorithm with tons of hacking

The key technical problem Highly trivial: 4 3 = 64Still trivial: 4 2 = 16Correct answer: = 8

If detecting communities is not for you

From someone who got a Google job “You can let your algorithms class know that the phone interviews are essentially like a difficult algorithms test. Lots of data structures, specifying the algorithm, analyzing the run time and space requirements... And all on the phone and you're supposed to talk through your thought process.”

Why care about algorithms? Driving directions

Why care about algorithms? Computing Bestsellers on the fly

Why care about algorithms? Booking cheapest air tickets

Why care about algorithms? Google searches

Why care about algorithms? Data compression

Why care about algorithms? Error correction /

(And I could) go on…

Find out for yourself Mini project: Report+ presentation on one algorithm. Groups of size = 7

Read Chazelle’s article

Questions/Comments?

Now about the course IT’LL BE

We’ll do loads of s Writing down your thought process formally and precisely!

The language of proofs Brad Pitt had a beard Every goat has a beard waleg.com animaldiversity.org Hence, Brad Pitt is a goat.

HW 0 and Resources

331 Support page

Why do proofs? Makes you think logically about problems and solutions From a friend who works on Google Maps: Proving that the algorithm I am implementing is correct helps me identify corner cases

A common complaint Your examples in class look nothing like HW questions.

True because…. zazzle.com

False because… HWs and exams will test your understanding of the material

To get an A in the class Have to get at least % Rest graded on the curve