Introduction CSE 2320 – Algorithms and Data Structures

Slides:



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

Data Structure TA: Abbas Sarraf
Please open your laptops, log in to the MyMathLab course web site, and open Daily Quiz 9. Remember: If you have time left out of your five minutes after.
Please open your laptops, log in to the MyMathLab course web site, and open Quiz 2.6/9.1. IMPORTANT NOTE: If you have time left after you finish the problems.
Data Structures & Agorithms Lecture-1: Introduction.
COP4020/CGS5426 Programming languages Syllabus. Instructor Xin Yuan Office: 168 LOV Office hours: T, H 10:00am – 11:30am Class website:
Computer Science 102 Data Structures and Algorithms V Fall 2009 Lecture 1: administrative details Professor: Evan Korth New York University 1.
CS 450: COMPUTER GRAPHICS COURSE AND SYLLABUS OVERVIEW SPRING 2015 DR. MICHAEL J. REALE.
COMP 151: Computer Programming II Spring Course Topics Review of Java and basics of software engineering (3 classes. Chapters 1 and 2) Recursion.
Welcome to Math 110 Online Section 001, Summer 2015.
Introduction CSE 2320 – Algorithms and Data Structures Vassilis Athitsos University of Texas at Arlington 1.
CS223 Algorithms D-Term 2013 Instructor: Mohamed Eltabakh WPI, CS Introduction Slide 1.
Math 125 Statistics. About me  Nedjla Ougouag, PhD  Office: Room 702H  Ph: (312)   Homepage:
Welcome to CS 3260 Dennis A. Fairclough. Overview Course Canvas Web Site Course Materials Lab Assignments Homework Grading Exams Withdrawing from Class.
COMP Introduction to Programming Yi Hong May 13, 2015.
CS 103 Discrete Structures Lecture 01 Introduction to the Course
MGS 351 Introduction to Management Information Systems
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.
CST 229 Introduction to Grammars Dr. Sherry Yang Room 213 (503)
Introduction to Data Structures
Computer Science 102 Data Structures and Algorithms CSCI-UA.0102 Fall 2012 Lecture 1: administrative details Professor: Evan Korth New York University.
Math 115b Section 3 (Spring 09)  Instructor: Kerima Ratnayaka   Phone :  Office.
Course Introduction Andy Wang COP 4530 / CGS 5425 Fall 2003, Section 4.
CS-2851 Dr. Mark L. Hornick 1 CS-2852 Data Structures Dr. Mark L. Hornick Office: L341 Phone: web: people.msoe.edu/hornick/
Principles of Computer Science I Honors Section Note Set 1 CSE 1341 – H 1.
Syllabus Highlights CSE 1310 – Introduction to Computers and Programming Vassilis Athitsos University of Texas at Arlington 1.
1 1.Log in to the computer in front of you –Temp account: 231class / 2.Update your in Cascadia's system –If I need to you I'll use.
ICS202 Data Structures King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science Department.
COP4610/CGS5765 Operating Systems Syllabus. Instructor Xin Yuan Office: 168 LOV Office hours: W M F 9:10am – 10:00am, or by appointments.
CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2002 Sections Ms. Susan Mitchell.
CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2001 Sections Ms. Susan Mitchell.
1 Data Structures COP 4530 Spring 2010 MW 4:35 PM – 5:50 PM CHE 101 Instructor:Dr. Rollins Turner Dept. of Computer Science and Engineering ENB
MGS 351 Introduction to Management Information Systems Lecture #1.
BIT 143: Programming – Data Structures It is assumed that you will also be present for the slideshow for the first day of class. Between that slideshow.
Syllabus Highlights CSE 1310 – Introduction to Computers and Programming Vassilis Athitsos University of Texas at Arlington 1.
James Tam Introduction To CPSC 233 James Tam Java Object-Orientation Graphical-user interfaces.
Course Info Instructor U.T. Nguyen Office: CSEB Office hours: Tuesday, 14:30-15:30 Thursday, 12:00-12:45 By.
Data Structures and Algorithms in Java AlaaEddin 2012.
CSE3330/5330 DATABASE SYSTEMS AND FILE STRUCTURES (DB I) CSE3330/5330 DB I, Summer2012 Department of Computer Science and Engineering, University of Texas.
Course Information CSE 2031 Fall Instructor U. T. Nguyen /new-yen/ Office: CSEB Office hours:  Tuesday,
EMIS 8373 Course Policies Updated 9 January 2007.
Math 115b Section 18 & 20 (Fall 2010)  Instructor: Kerima Ratnayaka   Phone : 
WELCOME TO MICRO ECONOMICS AB 224 Discussion of Syllabus and Expectations in the Class.
WELCOME TO MANAGERIAL ECONOMICS MT 445 Discussion of Syllabus and Expectations in the Class.
INTE 290 Summer 2015.
Financial Management of ECE Programs.  Go to “Tools”  Click on “Personal Information” to edit your personal information (including address) or.
Syllabus Highlights CSE 1310 – Introduction to Computers and Programming Alexandra Stefan University of Texas at Arlington 1.
CS16: Introduction to Algorithms and Data Structures
All important information will be posted on Blackboard
Andy Wang Object Oriented Programming in C++ COP 3330
Computer Engineering Department Islamic University of Gaza
CSc 020: Programming Concepts and Methodology II
Introduction to Programming
ICE 245: Algorithms Instructor: Dr. Mohammad Arifuzzaman
Course Information Mark Stanovich Principles of Operating Systems
Syllabus Overview CSE 4309 – Machine Learning Vassilis Athitsos
Syllabus Overview CSE 6363 – Machine Learning Vassilis Athitsos
Computer Science 102 Data Structures CSCI-UA
September 27 – Course introductions; Adts; Stacks and Queues
CS 201 – Data Structures and Discrete Mathematics I
CS 201 – Data Structures and Discrete Mathematics I
Introduction to Computers and their Applications
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.
MA Fall 2016 Instructor: Matt Weaver Office: MATH 615
Andy Wang Operating Systems COP 4610 / CGS 5765
CMPT 438 Algorithms Instructor: Tina Tian.
CSE1311 Introductory Programming for Engineers & Scientists
Syllabus Highlights CSE 1310 – Introduction to Computers and Programming Alexandra Stefan University of Texas at Arlington.
Course policy.
MA Fall Instructor: Tim Rolling -Office: MATH 719 -
Presentation transcript:

