CS 322 week 1 summary Syllabus-grouping-grading, grading policy – fairness - NO cheating, gap-based classification/SVM CS: problem solving by computers.

Slides:



Advertisements
Similar presentations
Wrap-Up Wednesday/Friday 10th Week. Goals of this course Give students a broader, more realistic view of the discipline of computer science as they decide.
Advertisements

Chapter 1 - An Introduction to Computers and Problem Solving
CS Section 600 CS Section 002 Dr. Angela Guercio Spring 2010.
Instructor Dr. Ken Rodham –3370 TMCB – –Office Hours: By Appointment.
Course Overview CS221 – Advanced Programming Fall 2007 : Ray S. Babcock Computer Science Department Montana State University.
Class 0: Review and Perspective. cis 335 Fall 2001 Barry Cohen Class info n Barry Cohen n n Office hours: W 3:15-4:40.
Computability to Practical Computing - and - How to Talk to Machines.
Discrete Math CSC151 Analysis of Algorithms. Complexity of Algorithms  In CS it's important to be able to predict how many resources an algorithm will.
Introduction to High-Level Language Programming
PROJECT MILESTONES Group Presentations: ~ 5 mins presentations.
Introduction of Engineering (ENGR 10) Guest Lecture March 24, 2014.
CSCE 1040 Computer Science 2 First Day. Course Dr. Ryan Garlick Office: Research Park F201 B –Inside the Computer Science department.
CS212: DATA STRUCTURES Lecture 1: Introduction. What is this course is about ?  Data structures : conceptual and concrete ways to organize data for efficient.
Graph Data Management Lab, School of Computer Science Add title here: Large graph processing
10/18/2013PHY 711 Fall Lecture 221 PHY 711 Classical Mechanics and Mathematical Methods 10-10:50 AM MWF Olin 103 Plan for Lecture 22: Summary of.
AP Computer Science Programming Conventions. Why coding conventions? 80% of the lifetime cost of a piece of software goes to maintenance. Hardly any.
Chapter 1 Data Structures and Algorithms. Primary Goals Present commonly used data structures Present commonly used data structures Introduce the idea.
Lecture 11 Data Structures, Algorithms & Complexity Introduction Dr Kevin Casey BSc, MSc, PhD GRIFFITH COLLEGE DUBLIN.
Faculty Purpose of CS 100 Prepare to live in an information world Prepare for more training in computing NOT - to learn to program (CS 142) NOT - to.
SE-2030 Software Engineering Tools and Practices SE-2030 Dr. Mark L. Hornick 1.
February 27, February 27, 2016February 27, 2016February 27, 2016 Azusa, CA Sheldon X. Liang Ph. D. Software Engineering in CS at APU Azusa Pacific.
1 st PeriodAP Computer Science 2 nd PeriodComputer Science I 3 rd PeriodIntroduction to Programming 4 th PeriodComputer Science I/ Advanced Projects Lunch.
- Sachin Singh. Data Mining - Concepts Extracting meaningful knowledge from huge chunk of ‘raw’ data. Types –Association –Classification –Temporal.
SWE minor 2007 Minor in Software Engineering Offered by the Departments of Computer Science and Information & Software Engineering New for Fall 2007.
CPIT 251: S OFTWARE E NGINEERING Lecture 1 Introduction to Software Engineering 1.
Data Structures Dr. Abd El-Aziz Ahmed Assistant Professor Institute of Statistical Studies and Research, Cairo University Springer 2015 DS.
Building Comfort With MATLAB
Programming and Data Structures
Big-O notation.
CSC 427: Data Structures and Algorithm Analysis
CSC 222: Object-Oriented Programming
CSC 222: Computer Programming II
CSc 1302 Principles of Computer Science II
4 generations of programming languages
COMPUTATIONAL MODELS.
Designing Well-Structured and Scalable Models
CS 153: Concepts of Compiler Design August 29 Class Meeting
GC101 Introduction to computers and programs
About CS5234 (Wk 0) Course Overview About CS5234 Homeworks
7 Big Ideas of Computing:
Introduction to Analysis of Algorithms
Introduction to Analysis of Algorithms
CSC 421: Algorithm Design & Analysis
CIS 115 Education for Service-- cis115.com. CIS 115 All Exercises Devry University (Devry) For more course tutorials visit CIS 115 All.
ECET370 Education for Service-- ecet370.com. ECET 370 Entire Course (Devry) For more course tutorials visit ECET 370 Week 1 Lab 1 ECET.
CS 201 – Data Structures and Discrete Mathematics I
Exam 2 Review CS 3358 Data Structures.
Alyce Brady CS 470: Data Structures CS 510: Computer Algorithms
Exam 2 Review CS 3358 Data Structures.
Mr. Smith’s Schedule 1st Period Computer Science I
A Reversible MC68HC11 Simulator and Its Empirical Computational Complexity Charles Vermette CIS 4914 Senior Project May 30, 2001.
Why software development difficult/different MIS,
CS 160 Introduction to Computer Science
Exam 2 Review CS 3358 Data Structures.
Computer Programming.
Embedded System Development Lecture 1 1/10/2007
Solving Cubic Equations
Welcome to the First-Year Experience!
procedural: 3 types C(2.5)/Cobol/pascal: wirth, Dijkstra/PL1
CMSC201 Computer Science I for Majors Final Exam Information
Why Computer Science? “The United States currently has more than 494,000 unfilled computing jobs, but only 43,000 computer science graduates to fill those.
CS 322 Week 2 As professional SE, always think about complexity reduction Stream data processing: big data using diff alg/data struc space O(1) Role of.
The Efficiency of Algorithms
Welcome to the First-Year Experience!
Why We Need Car Parking Systems - Wohr Parking Systems
Welcome to the First-Year Experience!
Types of Stack Parking Systems Offered by Wohr Parking Systems
Discrete Optimization
Add Title.
CS 322 week 1 summary Syllabus-grouping-grading, grading policy – fairness - NO cheating, gap-based classification CS: problem solving by computers with.
Presentation transcript:

CS 322 week 1 summary Syllabus-grouping-grading, grading policy – fairness - NO cheating, gap-based classification/SVM CS: problem solving by computers with lowest complexity Complexity: time, space – efficiency, and Kolmorogov (Chaitin), be concise and DRY: don’t repeat yourself; understandability Program = data structure + algorithm (book title, by Wirth Pascal) Constraint on time and space, make alg efficient (big O; <=cubic power; tractable/intractable) Chunk swapping: different alg for time & space constraints – trade space for time or vice versa: loop of array and circular linked list Elegance of skip list: widely used inspired by express line of NYC subway; a taste of math analysis Problem modeling using math optimization

CS 322 week 1 summary Motivation of software engineering: huge system Software crisis, late 60s early 70s late projects(time), over-budget($$), unreliable hard to maintain/not understandable, add comments, have clean logic Engineering project process: source of SE Life cycle models: spec  maintenance, copycat of conventional Eng. Water-fall General def of life cycle: series of steps taken to develop a huge software system. Water-fall is just one of it. More to be introduced.