Introduction CSE 2320 – Algorithms and Data Structures University of Texas at Arlington Last updated: 8/21/2018

Introductions Alexandra Stefan Attendance Textbook: Appreciate: feedback, questions, office hours visits Let me know of issues: cannot hear in the back, fonts too small, colors not visible,… Attendance Not mandatory Textbook: Introduction to Algorithms, by Thomas H. Cormen, Charles E. Leiserson, Ronald E. Rivest, Clifford Stein,3rd edition (CLRS). The 2nd edition is also fine. Additional reference: Algorithms in C, Parts 1-5, by Robert Sedgewick. 3rd Edition, 2001. NOTE: this textbook is usually sold as two volumes, one for parts 1-4, and one for part 5. Most of the topics covered in class are from parts 1-4. Privacy issues: the class is being recorded Sound only from you Video of me and the projector, NOT the board Link accessible from Blackboard (see “Echo 360 Recordings” in left panel menu) Not taught for distance education – parts of the board are not visible in the recording.

Course web page VERY IMPORTANT: course web page. The course web page will be the primary source of information about the class. To find the course web page: Search the web for "Alexandra Stefan", and go to my home page. Click on the link for the course. If you have any trouble finding the course web page email me.

Homework VERY IMPORTANT: Blackboard. Blackboard will be used for submitting ALL assignments. Blackboard -> Homework (in left panel menu) No submissions via e-mail, except if Blackboard is not working properly. If Blackboard says the submission is late, then it is late. Occasionally people submit the wrong files. YOU ARE RESPONSIBLE FOR VERIFYING you submitted the right files, and on time. Submit early (even if it is not the final version) and frequently.

Communication UTA email only (sent welcome email) Document our communication with an email Send me an email to confirm a permission/agreement that I gave verbally. I will remember it, I can get back to you, you have proof. Course website Blackboard will be used to: Submit homework Solve quizzes Post announcements Send email Homework vs announcements (see the difference) See hw feedback Ignore the ‘Total’ section in Grades. IRRELEVANT for your grade.

Attendance and Emergencies Class attendance is not mandatory, but you are responsible for the material you have missed. You do NOT need to let me know that you will miss a class, are late for a class or have to leave early. If you are running late for a lecture, you can still come in (I prefer you attend some part of the lecture rather than none). Do not be late on a regular basis. Missing the beginning will very likely cause you to not be able to follow the lecture well.

Attendance and Emergencies Exam attendance is mandatory Emergencies should be documented and you should let me know as soon as possible (e.g. ‘coming up with a cold’). The following are NOT emergencies: Computer crashes, Create backups: Save your homework on a flash drive and email yourself. Network failures, Submit early (even if it is not the final version) and frequently. Blackboard failure Submit early (even if it is not the final version). Check submission – download and run. Let me know if Blackboard seems to be misbehaving. If there is a problem with your Blackboard account, email your homework to both the TA and me.

Syllabus Topics Grading Homework (20%) & Blackboard quizzes (5%): 25% 2 midterms and a final, all with equal weights, not cumulative: 75% Academic honesty - See syllabus for more details. Collusion Are the consequences worth it for possibly less than 10% of your final grade? Parents, employer, future schools, permanent records, risk of getting expelled. The penalty for cheating or collusion in a homework or exam is a grade of 0 (for the entire exam or homework). Students that require accommodations Temporary or permanent Please come by my office no later than the second week of this semester. The syllabus policies will be STRICTLY followed You are RESPONSIBLE for understanding these policies, If you need a particular grade (e.g. for scholarship, good standing, graduating on time).

Example Class Score Calculation Item Earned score Max score Exam 1 90 100 Exam 2 70 Exam 3 96 Hw 1 80 Hw 2 120 150 Hw 3 Hw 4 175 200 Quiz 1 20 Quiz 2 Quiz 3 40 55 Quiz 4 Quiz 5 60 ExamAvg = (90+70+96)/3 = 85.33 Hw average score calculation: TotalMaxHwPts = 100+150+100+200 = 550 EarnedHwPts = 80+120+100+175 = 475 HwAvg = 100 * EarnedHwPts/ TotalMaxHwPts = 100 * 475 / 550 = 86.36 Quiz average score calculation: TotalMaxQuizPts = 20+80+55+40+60 EarnedQuizPts = 20+80+40+40+20 QuizAvg = 100 * EarnedQuizPts/ TotalMaxQuizPts = 100 * 200 /255 = 78.43 ClassScore = .75*ExamAvg + .2*HwAvg + .05*QuizAvg = .75*85.33 + .2*86.36 + .05*78.43 ≈ 85 The class scores will probably be curved for the letter grade.

Office hours You can see me and either one of the TAs. Ideally equal load for each TA so if there is an “issue” with one TA do not simply see the others, but also let us know (at least let me know) so that we can address it. My office: ERB 625 Times: see course webpage TA: see course webpage

Next Steps in the Course Execution of for-loops Examples of algorithms. Continue with time complexity and Big-Oh notation. Review basic data structures (linked lists, stacks, queues, trees) and introduce new ones (heaps, graphs). Explore, learn and analyze more of algorithms. Sorting, Searching, Recursion, Optimization Techniques (Dynamic Programming and Greedy), Graph Algorithms.